Linear and Nonlinear Generative Probabilistic Class Models for Shape Contours

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 ob jective 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.

Cite

Text

McNeill and Vijayakumar. "Linear and Nonlinear Generative Probabilistic Class Models for Shape Contours." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273574

Markdown

[McNeill and Vijayakumar. "Linear and Nonlinear Generative Probabilistic Class Models for Shape Contours." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/mcneill2007icml-linear/) doi:10.1145/1273496.1273574

BibTeX

@inproceedings{mcneill2007icml-linear,
  title     = {{Linear and Nonlinear Generative Probabilistic Class Models for Shape Contours}},
  author    = {McNeill, Graham and Vijayakumar, Sethu},
  booktitle = {International Conference on Machine Learning},
  year      = {2007},
  pages     = {617-624},
  doi       = {10.1145/1273496.1273574},
  url       = {https://mlanthology.org/icml/2007/mcneill2007icml-linear/}
}