File: test_utils.cpp

package info (click to toggle)
opencv 4.5.1%2Bdfsg-5
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 268,248 kB
  • sloc: cpp: 969,170; xml: 682,525; python: 36,732; lisp: 30,170; java: 25,155; ansic: 7,927; javascript: 5,643; objc: 2,041; sh: 935; cs: 601; perl: 494; makefile: 145
file content (38 lines) | stat: -rw-r--r-- 1,278 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
#include "test_precomp.hpp"

namespace opencv_test { namespace {

TEST(Features2D_KeypointUtils, retainBest_issue_12594)
{
    const size_t N = 9;

    // Construct 4-way tie for 3rd highest - correct answer for "3 best" is 6
    const float no_problem[] = { 5.0f, 4.0f, 1.0f, 2.0f, 0.0f, 3.0f, 3.0f, 3.0f, 3.0f };

    // Same set, different order that exposes partial sort property of std::nth_element
    // Note: the problem case may depend on your particular implementation of STL
    const float problem[] = { 3.0f, 3.0f, 3.0f, 3.0f, 4.0f, 5.0f, 0.0f, 1.0f, 2.0f };

    const size_t NBEST  = 3u;
    const size_t ANSWER = 6u;

    std::vector<cv::KeyPoint> sorted_cv(N);
    std::vector<cv::KeyPoint> unsorted_cv(N);

    for (size_t i = 0; i < N; ++i)
    {
        sorted_cv[i].response   = no_problem[i];
        unsorted_cv[i].response = problem[i];
    }

    cv::KeyPointsFilter::retainBest(sorted_cv, NBEST);
    cv::KeyPointsFilter::retainBest(unsorted_cv, NBEST);

    EXPECT_EQ(ANSWER, sorted_cv.size());
    EXPECT_EQ(ANSWER, unsorted_cv.size());
}

}} // namespace