An Algorithm for the Contextual Adaption of SURF Octave Selection With Good Matching Performance: Best Octaves

Speeded-Up Robust Features is a feature extraction algorithm designed for real-time execution, although this is rarely achievable on low-power hardware such as that in mobile robots. One way to reduce the computation is to discard some of the scale-space octaves, and previous research has simply discarded the higher octaves. This paper shows that this approach is not always the most sensible and presents an algorithm for choosing which octaves to discard based on the properties of the imagery. Results obtained with this best octaves algorithm show that it is able to achieve a significant reduction in computation without compromising matching performance.

[1]  Ghassan Hamarneh,et al.  n -SIFT: n -Dimensional Scale Invariant Feature Transform , 2009, IEEE Trans. Image Process..

[2]  Cordelia Schmid,et al.  Blur Robust and Color Constant Image Description , 2006, 2006 International Conference on Image Processing.

[3]  Zhen Fang,et al.  Accelerating mobile augmented reality on a handheld platform , 2009, 2009 IEEE International Conference on Computer Design.

[4]  K. Mikolajczyk.  Detection of local features invariant to affine transformations : application to matching and recognition , 2002 .

[5]  Luc Van Gool,et al.  Speeded-Up Robust Features (SURF) , 2008, Comput. Vis. Image Underst..

[6]  Tom Drummond,et al.  Faster and Better: A Machine Learning Approach to Corner Detection , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[8]  Cordelia Schmid,et al.  Evaluation of GIST descriptors for web-scale image search , 2009, CIVR '09.

[9]  Nan Zhang.  Computing Parallel Speeded-Up Robust Features (P-SURF) via POSIX Threads , 2009, ICIC.

[10]  Matthew A. Brown,et al.  Invariant Features from Interest Point Groups , 2002, BMVC.

[11]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[12]  Luc Van Gool,et al.  Efficient Non-Maximum Suppression , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[13]  Luc Van Gool,et al.  Fast scale invariant feature detection and matching on programmable graphics hardware , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[14]  Christopher Hunt,et al.  Notes on the OpenSURF Library , 2009 .

[15]  Adrian F. Clark,et al.  Performance Characterization in Computer Vision A Tutorial , 2006 .

[16]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[17]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Herbert Bay,et al.  From wide-baseline point and line correspondences to 3D , 2006 .

[19]  Stephen M. Smith,et al.  SUSAN—A New Approach to Low Level Image Processing , 1997, International Journal of Computer Vision.

[20]  Aly A. Farag,et al.  CSIFT: A SIFT Descriptor with Color Invariant Characteristics , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[21]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..