Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-25T23:17:38.624Z Has data issue: false hasContentIssue false
  • English
  • Français

A statistical approach to identifying closed object boundaries in images

Part of: Stochastic processes Markov processes

Published online by Cambridge University Press:  01 July 2016

Jeffrey D. Helterbrand ,
Noel Cressie  and
Jennifer L. Davidson
Jeffrey D. Helterbrand*
Affiliation:
Lilly Research Laboratories
Noel Cressie*
Affiliation:
Iowa State University
Jennifer L. Davidson*
Affiliation:
Iowa State University
*
* Postal address: Lilly Research Laboratories, A Division of Eli Lilly and Company, Indianapolis, IN 46285, USA.
** Postal address: Department of Statistics, Iowa State University, Ames, IA 50011, USA.
*** Postal address: Department of Electrical Engineering and Computer Engineering, Iowa State University, Ames, IA 50011, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this research, we present a statistical theory, and an algorithm, to identify one-pixel-wide closed object boundaries in gray-scale images. Closed-boundary identification is an important problem because boundaries of objects are major features in images. In spite of this, most statistical approaches to image restoration and texture identification place inappropriate stationary model assumptions on the image domain. One way to characterize the structural components present in images is to identify one-pixel-wide closed boundaries that delineate objects. By defining a prior probability model on the space of one-pixel-wide closed boundary configurations and appropriately specifying transition probability functions on this space, a Markov chain Monte Carlo algorithm is constructed that theoretically converges to a statistically optimal closed boundary estimate. Moreover, this approach ensures that any approximation to the statistically optimal boundary estimate will have the necessary property of closure.

Keywords

IMAGE ANALYSISBOUNDARY DETECTIONBAYESIAN METHODSMARKOV RANDOM FIELDSMARKOV CHAIN MONTE CARLO METHODS

MSC classification

Primary: 60G60: Random fields
Secondary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Type
Research Article
Information
Advances in Applied Probability , Volume 26 , Issue 4 , December 1994 , pp. 831 - 854
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Amit, Y. and Grenander, U. (1991) Comparing sweep strategies for stochastic relaxation. J. Multivariate Anal. 37, 197–222.CrossRefGoogle Scholar
Banfield, J. D. and Raftery, A. E. (1992) Ice floe identification in satellite images using mathematical morphology and clustering about principle curves. J. Amer. Statist. Assoc. 87, 7–16.CrossRefGoogle Scholar
Besag, J. (1974) Spatial interaction and the statistical analysis of lattice systems. J. R. Statist. Soc. B 36, 192–225.Google Scholar
Besag, J. (1986) On the statistical analysis of dirty pictures. J. R. Statist. Soc. B 48, 259–279.Google Scholar
Besag, J. (1991) Rejoinder to: Bayesian image restoration with two applications in spatial statistics. Ann. Inst. Statist. Math. 43, 45–59.CrossRefGoogle Scholar
Besag, J., York, J. and Mollie, A. (1991) Bayesian image restoration with two applications in spatial statistics (with discussion). Ann. Inst. Statist. Math. 43, 1–59.CrossRefGoogle Scholar
Cressie, N. (1991) Statistics for Spatial Data. Wiley, New York.Google Scholar
Cristi, R. (1990) Markov and recursive least squares methods for the estimation of data with discontinuities. IEEE Trans. Acoustics, Speech, Signal Proc. 38, 1972–1980.CrossRefGoogle Scholar
Doob, J. L. (1953) Stochastic Processes. Wiley, New York.Google Scholar
Elliot, H., Derin, H., Cristi, R. and Geman, D. (1986) Application of the Gibbs distribution to image segmentation In Statistical Image Processing and Graphics, ed. Wegman, E. and DePriest, D.. pp. 3–24. Marcel Dekker, New York.Google Scholar
Geiger, D. and Girosi, F. (1991) Parallel and deterministic algorithms from MRF's: surface reconstruction. IEEE Trans. Pattern Anal. Machine Intell. 13, 401–412.CrossRefGoogle Scholar
Geman, D. and Gidas, B. (1991) Image Analysis and Computer Vision, pp. 9–36. National Academy Press, Washington, DC.Google Scholar
Geman, D., Geman, S., Graffigne, C. and Dong, P. (1990) Boundary detection by constrained optimization. IEEE Trans. Pattern Anal. Machine Intell. 12, 609–628.CrossRefGoogle Scholar
Geman, S. and Geman, D. (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intell. 6, 721–741.CrossRefGoogle ScholarPubMed
Gonzalez, R. C. and Woods, R. E. (1992) Digital Image Processing. Addison-Wesley, New York.Google Scholar
Grenander, U. and Keenan, D. M. (1989) Towards automated image understanding. J. Appl. Statist. 16, 207–221.CrossRefGoogle Scholar
Grenander, U. and Miller, M. (1994) Representation of knowledge in complex systems (with discussion). J. R. Statist. Soc. B 56, 549–603.Google Scholar
Hammersley, J. M. and Clifford, P. (1971) Markov fields on finite graphs and lattices. Unpublished manuscript, Oxford University.Google Scholar
Helterbrand, J. D. (1993) Spatial dependence models and image analysis. PhD dissertation, Iowa State University.CrossRefGoogle Scholar
Helterbrand, J. D. (1994) One-pixel-wide closed boundary identification via image pyramids. Submitted for publication.Google Scholar
Hong, T. H. and Rosenfeld, A. (1984) Compact region extraction using weighted pixel linking in a pyramid. IEEE Trans. Pattern Anal. Machine Intell. 6, 222–229.CrossRefGoogle Scholar
Kindermann, R. and Snell, J. L. (1980) Markov Random Fields and Their Applications, Vol. 1. American Mathematical Society, Providence, RI.CrossRefGoogle Scholar
Molina, R. and Ripley, B. D. (1989) Using spatial models as priors in astronomical image analysis. J. Appl. Statist. 16, 193–206.CrossRefGoogle Scholar
Qian, W. and Titterington, D. M. (1990) Parameter estimation for hidden Gibbs chains. Statist. Prob. Lett. 10, 49–58.CrossRefGoogle Scholar
Qian, W. and Titterington, D. M. (1991) Estimation of parameters in hidden Markov models. Phil. Trans. R. Soc. London A 337, 407–428.Google Scholar
Ripley, B. D. and Sutherland, A. I. (1990) Finding spiral structures in images of galaxies. Phil. Trans. R. Soc. London A 332, 447–485.Google Scholar
Rosenfeld, A., (Ed.) (1984) Multiresolution Image Processing and Analysis. Springer-Verlag, Berlin.CrossRefGoogle Scholar
Schalkoff, R. J. (1989) Digital Image Processing and Computer Vision. Wiley, New York.Google Scholar
Shu, J. S.-P. (1989) One-pixel-wide edge detection. Pattern Recognition 22, 665–673.Google Scholar
Swendsen, R. H. and Wang, J.-S. (1987) Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58.CrossRefGoogle Scholar
Switzer, P. (1986) Statistical image processing. In Quantitative Analysis of Mineral and Energy Resources, ed. Chung, C., Fabbri, A., and Sinding-Larsen, R., pp. 271–282. Reidel, Dordrecht.Google Scholar
Tan, H. L., Gelfand, S. B. and Delp, E. J. (1991) A cost minimization approach to edge detection using simulated annealing. IEEE Trans. Pattern Anal. Machine Intell. 14, 3–18.CrossRefGoogle Scholar