This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Discontinuity-Adaptive Smoothness Priors in Computer Vision
June 1995 (vol. 17 no. 6)
pp. 576-586
ASCII Text
x 
 
S.z. Li, "On Discontinuity-Adaptive Smoothness Priors in Computer Vision," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 576-586, June, 1995.
 
 
BibTex
x
 
@article{ 10.1109/34.387504,
author = {S.z. Li},
title = {On Discontinuity-Adaptive Smoothness Priors in Computer Vision},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {17},
number = {6},
issn = {0162-8828},
year = {1995},
pages = {576-586},
doi = {http://doi.ieeecomputersociety.org/10.1109/34.387504},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - On Discontinuity-Adaptive Smoothness Priors in Computer Vision
IS - 6
SN - 0162-8828
SP576
EP586
EPD - 576-586
A1 - S.z. Li,
PY - 1995
KW - Discontinuities
KW - energy functions
KW - Euler equation
KW - computer vision
KW - Markov random fields
KW - minimization
KW - regularization.
VL - 17
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

Abstract—A variety of analytic and probabilistic models in connection to Markov random fields (MRFs) have been proposed in the last decade for solving low level vision problems involving discontinuities. This paper presents a systematic study of these models and defines a general discontinuity adaptive (DA) MRF model. By analyzing the Euler equation associated with the energy minimization, it shows that the fundamental difference between different models lies in the behavior of interaction between neighboring points, which is determined by the a priori smoothness constraint encoded into the energy function. An important necessary condition is derived for the interaction to be adaptive to discontinuities to avoid oversmoothing. This forms the basis on which a class of adaptive interaction functions (AIFs) is defined. The DA model is defined in terms of the Euler equation constrained by this class of AIFs. Its solution is C1 continuous and allows arbitrarily large but bounded slopes in dealing with discontinuities. Because of the continuous nature, it is stable to changes in parameters and data, a good property for regularizing ill-posed problems. Experimental results are shown.

[1] S. Geman and D. Geman,“Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, Nov. 1984.
[2] H. Elliott, H. Derin,R. Cristi,, and D. Geman,“Application of the Gibbs distribution to image segmentation,” Proc. Int’l Conf. Acoustic, Speech, and Signal Processing, pp. 32.5.1-32.5.4,San Diego, Calif., Mar. 1984.
[3] J.L. Marroquin,“Probabilistic solution of inverse problems,” PhD thesis, MIT AI Lab, 1985.
[4] T. Poggio, V. Torre, and C. Koch, “Computational Vision and Regularization Theory,” Nature, vol. 317, pp. 314-319, 1985.
[5] A. Blake,“The least disturbance principle and weak constraints,” Pattern Recognition Letters, vol. 1, pp. 393-399, 1983.
[6] D.T. Terzopoulos,“The role of constraints and discontinuities in visible surface reconstruction,” Proc. Eighth Int’l Joint Conf. AI, pp. 1,073-1,077,Karlsruhe, W. Germany, 1983.
[7] W.E.L. Grimson and T. Pavlidis,“Discontinuity detection for visual surface reconstruction,” Computer Vision, Graphics, and Image Processing, vol. 30, pp. 316-330, 1985.
[8] D. Mumford and J. Shah,“Boundary detection by minimizing functionals: I,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 22-26,San Francisco, Calif., June 1985.
[9] D. Terzopoulos, "Regularization of Inverse Visual Problems Involving Discontinuities," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 4, pp. 413-424, 1986.
[10] A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.
[11] D. Lee and T. Pavlidis,“One dimensional regularization with discontinuities,” Proc. First Int’l Conf. Computer Vision, pp. 572-577,London, England, 1987.
[12] C. Koch,“Computing motion in the presence of discontinuities: Algorithm and analog networks,” Neural Computers, R. Eckmiller and Ch.c.d. Malsburg, ed., vol. F41, NATO ASI Series, pp. 101-110, Springer-Verlag, 1988.
[13] Y.G. Leclerc,“Constructing simple stable descriptions for image partitioning,” Int’l J. Computer Vision, vol. 3, pp. 73-102, 1989.
[14] D. Shulman and J.Y. Herve, "Regularization of Discontinuous Flow Fields," Proc. Workshop Visual Motion, pp. 81-86, 1989.
[15] S. Z. Li,“Reconstruction without discontinuities,” Proc. Third Int’l Conf. Computer Vision, pp. 709-712,Osaka, Japan, Dec. 1990.
[16] N. Nordstrom,“Biased anisotropic diffusion—a unified regularization and diffusion approach to edge detection,” Proc. European Conf. Computer Vision, pp. 18-27, 1990.
[17] D. Geiger and F. Girosi,“Parallel and deterministic algorithms from MRFs: Surface reconstruction,” IEEE Transactions on PAMI, vol. 13, no. 5, pp. 401-412, May 1991.
[18] S. Z. Li,“Towards 3D vision from range images: An optimization framework and parallel distributed networks,” PhD thesis, Univ. of Surrey, Guilford, Surrey, UK, July 1991.
[19] C. Koch,J. Marroquin,, and A. Yuille,“Analog’neuronal’networks in early vision,” Proc. Nat’l Academic Science, USA, vol. 83, pp. 4,263-4,267, 1986.
[20] A.L. Yuille,“Energy function for early vision and analog networks,” A. I. Lab. Memo No. 987, MIT, Cambridge, Mass., 1987.
[21] T.E. Boult,“What is regular in regularization?,” Proc. First Int’l Conf. Computer Vision, pp. 457-462, 1987.
[22] M. Bertero,T.A. Poggio,, and V. Torre,“Ill-posed problems in early vision,” Proc. IEEE, vol. 76, no. 8, Aug. 1988.
[23] A.N. Tikhonov and V.A. Arsenin,Solutions of Ill-posed Problems.Washington: Winston&Sons, 1977.
[24] J. Marroquin,S. Mitter,, and T. Poggio,“Probabilistic solution of ill-posed problems in computational vision,” J. American Statistical Assoc., vol. 82, no. 397, pp. 76-89, Mar. 1987.
[25] G.E. Hinton,“Relaxation and its role in vision,” PhD thesis, Univ. of Edinburgh, Edinburgh, 1978.
[26] S.Z. Li,“A Markov random field model for object matching under contextual constraints,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition,Seattle, Wash., June 1994.
[27] S.Z. Li, Markov Random Field Modeling in Computer Vision. New York: Springer-Verlag, 1995.
[28] J.J. Hopfield,“Neurons with graded response have collective computational properties like those of two state neurons,” Proc. Nat’l Academic Science, USA, vol. 81, pp. 3,088-3,092, 1984.
[29] P.J. Besl,J.B. Birch,, and L.T. Watson,“Robust window operators,” Proc. Second Int’l Conf. Computer Vision, pp. 591-600, Dec. 1988.
[30] S.C. Liu and J.G. Harris,“Generalized smoothing networks in early vision,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 184-191, 1989.
[31] J.G. Harris,“A new approach to surface reconstruction: The coupled depth/slope model,” Proc. First Int’l Conf. Computer Vision, pp. 277-283,London, England, June 1987.
[32] R. Courant and D. Hilbert,Methods of Mathematical Physics, vol. 1. New York: Interscience Publishers Inc., 1953.
[33] L. Cesari,Optimization-Theory and Applications: Problems with Ordinary Differential Equations.New York: Springer-Verlag, 1983.
[34] T. Hebert and R. Leahy,“Statistic-based MAP image restoration from Poisson data using Gibbs priors,” IEEE Trans. Signal Processing, vol. 40, no. 9, Sept. 1992.
[35] P. Perona and J. Malik, "Scale-Space and Edge Detection Using Anisotropic Diffusion," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629639, July 1990.
[36] A.P. Witkin,“Scale-space filtering,” Proc. Int’l Joint Conf. Artificial Intelligence, vol. 2, pp. 1,019-1,022, 1983.
[37] P. Huber,Robust Statistics, Wiley, 1981.
[38] R. Stevenson and E. Delp,“Fitting curves with discontinuities,” Proc. Int’l Workshop Robust Computer Vision, pp. 127-136,Seattle, Wash., Oct.1-3, 1990.
[39] S.Z. Li,“Discontinuity-adaptive MRF prior and robust statistics: A comparative study,” Image and Vision Computing, vol. 13, no. 4, Apr. 1995.
[40] I. Weiss,“Shape reconstruction on a varying mesh,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 345-362, 1990.
[41] G. Wahba,“Spline bases, regularization, and generalized cross-validation for solving approximation problems with large quantities of noisy data,” Approximation Theory III, E. Cheney, ed., 1980, vol. 2, Academic Press.
[42] B. Shahraray and D. Anderson, "Optimal estimation of contour properties by cross-validated regularization," IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 6, pp. 600-610, June 1989.
[43] S.G. Nadabar and A.K. Jain,“Parameter estimation in MRF} lineprocess models,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 528-533, 1992.
[44] H. Derin and H. Elliott, "Modelling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 1, pp. 39-55, Jan. 1987.
[45] A. Witkin,D.T. Terzopoulos,, and M. Kass,“Signal matching through scale space,” Int’l J. Computer Vision, pp. 133-144, 1987.

Index Terms:
Discontinuities, energy functions, Euler equation, computer vision, Markov random fields, minimization, regularization.
Citation:
S.z. Li, "On Discontinuity-Adaptive Smoothness Priors in Computer Vision," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 576-586, June 1995, doi:10.1109/34.387504
Usage of this product signifies your acceptance of the Terms of Use.