Hostname: page-component-77f85d65b8-9nbrm Total loading time: 0 Render date: 2026-04-17T16:17:59.291Z Has data issue: false hasContentIssue false
  • English
  • Français

Inference on binary images from binary data

Part of: Inference from stochastic processes Geometric probability and stochastic geometry

Published online by Cambridge University Press:  01 July 2016

C. A. Glasbey
C. A. Glasbey*
Affiliation:
University of Edinburgh
*
∗ Postal address: Biomathematics and Statistics Scotland, The University of Edinburgh, James Clerk Maxwell Building, King's Buildings, Edinburgh, EH9 3JZ, UK.
Get access Rights & Permissions [Opens in a new window]

Abstract

The problem addressed is to reverse the degradation which occurs when images are digitised: they are blurred, subjected to noise and rounding error, and sampled only at a lattice of points. Inference is considered for the fundamental case of binary scenes, binary data and isotropic blur. The inferential process is separable into two stages: first from the lattice points to a binary image in continuous space and then the reversal of thresholding and blur. Methods are motivated by, and illustrated using, an electron micrograph of an immunogold-labelled section of tulip virus.

Keywords

DISCDECONVOLUTIONELECTRON MICROGRAPHIMMUNOGOLD LABELLATTICEPIXEL

MSC classification

Primary: 60D05: Geometric probability and stochastic geometry
Secondary: 62M30: Spatial processes

Information

Type
Stochastic Geometry and Statistical Applications
Information
Advances in Applied Probability , Volume 28 , Issue 3 , September 1996 , pp. 627 - 640
Copyright
Copyright © Applied Probability Trust 1996 

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.)

Article purchase

Temporarily unavailable

References

Ambartzumian, R. V. (1981) Combinatorial Integral Geometry: with Applications to Mathematical Stereology . Wiley, Chichester.Google Scholar
Aykroyd, R. G. and Green, P. J. (1991) Global and local priors, and the location of lesions using gamma-camera imagery. Phil. Trans. R. Soc. A 337, 323–342.Google Scholar
Bleher, P. M., Cheng, Z. M., Dyson, F. J. and Lebowitz, J. L. (1993) Distribution of the error term for the number of lattice points inside a shifted circle. Commun. Math. Phys. 154, 433–469.Google Scholar
Boult, T. E. and Wolberg, G. (1993) Local image-reconstruction and subpixel restoration algorithms. CVGIP: Graph. Models Image Processing 55, 63–77.Google Scholar
Bruckstein, A. M. (1987) On optimal image digitization. IEEE Trans. Acoustics, Speech Signal Processing 35, 553–555.Google Scholar
Davies, E. R. (1990) Machine Vision. Academic Press, New York.Google Scholar
Dorst, L. and Duin, R. P. W. (1984) Spirograph theory: a framework for calculations of digitized straight lines. IEEE Trans on Pattern Anal. Machine Intelligence 6, 632–639.CrossRefGoogle ScholarPubMed
Fu, C. C., Yang, T. S. and Stone, D. R. (1991) Enhancement of lithographic patterns by using serif features. IEEE Trans. Electron Devices 38, 2599–2603.CrossRefGoogle Scholar
Gilliland, D. C. (1962) Integral of the bivariate normal distribution over an offset circle. J. Amer. Statist. Assoc. 57, 758–768.CrossRefGoogle Scholar
Grenander, U. (1976) Pattern Synthesis: Lectures in Pattern Theory , Vol. 1. Springer, New York.Google Scholar
Havelock, D. I. (1989) Geometric precision in noise-free digital images. IEEE Trans. Pattern Anal. Machine Intelligence 11, 1065–1075.CrossRefGoogle Scholar
Havelock, D. I. (1991) The topology of locales and its effects on position uncertainty. IEEE Trans. Pattern Anal. Machine Intelligence 13, 380–386.CrossRefGoogle Scholar
Hitchcock, D. and Glasbey, C. A. (1995) Binary image restoration at sub-pixel resolution from multi-level data. BioSS internal report. .Google Scholar
Holgate, P. (1990) Lattice points in a random parallelogram. Adv. Appl. Prob. 22, 484–485.Google Scholar
Jennison, C. and Jubb, M. (1991) Aggregation and refinement in binary image restoration. Spatial Statistics and Imaging (IMS Lecture Notes). Hayward . pp. 150–162.Google Scholar
Kendall, D. G. (1948) On the number of lattice points inside a random oval. Quart. J. Math. 19, 1–26.CrossRefGoogle Scholar
Kendall, D. G. and Moran, P. A. P. (1962) Geometrical Probability. Griffin, London.Google Scholar
Kiryati, N. and Bruckstein, A. M. (1991) Gray levels can improve the performance of binary image digitizers. CVGIP: Graph. Models Image Processing 53, 31–39.Google Scholar
Koplowitz, J. and Raj, A. P. S. (1987) A robust filtering algorithm for subpixel reconstruction of chain coded line drawings. IEEE Trans. Pattern Anal. Machine Intelligence 9, 451–457.Google Scholar
Korostelev, A. P. and Tsybakov, A. B. (1993) Minimax Theory of Image Reconstruction. Springer, New York.CrossRefGoogle Scholar
Nakamura, A. and Aizawa, K. (1984) Digital circles. Comput. Vision, Graph. Image Processing 26, 242–255.Google Scholar
Nielsen, L., Astrom, K. J. and Jury, E. I. (1984) Optimal digitization of 2-D images. IEEE Trans. Acoustics, Speech Signal Processing 32, 1247–1249.Google Scholar
Patel, J. K. and Read, C. B. (1982) Handbook of the Normal Distribution. Marcel Dekker, New York.Google Scholar
Pavlidis, T. (1981) Algorithms for Graphics and Image Processing. Computer Science Press, Rockville, MD.Google Scholar
Ripley, B. D. (1991) The use of spatial models as image priors. Spatial Statistics and Imaging (IMS Lecture Notes). Hayward. pp. 309–340.Google Scholar
Roberts, I. M. (1994) Factors affecting the efficiency of immunogold labelling of plant virus antigens in thin sections. J. Virological Meth. 50, 155–166.Google Scholar
Rosenfeld, A. and Kak, A. C. (1982) Digital Picture Processing. 2nd edn. Academic Press, San Diego.Google Scholar
Rudemo, M. and Stryhn, H. (1994) Approximating the distribution of maximum likelihood contour estimators in two-region images. Scand. J. Statist. 21, 44–55.Google Scholar
Saleh, B. E. A. (1987) Image synthesis: discovery instead of recovery. In Image Recovery: Theory and Application. ed. Stark, H.. Academic Press, Orlando. pp. 463–498.Google Scholar
Serra, J. (1982) Image Analysis and Mathematical Morphology . Academic Press, London.Google Scholar
Serra, J. (1988) Image Analysis and Mathematical Morphology. Vol. 2: Theoretical Advances. Academic Press, London.Google Scholar
Solomon, H. (1978) Geometric Probability. SIAM, Philadelphia.Google Scholar
Sriraman, R., Koplowitz, J. and Mohan, S. (1989) Tree searched chain coding for subpixel reconstruction of planar curves. IEEE Trans. Pattern Anal. Machine Intelligence 11, 95–103.Google Scholar