Object recognition as many-to-many feature matching

International Journal of Computer Vision

Volumn 69, Issue 2, 2006, Pages 203-222

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

^a Drexel University   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^d UNIVERSITY OF TORONTO   (Canada)

Author keywords

Earth Mover's Distance (EMD); Graph embedding; Graph matching; Object recognition

Indexed keywords

ALGORITHMS; FEATURE EXTRACTION; GRAPH THEORY; IMAGE PROCESSING; IMAGE SEGMENTATION; SPEECH; VECTOR QUANTIZATION;

EARTH MOVER'S DISTANCE (EMD); GRAPH EMBEDDING; GRAPH MATCHING;

OBJECT RECOGNITION;

EID: 33744551438     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-006-6993-y     Document Type: Article

References (36)

1. Agarwala, R., Bafna, V., Farach, M., Paterson, M., and Thorup, M. 1999. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, 28(2):1073-1085.
2. Athitsos, V., Alon, J., Sclaroff, S., and Kollios, G. 2004. Boost-Map: A method for efficient approximate similarity rankings. In Proceedings, IEEE Conference on Computer Vision and Pattern Recognition, Washington, DC.
3. Atkinson, D.S. and Vaidya, P.M. 1995. Using geometry to solve the transportation problem in the plane. Algorithmica, 13(5):442-461.
4. Bell, E.T. 1934. Exponential numbers. Amer. Math. Monthly, 41:411-419.
5. Belongie, S., Malik, J., and Puzicha, J. 2002. Shape matching and object recognition using shape contexts. IEEE PAMI, 24(4):509-522.
6. Buneman, P. 1971. The recovery of trees from measures of dissimilarity. In F. Hodson, D. Kendall, and P. Tautu (Eds.), Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, Edinburgh, pp. 387-395.
7. Carcassoni, M. and Hancock, E.R. 2003. Correspondence matching with modal clusters. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(12):1609-1614.
8. Cohen, S.D. and Guibas, L.J. 1999. The earth mover's distance under transformation sets. In Proceedings, 7th International Conference on Computer Vision, Kerkyra, Greece, pp. 1076-1083.
9. Conway, J.H. and Sloane, N.J.A. 1998. Sphere Packing, Lattices and Groups. Springer-Verlag, New York.
10. Demirci, F., Shokoufandeh, A., Dickinson, S., Keselman, Y., and Bretzner, L. 2004. Many-to-many feature matching using spherical coding of directed graphs. In Proceedings, 8th European Conference on Computer Vision, Prague, Czech Republic.
11. Demirci, F., Shokoufandeh, A., Keselman, Y., Dickinson, S., and Bretzner, L. 2003. Many-to-many matching of scale-space feature hierarchies using metric embedding. In Scale Space Methods in Computer Vision, 4th International Conference, Isle of Skye, UK, pp. 17-32.
12. Gionis, A., Indyk, P., and Motwani, R. 1999. Similarity search in high dimensions via hashing. In VLDB, pp. 518-529.
13. Gold, S. and Rangarajan, A. 1996. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388.
14. Gupta, A. 1999. Embedding tree metrics into low dimensional euclidean spaces. In Proceedings of The Thirty-First Annual ACM Symposium on Theory of Computing, pp. 694-700.
15. 1 embeddings. In Proceedings of Symposium on Foundations of Computer Scince.
16. Indyk, P. 2001. Algorithmic aspects of geometric embeddings. In Proceedings, 42nd Annual Symposium on Foundations of Computer Science.
17. Grauman, K.K. and Darrell, T. 2004. Fast contour matching using approximate earth mover's distance. In Proc. IEEE Conf. on Comp. Vision and Pattern Recognition, IEEE Computer Society, pp. 220-227.
18. Keselman, Y. and Dickinson, S. 2005. Generic model abstraction from examples. IEEE PAMI, 27(7).
19. Keselman, Y., Shokoufandeh, A., Demirci, F. and Dickinson, S. 2003. Many-to-many graph matching via low-distortion embedding. In Proceedings, IEEE Conference on Computer Vision and Pattern Recognition, Madison, WI.
20. Kosinov, S. and Caelli, T. 2002. Inexact multisubgraph matching using graph eigenspace and clustering models. In Proceedings of SSPR/SPR, Springer, vol. 2396, pp. 133-142.
21. Leibe, B. and Schiele, B. 2003. Analyzing appearance and contour based methods for object categorization. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Madison, WI.
22. Lindeberg, T. 1998a. Edge detection and ridge detection with automatic scale selection. International Journal of Computer Vision, 30:117-154.
23. Lindeberg, T. 1998b. Feature detection with automatic scale selection. International Journal of Computer Vision, 30:77-116.
24. Liu, T.-L. and Geiger, D. 1999. Approximate tree matching and shape similarity. In Proceedings, 7th International Conference on Computer Vision, Kerkyra, Greece, pp. 456-462.
25. Matoušek, J. 1999. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 237:221-237.
26. Messmer, B. and Bunke, H. 1995. Efficient error-tolerant subgraph isomorphism detection. In D. Don and A. Bruckstein (Eds.), Shape, Structure and Pattern Recognition, World Scientific Publ. Co., pp. 231-240.
27. Murase, H. and Nayar, S. 1995. Visual learning and recognition of 3-D objects from appearance. International Journal of Computer Vision, 14:5-24.
28. Myers, R., Wilson, R., and Hancock, E. 2000. Bayesian graph edit distance. IEEE PAMI, 22(6):628-635.
29. Pelillo, M., Siddiqi, K. and Zucker, S. 1999. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11):1105-1120.
30. Rubner, Y., Tomasi, C., and Guibas, L.J. 2000. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121.
31. Scott, G. and Longuet-Higgins, H. 1991. An algorithm for associating the features of two patterns. In Proceedings of Royal Society of London, B244:21-26.
32. Sebastian, T., Klein, P., and Kimia, B. 2001. Recognition of shapes by editing shock graphs. In IEEE International Conference on Computer Vision, pp. 755-762.
33. Sebastian, T., Klein, P.N., and Kimia, B. 2004. Recognition of shapes by editing their shock graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(5):550-571.
34. Shokoufandeh, A., Dickinson, S.J., Jönsson, C., Bretzner, L., and Lindeberg, T. 2002. On the representation and matching of qualitative shape at multiple scales. In Proceedings, 7th European Conference on Computer Vision, vol. 3, pp. 759-775.
35. Shokoufandeh, A., Macrini, D., Dickinson, S., Siddiqi, K., and Zucker, S. 2005. Indexing hierarchical structures using graph spectra. IEEE PAMI, 27(7).
36. Siddiqi, K., Shokoufandeh, A., Dickinson, S., and Zucker, S. 1999. Shock graphs and shape matching. International Journal of Computer Vision, 30:1-24.