A binary representation for real-valued, local feature descriptors

• Autorzy: Oszust M.

Identyfikatory

DOI

10.14313/JAMRIS_1-2017/1

• Języki publikacji: EN

Abstrakty

EN

The usage of real-valued, local descriptors in computer vision applications is ofen constrained by their large memory requirements and long matching time. Typical approaches to the reduction of their vectors map the descriptor space to the Hamming space in which the obtained binary strings can be efficiently stored and compared. In contrary to such techniques, the approach proposed in this paper does not require a data-driven binarisation process, but can be seen as an extension of the floating-point descriptor computation pipeline with a step that allows turning it into a binary descriptor. In this step, binary tests are performed on values determined for pixel blocks from the described image patch. In the paper, the proposed approach is described and applied to two popular real-valued descriptors, SIFT and SURF. The paper also contains a comparison of the approach with state-of-the-art binarisation techniques and popular binary descriptors. The results demonstrate that the proposed representation for real-valued descriptors outperforms other methods on four demanding benchmark image datasets.

Słowa kluczowe

EN

SIFT; SURF; LDAHash; binary tests; image matching; image recognition

• Wydawca: Łukasiewicz Industrial Research Institute for Automation and Measurements PIAP
• Czasopismo: Journal of Automation Mobile Robotics and Intelligent Systems
• Rocznik: 2017
• Tom: Vol. 11, No. 1
• Strony: 3--9
• Opis fizyczny: Bibliogr. 40 poz., rys.

Twórcy

autor

Oszust M.

• Department of Computer and Control Engineering, Rzeszow University of Technology, Wincentego Pola 2, 35-959 Rzeszow, Poland, www.marosz.kia.prz.edu.pl

Bibliografia

