Many-to-many graph matching via metric embedding

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2003, Pages

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

^a DEPAUL UNIVERSITY   (United States)

^b DREXEL UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OBJECT RECOGNITION; VECTORS;

GRAPH MATCHING; METRIC EMBEDDING;

PATTERN MATCHING;

EID: 17544385479     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorrup. 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. 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.
4. J. Bourgain. On Lipschitz embedding of finite metric spaces into Hilbert space. Israel Journal of Mathematics, 52:46-52, 1985.
5. 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.
6. 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.
7. 1 embeddings. Proceedings of Symposium on Foundations of Computer Science, 1999.
8. P. Indyk. Algorithmic aspects of geometric embeddings. In Proceedings, 42nd Annual Symposium on Foundations of Computer Science, 2001.
9. W. Kim and A. C. Kak. 3D object recognition using bipartite matching embedded in discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(3):224-251, 1991.
10. 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.
11. 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 Science, pages 557-591, 1994.
12. N. Linial, A. Magen, and M. E. Saks. Trees and Euclidean metrics. Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 169-175, 1998.
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. M. Pelillo, K. Siddiqi, and S. W. Zucker. Many-to-many matching of attributed trees using association graphs and game dynamics. In IWVF, pages 583-593, 2001.
18. 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.
19. 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.
20. 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.
21. L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3:504-519, 1981.
22. A. Shokoufandeh, S. 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.
23. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. International Journal of Computer Vision, 30:1-24, 1999.
24. 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.