Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2191, Issue , 2001, Pages 361-368

  Schellewald, Christian ^a   Roth, Stefan ^a   Schnörr, Christoph ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; GRAPHIC METHODS; OPTIMIZATION; PATTERN MATCHING; PATTERN RECOGNITION; RELAXATION PROCESSES;

ANNEALING ALGORITHM; BENCHMARK EXPERIMENTS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTER GENERATED; CONVEX OPTIMIZATION TECHNIQUES; DETERMINISTIC ANNEALING; OBJECTIVE FUNCTIONS; SEARCH ALGORITHMS;

COMPUTER VISION;

EID: 84945262358     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45404-7_48     Document Type: Article

References (17)

1. M. Herbert, J. Ponce, T. Boult, and A. Gross, editors. Object Representation in Computer Vision, volume 994 of Leet. Not. Comp. Sei. Springer-Verlag, 1995.
2. H.H. Bülthoff and S. Edelman. Psychophysical support for a two-dimensional view interpolation theory of object recognition. Proe. Nat. Acad. Science,, 92:60-64, 1992.
3. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Patt. Anal. Mach. IntelL, 10(5):695-703, 1988.
4. G. Vosselmann. Relational matching, volume 628 of Led. Not. Comp. Sei. Springer, 1992.
5. W.K. Konen, T. Maurer, and C. von der Malsburg. A fast dynamic link matching algorithm for invariant pattern recognition. Neural Networks, 7(6/7): 1019-1030, 1994.
6. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Patt. Anal. Mach. IntelL, 18(4):377-388, 1996.
7. A.D.J. Cross, R.C. Wilson, and E.R. Hancock. Inexact graph matching using genetic search. Pattern Recog., 30(6):953-970, 1997.
8. A.D.J. Cross and E.R. Hancock. Graph-matching with a dual-step em algorithm. IEEE Trans. Patt. Anal. Mach. IntelL, 20(11):1236-1253, 1998.
9. W. Förstner. A framework for low level feature extraction. In J.O. Eklundh, editor, Computer Vision - ECCV’94, volume 801 of Led. Not. Comp. Sei., pages 61-70. Springer-Verlag, 1994.
10. S. Ishii and M. Sato. Doubly constrained network for combinatorial optimization. Neurocomputing, 2001. to appear.
11. G. Finke, R.E. Burkard, and F. Rendl. Quadratic assignment problems. Annals of Discrete Mathematics, 31:61-82, 1987.
12. K.M. Anstreicher and N.W. Brixius. A new bound for the quadratic assignment problem based on convex quadratic programming. Technical report, Dept, of Management Sciences, University of Iowa, 1999.
13. R.E. Burkard, S. Karisch, and F. Rendl. Qaplib - a quadratic assignment problem library. J. Global Optimization, 10:391-403, 1997.
14. H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE Trans. Patt. Anal. Mach. IntelL, 21(9):917-922, 1999.
15. A. Rangarajan, A. Yuille, and E. Mjolsness. Convergence properties of the softassign quadratic assignment algorithm. Neural Computation, 11(6):1455-1474, 1999.
16. C. Schellewald, S. Roth, and C. Schnörr. Evaluation of spectral and convex relaxations to the quadratic assignment of relational object views. Comp, science series, technical report, Dept. Math, and Comp. Science, University of Mannheim, Germany, 2001. in preparation.
17. S.W. Hadley, F. Rendl, and H. Wolkowicz. A new lower bound via projection for the quadratic assignment problem. Math, of Operations Research,,, 17:727-739, 1992.