Smooth curve extraction by mean field annealing

  • Laurent Hérault
  • Radu Horaud
Article
  • 29 Downloads

Abstract

In this paper, we attack the figure — ground discrimination problem from a combinatorial optimization perspective. In general, the solutions proposed in the past solved this problem only partially: either the mathematical model encoding the figure — ground problem was too simple or the optimization methods that were used were not efficient enough or they could not guarantee to find the global minimum of the cost function describing the figure — ground model. The method that we devised and which is described in this paper is tailored around the following contributions. First, we suggest a mathematical model encoding the figure — ground discrimination problem that makes explicit a definition of shape (or figure) based on cocircularity, smoothness, proximity, and contrast. This model consists of building a cost function on the basis of image element interactions. Moreover, this cost function fits the constraints of aninteracting spin system, which in turn is a well suited physical model to solve hard combinatorial optimization problems. Second, we suggest a combinatorial optimization method for solving the figure — ground problem, namely mean field annealing which combines the mean field approximation and annealing. Mean field annealing may well be viewed as a deterministic approximation of stochastic methods such as simulated annealing. We describe in detail the theoretical bases of this method, derive a computational model, and provide a practical algorithm. Finally, some experimental results are shown for both synthetic and real images.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Brady and H. Asada, Smoothed local symmetries and their implementation, Int. J. Robotics Res. 3(3)(1984)36–61.Google Scholar
  2. [2]
    J. Canny, A computational approach to edge detection, IEEE Trans. Pattern Anal. Machine Intellig. PAMI 8(1986)679–698.Google Scholar
  3. [3]
    P. Carnevali, L. Coletti and S. Patarnello, Image processing by simulated annealing, IBM J. Res. Develop. 29(1985)569–579.Google Scholar
  4. [4]
    R. Deriche, Using Canny's criteria to derive a recursively implemented optimal edge detector, Int. J. Comp. Vision 1(1987)167–187.Google Scholar
  5. [5]
    D. Geiger and F. Girosi, Parallel and deterministic algorithms from mrf's: Surface reconstruction, IEEE Trans. Pattern Anal. Machine Intellig. 13(1991)410–412.Google Scholar
  6. [6]
    D. Geiger and A. Yuille, A common framework for image segmentation, Int. J. Comp. Vision 6(1991)227–243.Google Scholar
  7. [7]
    D. Gutfinger and J. Sklansky, Robust classifiers by mixed adaptation, IEEE Trans. Pattern Anal. Machine Intellig. PAMI 13(1991)552–567.Google Scholar
  8. [8]
    L. Hérault and R. Horaud, Figure — ground discriminations: A combinatorial optimization approach, IEEE Trans. Pattern Anal. Machine Intellig. 15(1993)899–914.Google Scholar
  9. [9]
    L. Hérault and J.J. Niez, Neural networks and graph K-partitioning, Complex Syst. 3(1989)531–576.Google Scholar
  10. [10]
    L. Hérault and J.J. Niez, Neural networks and combinatorial optimisation: A study of NP-complete graph problems, in:Neural Networks: Advances and Applications, eds. E. Gelembe (North-Holland, 1991) pp. 165–213.Google Scholar
  11. [11]
    M. Kass, A. Witkin and D. Terzopoulos, Snakes: Active contour models, Int. J. Comp. Vision 1(1988)321–331.Google Scholar
  12. [12]
    W. Kohler,Gestalt Psychology (Meridian, New York, 1980).Google Scholar
  13. [13]
    H. Orland, Mean field theory for optimization problems, J. de Phys. Lett. 46(1985) L-763–L-770.Google Scholar
  14. [14]
    P. Parent and S.W. Zucker, Trace inference, curvature consistency, and curve detection, IEEE Trans. Pattern Anal. Machine Intellig. 11(1989)823–839.Google Scholar
  15. [15]
    C. Peterson, A new method for mapping optimization problems onto neural networks, Int. J. Neural Syst. 1(1989)3–22.Google Scholar
  16. [16]
    C. Peterson, Track finding with neural networks, Nucl. Instr. Meth. A279(1989)537–545.Google Scholar
  17. [17]
    T.J. Sejnowski and G.E. Hinton, Separating figure from ground with a Boltzmann machine, in:Vision, Brain, and Cooperative Computation, eds. M. Arbib and A. Hanson (MIT Press, 1988) pp. 703–724.Google Scholar
  18. [18]
    A. Sha'ashua and S. Ullman, Structural saliency: The detection of globally salient structures using a locally connected network,Proc. IEEE Int. Conf. on Computer Vision, Tampa, FL, 1988, pp. 321–327.Google Scholar
  19. [19]
    H.E. Stanley,Introduction to Phases Transitions and Critical Phenomena (Oxford University Press, 1971).Google Scholar
  20. [20]
    D.E. van den Bout and T.K. Miller, Graph partitioning using annealed neural networks,Int. Joint Conf. on Neural Networks, Washington D.C., 1989, pp. 521–528.Google Scholar
  21. [21]
    J. Zerubia and R. Chellappa, Mean field approximation using a compound Gauss — Markov random field for edge detection and image restoration,Proc. ICASSP, Alburquerque, NM, 1990, pp. 2193–2196.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Laurent Hérault
    • 1
  • Radu Horaud
    • 2
  1. 1.LETI (CEA-Technolgies Avancées), Département SystèmesCENGGrenobleFrance
  2. 2.LIFIA-IMAGGrenobeFrance

Personalised recommendations