Structural constraints for pose clustering

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes a structural method for object alignment by pose clustering. The idea underlying pose clustering is to decompose the objects under consideration into k-tuples of primitive parts. By bringing pairs of k-tuples into correspondence, sets of alignment parameters are estimated. The global alignment corresponds to the set of parameters with maximum votes. The work reported here offers two novel contributions. Firstly, we impose structural constraints on the arrangement of the k-tuples of primitives used for pose clustering. This limits problems of combinatorial background and eases the search for consistent pose clusters. Secondly, we use the EM algorithm to estimate maximum likelihood alignment parameters. Here we fit a mixture model to the set of transformation parameter votes. We control the order of the underlying mixture model using a minimum description length criterion.

Cite

CITATION STYLE

APA

Moss, S., & Hancock, E. R. (1999). Structural constraints for pose clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 632–640). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free