A convex-concave relaxation procedure based subgraph matching algorithm

Journal of Machine Learning Research

Volumn 25, Issue , 2012, Pages 237-252

  Liu, Zhi Yong ^a   Qiao, Hong ^a  

^a INSTITUTE OF AUTOMATION   (China)

Author keywords

Concave relaxation; Convex relaxation; Feature correspondence; Subgraph matching

Indexed keywords

CONCAVE RELAXATIONS; CONVEX RELAXATION; FEATURE CORRESPONDENCE; GRADUATED ASSIGNMENT ALGORITHM; GRAPH MATCHING PROBLEMS; PATH-FOLLOWING ALGORITHM; STATE-OF-THE-ART PERFORMANCE; SUBGRAPH MATCHING;

ALGORITHMS; LEARNING SYSTEMS; RELAXATION PROCESSES; STEREO VISION;

PATTERN MATCHING;

EID: 84876851159     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (21)

1. A. M. Abdulkader. Parallel Algorithms for Labelled Graph Matching. PhD thesis, Colorado School of Mines, 1998.
2. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(24):509- 521, 2002.
3. A. Blake and A Zisserman. Visual Reconstruction. MIT Press, Cambridge, MA, USA, 1987.
4. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. W. J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysi and Machine Intelligence, 17(8):749-764, 1995.
6. A. Dembo. Bounds of the extreme eigenvalues of postive-definite toeplitz matrices. IEEE Transactions on Information Theory, 34(2):352-355, 1988.
7. M. A. Fischler and R. A. Elschlager. The representation and matching of pictorial structures. IEEE Transactions on Computers, C-22(1):67-92, 1973.
8. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
9. G. H. Golub and C. F. Van Loan. Matrix Computations (third edition). The Johns Hopkins University Press, Baltimore and London, 1996.
10. R. M. Haralick and G. L. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
11. H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2):83-97, 1955.
12. Z. Y. Liu, H. Qiao, and L. Xu. An extended path following algorithm for graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(7):1451- 1456, 2012.
13. B. Luo and R. Hancock. Structural graph matching using the em algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1120-1136, 2001.
14. J. Maciel and J. P. Costeira. A global solution to sparse correspondence problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2):187-199, 2003.
15. G. Philbin, J. Sivic, and A. Zisserman. Geometric latent dirichlet allocation on a matching graph for large-scale image datasets. International Journal of Computer Vision, 95(2): 138-153, 2011.
16. Christian Schellewald and Christoph Schnörr. Probabilistic subgraph matching based on convex relaxation. In In Energy Minimization Methods in Computer Vision and Pattern Recognition, pages 171-186, 2005.
17. L. Torresani, V. Kolmogorov, and C. Rother. Feature correspondence via graph matching: Models and golbal optimization. In D. Forsyth, P. Torr, and A. Ziseerman (Eds.): ECCV 2008, Part II, LNCS 5303, pages 596-609, 2008.
18. J. R. Ullman. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1):31-42, 1976.
19. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5):695-703, 1988.
20. M. Zaslavskiy, F. Bach, and J. P. Vert. A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12):2227- 2242, 2009.
21. X. Z. Zhan. Extremal eigenvalues of real symmetric matrices with entries in an interval. SIAM Journal on Matrix Analysis and Applications, 27(3):851-860, 2006.