Figure-Ground Discrimination: A Combinatorial Optimization Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 15, Issue 9, 1993, Pages 899-914

  Herault, Laurent ^a   Horaud, Radu ^b  

^a CEA LETI   (France)

^b LIFIA CNRS INRIA   (France)

Author keywords

Feature grouping; figure ground discrimination; low level vision; mean field annealing; microcanonical annealing; recursive neural networks; simulated annealing; stochastic optimization theory; thresholding

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTER VISION; IMAGE CODING; MATHEMATICAL MODELS; NEURAL NETWORKS; OPTIMIZATION; PATTERN RECOGNITION; RECURSIVE FUNCTIONS; STATISTICAL METHODS;

FEATURE GROUPING; FINITE GROUND DISCRIMINATION; LOW LEVEL VISION; MEAN FIELD ANNEALING; MICROCANONICAL ANNEALING; SIMULATED ANNEALING; THRESHOLDING;

IMAGE PROCESSING;

EID: 0027656539     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.232076     Document Type: Article

References (29)

1. S. T. Barnard, “Stochastic stereo matching over scale,” Int. J. Comput. Vision, vol. 3, no. 1, pp. 17–32, May 1989.
2. A. Blake, “Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction,” IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 1, pp. 2–12, Jan. 1989.
3. A. Blake and A. Zisserman. Visual Reconstruction. Cambridge, MA: MIT Press, 1987.
4. M. Brady and H. Asada, “Smoothed local symmetries and their implementation,” Int. J. Robotics Res., vol. 3, no. 3, pp. 36–61, 1984.
5. J. Canny, “A computational approach to edge detection,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-8, no. 6, pp. 679–698, Nov. 1986.
6. P. Camevali, L. Coletti, and S. Patamello, “Image processing by simulated annealing,” IBM J. Res. Development, vol. 29, no. 6, pp 569–579, Nov. 1985.
7. M. Creutz, “Microcanonical Monte carlo simulation,” Phys. Rev. Lett., vol. 50, no. 19, pp. 1411–1414, May 1983.
8. R. Deriche, “Using Canny’s criteria to derive a recursively implemented optimal edge detector,” Int. J. Comput. Vision, vol. 1, no. 2, pp. 167–187, 1987.
9. D. Geiger and F. Girosi, “Parallel and deterministic algorithms from mrf’s: Surface reconstruction,” IEEE Trans. Patt. Anal. Machine Intell, vol. 13, no. 5, pp. 410–412, May 1991.
10. D. Geiger and A. Yuille, “A common framework for image segmentation,” Int. J. Comput. Vision, vol. 6, no. 3, pp. 227–243, 1991.
11. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and bayesian restorarion of images,” IEEE Trans. Patt. Anal. Machine Intell, vol. PAMI-6, pp. 721–741, 1984.
12. D. Gutfinger and J. Sklansky, “Robust classifiers by mixed adaptation,” IEEE Trans. Patt. Anal. Machine Intell., vol. 13, no. 6, pp. 552–567, June 1991.
13. L. Herault and J. J. Niez, “Neural networks and graph K-partitioning,” Complex Syst., vol. 3, no. 6, pp. 531–576, Dec. 1989.
14. L. Herault and J. J. Niez, “Neural networks and combinatorial optimization: A study of NP-complete graph problems,” in Neural Networks: Advances and Applications (E. Gelembe, Ed.). Amsterdam: North Holland, 1991, pp. 165–213.
15. M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active contour models,” Int. J. Comput. Vision, vol. 1, no. 4, pp. 321–331, Jan. 1988.
16. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Sci., vol. 220, pp. 671–680, 1983.
17. W. Kohler, Gestalt Psychology. New York: Meridian, 1980.
18. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equations of state calculations by fast computing machines,” J. Chem. Phys., vol. 21, pp. 1087–1092, 1953.
19. H. Orland, “Mean field theory for optimization problems,” J. Phys.—Lett., vol. 46, no. 17, pp. L-763-L-770, Sept. 1985.
20. P. Parent and S. W. Zucker, “Trace inference, curvature consistency, and curve detection,” IEEE Trans. Patt. Anal. Machine Intell, vol. 11, no. 8, pp. 823–839, Aug. 1989.
21. C. Peterson, “A new method for mapping optimization problems onto neural networks,” Int. J. Neural Syst., vol. 1, no. 1, pp. 3–22, 1989.
22. C. Peterson, “Track finding with neural networks,” Nuclear Instrum. Methods Phys. Res., vol. A279, pp. 537–545, 1989.
23. C. Peterson and J. R. Anderson, “A mean field learning algorithm for neural networks,” Complex Syst., vol. 1, pp. 995–1019, 1987.
24. F. Reif, Fundamental of Statistical and Thermal Physics. New York: McGraw-Hill, 1965.
25. T. J. Sejnowski and G. E. Hinton, “Separating figure from ground with a Boltzmann machine,” in Vision, Brain, and Cooperative Computation (M. Arbib and A. Hanson, Eds.). Cambridge, MA: MIT Press, 1988, pp. 703–724.
26. A. Sha’ashua and S. Ullman, “Structural saiiency: The detection of globally salient structures using a locally connected network,” in Proc. IEEE Int. Conf Comput. Vision (Tampa, FL), Dec. 1988, pp. 321–327.
27. H. E. Stanley, Introduction to Phases Transitions and Critical Phenomena. Oxford, UK: Oxford University Press, 1971.
28. D. E. Van den Bout and T. K. Miller, “Graph partitioning using annealed neural networks,” in Proc. Int. Joint Conf. Neural Networks (Washington DC), June 1989, pp. 521–528.
29. J. Zerubia and R. Chellappa, “Mean field approximation using compound Gauss-Markov random field for edge detection and image restoration,” io Proc. ICASSP (Alburquerque, NM), 1990, pp. 2193–2196, Apr. 1990.