Abstract
Geometric constraints have been widely applied to image matching to gain additional advantages over feature points. A rapid triangle matching (RTM) algorithm was such an algorithm for matching triangles formed by three feature points using 38-dimensional floating-point descriptors. The RTM was faster than SIFT, but it was still hard to meet the real-time requirement. As such, we designed two kinds of binary descriptors including FREAK and rBRIEF used in ORB to replace the floating-point descriptors of RTM, and compared the improved RTM algorithms with original RTM algorithm and SIFT based on simulated and actual binocular images. The results demonstrate that our algorithms greatly improve the speed as well as the precision and matching score. Furthermore, our algorithms can match additional points compared to SIFT and the original RTM when applied to structural scenes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kim, S., Yoo, H., Sohn, K.: Robust corner detector based on corner candidate region. In: 8th IEEE Conference on Industrial Electronics and Applications, pp. 1620–1626. IEEE Press, Melbourne (2013)
Mair, E., Hager, G.D., Burschka, D., Suppa, M., Hirzinger, G.: Adaptive and generic corner detection based on the accelerated segment test. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 183–196. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15552-9_14
Lowe, D.G.: Object recognition from local scale invariant features. In: 7th IEEE International Conference on Computer Vision, pp. 1150–1157. IEEE Press, Kerkyra (1999)
Bay, H., Tuytelaars, T., Gool, L.: SURF: speeded up robust features. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, pp. 404–417. Springer, Heidelberg (2006). doi:10.1007/11744023_32
Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: Speeded-up robust features (SURF). J. Comput. Vis. Image Underst. 110(3), 346–359 (2008)
Harris, C., Stephens, M.: A combined corner and edge detector. In: 4th Alvey Vision Conference, Manchester, pp. 147–151 (1988)
Rosten, E., Drummond, T.: Machine learning for high-speed corner detection. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, pp. 430–443. Springer, Heidelberg (2006). doi:10.1007/11744023_34
Rosten, E., Porter, R., Drummond, T.: Faster and better: a machine learning approach to corner detection. J. IEEE Trans. Pattern Anal. Mach. Intell. 32(1), 105–119 (2010)
Calonder, M., Lepetit, V., Strecha, C., Fua, P.: BRIEF: binary robust independent elementary features. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6314, pp. 778–792. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15561-1_56
Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to SIFT or SURF. In: IEEE International Conference on Computer Vision, pp. 2564–2571. IEEE Press, Barcelona (2011)
Alahi, A., Ortiz, R., Vandergheynst, P.: FREAK: fast retina keypoint. In: IEEE Computer Vision and Pattern Recognition, pp. 510–517. IEEE Press, Providence (2012)
Miksik, O., Mikolajczyk, K.: Evaluation of local detectors and descriptors for fast feature matching. In: 21st International Conference on Pattern Recognition, pp. 2681–2684. IEEE Press, Tsukuba (2012)
Zhang, H., Wang, L., Jia, R.: Scale-invariant global sparse image matching method based on Delaunay triangle. In: 6th International Symposium on Multispectral Image Processing and Pattern Recognition, p. 7495. SPIE, Yichang (2009)
Liu, Z., An, J.: A new algorithm of global feature matching based on triangle regions for image registration. In: 10th International Conference on Signal Processing, pp. 1248–1251. IEEE Press, Beijing (2010)
Yang, S., Wei, E., Wang, Y.: Matching triangle chain codes. In: 6th International Conference on Image and Graphics, pp. 290–296. IEEE Press, Hefei (2011)
Cao, J.C.: Fast image matching algorithm based on new feature description. Thesis, Dalian University of Technology, Dalian, China (2015)
Lawson, C.L.: Transforming triangulations. J. Discret. Math. 3(4), 3–365 (1972)
Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. J. Commun. ACM 24(6), 381–395 (1981)
Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. J. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1615–1630 (2005)
Geiger, A., Lenz, P., Stiller, C., Urtasun, R.: Vision meets robotics: the KITTI dataset. J. Int. J. Robot. Res. 32(11), 1231–1237 (2013)
Mikolajczyk, K., Tuytelaars, T., Schmid, C., Kadir, T., Van Gool, L.: A comparison of affine region detectors. J. Int. J. Comput. Vis. 65(1–2), 43–72 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Tian, M., Lin, QH. (2017). Rapid Triangle Matching Based on Binary Descriptors. In: Cong, F., Leung, A., Wei, Q. (eds) Advances in Neural Networks - ISNN 2017. ISNN 2017. Lecture Notes in Computer Science(), vol 10262. Springer, Cham. https://doi.org/10.1007/978-3-319-59081-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-59081-3_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59080-6
Online ISBN: 978-3-319-59081-3
eBook Packages: Computer ScienceComputer Science (R0)