Abstract
The image matching methods based on regions have many advantages over the point matching techniques, and the most charming one is that once region being matched, all pixels are matched in theory. It would benefit many applications, such as object retrieval, stereo corresponding, semantic understanding a scene, object tracking. This paper proposes a new region matching algorithm based on consistency graph and region adjacency graphs. Firstly, the segmented images are transformed into region adjacency graphs, and the potential region pairs and the potential edge segment pairs are packaged in a consistency graph. Since the rightly matched pair always is accompanied by harmonious neighbourhoods, the right correspondences tend to cluster together, and the error corresponding relationship should have few chances to connect to any compatible neighbourhood. Thus, the solution space is greatly reduced and the corresponding relationship can be found in a polynomial computational complexity just by a simple method, such as seed-growth method. To the best of our knowledge, the method is the first one to match two images by region adjacency graphs and find the corresponding relationship in a polynomial computational complexity. Experiments on the existing benchmark show that the proposed method could quickly find the right corresponding relationship between images with illumination, rotation and affine transformation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Proena, H.: Performance evaluation of keypoint detection and matching techniques on grayscale data. Signal Image Video Process. 9(5), 1009–1019 (2013)
Bay, H., Ess, A., Tuytelaars, T.: Surf: speeded up robust features. Comput. Vis. Image 110(3), 346–359 (2008)
Dalal, N., Triggs, B., Schmid, C.: Human detection using oriented histograms of flow and appearance. In: European Conference on Computer Vision, Graz, pp. 428–441 (2006)
Wang, J., Yagi, Y.: Many-to-many superpixel matching for robust tracking. IEEE Trans. Cybern. 44(7), 1237–1248 (2014)
Yang, F., Lu, H., Yang, M.H.: Robust superpixel tracking. IEEE Trans. Image Process. 23(4), 1639–1651 (2014)
Medioni, G., Nevatia, R.: Segment-based stereo matching. Comput. Vis. Gr. Image Process. 31(3), 2–18 (1985)
Ansaria, M.E., Bensrhairc, A.: A new regions matching for color stereo images. Pattern Recognit. Lett. 28(13), 1679–1687 (2007)
Fuh, C.S., Maragos, P.: Region-based optical flow estimation. In: Computer Vision and Pattern Recognition, pp. 130–135 (1989)
Ming-Hsuan, Y., Ahuja, N., Tabb, M.: Extraction of 2nd motion trajectories and its application to hand gesture recognition. IEEE Trans. Pattern Anal. Mach. Intell. 24(8), 1061–1074 (2002)
Basri, R., Jacobs, D.: Recognition using region correspondences. Int. J. Comput. Vis. 25(2), 145–166 (1997)
Keselman, Y., Shokoufandeh, A., Demirci, M., et al.: Many-to-many graph matching via metric embedding. In: Computer Vision and Pattern Recognition, pp. 850–857 (2003)
Yang, X., Cai, L.: Adaptive region matching for region-based image retrieval by constructing region importance index. IET Comput. Vis. 8(2), 141–151 (2014)
Gondra, I., Alam, F.I.: Learning spatial relations for object-specific segmentation using Bayesian network model. Signal Image Video Process. 8(8), 1441–1450 (2014)
Todorovic, S., Ahuja, N.: Region-based hierarchical image matching. Int. J. Comput. Vis. 78(1), 47–66 (2008)
Ullmann, J.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31–42 (1976)
Abu-Khzam, F.N., Samatova, N.F., Rizk, M.A., et al.: The maximum common subgraph problem: faster solutions via vertex cover. In: IEEE/ACS International Conference on Computer Systems and Applications, Amman, pp. 367–373 (2007)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)
Singh, R., Xu, J., Berger, B.: Pair wise global alignment of protein interaction networks by matching neighborhood topology. In: 11th International Conference Research in Computational Molecular Biology, pp. 16–31 (2007)
Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695–703 (1988)
Xiao, B., Hancock, E., Wilson, R.: A generative model for graph matching and embedding. Comput. Vis. Image 113(7), 777–789 (2009)
Caetano, T.S., Caelli, T., Schuurmans, D., et al.: Graphical models and point pattern matching. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1646–1663 (2006)
McAuley, J.J., Caetano, T.S.: Fast matching of large point sets under occlusions. Pattern Recognit. 45(2), 563–569 (2012)
Acknowledgments
This research was sponsored by Zhejiang Provincial Public Technology Research Project of China (Project No. 2016C31117) and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry (Project No. R20150404), which are greatly appreciated by the authors.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luo, S., Zhou, Hm., Xu, Jh. et al. Matching images based on consistency graph and region adjacency graphs. SIViP 11, 501–508 (2017). https://doi.org/10.1007/s11760-016-0987-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11760-016-0987-1