Linear and nonlinear generative probabilistic class models for shape contours
Pages 617 - 624
Abstract
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use objective functions in data space without explicit noise models, we are able to extract complex shape variation from noisy data. Most approaches to learning shape models slide observed data points around fixed contours and hence, require a correctly labeled 'reference shape' to prevent degenerate solutions. In our method, unobserved curves are reparameterized to explain the fixed data points, so this problem does not arise. The proposed algorithms are suitable for use with arbitrary basis functions and are applicable to both open and closed shapes; their effectiveness is demonstrated through illustrative examples, quantitative assessment on benchmark data sets and a visualization task.
References
[1]
Bishop, C. (2006). Pattern recognition and machine learning. Springer.
[2]
Chui, H., & Rangarajan, A. (2000). A feature registration framework using mixture models. MMBIA.
[3]
Cootes, T., & Taylor, C. (1999). A mixture model for representing shape. Im. and Vis. Comp., 17, 567--574.
[4]
Davies, R. (2002). Learning shape: Optimal models for analysing shape variability. Doctoral dissertation, University of Manchester.
[5]
Davies, R. H., Twining, C. J., Cootes, T. F., Waterton, J. C., & Taylor, C. J. (2002). A minimum description length approach to statistical shape modeling. IEEE Trans. on Med. Im., 21, 525--537.
[6]
Ericsson, A., & Astrom, K. (2003a). An affine invariant deformable shape representation for general curves. ICCV.
[7]
Ericsson, A., & Astrom, K. (2003b). Minimizing the description length using steepest descent. BMVC.
[8]
Ericsson, A., & Karlsson, J. (2006). Benchmarking of algorithms for automatic correspondence of shapes. BMVC.
[9]
Hladuvka, J., & Buhler, K. (2005). MDL spline models: Gradient and polynomial reparameterisations. BMVC.
[10]
Kotcheff, A. C. W., & Taylor, C. J. (1998). Automatic constuction of eigenshape models by direct optimization. Med. Im. Anal., 2, 303--314.
[11]
McNeill, G., & Vijayakumar, S. (2006). Hierarchical Procrustes matching for shape retrival. CVPR.
[12]
Ramsay, J., & Silverman, B. (2005). Functional data analysis. Springer.
[13]
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004). Recognition of shapes by editing their shock graphs. PAMI, 26, 550--571.
[14]
Thodberg, H. (2003). Minimum description length shape and appearance models. IPMI.
[15]
Thodberg, H., & Olafsdottir, H. (2003). Adding curvature to minimum description length shape models. BMVC.
[16]
Twining, C., & Taylor, C. (2001). Kernel principal component analysis and the construction of non-linear active shape models. BMVC.
- Linear and nonlinear generative probabilistic class models for shape contours
Recommendations
Analysis and synthesis of 3D shape families via deep-learned generative models of surfaces
SGP '15: Proceedings of the Eurographics Symposium on Geometry ProcessingWe present a method for joint analysis and synthesis of geometrically diverse 3D shape families. Our method first learns part-based templates such that an optimal set of fuzzy point and part correspondences is computed between the shapes of an input ...
GEM3D: GEnerative Medial Abstractions for 3D Shape Synthesis
SIGGRAPH '24: ACM SIGGRAPH 2024 Conference PapersWe introduce GEM3D 1 – a new deep, topology-aware generative model of 3D shapes. The key ingredient of our method is a neural skeleton-based representation encoding information on both shape topology and geometry. Through a denoising diffusion ...
Multi-Reference Shape Priors for Active Contours
In this paper, we present a new way of constraining the evolution of an active contour with respect to a set of fixed reference shapes. This approach is based on a description of shapes by the Legendre moments computed from their characteristic ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Machine Learning Journal
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 June 2007
Check for updates
Qualifiers
- Article
Conference
ICML '07 & ILP '07
Sponsor:
Acceptance Rates
Overall Acceptance Rate 140 of 548 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 146Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in