Abstract
This paper presents a geometric approach to perform: (i) hierarchical clustering of imaged objects according to the shapes of their boundaries, and (ii) testing of observed shapes for classification. An intrinsic metric on nonlinear, infinite-dimensional shape space, obtained using geodesic lengths, is used for clustering. This analysis is landmark free, does not require embedding shapes in ℝ2, and uses ordinary differential equations for flows (as opposed to partial differential equations). Intrinsic analysis also leads to well defined shape statistics such as means and covariances, and is computationally efficient. Clustering is performed in a hierarchical fashion. At any level of hierarchy clusters are generated using a minimum dispersion criterion and an MCMC-type search algorithm. Cluster means become elements to be clustered at the next level. Gaussian models on tangent spaces are used to pose binary or multiple hypothesis tests for classifying observed shapes. Hierarchical clustering and shape testing combine to form an efficient tool for shape retrieval from a large database of shapes. For databases with n shapes, the searches are performed using log(n) tests on average. Examples are presented for demonstrating these tools using shapes from Kimia shape database and the Surrey fish database.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Brown, D.E., Huntley, C.L.: A practical application of simulated annealing to clustering. Technical Report IPC-TR-91-003, Institute for Parallel Computing, University of Virginia, Charlotesville, VA (1991)
Cremers, D., Soatto, S.: A pseudo distance for shape priors in level set segmentation. In: 2nd IEEE Workshop on Variational, Geometric, and Level Set Methods in Computer Vision, France (2003)
Dryden, I.L., Mardia, K.V.: Statistical Shape Analysis. John Wiley & Son, Chichester (1998)
Figueiredo, M.A.T., Jain, A.K.: Unsupervised learning of finite mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(3) (2002)
Jain, K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)
Maurel, A.P., Sapiro, G.: Dynamic shapes average. In: 2nd IEEE Workshop on Variational, Geometric, and Level Set Methods in Computer Vision, France (2003)
Miller, M.I., Younes, L.: Group actions, homeomorphisms, and matching: A general framework. International Journal of Computer Vision 41(1/2), 61–84 (2002)
Robert, C.P., Casella, G.: Monte Carlo Statistical Methods. Springer Text in Stat. (1999)
Rose, K.: Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of IEEE 86(11), 2210–2239 (1998)
Klassen, E., Srivastava, A., Mio, W., Joshi, S.H.: Analysis of planar shapes using geodesic paths on shape spaces. IEEE Pattern Analysis and Machiner Intelligence (March 2004) (to appear)
Mokhtarian, F., Abbasi, S., Kittler, J.: Efficient and robust shape retrieval by shape content through curvature scale space. In: Proceedings of First International Conference on Image Database and MultiSearch (1996)
Sharvit, D., Chan, J., Tek, H., Kimia, B.B.: Symmetry-based indexing of image databases. Content-Based Access of Image and Video Libraries (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joshi, S., Srivastava, A., Mio, W., Liu, X. (2004). Hierarchical Organization of Shapes for Efficient Retrieval. In: Pajdla, T., Matas, J. (eds) Computer Vision - ECCV 2004. ECCV 2004. Lecture Notes in Computer Science, vol 3023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24672-5_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-24672-5_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21982-8
Online ISBN: 978-3-540-24672-5
eBook Packages: Springer Book Archive