|
|
|
@ -918,7 +918,7 @@ public: |
|
|
|
|
void radiusMatch( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, float maxDistance, |
|
|
|
|
InputArrayOfArrays masks=noArray(), bool compactResult=false ); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CV_WRAP void write( const String& fileName ) const |
|
|
|
|
{ |
|
|
|
|
FileStorage fs(fileName, FileStorage::WRITE); |
|
|
|
@ -955,9 +955,9 @@ public: |
|
|
|
|
- `FlannBased` |
|
|
|
|
*/ |
|
|
|
|
CV_WRAP static Ptr<DescriptorMatcher> create( const String& descriptorMatcherType ); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CV_WRAP static Ptr<DescriptorMatcher> create( int matcherType ); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
protected: |
|
|
|
|
/**
|
|
|
|
|
* Class to work with descriptors from several images as with one merged matrix. |
|
|
|
@ -1015,11 +1015,11 @@ class CV_EXPORTS_W BFMatcher : public DescriptorMatcher |
|
|
|
|
{ |
|
|
|
|
public: |
|
|
|
|
/** @brief Brute-force matcher constructor (obsolete). Please use BFMatcher.create()
|
|
|
|
|
*
|
|
|
|
|
*
|
|
|
|
|
* |
|
|
|
|
* |
|
|
|
|
*/ |
|
|
|
|
CV_WRAP BFMatcher( int _normType=NORM_L2, bool _crossCheck=false ); |
|
|
|
|
|
|
|
|
|
CV_WRAP BFMatcher( int normType=NORM_L2, bool crossCheck=false ); |
|
|
|
|
|
|
|
|
|
virtual ~BFMatcher() {} |
|
|
|
|
|
|
|
|
|
virtual bool isMaskSupported() const { return true; } |
|
|
|
@ -1035,9 +1035,9 @@ public: |
|
|
|
|
matcher's collection is the nearest and vice versa, i.e. the BFMatcher will only return consistent |
|
|
|
|
pairs. Such technique usually produces best results with minimal number of outliers when there are |
|
|
|
|
enough matches. This is alternative to the ratio test, used by D. Lowe in SIFT paper. |
|
|
|
|
*/
|
|
|
|
|
CV_WRAP static Ptr<BFMatcher> create( int _normType=NORM_L2, bool _crossCheck=false ) ; |
|
|
|
|
|
|
|
|
|
*/ |
|
|
|
|
CV_WRAP static Ptr<BFMatcher> create( int normType=NORM_L2, bool crossCheck=false ) ; |
|
|
|
|
|
|
|
|
|
virtual Ptr<DescriptorMatcher> clone( bool emptyTrainData=false ) const; |
|
|
|
|
protected: |
|
|
|
|
virtual void knnMatchImpl( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, int k, |
|
|
|
@ -1060,7 +1060,7 @@ matches of descriptor sets because flann::Index does not support this. : |
|
|
|
|
class CV_EXPORTS_W FlannBasedMatcher : public DescriptorMatcher |
|
|
|
|
{ |
|
|
|
|
public: |
|
|
|
|
FlannBasedMatcher( const Ptr<flann::IndexParams>& indexParams=makePtr<flann::KDTreeIndexParams>(), |
|
|
|
|
CV_WRAP FlannBasedMatcher( const Ptr<flann::IndexParams>& indexParams=makePtr<flann::KDTreeIndexParams>(), |
|
|
|
|
const Ptr<flann::SearchParams>& searchParams=makePtr<flann::SearchParams>() ); |
|
|
|
|
|
|
|
|
|
virtual void add( InputArrayOfArrays descriptors ); |
|
|
|
@ -1075,7 +1075,7 @@ public: |
|
|
|
|
virtual bool isMaskSupported() const; |
|
|
|
|
|
|
|
|
|
CV_WRAP static Ptr<FlannBasedMatcher> create(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
virtual Ptr<DescriptorMatcher> clone( bool emptyTrainData=false ) const; |
|
|
|
|
protected: |
|
|
|
|
static void convertToDMatches( const DescriptorCollection& descriptors, |
|
|
|
|