Evaluation of Clustering Configurations for Object Retrieval Using SIFT Features

Scale-Invariant Feature Transform (SIFT) features have been widely accepted as an effective local keypoint descriptor for its robust description of digital image content. This method extracts distinctive invariant features from images that can be used to perform reliable matching between different views of an object. Object recognition proceeds by matching individual features to a database of features from known objects using a fast nearest-neighbour algorithm, followed by a Hough transform to identify clusters belonging to a single object, and finally performing verification through least-squares solution for consistent pose parameters. Nonetheless, reasoning for the choice of this clustering approach is not provided and a lack of its theoretical insight is noticed. Here, we present and evaluate different configurations for clustering sets of keypoints according to their pose parameters: x and y coordinates location, scale and orientation based on Lowe’s approach.

[1]  Vincent Lepetit,et al.  Fast Keypoint Recognition Using Random Ferns , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Vincent Lepetit,et al.  BRIEF: Binary Robust Independent Elementary Features , 2010, ECCV.

[4]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[5]  Roland Siegwart,et al.  BRISK: Binary Robust invariant scalable keypoints , 2011, 2011 International Conference on Computer Vision.

[6]  Tom Drummond,et al.  Machine Learning for High-Speed Corner Detection , 2006, ECCV.

[7]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[8]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[9]  Josef Kittler,et al.  A survey of the hough transform , 1988, Comput. Vis. Graph. Image Process..

[10]  Simon Haykin,et al.  Neural Networks and Learning Machines , 2010 .

[11]  I. Dattner Statistical properties of the Hough transform estimator in the presence of measurement errors , 2009, J. Multivar. Anal..

[12]  E. Grafarend Linear and nonlinear models : fixed effects, random effects, and mixed models , 2006 .

[13]  Gary R. Bradski,et al.  ORB: An efficient alternative to SIFT or SURF , 2011, 2011 International Conference on Computer Vision.

[14]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[15]  Darius Burschka,et al.  Adaptive and Generic Corner Detection Based on the Accelerated Segment Test , 2010, ECCV.

[16]  Pierre Vandergheynst,et al.  FREAK: Fast Retina Keypoint , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.