Abstract
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the triangle inequality is generally not fulfilled. To this end, a matching of two planar shapes is computed by cutting an appropriately defined graph the edge weights of which encode the local similarity of respective contour parts on either shape. The cost of the minimum cut can be interpreted as a semi-metric on the space of planar shapes. Subsequently, we introduce the notion of a mean shape for the case of semi-metrics and show that this allows to perform a shape retrieval which mimics human notions of shape similarity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE PAMI 26(9), 1124–1137 (2004)
Cremers, D., Soatto, S.: A pseudo-distance for shape priors in level set segmentation. In: Paragios, N. (ed.) IEEE 2nd Int. Workshop on Variational, Geometric and Level Set Methods, Nice, pp. 169–176 (2003)
Gdalyahu, Y., Weinshall, D.: Flexible syntactic matching of curves and its application to automatic hierarchical classication of silhouettes. IEEE PAMI 21(12), 1312–1328 (1999)
Karcher, H.: Riemann center of mass and mollifier smoothing. Comm. Pure and Applied Math. 30, 509–541 (1977)
Klassen, E., Srivastava, A., Mio, W., Joshi, S.H.: Analysis of planar shapes using geodesic paths on shape spaces. IEEE PAMI 26(3), 372–383 (2003)
Latecki, L.J., Lakämper, R.: Shape similarity measure based on correspondence of visual parts. IEEE PAMI 22(10), 1185–1190 (2000)
Manay, S., Cremers, D., Hong, B.-W., Yezzi, A., Soatto, S.: Integral invariants for shape matching. IEEE PAMI 28(10), 1602–1618 (2006)
Michor, P., Mumford, D.: Riemannian geometries on spaces of plane curves. J. of the European Math. Society (2003)
Pennec, X.: Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements. Journal of Mathematical Imaging and Vision 25(1), 127–154 (2004) (A preliminary appeared as INRIA RR-5093, January 2004)
Schmidt, F.R., Töppe, E., Cremers, D., Boykov, Y.: Efficient shape matching via graph cuts. In: Energy Minimization Methods in Computer Vision and Pattern Recognition (to appear)
Sharvit, D., Chan, J., Tek, H., Kimia, B.: Symmetry-based indexing of image databases (1998)
Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math. 54, 150–168 (1932)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, F.R., Töppe, E., Cremers, D., Boykov, Y. (2007). Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts. In: Hamprecht, F.A., Schnörr, C., Jähne, B. (eds) Pattern Recognition. DAGM 2007. Lecture Notes in Computer Science, vol 4713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74936-3_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-74936-3_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74933-2
Online ISBN: 978-3-540-74936-3
eBook Packages: Computer ScienceComputer Science (R0)