This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
One-Dimensional Regularization with Discontinuities
November 1988 (vol. 10 no. 6)
pp. 822-829

Regularization is equivalent to fitting smoothing splines to the data so that efficient and reliable numerical algorithms exist for finding solutions. however, the results exhibit poor performance along edges and boundaries. To cope with such anomalies, a more general class of smoothing splines that preserve corners and discontinuities is studied. Cubic splines are investigated in detail, since they are easy to implement and produce smooth curves near all data points except those marked as discontinuities or creases. A discrete regularization method is introduced to locate corners and discontinuities in the data points before the continuous regularization is applied.

[1] J. H. Ahlberg, E. N. Nilson, and J. L. Walsh,The Theory of Splines and Their Applications. New York: Academic, 1967.
[2] A. Blake and A. Zisserman, "Invariant surface reconstruction using weak continuity constraints," inProc. IEEE Comput. Vision Pattern Recognition Conf., Miami Beach, FL, June 22-26, 1986, pp. 62-67.
[3] A. Blake and A. Zisserman, "Some properties of weak continuity constraints and the GNC algorithm," inProc. IEEE Comput. Vision Pattern Recognition Conf., Miami Beach, FL, June 22-26, 1986, pp. 656-661.
[4] P. Craven and G. Wahba, "Smoothing noisy data with spline functions; Estimating the correct degree of smoothing by the method of generalized cross-validation," Dep. Stat., Univ. Wisconsin, Madison, WI, TR #445, 1977.
[5] C. de Boor,A Practical Guide to Splines. New York: Springer-Verlag, 1978.
[6] G. Forsythe and C. Moler,Computer Solutions of Linear Algebraic Systems. Englewood Cliffs, NJ: Prentice-Hall, 1967.
[7] I. M. Gelfand and S. V. Fomin,Calculus of Variation. Englewood Cliffs, NJ: Prentice-Hall, 1963.
[8] W. E. L. Grimson,From Images to Surfaces: A Computational Study of the Human Early visual System. Cambridge, MA: MIT Press, 1981.
[9] W. E. L. Grimson and T. Pavlidis, "Discontinuity detection for visual surface reconstruction,"Comput. Vision, Graphics, Image Processing, vol. 30, pp. 316-330, 1985.
[10] E. Hildreth,The Measurement of Visual Motion, Cambridge, MA: MIT Press, 1983.
[11] K. Ikeuchi and B. K. P. Horn, "Numerical shape from shading and occluding boundaries, in Special Volume on Computer Vision,Artif. Intell. J., vol. 17, pp. 141-184, 1981.
[12] D. Lee, "Optimal algorithms for image understanding: Current status and future plans,"J. Complexity, vol. 1, no. 1, pp. 138-146, 1985.
[13] D. Lee, "Fast multiplication of a recursive block Toeplitz matrix by a vector and its application,"J. Complexity, vol. 1, no. 2, pp. 295- 305, 1986.
[14] D. Mumford and J. Shah, "Boundary detection by minimizing functionals," inProc. IEEE Comput. Vision Pattern Recognition Conf., San Francisco, CA, June 19-23, 1985, pp. 22-26.
[15] T. Poggio, "Early vision: From computational structure to algorithms and parallel hardware,"CVGIP, vol. 31, pp. 139-155, 1985.
[16] T. Poggio, V. Torre, and C. Koch, "Computational vision and regularization theory,"Nature, vol. 317, pp. 314-319, 1985.
[17] M. J. D. Powell,Approximation Theory and Methods. Melbourne, Australia: Cambridge Univ. Press, 1981.
[18] C. H. Reinsch, "Smoothing by spline functions,"Numer. Math., vol. 10, pp. 177-183, 1967.
[19] I. J. Schoenberg, "Spline functions and the problem of graduation,"Proc. Nat. Acad. Sci., vol. 52, pp. 947-950, 1964.
[20] L. L. Schumaker, "Fitting surfaces to scattered data," inApproximation Theory II, G. G. Lorenz, C. K. Chui, and L. L. Schumaker, Eds. New York: Academic, 1976, pp. 203-268.
[21] B. Shahraray and D. J. Anderson, "Optimal smoothing of digitized contours," inProc. IEEE Comput. Vision Pattern Recognition Conf., Miami Beach, FL, June 22-26, 1986, pp. 210-218.
[22] D. Terzopoulos, "Multiresolution computation of visible-surface representations," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 1984.
[23] D. Terzopoulos, "Regularization of inverse visual problems involving discontinuities,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 4, pp. 413-424, July 1986.
[24] A. N. Tikhonov and V. Y. Arsenin,Solution of Ill-Posed Problems. New York: Wiley, 1977.
[25] D. Utreras, "Cross-validation techniques for smoothing spline functions in one or two dimensions," inSmoothing Techniques for Curve Estimation, T. Gasser and M. Rosenblatt, Eds. New York: Springer-Verlag, 1979, pp. 196-232.
[26] G. Wahba, "Convergence rates of thin plate smoothing splines when the data are noisy," inSmoothing Techniques for Curve Estimation, T. Gasser and M. Rosenblatt, Eds. New York: Springer-Verlag, 1979, pp. 233-245.
[27] G. Wahba, "Surface fitting with scattered noisy data on EuclideanD-space and on the sphere,"Rocky Mountain J. Math., vol. 14, pp. 281-299, 1984.
[28] Whittaker, "On a new method of graduation,"Proc. Edinburgh Math. Soc., vol. 41, pp. 63-75, 1923.

Index Terms:
edge analysis; 1-D regularization; computerized picture processing; cubic splines; discontinuities; discrete regularization; data points; computerised picture processing; splines (mathematics)
Citation:
D. Lee, T. Pavlidis, "One-Dimensional Regularization with Discontinuities," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 6, pp. 822-829, Nov. 1988, doi:10.1109/34.9105
Usage of this product signifies your acceptance of the Terms of Use.