Abstract
In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative power of each correspondence with the spatial consistency directly estimated from a graph that captures the interactions of all correspondences by using Random Walks with Restart (RWR), one of the well-established graph mining techniques. The \(\it{steady}\)-\(\it{state}\) probabilities of RWR provide the global relationship between two correspondences by the local affinity propagation. Since the correct correspondences are likely to establish global interactions among them and thus form a strongly consistent group, our algorithm efficiently produces the confidence of each correspondence as the likelihood of correct matching. We recover correct matches by imposing a sequential method with mapping constraints in a simple way. The experimental evaluations show that our method is qualitatively and quantitatively robust to outliers, and accurate in terms of matching rate in various matching frameworks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ETHZ Toys Datatset, http://www.vision.ee.ethz.ch/~vferrari/datasets.html
ICCV2005 Dataset, http://research.microsoft.com/iccv2005/contest/
Berg, A.C., Berg, T., Malik, J.: Shape Matching and Object Recognition using Low Distortion Correspondences. In: CVPR, pp. 26–33 (2005)
Hedau, V., Arora, H., Ahuja, N.: Matching Images Under Unstable Segmentations. In: CVPR, pp. 1–8 (2008)
Kannala, J., Rahtu, E., Brandt, S.S., Heikkilä, J.: Object Recognition and Segmentation by Non-Rigid Quasi-Dense Matching. In: CVPR, pp. 1–8 (2008)
Kim, T.H., Lee, K.M., Lee, S.U.: Generative Image Segmentation Using Random Walks with Restart. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 264–275. Springer, Heidelberg (2008)
Leordeanu, M., Hebert, M.: A Spectral Technique for Correspondence Problems Using Pairwise Constraints. In: ICCV, pp. 1482–1489 (2005)
Lowe, D.G.: Distinctive Image Features from Scale-Invariant Keypoints. IJCV 60(2), 91–110 (2004)
Maciel, J., Costeira, J.: A Global Solution to Sparse Correspondence Problems. PAMI 25(2), 187–199 (2003)
Mikolajczyk, K., Schmid, C.: Scale & Affine Invariant Interest Point Detectors. IJCV 60(1), 63–86 (2004)
Pan, J.Y., Yang, H.J., Faloutsos, C., Duygulu, P.: Automatic Multimedia Cross-modal Correlation Discovery. In: KDD, pp. 653–658 (2004)
Tuytelaars, T., Gool, L.V.: Matching Widely Separated Views based on Affine Invariant Regions. IJCV 59(1), 61–85 (2004)
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Scholkopf, B.: Learning with Local and Global Consistency. In: NIPS, pp. 321–328 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, T.H., Lee, K.M., Lee, S.U. (2010). A Probabilistic Model for Correspondence Problems Using Random Walks with Restart. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12297-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-12297-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12296-5
Online ISBN: 978-3-642-12297-2
eBook Packages: Computer ScienceComputer Science (R0)