Keypoint recognition using randomized trees
École Normale Supérieure - PSL · École Polytechnique Fédérale de Lausanne
Abstract
In many 3D object-detection and pose-estimation problems, runtime performance is of critical importance. However, there usually is time to train the system, which we will show to be very useful. Assuming that several registered images of the target object are available, we developed a keypoint-based approach that is effective in this context by formulating wide-baseline matching of keypoints extracted from the input images to those found in the model images as a classification problem. This shifts much of the computational burden to a training phase, without sacrificing recognition performance. As a result, the resulting algorithm is robust, accurate, and fast-enough for frame-rate performance. This reduction…
Citation impact
- FWCI
- 38.26
- Percentile
- 100%
- References
- 41
Authors
2Topics & keywords
- Computer science
- Artificial intelligence
- Object detection
- Computer vision
- Context (archaeology)
- Reduction (mathematics)
- Matching (statistics)
- Detector