Abstract
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation errors, articulation, scale difference, and within-class deformation can yield image and model features which don’t match one-to-one but rather many-to-many. Adopting a graph-based representation of a set of features, we present a matching algorithm that establishes many-to-many correspondences between the nodes of two noisy, vertex-labeled weighted graphs. Our approach reduces the problem of many-to-many matching of weighted graphs to that of many-to-many matching of weighted point sets in a normed vector space. This is accomplished by embedding the initial weighted graphs into a normed vector space with low distortion using a novel embedding technique based on a spherical encoding of graph structure. Many-to-many vector correspondences established by the Earth Mover’s Distance framework are mapped back into many-to-many correspondences between graph nodes. Empirical evaluation of the algorithm on an extensive set of recognition trials, including a comparison with two competing graph matching approaches, demonstrates both the robustness and efficacy of the overall approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
athitsos-alon-sclaroff-kollios:boostmap:2004 Athitsos, V., Alon, J., Sclaroff, S., and Kollios, G. 2004.BoostMap: A method for efficient approximate similarity rankings.In Proceedings, IEEE Conference on Computer Vision and Pattern Recognition, Washington, DC.
Atkinson, D.S. and Vaidya, P.M. 1995.Using geometry to solve the transportation problem in the plane.Algorithmica, 13(5):442–461.
Bell, E.T. 1934.Exponential numbers.Amer. Math. Monthly, 41:411–419.
Belongie, S., Malik, J., and Puzicha, J. 2002.Shape matching and object recognition using shape contexts.IEEE PAMI, 24(4):509–522.
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.
Carcassoni, M. and Hancock, E.R. 2003.Correspondence matching with modal clusters.IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(12):1609–1614.
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.
Conway, J.H. and Sloane, N.J.A. 1998.Sphere Packing, Lattices and Groups.Springer-Verlag, New York.
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.
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.
Gionis, A., Indyk, P., and Motwani, R. 1999.Similarity search in high dimensions via hashing.In VLDB, pp. 518–529.
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.
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.
Gupta, A., Newman, I., Rabinovich, Y., and Sinclair, A. 1999.Cuts, trees and l1 embeddings.In Proceedings of Symposium on Foundations of Computer Scince.
Indyk, P. 2001.Algorithmic aspects of geometric embeddings.In Proceedings, 42nd Annual Symposium on Foundations of Computer Science.
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.
Keselman, Y. and Dickinson, S. 2005.Generic model abstraction from examples.IEEE PAMI, 27(7) .
Keselman, Y., Shokoufandeh, A., Demirci, F. and Dickinson, S. 2003.Many-to-many graph matchingvia\vadjust\vfill\pagebreak low-distortion embedding.In Proceedings, IEEE Conference on Computer Vision and Pattern Recognition, Madison, WI.
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.
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.
Lindeberg, T. 1998a.Edge detection and ridge detection with automatic scale selection.International Journal of Computer Vision, 30:117–154.
Lindeberg, T. 1998b.Feature detection with automatic scale selection.International Journal of Computer Vision, 30:77–116.
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.
Matouúsek, J. 1999.On embedding trees into uniformly convex Banach spaces.Israel Journal of Mathematics, 237:221–237.
Messmer, B. and Bunke, H. 1995.Efficient error-tolerant subgraph isomorphism detection.In D.Dori and A.Bruckstein (Eds.), Shape, Structure and Pattern Recognition, World Scientific Publ. Co., pp. 231–240.
Murase, H. and Nayar, S. 1995.Visual learning and recognition of 3-D objects from appearance.International Journal of Computer Vision, 14:5–24.
Myers, R., Wilson, R., and Hancock, E. 2000.Bayesian graph edit distance.IEEE PAMI, 22(6):628–635.
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.
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.
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.
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.
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.
Shokoufandeh, A., Dickinson, S., Jonsson, C., Bretzner, L., and Lindeberg, T. 2002. block The representation and matching of qualitative shape at multiple scales. block In Proceedings, ECCV, pp. 759–775, Copenhagen.
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.
Shokoufandeh, A., Macrini, D., Dickinson, S., Siddiqi, K., and Zucker, S. 2005.Indexing hierarchical structures using graph spectra.IEEE PAMI, 27(7).
Siddiqi, K., Shokoufandeh, A., Dickinson, S., and Zucker, S. 1999.Shock graphs and shape matching.International Journal of Computer Vision, 30:1–24.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Demirci, M.F., Shokoufandeh, A., Keselman, Y. et al. Object Recognition as Many-to-Many Feature Matching. Int J Comput Vision 69, 203–222 (2006). https://doi.org/10.1007/s11263-006-6993-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11263-006-6993-y