Abstract
A new formulation of the image partitioning problem is presented: construct a complete and stable description of an image-in terms of a specified descriptive language-that is simplest in the sense of being shortest. We show that a descriptive language limited to a low-order polynomial description of the intensity variation within each region and a chain-code-like description of the region boundaries yields intuitively satisfying partitions for a wide class of images.
The advantage of this formulation is that it can be extended to deal with subsequent steps of the image understanding problem (or to deal with other attributes, such as texture) in a natural way by augmenting the descriptive language. Experiments performed on a variety of both real and synthetic images demonstrate the superior performance of this approach over partitioning techniques based on clustering vectors of local image attributes and standard edge-detection techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.J. Besl and R.C. Jain, “Segmentation through variable-order surface fitting”, IEEE Trans. PAMI 10(2):167–192, 1988.
T.O. Binford, “Inferring surfaces from images”, Artificial Intelligence, 17(1–3):205–244, 1981.
A. Blake, “Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction”, IEEE Trans. PAMI 11(1):2–12.
A. Blake and A. Zisserman, Visual Reconstruction, MIT Press: Cambridge, MA, 1987.
J.F. Canny, “A computational approach to edge detection”, IEEE Trans. PAMI 8(6):679–698, 1986.
G. Dahlquist and A. Björck, Numerical Methods, N. Anderson (trans.), Prentice-Hall: Englewood Cliffs, NJ, 1974.
P. Fua and A.J. Hanson, “Generic feature extraction using probability-based objective functions”, submitted to Machine Vision and Applications, 1988.
S. Geman and D. Geman, “Stochastic relaxation, gibbs distributions, and the bayesian restoration of images”, IEEE Trans. PAMI 6(6): 721–741, 1984.
M.P. Georgeoff and C.S. Wallace, “A general selection criterion for inductive inference”, SRI Tech. Note 372, SRI International, Menlo Park, CA, 1985.
W.E.L. Grimson and T. Pavlidis, “Discontinuity detection for visual surface reconstruction”, Computer Vision, Graphics, and Image Processing 30:316–330, 1985.
R.M. Haralick, “Digital step edges from zero crossings of second directional derivatives”, IEEE Trans. PAMI 6(1): 58–68, 1984.
D.J. Langridge, “Detection of discontinuities in the first derivatives of surfaces”, Computer Vision, Graphics, and Image Processing 27:291–308, 1984.
K.I. Laws, “Textured Image Segmentation”, Ph.D. Thesis, Report USCIPI 940, Image Processing Institute, U. Southern California, Los Angelos, CA, 1980.
Y.G. Leclerc, “Capturing the local structure of image discontinuities in two dimensions”, Proc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, San Francisco, CA, pp. 34–38, June, 1985.
Y.G. Leclerc, “The Local Structure of Image Intensity Discontinuities”, Ph. D. dissertation, McGill University, Montréal, Québec, Canada, in preparation.
Y.G. Leclerc and S.W. Zucker, “The local structure of image discontinuities in one dimension”, IEEE Trans. PAMI 9(3):341–355, 1987.
D. Lee and T. Pavlidis, “One-dimensional regularization with discontinuities”, Proc. 1st Intern. Conf. Computer Vision, London, pp. 572–577, 1987.
D.G. Luenberger, “Linear and Nonlinear Programming, (2nd ed.), Addison-Wesley: Menlo Park, CA, 1984.
J. Marroquin, S. Mitter and T. Poggio, “Probabilistic solution of ill-posed problems in computational vision”, J. Am. Stat. Assoc. 82(397):76–89, 1987.
D. Mumford and J. Shah, “Boundary detection by minimizing functionals, I,” Proc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, San Francisco, CA, pp. 22–26, 1985.
R. Ohlander, K. Price and D.R. Reddy, “Picture segmentation using a recursive region splitting method”, Computer Graphics and Image Processing 8(3):313–333, 1978.
T. Poggio, V. Torre, and C. Koch, “Computational vision and regularization theory”, Nature, vol. 317, 1985.
J. Rissanen, “A universal prior for integers and estimation by minimum description length”, Annals of Statistics 11(2):416–431, 1983.
J. Rissanen, “Minimum-description-length principle”. In Encyclopedia of Statistical Sciences, vol. 5, Wiley: New York pp. 523–527, 1987.
P. Saint-Marc and G. Medioni, “Adaptive smoothing for feature extraction”, Proc. DARPA Image Understanding Workshop, Cambridge, MA, pp. 1100–1113, 1988.
D. Terzopoulos, “Regularization of inverse visual problems involving discontinuities”, IEEE Trans. PAMI 8(4): 413–424, 1986.
A.W. Witkin, “Scale space filtering”, Proc. 8th Intern. Joint Conf. Artif. Intell., Karlsruhe, West Germany, pp. 1019–1021, 1983.
A.W. Witkin, D. Terzopoulos and M. Kass, “Signal matching through scale space”, Intern. J. Computer Vision 1(2):133–144, 1987.
Author information
Authors and Affiliations
Additional information
Support for this work was provided by the Defense Advanced Research Projects Agency under contract MDA903-86-C-0084.
Rights and permissions
About this article
Cite this article
Leclerc, Y.G. Constructing simple stable descriptions for image partitioning. Int J Comput Vision 3, 73–102 (1989). https://doi.org/10.1007/BF00054839
Issue Date:
DOI: https://doi.org/10.1007/BF00054839