Procedings of the British Machine Vision Conference 2006 2006
DOI: 10.5244/c.20.55
|View full text |Cite
|
Sign up to set email alerts
|

Real-Time Feature Matching using Adaptive and Spatially Distributed Classification Trees

Abstract: This paper presents a method for real-time wide-baseline feature matching. The approach is based on the work of Lepetit and colleagues [9], where randomized decision trees are trained to establish correspondences between detected features in a training image, and those in input frames. Though extremely promising, their actual results can vary depending on the viewpoint and illumination conditions. We combine two approaches to alleviate its limitations. The first aims to update the trees at run-time, adapting t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2007
2007
2012
2012

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…A good survey about different model-based tracking approaches can be found in [11,21]. Some authors propose the use of machine learning techniques to solve the problem of wide baseline keypoint matching [3,15]. Supervised classification systems requires a pre-processing, where a system is trained with a determined set of known examples (training set) that represents variations in all their independent variables.…”
Section: Tracking By Detectionmentioning
confidence: 99%
“…A good survey about different model-based tracking approaches can be found in [11,21]. Some authors propose the use of machine learning techniques to solve the problem of wide baseline keypoint matching [3,15]. Supervised classification systems requires a pre-processing, where a system is trained with a determined set of known examples (training set) that represents variations in all their independent variables.…”
Section: Tracking By Detectionmentioning
confidence: 99%
“…Another idea is to consider interest-point matching as a classification problem. The features from the reference image are used to train the classifier [4], [19].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the case of using RDTs for classification, the estimated pose can further be used to update the decision Trees to the actual viewing conditions at runtime (Boffy et al, 2006) . Our experiments showed that this can significantly improve the matching performance and makes it more robust to illumination changes, such as cast shadows or reflections.…”
Section: The Matching and Pose Estimation Phasementioning
confidence: 99%