Many-to-many matching of scale-space feature hierarchies using metric embedding

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

Volumn 2695, Issue , 2003, Pages 17-32

  Demirci, M Fatih ^a   Shokoufandeh, Ali ^a   Keselman, Yakov ^b   Dickinson, Sven ^c   Bretzner, Lars ^d  

^a Drexel University   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; DIRECTED GRAPHS; FEATURE EXTRACTION; GRAPH THEORY; PATTERN MATCHING; SCALES (WEIGHING INSTRUMENTS); TREES (MATHEMATICS); VECTOR SPACES;

EDGE-WEIGHTED GRAPH; FEATURE HIERARCHIES; GRAPH MATCHING PROBLEMS; MATCHING ALGORITHM; METRIC EMBEDDINGS; MULTI-SCALE FEATURES; NORMED VECTOR SPACES; QUALITATIVE SHAPES;

IMAGE MATCHING;

EID: 35248839638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Review

References (24)

1. R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, 28(2):1073-1085, 1999.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications, pages 4-7. Prentice Hall, Englewood Cliffs, New Jersey, 1993.
3. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE PAMI, 24(4):509-522, April 2002.
4. R. Beveridge and E. M. Riseman. How easy is matching 2D line models using local search? IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(6):564-579, June 1997.
5. J. Bourgain. On Lipschitz embedding of finite metric spaces into Hilbert space. Israel Journal of Mathematics, 52:46-52, 1985.
6. P. Buneman. The recovery of trees from measures of dissimilarity. In F. Hodson, D. Kendall, and P. Tautu, editors, Mathematics in the Archaeological and Historical Sciences, pages 387-395. Edinburgh University Press, Edinburgh, 1971.
7. S. D. Cohen and L. J. Guibas. The earth mover's distance under transformation sets. In Proceedings, 7th International Conference on Computer Vision, pages 1076-1083, Kerkyra, Greece, 1999.
8. Steven Gold and Anand Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
9. 1 embeddings. Proceedings of Symposium on Foundations of Computer Scince, 1999.
10. P. Indyk. Algorithmic aspects of geometric embeddings. In Proceedings, 42nd Annual Symposium on Foundations of Computer Science, 2001.
11. S. Kosinov and T. Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. In Proceedings of SSPR/SPR, volume 2396, pages 133-142. Springer, 2002.
12. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Proceedings of 35th Annual Symposium on Foundations of Computer Scince, pages 557-591, 1994.
13. T.-L. Liu and D. Geiger. Approximate tree matching and shape similarity. In Proceedings, 7th International Conference on Computer Vision, pages 456-462, Kerkyra, Greece, 1999.
14. B. Luo and E.R. Hancock. Structural matching using the em algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:1120-1136, 2001.
15. J. Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 237:221-237, 1999.
16. M. Pelillo, K. Siddiqi, and S. Zucker. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11):1105-1120, November 1999.
17. Y. Rubner, C. Tomasi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000.
18. G. Scott and H. Longuet-Higgins. An algorithm for associating the features of two patterns. Proceedings of Royal Society of London, B244:21-26, 1991.
19. T. Sebastian, P. Klein, and B. Kimia. Recognition of shapes by editing shock graphs. In IEEE International Conference on Computer Vision, pages 755-762, 2001.
20. L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3:504-519, 1981.
21. A. Shokoufandeh, S.J. Dickinson, C. Jönsson, L. Bretzner, and T. Lindeberg. On the representation and matching of qualitative shape at multiple scales. In Proceedings, 7th European Conference on Computer Vision, volume 3, pages 759-775, 2002.
22. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. International Journal of Computer Vision, 30:1-24, 1999.
23. S. Umeyama. Least-squares estimation of transformation parameters between two point patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):376-380, April 1991.
24. M. S. Waterman, T. F. Smith, M. Singh, and W. A. Beyer. Additive evolutionary trees. J. Theor. Biol, 64:199-213, 1977.