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.
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
Ballard D., “Generalising the Hough Transform to Detect Arbitrary Shapes”, Pattern Recognition, 13, pp. 111–122, 1981.
Dempster A.P., Laird N.M. and Rubin D.B., “Maximum-likelihood from Incomplete Data via the EM Algorithm”, J. Royal Statistical Soc. Ser. B (methodological),39, pp 1–38, 1977.
Richardson S. and P.J. Green, “On Bayesian analysis of mixtures with an unknown number of components”, Journal of the Royal Statistical Society Series B-Methodological, 59, pp.731–758, 1997.
Geman D., E. Bienenstock and R. Doursat, “Neural networks and the bias variance dilemma”, Neural Computation, 4, pp.1–58, 1992.
Hel-Or Y. and Werman M, “Pose Estimation by Fusing Noisy Data of Different Dimensions”, IEEE PAMI, 17, pp. 195–201, 1995.
Moss S. and Hancock E.R., “Registering Incomplete Radar Images with the EM Algorithm”, Image and Vision Computing, to appear, 1997.
Olson C.F., “Probabilistic Indexing for Object Recognition”, IEEE PAMI, 17, pp. 518–522, 1995.
Rissanen J., “Minimum Description Length Principle”, Encyclopedia of Statistic Sciences, 5, pp. 523–527, 1987.
Silverman B.W., “Density Estimation for Statistics and Data Analysis”, Chapman-Hall, 1986.
Stockman G., “Object Recognition and Localisation via Pose Clustering”, CVGIP, 40, pp. 361–387, 1987.
Stockman G, Kopstein S and Benett S., “Matching Images to Models for Registration and Object Detection”, IEEE PAMI, 4, pp. 229–241, 1982.
Ullman S., “An Approach to Object Recognition: Aligning Pictorial Descriptions”, Cognition, 32, pp. 193–254, 1989.
Tuceryan M. and T. Chorzempa, “Relative Sensitivity of a Family of Closest-point Graphs in Computer Vision Applications”, it Pattern Recognition, 25, pp. 361–373, 1991.
Viola P. and Wells W., “Alignment by Maximisation of Mutual Information”, Proceedings of the Fifth International Conference on computer Vision, pp. 16–23, 1995.
Woolfson H., “Model-Based Object Recognition by Geometric Hashing”, ECCV90(526–536).
Wilson R.C. and Hancock E.R., “Relational Matching by Discrete Relaxation”, IEEE PAMI, 19 pp. 634–648, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moss, S., Hancock, E.R. (1999). Structural Constraints for Pose Clustering. In: Solina, F., Leonardis, A. (eds) Computer Analysis of Images and Patterns. CAIP 1999. Lecture Notes in Computer Science, vol 1689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48375-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-48375-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66366-9
Online ISBN: 978-3-540-48375-5
eBook Packages: Springer Book Archive