Matches keypoints by their feature vectors and geometric properties. More...
#include <SimpleHoughClusterer.h>
Public Member Functions | |
void | eliminateByOrientation () |
Create an angle histogram and remove nonfitting matches. | |
void | eliminateByPosition (float maxDistance) |
Translates all points into the same coordinate system and removes matches with a too high distance. | |
void | eliminateByScale () |
Create a scale quotient histogram and remove nonfitting matches. | |
std::string | getLog () |
std::list< KeyPointMatch > | getMatches () |
SimpleHoughClusterer (std::vector< KeyPoint > *keyPoints1, std::vector< KeyPoint > *keyPoints2, std::list< KeyPointMatch > &matches) | |
The constructor. | |
~SimpleHoughClusterer () | |
The destructor. | |
Private Member Functions | |
std::vector< bool > | computeDeleteMap (std::vector< double > hist, int numBins, int windowSize) |
int | deg (float rad) |
void | eraseMatches (std::list< unsigned > &indices) |
void | getCenters (Point2D ¢erA, Point2D ¢erB) |
float | getMeanScaleQuotient () const |
float | getMeanTurnAngle () const |
Private Attributes | |
std::vector< KeyPoint > * | m_KeyPoints1 |
std::vector< KeyPoint > * | m_KeyPoints2 |
objectImagePoints | |
std::ostringstream | m_Log |
std::list< KeyPointMatch > | m_Matches |
Matches keypoints by their feature vectors and geometric properties.
Definition at line 30 of file SimpleHoughClusterer.h.
SimpleHoughClusterer::SimpleHoughClusterer | ( | std::vector< KeyPoint > * | keyPoints1, |
std::vector< KeyPoint > * | keyPoints2, | ||
std::list< KeyPointMatch > & | matches | ||
) |
The constructor.
The destructor.
std::vector<bool> SimpleHoughClusterer::computeDeleteMap | ( | std::vector< double > | hist, |
int | numBins, | ||
int | windowSize | ||
) | [private] |
int SimpleHoughClusterer::deg | ( | float | rad | ) | [inline, private] |
Definition at line 73 of file SimpleHoughClusterer.h.
Create an angle histogram and remove nonfitting matches.
threshold | maximal angle difference to mean angle |
void SimpleHoughClusterer::eliminateByPosition | ( | float | maxDistance | ) |
Translates all points into the same coordinate system and removes matches with a too high distance.
maxDistance | maximal distance between original and translated match (multiplied by the ipoint scale) |
Create a scale quotient histogram and remove nonfitting matches.
threshold | maximal difference to mean relative scale |
void SimpleHoughClusterer::eraseMatches | ( | std::list< unsigned > & | indices | ) | [private] |
void SimpleHoughClusterer::getCenters | ( | Point2D & | centerA, |
Point2D & | centerB | ||
) | [private] |
std::string SimpleHoughClusterer::getLog | ( | ) |
std::list< KeyPointMatch > SimpleHoughClusterer::getMatches | ( | ) | [inline] |
Definition at line 57 of file SimpleHoughClusterer.h.
float SimpleHoughClusterer::getMeanScaleQuotient | ( | ) | const [private] |
float SimpleHoughClusterer::getMeanTurnAngle | ( | ) | const [private] |
std::vector< KeyPoint >* SimpleHoughClusterer::m_KeyPoints1 [private] |
Definition at line 76 of file SimpleHoughClusterer.h.
std::vector< KeyPoint >* SimpleHoughClusterer::m_KeyPoints2 [private] |
objectImagePoints
Definition at line 78 of file SimpleHoughClusterer.h.
std::ostringstream SimpleHoughClusterer::m_Log [private] |
Definition at line 82 of file SimpleHoughClusterer.h.
std::list< KeyPointMatch > SimpleHoughClusterer::m_Matches [private] |
Definition at line 80 of file SimpleHoughClusterer.h.