Pyramid Implementation of Optimal-Step Conjugate-Search Algorithms for Some Low-Level Vision Problems

IEEE Transactions on Systems, Man and Cybernetics

Volumn 19, Issue 6, 1989, Pages 1408-1425

  Simchony, Tal ^a   Chellappa, Ramalingam ^a   Lichtenstein, Ze'ev ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE PROCESSING--IMAGE ANALYSIS; OPTIMIZATION; PROBABILITY--RANDOM PROCESSES;

CONJUGATE-SEARCH ALGORITHMS; GAUSS-MARKOV RANDOM FIELD; GRADIENT METHODS; GRADUATED NONCONVEXITY ALGORITHM; LOW LEVEL VISION; MAP PROBABILITY ESTIMATE;

VISION;

EID: 0024768808     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.44062     Document Type: Article

References (35)

1. B.K.P. Horn, Robot Vision. Cambridge, MA: The MIT Press, 1986.
2. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and Bayesian restoration of images,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 721–741, Nov. 1984.
3. T. Poggio and V. Torre, “Ill-posed problems and regularization analysis in early vision,” Artificial Intelligence Lab, M.I.T., A.I.M 773, Apr. 1984.
4. J. Hadamard, Lectures on the Cauchy Problem in Linear Partial Differential Equations. New Haven, CT: Yale University Press, 1923.
5. R. Courant and D. Hilbert, Methods of Mathematical Physics, vol. 1. New York: Interscience, 1953.
6. M.J. Brooks and B.K.P. Horn, “Shape and source from shading,” in Proc. Int. Joint Conf. Artificial Intell., Los Angeles, CA, Aug. 1985, pp. 932–936.
7. M. Strat. “A numerical method for shape from shading from a single image,” MS Thesis, M.I.T., Dept. of Elect. Engrg. and Comp. Sci., 1979.
8. D. Lee. “A provably convergent algorithm for shape from shading,” in Proc. DARPA Image Understanding Workshop, Miami Beach, FL, Dec. 1985, pp. 489–496.
9. A. Blake and A. Zisserman, Visual Reconstruction. Cambridge, MA: MIT Press, 1987.
10. D. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
11. D. Terzopoulos, “Image analysis using multigrid relaxation methods,” IEEE Trans. Pattern Anal. Machine Intell., vol, PAMI-8, pp. 129–139, Mar. 1986.
12. Z. Li and L. Uhr, “Pyramid vision using key features to integrate image-driven bottom-up and model-driven top-down processes,” IEEE Trans. Syst. Man Cybern, vol. SMC-17, pp. 250–263, Mar. 1987.
13. P.J. Burt. T.H. Hong, and A. Rosenfeld, “Segmentation and estimation of image region properties through cooperative hierarchical computation,” IEEE Trans. Syst. Man Cybern., vol. SMC-11, pp. 801–809, 1981.
14. P.J. Burt and G.S. van der Wal, “Iconic image analysis with the pyramid vision machine,” Comput. Architecture Pattern Anal. Machine Intell., pp. 137–144, 1987.
15. R. Miller, “Pyramid computer algorithms,” Ph.D. Thesis, Dept. of Math., State Univ. of New York, Binghamton, 1984.
16. A. Rosenfeld, Multiresolution Image Processing and Analysis. New York: Springer-Verlag, 1984.
17. A. Rosenfeld, “A report on the DARPA image understanding architectures workshop.” in Proc. of DARPA Image Understanding Workshop, Los Angeles. CA, Feb. 1987, pp. 298–302.
18. S.L. Tanimoto, “Paradigm for pyramid machine algorithms,” Parallel Structures for Comput. Vision, M.T.B. Duff, Ed. New York: Academic, pp. 173–194, 1987.
19. M. Shneier, “Using pyramid to define local threshols for blob detection.” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 345–349, May 1983.
20. J. Besag, “On the statistical analysis of dirty pictures,” J. Roy. Statist. Soc. B. vol. 48, pp. 259–302, 1986.
21. T. Simchony and R. Chellappa, “Direct analytical methods for solving Poisson equations in computer vision problems,” in IEEE Comput. Society Workshop Comput. Vision Problems. Miami Beach, FL. Nov. 1987.
22. S. Geman and C. Hwang, “Diffusions for global optimization,” SIAM J. Contr. Optimization, vol. 24, pp. 1031–1043, Sept. 1986.
23. L.E. Scales, Introduction to Nonlinear Optimization. New York: Spinger-Verlag, 1985.
24. A.K. Jain and J.R. Jain, “Partial difference equations and finite differences in image processing, part II: Image restoration,” IEEE Trans. Automatic Contr., vol. AC-23, pp. 817–833, Oct. 1978.
25. R. Chellappa and R.L. Kashyap, “Digital image restoration using spatial interaction models,” IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-30, pp. 461–472, June 1982.
26. H. Jinchi, T. Simchony, and R. Chellappa, “Maximum aposteriori restoration of images corrupted by multiplicative noise,” in Proc. ICASSP 87, IEEE Conf. Acoust. Speech Signal Process., Dallas, TX, Apr. 1987.
27. F.C. Jeng and J.W. Woods, “Image estimation by stochastic relaxation in the compound Gaussian case,” in Proc. ICASSP 88, IEEE Conf. Acoust. Speech Signal Process., New York, N.Y., Apr. 1988.
28. A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Roy. Statis. Soc. B, no. 39, 1977.
29. R. Chellappa and R.L. Kashyap, “Texture synthesis using two-dimensional noncausal autoregressive models,” IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-33, pp. 194–203, Feb. 1985.
30. R. Chellappa, S. Chatterjee, and R. Bagdazian, “Texture synthesis and coding using Gaussian Markov random field models,” IEEE Trans. Syst. Man Cybern., vol. SMC-15, pp. 298–303, Mar. 1985.
31. J. Besag, “Spatial interaction and the statistical analysis of lattice systems,” J. Roy. Statist. Soc. B, vol. 36, pp. 192–236, 1974.
32. H. Kaufman et al., “Estimation and identification of two-dimensional images,” IEEE Trans. Automatic Contr., vol. AC-28, no. 7, pp. 745–755, July 1983.
33. B.R. Hunt, “Digital image processing,” Proc. IEEE, vol. 63, Apr. 1975, pp. 693–708.
34. A.K. Jain, “A sinusoidal family of unitary transforms,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 356–365, Oct. 1979.
35. A. Rangarajan, R. Chellappa, and T. Simchony “Networks for image estimation using penalty mehtod,” Proc. Int. Joint Conf. Neural Networks, Washington DC, June, 1989.