Abstract
This paper describes how the early visual process of contour organisation can be realised using the EM algorithm of Dempster, Laird and Rubin [2]. The underlying computational representation is based on Zucker's idea of fine spline coverings [17]. According to our EM approach the adjustment of spline parameters draws on an iterative weighted least-squares fitting process. The expectation step of our EM procedure computes the likelihood of the data using a mixture model defined over the set of spline coverings. These splines are limited in their spatial extent using Gaussian windowing functions. The maximisation of the likelihood leads to a set of linear equations in the spline parameters which solve the weighted least squares problem. We evaluate the technique on the localisation of road structures in aerial infra-red images.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Becker S. and Hinton G.E., “Learning mixture models of spatial coherence”, Neural Computation, 5, pp 267–277, 1992.
Dempster 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.
Ferrie F.P., Lagarde J. and Whaite P., “Darboux frames, snakes, and superquadratics: geometry from the bottom up”, IEEE PAMI, 15, pp. 771–784, 1993
Hancock E.R., “Resolving edge-line ambiguities using probabilistic relaxation”, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 300–306, 1993.
Hancock E.R. and Kittler J., “Edge labelling using dictionary-based probabilistic relaxation”, IEEE PAMI, 12, pp. 161–185, 1990.
Hummel R.A. and Zucker S.W., “On the foundations of relaxation labelling processes”, IEEE PAMI, 5, pp 267–287, 1987.
Jordan M.I. and Jacobs R.A., “Hierarchical mixtures of experts and the EM algorithm”, Neural Computation, 6, pp. 181–214, 1994.
Kittler J. and Hancock, E.R., “Combining evidence in probabilistic relaxation”, International Journal of Pattern Recognition and Artificial Intelligence, 3, N1, pp 29–51, 1989.
Leite J.A.F. and Hancock, E.R., “ Statistically combining and refining multichannel information”, Progress in Image Analysis and Processing III: Edited by S Impedovo, World Scientific, pp. 193–200, 1994
Meer P., Mintz D., Rosenfeld A. and Kim D.Y., “Robust regression methods for computer vision — A review”, International Journal of Computer vision, 6, pp. 59–70, 1991.
Peleg S. and Rosenfeld A., “Determining compatibility coefficients for curve enhancement relaxation processes”, IEEE SMC, 8, pp. 548–555, 1978.
Rosenfeld A., Hummel R.A. and Zucker S.W., “Scene labelling by relaxation operations”, IEEE Transactions SMC, SMC-6, pp 400–433, 1976.
Sander P.T. and Zucker S.W., “Inferring surface structure and differential structure from 3D images”, IEEE PAMI, 12, pp 833–854, 1990.
Sharp N.G. and Hancock E.R., “Feature tracking by multi-frame relaxation”, Image and Vision Computing, 13, pp. 637–644, 1995.
Terzopoulos D., “Regularisation of inverse problems involving discontinuities”, IEEE PAMI, 8, pp 129–139, 1986.
Zucker, S.W., Hummel R.A., and Rosenfeld A., “An application of relaxation labelling to line and curve enhancement”, IEEE TC, C-26, pp. 394–403, 1977.
Zucker S., David C., Dobbins A. and Iverson L., “The organisation of curve detection: coarse tangent fields and fine spline coverings”, Proceedings of the Second International Conference on Computer Vision, pp. 577–586, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leite, J.A.F., Hancock, E.R. (1996). Iterative curve organisation with the EM algorithm. In: Borges, D.L., Kaestner, C.A.A. (eds) Advances in Artificial Intelligence. SBIA 1996. Lecture Notes in Computer Science, vol 1159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61859-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-61859-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61859-1
Online ISBN: 978-3-540-70742-4
eBook Packages: Springer Book Archive