Abstract
We propose a robust method to match image feature points taking into account geometric consistency. It is a careful adaptation of the match propagation principle to 4th-order geometric constraints (match quadruple consistency). With our method, a set of matches is explained by a network of locally-similar affinities. This approach is useful when simple descriptor-based matching strategies fail, in particular for highly ambiguous data, e.g., with repetitive patterns or where texture is lacking. As it scales easily to hundreds of thousands of matches, it is also useful when denser point distributions are sought, e.g., for high-precision rigid model estimation. Experiments show that our method is competitive (efficient, scalable, accurate, robust) against state-of-the-art methods in deformable object matching, camera calibration and pattern detection.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60, 91–110 (2004)
Tola, E., Lepetit, V., Fua, P.: Daisy: An efficient dense descriptor applied to wide-baseline stereo. IEEE Trans. Pattern Anal. Mach. Intell. 32, 815–830 (2010)
Fischler, M.A., Bolles, R.C.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 381–395 (1981)
Pritchett, P., Zisserman, A., Zisserman, A.: Wide baseline stereo matching. In: ICCV, pp. 754–760 (1998)
Brown, M., Lowe, D.: Invariant features from interest point groups. In: BMVC, pp. 656–665 (2002)
Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV, pp. 1482–1489 (2005)
Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)
Choi, O., Kweon, I.S.: Robust feature point matching by preserving local geometric consistency. Comput. Vis. Image Underst. 113, 726–742 (2009)
Duchenne, O., Bach, F., Kweon, I.S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. PAMI 33, 2383–2395 (2011)
Chertok, M., Keller, Y.: Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 32, 2205–2215 (2010)
Cho, M., Lee, J., Lee, K.M.: Reweighted Random Walks for Graph Matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 492–505. Springer, Heidelberg (2010)
Zheng, Y., Doermann, D.: Robust point matching for nonrigid shapes by preserving local neighborhood structures. Tr. PAMI 28 (2006)
Kannala, J., Rahtu, E., Brandt, S., Heikkila, J.: Object recognition and segmentation by non-rigid quasi-dense matching. In: CVPR, pp. 1–8 (2008)
Ferrari, V., Tuytelaars, T., Van Gool, L.: Simultaneous Object Recognition and Segmentation by Image Exploration. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3021, pp. 40–54. Springer, Heidelberg (2004)
Cho, M., Lee, J., Lee, K.M.: Feature correspondence and deformable object matching via agglomerative correspondence clustering. In: ICCV (2009)
Mikolajczyk, K., Schmid, C.: An Affine Invariant Interest Point Detector. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol. 2350, pp. 128–142. Springer, Heidelberg (2002)
Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide baseline stereo from maximally stable extremal regions. In: BMVC, pp. 384–393 (2002)
Mikolajczyk, K., Tuytelaars, T., Schmid, C., Zisserman, A., Matas, J., Schaffalitzky, F., Kadir, T., Gool, L.V.: A comparison of affine region detectors. IJCV 65, 43–72 (2005), http://www.robots.ox.ac.uk/~vgg/research/affine/
Snavely, N., Seitz, S.M., Szeliski, R.: Modeling the world from internet photo collections. Int. J. Comput. Vision 80, 189–210 (2008)
Lee, S.C., Nevatia, R.: Extraction and integration of window in a 3D building model from ground view image. In: CVPR (2), pp. 113–120 (2004)
Ali, H., Seifert, C., Jindal, N., Paletta, L., Paar, G.: Window detection in facades. In: ICIAP, pp. 837–842 (2007)
Haugeard, J.E., Philipp-Foliguet, S., Precioso, F.: Windows and facades retrieval using similarity on graph of contours. In: ICIP, pp. 269–272 (2009)
Recky, M., Leberl, F.: Windows detection using k-means in cie-lab color space. In: ICPR, pp. 356–359 (2010)
Korč, F., Förstner, W.: eTRIMS Image Database for interpreting images of man-made scenes. Technical Report TR-IGG-P-2009-01, University of Bonn (2009)
Viola, P.A., Jones, M.J.: Robust real-time face detection. IJCV 57, 137–154 (2004)
Lhuillier, M., Quan, L.: Match propagation for image-based modeling and rendering. Tr. PAMI 24, 1140–1146 (2002)
Cech, J., Sanchez-Riera, J., Horaud, R.: Scene flow estimation by growing correspondence seeds. In: CVPR, pp. 3129–3136 (2011)
HaCohen, Y., Shechtman, E., Goldman, D.B., Lischinski, D.: Non-rigid dense correspondence with applications for image enhancement. SIGGRAPH 30 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ok, D., Marlet, R., Audibert, JY. (2013). Efficient and Scalable 4th-Order Match Propagation. In: Lee, K.M., Matsushita, Y., Rehg, J.M., Hu, Z. (eds) Computer Vision – ACCV 2012. ACCV 2012. Lecture Notes in Computer Science, vol 7724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37331-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-37331-2_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37330-5
Online ISBN: 978-3-642-37331-2
eBook Packages: Computer ScienceComputer Science (R0)