Image Denoising by Statistical Area Thresholding

  • D. Coupier
  • A. Desolneux
  • B. Ycart


Area openings and closings are morphological filters which efficiently suppress impulse noise from an image, by removing small connected components of level sets. The problem of an objective choice of threshold for the area remains open. Here, a mathematical model for random images will be considered. Under this model, a Poisson approximation for the probability of appearance of any local pattern can be computed. In particular, the probability of observing a component with size larger than k in pure impulse noise has an explicit form. This permits the definition of a statistical test on the significance of connected components, thus providing an explicit formula for the area threshold of the denoising filter, as a function of the impulse noise probability parameter. Finally, using threshold decomposition, a denoising algorithm for grey level images is proposed.


image denoising mathematical morphology area opening and closing random image threshold function Poisson approximation lattice animals 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Bollobás,Random Graphs, Academic Press: London, 1985.Google Scholar
  2. 2.
    A.R. Conway and A.J. Guttmann, “On two-dimensional percolation”J. Phys. A: Math. Gen., Vol. 28, pp. 891–904, 1995.Google Scholar
  3. 3.
    D. Coupier, A. Desolneux, and B. Ycart, A zero-one law for first-order logic on random images, inProceedings Math-Info’04, Drmota et al. (Ed.), to appear 2004.Google Scholar
  4. 4.
    A. Desolneux, L. Moisan, and J.-M. Morel, “Meaningful alignments”Int. J. Computer Vision, Vol. 40, No. 1, pp. 7–23, 2000.Google Scholar
  5. 5.
    A. Desolneux, L. Moisan, and J.-M. Morel, “Edge detection by Helmholtz principle”Journal of Mathematical Imaging and Vision, Vol. 14, No. 3, pp. 271–284, 2001.Google Scholar
  6. 6.
    D.L. Donoho and I.M. Johnstone, “Adapting to unknown smoothness via wavelet shrinkage”Journal of Amer. Stat. Assoc., Vol. 90, pp. 1200–1224, 1995.Google Scholar
  7. 7.
    H.J.A.M. Heijmans, “Self-dual morphological operators and filters”Journal of Mathematical Imaging and Vision, Vol. 6, No. 1, pp. 15–36, 1996.Google Scholar
  8. 8.
    H.J.A.M. Heijmans, “Connected morphological operators for binary images”Computer Vision and Image Understanding, Vol. 73, No. 1, pp. 99–120, 1999.Google Scholar
  9. 9.
    I. Jensen and A.J. Guttmann, “Statistics of lattice animals (polyominoes) and polygons”J. Phys. A: Math. Gen., Vol. 33, pp. L257–L263, 2000.Google Scholar
  10. 10.
    D.A. Klarner, “Cell growth problems”Canad. J. Math., Vol. 19, pp. 851–863, 1967.Google Scholar
  11. 11.
    D.A. Klarner and R.L. Rivest, “A procedure for improving the upper bound for the number ofn-ominoes”Canad. J. Math., Vol. 25, pp. 585–602, 1973.Google Scholar
  12. 12.
    S. Masnou and J.-M. Morel, “Image restoration involving connectedness” inProc. DIP’97, Vienna, Austria, Vol. 3346. SPIE, 1998.Google Scholar
  13. 13.
    P. Monasse, “Contrast invariant representation of digital images and application to registration” PhD thesis, University Paris 9, 2000.Google Scholar
  14. 14.
    P. Monasse and F. Guichard, “Fast computation of a contrast invariant image representation”IEEE Transactions on Image Processing, Vol. 9, No. 5, pp. 860–872, 2000.Google Scholar
  15. 15.
    B. Sapoval and M. Rosso, “Gradient percolation and fractal frontiers in image processing”Fractals, Vol. 3, pp. 23–31, 1995.Google Scholar
  16. 16.
    J. Serra,Image Analysis and Mathematical Morphology, Part. I, Academic Press: New York, 1982.Google Scholar
  17. 17.
    J. Serra,Image Analysis and Mathematical Morphology, Part. II: Theoretical Advances, Academic Press: London, 1988.Google Scholar
  18. 18.
    J. Serra and L. Vincent, “An overview of morphological filtering”Circuits, Systems and Signal Processing, Vol. 11, No. 1, pp. 47–108, 1992.Google Scholar
  19. 19.
    J. Spencer, “Nine lectures on random graphs” inEcole d’été de probabilité de Saint-Flour XXI, P. Bernard (Ed.), Vol. 1541 ofL.N. in Mathematics, Springer-Verlag, New York, 1991, pp. 293–343.Google Scholar
  20. 20.
    L. Vincent, “Morphological area opening and closing for grayscale images” inProc. NATO Shape in Picture Workshop, Driebergen, Springer-Verlag: The Netherlands, 1992, pp. 197–208.Google Scholar
  21. 21.
    L. Vincent, “Grayscale area openings and closings: Their applications and efficient implementation” inProc. EURASIP Workshop on Mathematical Morphology and its Applications to Signal Processing, Barcelona, Spain, 1993, pp. 22–27.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.MAP5, UMR CNRS 8145Université René DescartesParis

Personalised recommendations