Discontinuity Preserving Regularization of Inverse Visual Problems

IEEE Transactions on Systems, Man and Cybernetics

Volumn 24, Issue 3, 1994, Pages 455-469

  Stevenson, Robert L ^a   Schmitz, Barbara E ^a   Delp, Edward J ^b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; FUNCTION EVALUATION; IMAGE ANALYSIS; IMAGE RECONSTRUCTION; INVERSE PROBLEMS; LEAST SQUARES APPROXIMATIONS; OPTICAL FLOWS; SYSTEM STABILITY; VECTORS;

CONVEX REGULARIZATION KERNEL; DISCONTINUITY; LOW LEVEL VISION; STABILIZING FUNCTIONALS; TIKHONOV REGULARIZATION;

PARAMETER ESTIMATION;

EID: 0028384165     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.278994     Document Type: Article

References (56)

1. M. Bertero, T. Poggio and V. Torre, “III-posed problems in early vision,” Artificial Intelligence Laboratory Memo, no. 924, Cambridge, MA: MTT, 1986.
2. A Blake and A. Zisserman, “Invariant surface reconstruction using weak continuity constraints,” in Proc. Computer Vision and Pattern Recognition Conf, Miami, FL, June 22–26, 1986, pp. 62–67.
3. A. Blake and A. Zisserman, “Some properties of weak continuity constraints and the GNC algorithm,” in Proc. Computer Vision and Pattern Recognition Conf, Miami, FL, June 22–26, 1986, pp. 656–661.
4. A. Blake and A. Zisserman, Visual Reconstruction, Cambridge, MA: MIT Press, 1987.
5. A. Blake and A Zisserman, “Localizing discontinuities using weak continuity constraints,” Pattern Recog. Lett, vol. 6, pp. 51–59, 1987.
6. C. Bouman and K. Sauer, “An edge-preserving method for image reconstruction from integral projections,” presented at the Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, MD, Mar. 20–22, 1991.
7. C. Bouman and K. Sauer, “A generalized Gaussian image model for edge preserving MAP estimation,” IEEE Trans. Image Processing, vol. 2, no. 3, pp. 296–310, July 1993.
8. J. Daniel, “The conjugate gradient method for linear and nonlinear operator equations,” SIAM J. Numerical Anal., vol. 4, pp. 10–26, 1967.
9. R. Fletcher and C. Reeves, “Function minimization by conjugate gradients,” Computer J., vol. 7, pp. 149–154, 1964.
10. D. Geiger and F. Girosi, “Parallel and deterministic algorithms for MRFs: Surface reconstruction and integration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 401–412, 1991.
11. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions and the Bayessian restoration of images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-6, no. 6, pp. 721–741. Nov. 1984.
12. D. Geman and G. Reynolds, “Constrained restoration and the recovery of discontinuities,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 3, pp. 367–383, Mar. 1992.
13. 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.
14. J. Hadamard, Lectures on the Cauchy Problem in Linear Partial Differential Equations, New Haven, CT: Yale University Press, 1923.
15. M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” J. Res. National Bureau of Standards, vol. 49, no. 6, pp. 409–427, Dec. 1952.
16. J. Jou and A. C. Bovik, “Improved initial approximation and intensity-guided guided discontinuity detection in visible-surface reconstruction,” Computer Wsion, Graphics and Image Processing, vol. 4, no. 3, pp. 292–325, Sept. 1989.
17. W. Hackbusch, Multi-Grid Methods and Applications. Berlin, Germany: Springer-Verlag, 1985.
18. K. Huang, D. Lee, and T. Pavidis, “Edge detection through two-dimensional dimensional regularization,” in Proc. Workshop on Computer Vision, Miami Beach, FL, Nov. 30-Dec. 2, 1987, pp. 225–227.
19. P. J. Huber, “Robust Smoothing,” in Robustness in Statistics, R. L. Launer and G. B. Wilkinson, eds. New York: John Wiley & Sons, 1981.
20. P. J. Huber, Robust Statistics. New York: John Wiley & Sons, 1981.
21. J. G. Harris, “Analog models for early vision,” Ph.D. dissertation, California Institute of Technology, 1991.
22. J. Hutchinson, C. Koch, J. Luo, and C. Mead, “Computing motion using analog and binary resistive networks,” Computer, pp. 52–62, Mar, 1988.
23. D. Keren and M. Werman, “Variations on Regularization,” in Proc. 10th Int. Conf. on Pattern Recognition, Atlantic City, NJ, June 16–21, 1990, pp. 93–98.
24. W. J. Karplus, Analog circuits: Solutions of field problem. New York: McGraw-Hill, 1958.
25. D. Lee and T. Pavlidis, “One-dimensional regularization with discontinuities,” in Proc. First Int. Conf on Computer Vision, London, England, June 8–11, 1987, pp. 572–577.
26. D. Lee and T. Pavlidis, “One-dimensional regularization with discontinuities,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 6, pp. 822–829, Nov. 1988.
27. S. Z. Li, “Reconstruction without discontinuities,” in Proc. Third Int. Conf on Computer Vision, Osaka, Japan, Dec. 4–7, 1990, pp. 709–712.
28. A. Lumsdaine, J. L. Wyatt, Jr., and I. M. Elfadel, “Nonlinear analog networks for image smoothing and segmentation,” J. VLSI Signal Processing, no. 2, pp. 53–68, 1991.
29. J. L. Marroquin, “Probabilistic Solution of Inverse Problems,” Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1985.
30. J. L. Marroquin, S. Mitter, and T. Poggio, “Probabilistic solution of illposed posed problems in computational vision,” J. Amer. Statist. Assoc., vol. 82, no. 397, pp. 76–89, Mar. 1987.
31. D. Mumford and J. Shah, “Optimal approximations of piecewise smooth functions and associated variational problems,” Communications in Pure and Applied Mathematics, vol. 42, pp. 577–685, 1989
32. P. Penfield, R. Spence, and S. Duinker, Tellegen's Theorem and Electrical Networks. Cambridge, MA: MIT Press, 1970.
33. T. Poggio and V. Torre, “III-posed problems and regularization analysis in early vision,” Artificial Intelligence Laboratory Memo, no. 773, Cambridge, MA: MIT, 1984.
34. T. Poggio, V. Torre, and C. Kock, “Computational vision and regularization theory,” Nature, vol. 317, no. 26, pp. 314–319, Sept. 1985.
35. T. Poggio, “Early vision: From computational structure to algorithms and parallel hardware,” in Human and Machine Vision II, A. Rosenfeld, ed. Academic Press, 1986, pp. 190–206.
36. D. Shulman and J. Y. Herve, “Regularization of discontinuous flow fields,” in Proc. IEEE Workshop on Visual Motion, Irvine, CA, Mar. 20–22, 1989, pp. 81–86.
37. S. S. Sinha and B. G. Schunck, “Discontinuity preserving surface reconstruction,” in Proc. IEEE Conf on Computer Vision and Pattern Recognition, San Diego, CA, June 4–8, 1989, pp. 229–234.
38. S. S. Sinha and B. G. Schunck, “A robust method for surface reconstruction,” in Proc. Int. Workshop on Robust Computer Vision, Seattle, WA, Oct. 1–3, 1990, pp. 183–199.
39. S. S. Sinha and B. G. Schunck, “Surface approximation using weighted splines,” presented at the IEEE Conference on Computer Vision and Pattern Recognition, Lahaina, Maui, Hawaii, J une 3–6, 1991.
40. R. L. Stevenson and E. J. Delp, “Invariant recovery of surfaces in mdimensional space from sparse data,” J. Opt. Soc. Amer. A, vol. 7, no. 3, pp. 480–490, Mar. 1990.
41. R. L. Stevenson, “Invariant reconstruction of curves and surfaces with applications in computer vision,” Ph.D. dissertation, Purdue University, 1990.
42. R. L. Stevenson and E. J. Delp, “Fitting curves with discontinuities,” in IEEE Int. Workshop on Robust Computer Vision, Seattle, WA, Oct 1–3, 1990, pp. 127–136.
43. R. L. Stevenson and E. J. Delp, “Viewpoint invariant recovery of visual surfaces from sparse data,” in Proc. IEEE Third Int. Conf on Computer Vision, Osaka, Japan, Dec. 4-7, 1990, pp. 309–312.
44. R. L. Stevenson and E. J. Delp, “Viewpoint invariant recovery of visual surfaces from sparse data,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 9, pp. 897–909, Sept. 1992.
45. R. L. Stevenson and E. J. Delp, “Surface reconstruction with discontinuities,” presented at the SPIE Conference on Computer Vision and Graphics II, Boston, MA, Nov. 1991
46. R. L. Stevenson, G. B. Adams, L. H. Jamieson and E. J. Delp, “Parallel implementation for iterative image restoration algorithms on a parallel DSP machine,”.I. VLSI Signal Processing, vol. 5, no. 2/3, pp. 261–272, 1993.
47. R. Szeliski, “Regularization uses fractal priors,” in Sixth Nat. Conf. on Artificial Intelligence, Seattle, WA, July 13–17, 1987, pp. 749–754.
48. R. Szeliski, Bayesian Modeling of Uncertainty in Low-Level Vision. Boston, MA: Kluwer Academic, 1989.
49. D. Terzopoulos, “The role of constraints and discontinuities in visible-surface surface reconstruction,” in Proc. 8th Int. Joint Conf. on Artificial Intelligence, Karlsruhe, West Germany, Aug. 8–12, 1983, pp. 1073–1077.
50. D. Terzopoulos, “Controlled-smoothness stabilizers for the regularization of ill-posed visual problems involving discontinuities,” in Proc. Image Understanding Workshop, New Orleans, LA, Oct. 3–4, 1984, pp. 225–229.
51. D. Terzopoulos, “Regularization of inverse visual problems involving discontinuities,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-8, no. 4, pp. 413–424, July 1986.
52. A. N. Tikhonov and V. Y. Arsenin, Solutions of III-Posed Problems. Washington, DC: V. H. Winston & Sons, 1977.
53. A. N. Tikhonov and A. V. Goncharsky, eds., III-Posed Problems in the Natural Sciences. Moscow: MIR Publishers, 1987.
54. G. Wahba, “Spline base, regularization, and generalized cross validation for solving approximation problems with large quantities of noisy data,” in Approximation Theory III: Proceedings of a Conference Honoring Professor George G. Lorentz, E. W. Cheney, ed., Academic Press, pp. 905–912, 1980.
55. A. L. Yuille, “Energy functions for early vision and analog networks,” Biol. Cybern., vol. 16, pp. 115–123, 1989.
56. B. E. Schmitz and R. L. Stevenson, “Parameter estimation for the curve recovery schedule,” in Proc. 31st Ann. Allerton Conf on Communications, Control, and Computing, Monticello, IL, 1993, pp. 485–494.