Abstract
Graph matching has attracted extensive attention in computer vision due to its powerful representation and robustness. However, its combinatorial nature and computational complexity limit the size of input graphs. Most graph matching methods initially reconstruct the graphs, while the preprocessing often results in poor performance. In this paper, a novel progressive probabilistic model is proposed in order to handle the outliers and boost the performance. This model takes advantage of the cooperation between process of correspondence enrichment and graph matching. Candidate matches are propagated with local consistency regularization in a probabilistic manner, and unreliable ones are rejected by graph matching. Experiments on two challenging datasets demonstrate that the proposed model outperforms the state-of-the-art progressive method in challenging real-world matching tasks.
Keywords
This project was supported by Shenzhen Peacock Plan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Note that in this paper we use \(\texttt {x}_{ij}\) to denote \(\texttt {x}_{(i-1){n_2}+j}\).
References
Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: models and global optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 596–609. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88688-4_44
Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: ICCV (2013)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18, 265–298 (2004)
Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)
Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)
Leordeanu, M., Herbert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)
Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6315, pp. 492–505. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15555-0_36
Suh, Y., Cho, M., Lee, K.M.: Graph matching via sequential Monte Carlo. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7574, pp. 624–637. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33712-3_45
Cho, M., Sun, J., Duchenne, O., Ponce, J.: Finding matches in a haystack: a max-pooling strategy for graph matching in the presence of outliers. In: CVPR (2014)
Cho, M., Lee, K.M.: Progressive graph matching: making a move of graphs via probabilistic voting. In: CVPR (2012)
Wang, C., Wang, L., Liu, L.: Progressive mode-seeking on graphs for sparse feature matching. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8690, pp. 788–802. Springer, Cham (2014). doi:10.1007/978-3-319-10605-2_51
Ham, B., Cho, M., Schmid, C., Ponce, J.: Proposal flow. In: CVPR (2016)
Lopuhaa, H.P., Rousseeuw, P.J.: Breakdown points of affine equivariant estimators of multivariate location and covariance matrices. Ann. Stat. 19(1), 229–248 (1991)
Chandrasekaran, R., Tamir, A.: Open questions concerning Weiszfeld algorithm for the Fermat-Weber location problem. Math. Program. 44, 293–295 (1989)
Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV (1999)
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
Tang, M., Wang, W. (2017). Progressive Probabilistic Graph Matching with Local Consistency Regularization. In: Felsberg, M., Heyden, A., Krüger, N. (eds) Computer Analysis of Images and Patterns. CAIP 2017. Lecture Notes in Computer Science(), vol 10425. Springer, Cham. https://doi.org/10.1007/978-3-319-64698-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-64698-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64697-8
Online ISBN: 978-3-319-64698-5
eBook Packages: Computer ScienceComputer Science (R0)