Object Detection by Keygraph Classification
In this paper, we propose a new approach for keypoint-based object detection. Traditional keypoint-based methods consist of classifying individual points and using pose estimation to discard misclassifications. Since a single point carries no relational features, such methods inherently restrict the usage of structural information. Therefore, the classifier considers mostly appearance-based feature vectors, thus requiring computationally expensive feature extraction or complex probabilistic modelling to achieve satisfactory robustness. In contrast, our approach consists of classifying graphs of keypoints, which incorporates structural information during the classification phase and allows the extraction of simpler feature vectors that are naturally robust. In the present work, 3-vertices graphs have been considered, though the methodology is general and larger order graphs may be adopted. Successful experimental results obtained for real-time object detection in video sequences are reported.
KeywordsFeature Vector IEEE Computer Society Object Detection Delaunay Triangulation Internal Angle
Unable to display preview. Download preview PDF.
- 4.Özuysal, M., Fua, P., Lepetit, V.: Fast keypoint recognition in ten lines of code. In: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE Computer Society, Los Alamitos (2007)Google Scholar
- 7.Tang, F., Tao, H.: Object tracking with dynamic feature graph. In: Proceedings of the 2nd Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance, pp. 25–32. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 8.OpenCV: http://opencv.willowgarage.com/
- 9.Shi, J., Tomasi, C.: Good features to track. In: Proceedings of the 1994 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 593–600. IEEE Computer Society, Los Alamitos (1994)Google Scholar