Fast and scalable approximate spectral graph matching for correspondence problems

Information Sciences

Volumn 220, Issue , 2013, Pages 306-318

  Kang, U ^a   Hebert, Martial ^b   Park, Soonyong ^c  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Samsung Advanced Institute of Technology (SAIT)   (South Korea)

Author keywords

Approximation algorithm; Correspondence problem; Spectral graph matching

Indexed keywords

AFFINITY MATRIX; AS GRAPH; CORRESPONDENCE PROBLEMS; DATA GENERATION; DATA SIZE; EXACT ALGORITHMS; GRAPH MATCHINGS; KRONECKER PRODUCT; LINEAR COMBINATIONS; LOSS OF ACCURACY; MEMORY REQUIREMENTS; SMALL DATA; SPECTRAL GRAPH MATCHING; SPECTRAL MATCHING ALGORITHMS; SPECTRAL MATCHINGS;

APPROXIMATION ALGORITHMS; COMPUTER VISION; EIGENVALUES AND EIGENFUNCTIONS; PATTERN MATCHING;

MATRIX ALGEBRA;

EID: 84868479626     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2012.07.008     Document Type: Conference Paper

References (32)

1. S. Belongie, J. Malik, and J. Puzicha Shape matching and object recognition using shape contexts IEEE Trans. Pattern Anal. Mach. Intell. 24 4 2002 509 522
2. J.L. Bentley Multidimensional binary search trees used for associative searching Commun. ACM 18 9 1975 509 517
3. A.C. Berg, T.L. Berg, J. Malik. Shape matching and object recognition using low distortion correspondences, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2005, pp. 26-33.
4. P.J. Besl, and N.D. McKay A method for registration of 3-d shapes IEEE Trans. Pattern Anal. Mach. Intell. 14 2 1992 239 256
5. M. Brown, D.G. Lowe, Recognising panoramas, in: Internat. Conf. on Computer Vision (ICCV), 2003, pp. 1218-1227.
6. J. Canny A computational approach to edge detection IEEE Trans. Pattern Anal. Mach. Intell. 8 6 1986 679 698
7. M. Cho, J. Lee, K.M. Lee, Reweighted random walks for graph matching, in: European Conference on Computer Vision (ECCV), 2010, pp. 492-505.
8. T. Cour, P. Srinivasan, J. Shi, Balanced graph matching, in: Conf. Neural Information Processing Systems (NIPS), 2006, pp. 313-320.
9. J. Dean, S. Ghemawat, Mapreduce: Simplified data processing on large clusters, in: Symposium on Operating Systems Design and Implementation (OSDI), 2004, pp. 137-150.
10. O. Duchenne, F.R. Bach, I.-S. Kweon, J. Ponce, A tensor-based algorithm for high-order graph matching, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2009, pp. 1980-1987.
11. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company
12. S. Gold, and A. Rangarajan A graduated assignment algorithm for graph matching IEEE Trans. Pattern Anal. Mach. Intell. 18 4 1996 377 388
13. G.H. Golub, and C.F.V. Loan Matrix Computations 1996 Johns Hopkins University Press
14. R.A. Horn, and C.R. Johnson Matrix Analysis 1985 Cambridge University Press
15. G. Kim, M. Hebert, and S.-K. Park Preliminary development of a line feature-based object recognition system for textureless indoor objects S. Lee, I. Suh, M. Kim, Recent Progress in Robotics: Viable Robotic Service to Human Lecture Notes in Control and Information Sciences vol. 370 2008 Springer Berlin/Heidelberg 255 268
16. H.W. Kuhn The hungarian method for the assignment problem Naval Res. Logis. Quart. 2 1955 83 97
17. K. Lange Numerical Analysis for Statisticians 1999 Springer
18. J. Lee, M. Cho, K.M. Lee, Hyper-graph matching via reweighted random walks, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2011, pp. 1633-1640.
19. M. Leordeanu, M. Hebert, A spectral technique for correspondence problems using pairwise constraints, in: Internat. Conf. on Computer Vision (ICCV), 2005, pp. 1482-1489.
20. M. Leordeanu, M. Hebert, R. Sukthankar, Beyond local appearance: Category recognition from pairwise interactions of simple features, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2007.
21. J. Maciel, and J. Costeira A global solution to sparse correspondence problems IEEE Trans. Pattern Anal. Mach. Intell. 25 2 2003 187 199
22. A.Y. Ng, A.X. Zheng, M.I. Jordan, Link analysis, eigenvectors and stability, in: Internat. Joint Conf. Artificial Intelligence (IJCAI), 2001, pp. 903-910.
23. S. Park, S. Kim, M. Park, and S.-K. Park Vision-based global localization for mobile robots with hybrid maps of objects and spatial layouts Inf. Sci. 179 2009 4174 4198
24. S. Park, S.-K. Park, Spectral scan matching and its application to global localization for mobile robots, in: IEEE Conf. Robotics and Automation (ICRA), 2010, pp. 1361-1366.
25. P. Pritchett, A. Zisserman, Wide baseline stereo matching, in: Internat. Conf. on Computer Vision (ICCV), 1998, pp. 754-760.
26. S. Se, D.G. Lowe, and J.J. Little Vision-based global localization and mapping for mobile robots IEEE Trans Rob. 21 3 2005 364 375
27. J. Shi, C. Tomasi, Good features to track, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 1994, pp. 593-600.
28. K.K.T.K.X. Shyjan Mahamud, and Lance R. Williams Segmentation of multiple salient closed contours from real images IEEE Trans. Pattern Anal. Mach. Intell. 25 4 2003 433 444
29. R. Sinkhorn A relationship between arbitrary positive matrices and doubly stochastic matrices Ann. Math. Statist. 35 2 1964 876 879
30. G. Stewart, and J.-G. Sun Matrix Perturbation Theory 1990 Academic Press
31. R. Zass, A. Shashua, Probabilistic graph and hypergraph matching, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2008.
32. Z. Zhang Iterative point matching for registration of free-form curves and surfaces Int. J. Comput. Vision 13 2 1994 119 152