Keypoint Signatures for Fast Learning and Recognition
Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the training itself is usually relatively slow and performed offline. Although methods have recently been proposed to train the classifier online, they can only learn a very limited number of new keypoints. This represents a handicap for real-time applications, such as Simultaneous Localization and Mapping (SLAM), which require incremental addition of arbitrary numbers of keypoints as they become visible.
In this paper, we overcome this limitation and propose a descriptor that can be learned online fast enough to handle virtually unlimited numbers of keypoints. It relies on the fact that if we train a Randomized Tree classifier to recognize a number of keypoints extracted from an image database, all other keypoints can be characterized in terms of their response to these classification trees. This signature is fast to compute and has a discriminative power that is comparable to that of the much slower SIFT descriptor.
KeywordsFeature Point Recognition Rate Randomize Tree Signature Length Fast Learning
- 2.Mikolajczyk, K., Schmid, C.: A Performance Evaluation of Local Descriptors. In: Conference on Computer Vision and Pattern Recognition, pp. 257–263 (2003)Google Scholar
- 4.Bay, H., Tuytelaars, T., Van Gool, L.: SURF: Speeded up robust features. In: European Conference on Computer Vision (2006)Google Scholar
- 6.Ozuysal, M., Fua, P., Lepetit, V.: Fast Keypoint Recognition in Ten Lines of Code. In: Conference on Computer Vision and Pattern Recognition, Minneapolis, MI (2007)Google Scholar
- 7.Williams, B., Klein, G., Reid, I.: Real-time slam relocalisation. In: International Conference on Computer Vision (2007)Google Scholar
- 10.Nister, D., Stewenius, H.: Scalable Recognition with a Vocabulary Tree. In: Conference on Computer Vision and Pattern Recognition (2006)Google Scholar
- 13.Beis, J., Lowe, D.: Shape Indexing using Approximate Nearest-Neighbour Search in High-Dimensional Spaces. In: Conference on Computer Vision and Pattern Recognition, Puerto Rico, pp. 1000–1006 (1997)Google Scholar
- 14.Rosten, E., Drummond, T.: Machine learning for high-speed corner detection. In: European Conference on Computer Vision (2006)Google Scholar
- 15.Montemerlo, M., Thrun, S., Koller, D., Wegbreit, B.: FastSLAM: A factored solution to the simultaneous localization and mapping problem. In: Proceedings of the AAAI National Conference on Artificial Intelligence, Edmonton, Canada. AAAI Press, Menlo Park (2002)Google Scholar
- 16.Montemerlo, M., Thrun, S., Koller, D., Wegbreit, B.: FastSLAM 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico (2003)Google Scholar
- 18.Davison, A.J.: Real-Time Simultaneous Localisation and Mapping with a Single Camera. ICCV 02, 1403 (2003)Google Scholar