Keypoint Recognition with Two-Stage Randomized Trees

Shoichi SHIMIZU  Hironobu FUJIYOSHI  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E95-D   No.7   pp.1766-1774
Publication Date: 2012/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E95.D.1766
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Machine Vision and its Applications)
Category: Matching
Keyword: 
keypoint matching,  viewpoint estimation,  randomized trees,  

Full Text: PDF>>
Buy this Article




Summary: 
This paper proposes a high-precision, high-speed keypoint matching method using two-stage randomized trees (RTs). The keypoint classification uses conventional RTs for high-precision, real-time keypoint matching. However, the wide variety of view transformations for templates expressed by RTs make it diffidult to achieve high-precision classification for all transformations with a single RTs. To solve this problem, the proposed method classifies the template view transformations in the first stage and then, in the second stage, classifies the keypoints using the RTs that corresponds to each of the view transformations classified in the first stage. Testing demonstrated that the proposed method is 88.5% more precise than SIFT, and 63.5% more precise than using conventional RTs for images in which the viewpoint of the object is rotated by 70 degrees. We have also shown that the proposed method supports real-time keypoint matching at 12 fps.