initial addition of BRISK with some tests
This commit is contained in:
parent
228070a74c
commit
13ded36ecb
@ -267,6 +267,92 @@ public:
|
|||||||
static Ptr<Feature2D> create( const string& name );
|
static Ptr<Feature2D> create( const string& name );
|
||||||
};
|
};
|
||||||
|
|
||||||
|
/*!
|
||||||
|
BRISK implementation
|
||||||
|
*/
|
||||||
|
class CV_EXPORTS_W BRISK : public Feature2D
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
CV_WRAP explicit BRISK(int thresh=30, int octaves=3, float patternScale=1.0f);
|
||||||
|
|
||||||
|
virtual ~BRISK();
|
||||||
|
|
||||||
|
// returns the descriptor size in bytes
|
||||||
|
int descriptorSize() const;
|
||||||
|
// returns the descriptor type
|
||||||
|
int descriptorType() const;
|
||||||
|
|
||||||
|
// Compute the BRISK features on an image
|
||||||
|
void operator()(InputArray image, InputArray mask, vector<KeyPoint>& keypoints) const;
|
||||||
|
|
||||||
|
// Compute the BRISK features and descriptors on an image
|
||||||
|
void operator()( InputArray image, InputArray mask, vector<KeyPoint>& keypoints,
|
||||||
|
OutputArray descriptors, bool useProvidedKeypoints=false ) const;
|
||||||
|
|
||||||
|
AlgorithmInfo* info() const;
|
||||||
|
|
||||||
|
// custom setup
|
||||||
|
CV_WRAP explicit BRISK(std::vector<float> &radiusList, std::vector<int> &numberList,
|
||||||
|
float dMax=5.85f, float dMin=8.2f, std::vector<int> indexChange=std::vector<int>());
|
||||||
|
|
||||||
|
// call this to generate the kernel:
|
||||||
|
// circle of radius r (pixels), with n points;
|
||||||
|
// short pairings with dMax, long pairings with dMin
|
||||||
|
CV_WRAP void generateKernel(std::vector<float> &radiusList,
|
||||||
|
std::vector<int> &numberList, float dMax=5.85f, float dMin=8.2f,
|
||||||
|
std::vector<int> indexChange=std::vector<int>());
|
||||||
|
|
||||||
|
protected:
|
||||||
|
|
||||||
|
void computeImpl( const Mat& image, vector<KeyPoint>& keypoints, Mat& descriptors ) const;
|
||||||
|
void detectImpl( const Mat& image, vector<KeyPoint>& keypoints, const Mat& mask=Mat() ) const;
|
||||||
|
|
||||||
|
// Feature parameters
|
||||||
|
CV_PROP_RW int threshold;
|
||||||
|
CV_PROP_RW int octaves;
|
||||||
|
|
||||||
|
// some helper structures for the Brisk pattern representation
|
||||||
|
struct BriskPatternPoint{
|
||||||
|
float x; // x coordinate relative to center
|
||||||
|
float y; // x coordinate relative to center
|
||||||
|
float sigma; // Gaussian smoothing sigma
|
||||||
|
};
|
||||||
|
struct BriskShortPair{
|
||||||
|
unsigned int i; // index of the first pattern point
|
||||||
|
unsigned int j; // index of other pattern point
|
||||||
|
};
|
||||||
|
struct BriskLongPair{
|
||||||
|
unsigned int i; // index of the first pattern point
|
||||||
|
unsigned int j; // index of other pattern point
|
||||||
|
int weighted_dx; // 1024.0/dx
|
||||||
|
int weighted_dy; // 1024.0/dy
|
||||||
|
};
|
||||||
|
inline int smoothedIntensity(const cv::Mat& image,
|
||||||
|
const cv::Mat& integral,const float key_x,
|
||||||
|
const float key_y, const unsigned int scale,
|
||||||
|
const unsigned int rot, const unsigned int point) const;
|
||||||
|
// pattern properties
|
||||||
|
BriskPatternPoint* patternPoints_; //[i][rotation][scale]
|
||||||
|
unsigned int points_; // total number of collocation points
|
||||||
|
float* scaleList_; // lists the scaling per scale index [scale]
|
||||||
|
unsigned int* sizeList_; // lists the total pattern size per scale index [scale]
|
||||||
|
static const unsigned int scales_; // scales discretization
|
||||||
|
static const float scalerange_; // span of sizes 40->4 Octaves - else, this needs to be adjusted...
|
||||||
|
static const unsigned int n_rot_; // discretization of the rotation look-up
|
||||||
|
|
||||||
|
// pairs
|
||||||
|
int strings_; // number of uchars the descriptor consists of
|
||||||
|
float dMax_; // short pair maximum distance
|
||||||
|
float dMin_; // long pair maximum distance
|
||||||
|
BriskShortPair* shortPairs_; // d<_dMax
|
||||||
|
BriskLongPair* longPairs_; // d>_dMin
|
||||||
|
unsigned int noShortPairs_; // number of shortParis
|
||||||
|
unsigned int noLongPairs_; // number of longParis
|
||||||
|
|
||||||
|
// general
|
||||||
|
static const float basicSize_;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
ORB implementation.
|
ORB implementation.
|
||||||
|
2277
modules/features2d/src/brisk.cpp
Executable file
2277
modules/features2d/src/brisk.cpp
Executable file
File diff suppressed because it is too large
Load Diff
@ -51,6 +51,12 @@ using namespace cv;
|
|||||||
Otherwise, linker may throw away some seemingly unused stuff.
|
Otherwise, linker may throw away some seemingly unused stuff.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
CV_INIT_ALGORITHM(BRISK, "Feature2D.BRISK",
|
||||||
|
obj.info()->addParam(obj, "thres", obj.threshold);
|
||||||
|
obj.info()->addParam(obj, "octaves", obj.octaves));
|
||||||
|
|
||||||
|
///////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
CV_INIT_ALGORITHM(BriefDescriptorExtractor, "Feature2D.BRIEF",
|
CV_INIT_ALGORITHM(BriefDescriptorExtractor, "Feature2D.BRIEF",
|
||||||
obj.info()->addParam(obj, "bytes", obj.bytes_));
|
obj.info()->addParam(obj, "bytes", obj.bytes_));
|
||||||
|
|
||||||
@ -154,6 +160,7 @@ bool cv::initModule_features2d(void)
|
|||||||
{
|
{
|
||||||
bool all = true;
|
bool all = true;
|
||||||
all &= !BriefDescriptorExtractor_info_auto.name().empty();
|
all &= !BriefDescriptorExtractor_info_auto.name().empty();
|
||||||
|
all &= !BRISK_info_auto.name().empty();
|
||||||
all &= !FastFeatureDetector_info_auto.name().empty();
|
all &= !FastFeatureDetector_info_auto.name().empty();
|
||||||
all &= !StarDetector_info_auto.name().empty();
|
all &= !StarDetector_info_auto.name().empty();
|
||||||
all &= !MSER_info_auto.name().empty();
|
all &= !MSER_info_auto.name().empty();
|
||||||
|
95
modules/features2d/test/test_brisk.cpp
Normal file
95
modules/features2d/test/test_brisk.cpp
Normal file
@ -0,0 +1,95 @@
|
|||||||
|
/*M///////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
//
|
||||||
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
||||||
|
//
|
||||||
|
// By downloading, copying, installing or using the software you agree to this license.
|
||||||
|
// If you do not agree to this license, do not download, install,
|
||||||
|
// copy or use the software.
|
||||||
|
//
|
||||||
|
//
|
||||||
|
// License Agreement
|
||||||
|
// For Open Source Computer Vision Library
|
||||||
|
//
|
||||||
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
||||||
|
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
|
||||||
|
// Third party copyrights are property of their respective owners.
|
||||||
|
//
|
||||||
|
// Redistribution and use in source and binary forms, with or without modification,
|
||||||
|
// are permitted provided that the following conditions are met:
|
||||||
|
//
|
||||||
|
// * Redistribution's of source code must retain the above copyright notice,
|
||||||
|
// this list of conditions and the following disclaimer.
|
||||||
|
//
|
||||||
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
||||||
|
// this list of conditions and the following disclaimer in the documentation
|
||||||
|
// and/or other materials provided with the distribution.
|
||||||
|
//
|
||||||
|
// * The name of the copyright holders may not be used to endorse or promote products
|
||||||
|
// derived from this software without specific prior written permission.
|
||||||
|
//
|
||||||
|
// This software is provided by the copyright holders and contributors "as is" and
|
||||||
|
// any express or implied warranties, including, but not limited to, the implied
|
||||||
|
// warranties of merchantability and fitness for a particular purpose are disclaimed.
|
||||||
|
// In no event shall the Intel Corporation or contributors be liable for any direct,
|
||||||
|
// indirect, incidental, special, exemplary, or consequential damages
|
||||||
|
// (including, but not limited to, procurement of substitute goods or services;
|
||||||
|
// loss of use, data, or profits; or business interruption) however caused
|
||||||
|
// and on any theory of liability, whether in contract, strict liability,
|
||||||
|
// or tort (including negligence or otherwise) arising in any way out of
|
||||||
|
// the use of this software, even if advised of the possibility of such damage.
|
||||||
|
//
|
||||||
|
//M*/
|
||||||
|
|
||||||
|
#include "test_precomp.hpp"
|
||||||
|
|
||||||
|
using namespace cv;
|
||||||
|
|
||||||
|
class CV_BRISKTest : public cvtest::BaseTest
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
CV_BRISKTest();
|
||||||
|
~CV_BRISKTest();
|
||||||
|
protected:
|
||||||
|
void run(int);
|
||||||
|
};
|
||||||
|
|
||||||
|
CV_BRISKTest::CV_BRISKTest() {}
|
||||||
|
CV_BRISKTest::~CV_BRISKTest() {}
|
||||||
|
|
||||||
|
void CV_BRISKTest::run( int )
|
||||||
|
{
|
||||||
|
Mat image1 = imread(string(ts->get_data_path()) + "inpaint/orig.jpg");
|
||||||
|
Mat image2 = imread(string(ts->get_data_path()) + "cameracalibration/chess9.jpg");
|
||||||
|
|
||||||
|
if (image1.empty() || image2.empty())
|
||||||
|
{
|
||||||
|
ts->set_failed_test_info( cvtest::TS::FAIL_INVALID_TEST_DATA );
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
Mat gray1, gray2;
|
||||||
|
cvtColor(image1, gray1, CV_BGR2GRAY);
|
||||||
|
cvtColor(image2, gray2, CV_BGR2GRAY);
|
||||||
|
|
||||||
|
Ptr<FeatureDetector> detector = Algorithm::create<FeatureDetector>("Feature2D.BRISK");
|
||||||
|
|
||||||
|
vector<KeyPoint> keypoints1;
|
||||||
|
vector<KeyPoint> keypoints2;
|
||||||
|
detector->detect(image1, keypoints1);
|
||||||
|
detector->detect(image2, keypoints2);
|
||||||
|
|
||||||
|
for(size_t i = 0; i < keypoints1.size(); ++i)
|
||||||
|
{
|
||||||
|
const KeyPoint& kp = keypoints1[i];
|
||||||
|
ASSERT_NE(kp.angle, -1);
|
||||||
|
}
|
||||||
|
|
||||||
|
for(size_t i = 0; i < keypoints2.size(); ++i)
|
||||||
|
{
|
||||||
|
const KeyPoint& kp = keypoints2[i];
|
||||||
|
ASSERT_NE(kp.angle, -1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST(Features2d_BRISK, regression) { CV_BRISKTest test; test.safe_run(); }
|
||||||
|
|
@ -301,6 +301,13 @@ private:
|
|||||||
* Tests registrations *
|
* Tests registrations *
|
||||||
\****************************************************************************************/
|
\****************************************************************************************/
|
||||||
|
|
||||||
|
TEST( Features2d_DescriptorExtractor_BRISK, regression )
|
||||||
|
{
|
||||||
|
CV_DescriptorExtractorTest<Hamming> test( "descriptor-brisk", (CV_DescriptorExtractorTest<Hamming>::DistanceType)2.f,
|
||||||
|
DescriptorExtractor::create("BRISK") );
|
||||||
|
test.safe_run();
|
||||||
|
}
|
||||||
|
|
||||||
TEST( Features2d_DescriptorExtractor_ORB, regression )
|
TEST( Features2d_DescriptorExtractor_ORB, regression )
|
||||||
{
|
{
|
||||||
// TODO adjust the parameters below
|
// TODO adjust the parameters below
|
||||||
|
@ -247,6 +247,12 @@ void CV_FeatureDetectorTest::run( int /*start_from*/ )
|
|||||||
* Tests registrations *
|
* Tests registrations *
|
||||||
\****************************************************************************************/
|
\****************************************************************************************/
|
||||||
|
|
||||||
|
TEST( Features2d_Detector_BRISK, regression )
|
||||||
|
{
|
||||||
|
CV_FeatureDetectorTest test( "detector-brisk", FeatureDetector::create("BRISK") );
|
||||||
|
test.safe_run();
|
||||||
|
}
|
||||||
|
|
||||||
TEST( Features2d_Detector_FAST, regression )
|
TEST( Features2d_Detector_FAST, regression )
|
||||||
{
|
{
|
||||||
CV_FeatureDetectorTest test( "detector-fast", FeatureDetector::create("FAST") );
|
CV_FeatureDetectorTest test( "detector-fast", FeatureDetector::create("FAST") );
|
||||||
|
Loading…
x
Reference in New Issue
Block a user