An Efficient View-Point Invariant Detector and Descriptor

Article Preview

Abstract:

Many computer vision applications need keypoint correspondence between images under different view conditions. Generally speaking, traditional algorithms target applications with either good performance in invariance to affine transformation or speed of computation. Nowadays, the widely usage of computer vision algorithms on handle devices such as mobile phones and embedded devices with low memory and computation capability has proposed a target of making descriptors faster to computer and more compact while remaining robust to affine transformation and noise. To best address the whole process, this paper covers keypoint detection, description and matching. Binary descriptors are computed by comparing the intensities of two sampling points in image patches and they are matched by Hamming distance using an SSE 4.2 optimized popcount. In experiment results, we will show that our algorithm is fast to compute with lower memory usage and invariant to view-point change, blur change, brightness change, and JPEG compression.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

143-148

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lowe. D., Distinctive Image Features from Scale-Invariant Keypoints, Computer Vision and Image Understanding, 20 (2004) 91-110.

DOI: 10.1023/b:visi.0000029664.99615.94

Google Scholar

[2] Mikolajczyk. K., Schmid. C., A Performance Evaluation of Local Descriptors, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 (2004) 1615–1630.

DOI: 10.1109/tpami.2005.188

Google Scholar

[3] Hua. G., Brown. M., Winder. S., Discriminant Embedding for Local Image Descriptors, International Conference on Computer Vision, (2007).

DOI: 10.1109/iccv.2007.4408857

Google Scholar

[4] Edward Rosten, Tom Drummond, Fusing points and lines for high performance tracking, International Conference on Computer Vision, 1508-1511, (2005).

DOI: 10.1109/iccv.2005.104

Google Scholar

[5] Edward Rosten, Tom Drummond, Machine learning for high-speed corner detection, European Conference on Computer Vision, 430-443, (2006).

DOI: 10.1007/11744023_34

Google Scholar

[6] Xiaodi Hou, Liqing Zhang, Saliency Detection: A Spectral Residual Approach, Computer Vision and Pattern Recognition, 1-8 (2007).

DOI: 10.1109/cvpr.2007.383267

Google Scholar

[7] Calonder M., Lepetit V., Strecha C., Fua P., BRIEF: Binary Robust Independent Elementary Features, European Conference on Computer Vision, (2010).

DOI: 10.1007/978-3-642-15561-1_56

Google Scholar

[8] Rublee Ethan, Rabaud Vincent, Konolige Kurt, Bradski Gary, ORB: An Efficient Alternative to SIFT or SURF, International Conference on Computer Vision, (2011).

DOI: 10.1109/iccv.2011.6126544

Google Scholar

[9] Stefan Leutenegger, Margarita Chli, Roland Siegwart, BRISK: Binary Robust Invariant Scalable Keypoints, International Conference on Computer Vision, (2011).

DOI: 10.1109/iccv.2011.6126542

Google Scholar