• [1] P. Abeles, “Speeding up SURF”. In: Proc. Int. Symp. on Advances in Visual Computing (ISVC), 2013, 454–464.
• [2] A. Alahi, R. Ortiz, and P. Vandergheynst, “FREAK: Fast retina keypoint”. In: Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, 2012, 510–517.
• [3] P. F. Alcantarilla, J. Nuevo, and A. Bartoli, “Fast explicit diffusion for accelerated features in nonlinear scale spaces”. In: British Machine Vision Conf. (BMVC), 2013.
• [4] V. Balntas, L. Tang, and K. Mikolajczyk, “BOLD - Binary online learned descriptor for efficient image matching”. In: 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, 2367–2375.
• [5] H. Bay, T. Tuytelaars, and L. V. Gool. “SURF: Speeded up robust features”. In: Proc. European Conf. on Computer Vision (ECCV), 404–417. Springer, May 2006.
• [6] S. Bianco, D. Mazzini, D. P. Pau, and R. Schettini, “Local detectors and compact descriptors for visual search: A quantitative comparison”, Digit.Signal Process., vol. 44, 2015, 1–13.
• [7] M. Calonder, V. Lepetit, C. Strecha, and P. Fua. “BRIEF: Binary Robust Independent ElementaryFeatures”. In: K. Daniilidis, P. Maragos, and N. Paragios, eds., Computer Vision - ECCV 2010, volume 6314 of Lecture Notes in Computer Science, 778–792. Springer Berlin Heidelberg, 2010.
• [8] C. Clarke and P. Angelov, “Sariva: Smartphone app for real-time intelligent video analytics”, Journal of Automation, Mobile Robotics and Intelligent Systems, vol. 8, no. 4, 2014, 15–19.
• [9] B. Fan, Q. Kong, T. Trzcinski, Z. Wang, C. Pan, and P. Fua, “Receptive fields selection for binary feature description”, IEEE T. Image Process., vol. 23, no. 6, 2014, 2583–2595.
• [10] J. Figat, T. Kornuta, and W. Kasprzak, “Performance evaluation of binary descriptors of local features”. In: L. Chmielewski, R. Kozera, B.-S. Shin, and K. Wojciechowski, eds., Proceedings of the International Conference on Computer Vision and Graphics, vol. 8671, 2014, 187–194.
• [11] J. Fuentes-Pacheco, J. Ruiz-Ascencio, and J. M. Rendon-Mancha, “Visual simultaneous localization and mapping: A survey”, Artif. Intell. Rev., vol. 43, no. 1, 2015, 55–81.
• [12] E. Garcia-Fidalgo and A. Ortiz, “Vision-based topological mapping and localization methods: A survey”, Robotics and Autonomous Systems, vol. 64, 2015, 1–20.
• [13] J. Heinly, E. Dunn, and J.-M. Frahm. “Comparative evaluation of binary features”. In: Proc. European Conf. on Computer Vision (ECCV), 759–773. Springer, Oct. 2012.
• [14] A. Hietanen, J. Lankinen, J.-K. Kamarainen, A. G.Buch, and N. Kruger, “A comparison of feature detectors and descriptors for object class matching”,Neurocomputing, vol. 184, 2016, 3 – 12, RoLoD: Robust Local Descriptors for Computer Vision 2014.
• [15] W. Hu, N. Xie, L. Li, X. Zeng, and S. Maybank, “A survey on visual content-based video indexing and retrieval”, IEEE Trans. Syst. Man Cybern. Syst., vol. 41, no. 6, 2011, 797–819.
• [16] G. Hua, M. Brown, and S. Winder, “Discriminant embedding for local image descriptors”. In: 2007 IEEE 11th International Conference on Computer Vision, 2007, 1–8.
• [17] W. Jan, “On the representation of planes for efficient graph-based slam with high-level features”, Journal of Automation, Mobile Robotics and Intelligent Systems, vol. 10, no. 03, 2016, 3–11.
• [18] Z. Ji, Y. Pang, and X. Li, “Relevance preserving projection and ranking for web image search reranking”, IEEE Trans. Image Process., vol. 24, no. 11, 2015, 4137–4147.
• [19] Y. Ke and R. Sukthankar, “PCA-SIFT: a more distinctive representation for local image descriptors”. In: Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Conference on, vol. 2, 2004, II–506–II–513 Vol.2.
• [20] Y. Ke, R. Sukthankar, L. Huston, Y. Ke, and R. Sukthankar, “Efficient near-duplicate detection and sub-image retrieval”. In: ACM Multimedia, vol. 4, no. 1, 2004, 5.
• [21] N. Khan, B. McCane, and S. Mills, “Better than SIFT?”, Mach. Vis. Appl., vol. 26, no. 6, 2015, 819–836.
• [22] S. Kim, K. Paeng, J. W. Seo, and S. D. Kim, “Bi-DCT: DCT-based local binary descriptor for dense stereo matching”, IEEE Signal Proc. Let., vol. 22, no. 7, 2015, 847–851.
• [23] S. Leutenegger, M. Chli, and R. Siegwart, “BRISK: Binary Robust Invariant Scalable Keypoints”. In: Computer Vision (ICCV), 2011 IEEE International Conference on, 2011, 2548–2555.
• [24] D. G. Lowe, “Distinctive image features from scale-invariant keypoints”, Int. J. Comput. Vision, vol. 60, no. 2, 2004, 91–110.
• [25] K. Mikolajczyk and C. Schmid, “A performance evaluation of local descriptors”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 10, 2005, 1615–1630.
• [26] O. Miksik and K. Mikolajczyk, “Evaluation of local detectors and descriptors for fast feature matching”. In: Proc. Int. Conf. on Pattern Recognition (ICPR), 2012, 2681–2684.
• [27] D. Mukherjee, Q. M. J. Wu, and G. Wang, “A comparative experimental study of image feature detectors and descriptors”, Mach. Vision Appl., vol. 26, no. 4, 2015, 443–466.
• [28] D. Nister and H. Stewenius, “Scalable recognition with a vocabulary tree”. In: Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on, vol. 2, 2006, 2161–2168.
• [29] M. Oszust, “BDSB: Binary descriptor with shared pixel blocks”, Journal of Visual Communication and Image Representation, vol. 41, 2016, 154–165.
• [30] M. Oszust, “Towards binary robust fast features using the comparison of pixel blocks”, Meas. Sci. Technol., vol. 27, no. 3, 2016, 035402.
• [31] K. A. Peker, “Binary SIFT: Fast image retrieval using binary quantized SIFT features”. In: Content-Based Multimedia Indexing (CBMI), 20119th International Workshop on, 2011, 217–222.
• [32] E. Rosten, R. Porter, and T. Drummond, “Faster and better: A machine learning approach to corner detection”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 1, 2010, 105–119.
• [33] E. Rublee, V. Rabaud, K. Konolige, and G. Bradski, “ORB: An efficient alternative to SIFT or SURF”. In: Computer Vision (ICCV), 2011 IEEE International Conference on, 2011, 2564–2571.
• [34] A. Smeulders, D. Chu, R. Cucchiara, S. Calderara, A. Dehghan, and M. Shah, “Visual tracking: An experimental survey”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 36, no. 7, 2014, 1442–1468.
• [35] C. Strecha, A. Bronstein, M. Bronstein, and P. Fua, “LDAHash: Improved matching with smaller descriptors”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 1, 2012.
• [36] T. Trzcinski, M. Christoudias, P. Fua, and V. Lepetit, “Boosting binary keypoint descriptors”. In: Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on, 2013, 2874–2881.
• [37] D. Warchol and M. Wysocki, “Recognition of hand posture based on a point cloud descriptor and a feature of extended fingers”, Journal of Automation, Mobile Robotics and Intelligent Systems, vol. 10, no. 01, 2016, 48–57.
• [38] X. Xu, L. Tian, J. Feng, and J. Zhou, “OSRI: A rotationally invariant binary descriptor”, IEEE Trans. Image Process., vol. 23, no. 7, 2014, 2983–2995.
• [39] X. Yang and K. T. T. Cheng, “LDB: An ultra-fast feature for scalable augmented reality on mobile devices”. In: Mixed and Augmented Reality (ISMAR), 2012 IEEE International Symposium on, 2012, 49–57.
• [40] X. Yang and K. T. T. Cheng, “Local difference binary for ultrafast and distinctive feature description”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 36, no. 1, 2014, 188–194.

Uwagi

PL

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).