Advertisement

Volterra Filtering of Noisy Images of Curves

  • Jonas August
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2352)

Abstract

How should one filter very noisy images of curves? While blurring with a Gaussian reduces noise, it also reduces contour contrast. Both non-homogeneous and anisotropic diffusion smooth images while preserving contours, but these methods assume a single local orientation and therefore they can merge or distort nearby or crossing contours. To avoid these difficulties, we view curve enhancement as a statistical estimation problem in the three-dimensional (x, y, θ)-space of positions and directions, where our prior is a probabilistic model of an ideal edge/line map known as the curve indicator random field (cirf). Technically, this random field is a superposition of local times of Markov processes that model the individual curves; intuitively, it is an idealized artist’s sketch, where the value of the field is the amount of ink deposited by the artist’s pen. After reviewing the cirf framework and our earlier formulas for the CIRF cumulants, we compute the minimum mean squared error (mmse) estimate of the cirf embedded in large amounts of Gaussian white noise. The derivation involves a perturbation expansion in an infinite noise limit, and results in linear, quadratic, and cubic (Volterra) cirf filters for enhancing images of contours. The self-avoidingness of smooth curves in (x, y, θ) simplified our analysis and the resulting algorithms, which run in O(n log n) time, where n is the size of the input. This suggests that the Gestalt principle of good continuation may not only express the likely smoothness of contours, but it may have a computational basis as well.

Keywords

Markov Process Noisy Image Direction Process Illusory Contour Good Continuation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    P. Alper. A consideration of discrete volterra series. IEEE Transactions on Automatic Control, 10:322–327, 1965.CrossRefGoogle Scholar
  2. 2.
    J. August. The Curve Indicator Random Field. PhD thesis, Yale University, 2001.Google Scholar
  3. 3.
    J. August and S. W. Zucker. A markov process using curvature for filtering curve images. In Energy Minimization Methods for Computer Vision and Pattern Recognition, 2001.Google Scholar
  4. 4.
    J. Canny. A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8:679–698, 1986.Google Scholar
  5. 5.
    G. Casella and R. L. Berger. Statistical Inference. Duxbury, Belmont, CA, 1990.zbMATHGoogle Scholar
  6. 6.
    D. Geman and B. Jedynak. An active testing model for tracking roads in satellite images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(1):1–14, 1996.CrossRefGoogle Scholar
  7. 7.
    S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721–741, 1984.zbMATHCrossRefGoogle Scholar
  8. 8.
    E. R. Hancock and J. Kittler. Edge-labeling using dictionary-based relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(2):165–181, 1990.CrossRefGoogle Scholar
  9. 9.
    B. K. P. Horn. The Curve of Least Energy. ACM Transactions on Mathematical Software, 9:441–460, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    L. A. Iverson. Toward Discrete Geometric Models for Early Vision. PhD thesis, McGill University, Montreal, 1994.Google Scholar
  11. 11.
    S. N. Kalitzin, B. M. ter Haar Romeny, and M. A. Viergever. Invertible orientation bundles on 2d scalar images. In Proc. Scale-Space’ 97, LICS, pages 77–88. Springer, 1997.Google Scholar
  12. 12.
    J. J. Koenderink. The structure of images. Biological Cybernetics, 50:363–370, 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    M. Lindenbaum and A. Berengolts. A probabilistic interpretation of the saliency network. In European Conf. on Computer Vision, 2000.Google Scholar
  14. 14.
    J. L. Marroquin. A markovian random field of piecewise straight lines. Biological Cybernetics, 61:457–465, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    P. McCullagh. Tensor Methods in Statistics. Monographs in Statistics and Applied Probability. Chapman and Hall, Cambridge, England, 1987.zbMATHGoogle Scholar
  16. 16.
    D. Mumford. Algebraic Geometry and Its Applications, chapter Elastica and Computer Vision, pages 491–506. Springer-Verlag, 1994.Google Scholar
  17. 17.
    L. Nikias and A. P. Petropulu. Higher-Order Spectra Analysis: A Nonlinear Signal Processing Framework. Prentice Hall, Englewood Cliffs, NJ, 1993.zbMATHGoogle Scholar
  18. 18.
    P. Parent and S. W. Zucker. Trace inference, curvature consistency, and curve detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(8):823–839, August 1989.Google Scholar
  19. 19.
    P. Perona and J. Malik. Scale-space and edge detection using anisotropic diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(7):629–39, jul 1990.Google Scholar
  20. 20.
    B. Picinbono and Y. Gu. Mean square estimation and projections. Signal Processing, 19:1–8, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    A. Rosenfeld, R. A. Hummel, and S. W. Zucker. Scene labeling by relaxation operations. IEEE Transactions on Systems, Man, and Cybernetics, 6(6):420–433, 1976.zbMATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    D. L. Ruderman. Natural Ensembles and Sensory Signal Processing. PhD thesis, U. C. Berkelely, 1993.Google Scholar
  23. 23.
    M. Schetzen. The Volterra and Wiener Theories of Nonlinear Systems. Wiley, New York, 1980.zbMATHGoogle Scholar
  24. 24.
    A. Sha’ashua and S. Ullman. Structural saliency: The detection of globally salient structures using a locally connected network. In Proceedings, Second International Conference on Computer Vision, 1988.Google Scholar
  25. 25.
    K. Thornber and L. Williams. Analytic solution of stochastic completion fields. Biological Cybernetics, 75:141–151, 1996.zbMATHCrossRefGoogle Scholar
  26. 26.
    J. Weickert. Anisotropic diffusion in image processing. ECMI. Teubner, Stuttgart, 1998.zbMATHGoogle Scholar
  27. 27.
    L. Williams and D. Jacobs. Stochastic completion fields: A neural model of illusory contour shape and salience. Neural Computation, 9(4):837–858, 1997.CrossRefGoogle Scholar
  28. 28.
    S. W. Zucker, R. Hummel, and A. Rosenfeld. An application of relaxation labelling to line and curve enhancement. IEEE Trans. Computers, C-26:393–403, 922–929, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jonas August
    • 1
  1. 1.Robotics InstituteCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations