TestMatchingAlgorithm Class Reference

Inheritance diagram for TestMatchingAlgorithm:

Public Member Functions
	TestMatchingAlgorithm ()
virtual	~TestMatchingAlgorithm ()
virtual void	doSetup ()
	this will be called exactly once for each call to DenseMatcher::match() More...
virtual size_t	sizeA () const
	what is the size of list A? More...
virtual size_t	sizeB () const
	what is the size of list B? More...
virtual float	distanceThreshold () const
	distances above this threshold will not be returned as matches. More...
virtual float	distanceRatioThreshold () const
	by which factor does the first best match has to be better than the second best one. More...
virtual bool	skipA (size_t indexA) const
	Should we skip the item in list A? This will be called once for each item in the list. More...
virtual bool	skipB (size_t) const
	Should we skip the item in list B? This will be called many times. More...
virtual float	distance (size_t indexA, size_t indexB) const
	the "distance" between the two points. For points that absolutely don't match. Please use float max. More...
virtual void	reserveMatches (size_t numMatches)
	a function that tells you how many times setMatching() will be called. More...
virtual void	setBestMatch (size_t indexA, size_t indexB, double)
	At the end of the matching step, this function is called once for each pair of matches discovered. More...
Public Member Functions inherited from okvis::MatchingAlgorithm
	MatchingAlgorithm ()
virtual	~MatchingAlgorithm ()
virtual listB_tree_structure_t::iterator	getListBStartIterator (size_t indexA)
	Get begin iterator for elements of listB to be matched against the given element from list A (indexA) for a given index of listA, get an iterator into the listB multimap to the start of all elements in listB that should be matched against indexA note: implement this in your matching algorithm subclass. More...
virtual listB_tree_structure_t::iterator	getListBEndIterator (size_t indexA)
	Get end iterator for elements of listB to be matched against the given element from list A (indexA) for a given index of listA, get an iterator into the listB multimap to the end of all elements in listB that should be matched against indexA. More...
float	matchFailed () const
	What to return if the match failed. More...

Public Attributes
std::vector< double >	listA
std::vector< double >	listB
std::vector< std::pair< int, int > >	matches

Additional Inherited Members
Public Types inherited from okvis::MatchingAlgorithm
typedef std::shared_ptr < MatchingAlgorithm >	Ptr
typedef std::multimap< size_t, size_t >	listB_tree_structure_t
	Tree data structure for image space restricted matching mapping from image row to list of features (indices!) More...

Constructor & Destructor Documentation

TestMatchingAlgorithm::TestMatchingAlgorithm ( )

inline

virtual TestMatchingAlgorithm::~TestMatchingAlgorithm ( )

inlinevirtual

Member Function Documentation

virtual float TestMatchingAlgorithm::distance ( size_t  indexA, size_t  indexB  ) const

inlinevirtual

the "distance" between the two points. For points that absolutely don't match. Please use float max.

Implements okvis::MatchingAlgorithm.

virtual float TestMatchingAlgorithm::distanceRatioThreshold ( ) const

inlinevirtual

by which factor does the first best match has to be better than the second best one.

Reimplemented from okvis::MatchingAlgorithm.

virtual float TestMatchingAlgorithm::distanceThreshold ( ) const

inlinevirtual

distances above this threshold will not be returned as matches.

Reimplemented from okvis::MatchingAlgorithm.

virtual void TestMatchingAlgorithm::doSetup ( )

inlinevirtual

this will be called exactly once for each call to DenseMatcher::match()

Reimplemented from okvis::MatchingAlgorithm.

virtual void TestMatchingAlgorithm::reserveMatches ( size_t  numMatches )

inlinevirtual

a function that tells you how many times setMatching() will be called.

Implements okvis::MatchingAlgorithm.

virtual void TestMatchingAlgorithm::setBestMatch ( size_t  indexA, size_t  indexB, double    )

inlinevirtual

At the end of the matching step, this function is called once for each pair of matches discovered.

Implements okvis::MatchingAlgorithm.

virtual size_t TestMatchingAlgorithm::sizeA ( ) const

inlinevirtual

what is the size of list A?

Implements okvis::MatchingAlgorithm.

virtual size_t TestMatchingAlgorithm::sizeB ( ) const

inlinevirtual

what is the size of list B?

Implements okvis::MatchingAlgorithm.

virtual bool TestMatchingAlgorithm::skipA ( size_t  indexA ) const

inlinevirtual

Should we skip the item in list A? This will be called once for each item in the list.

Reimplemented from okvis::MatchingAlgorithm.

virtual bool TestMatchingAlgorithm::skipB ( size_t  ) const

inlinevirtual

Should we skip the item in list B? This will be called many times.

Reimplemented from okvis::MatchingAlgorithm.

Member Data Documentation

std::vector<double> TestMatchingAlgorithm::listA

std::vector<double> TestMatchingAlgorithm::listB

std::vector<std::pair<int, int> > TestMatchingAlgorithm::matches

---

The documentation for this class was generated from the following file:

• okvis/okvis_matcher/test/testMatcher.cpp