Noncausal Gauss Markov Random Fields: Parameter Structure and Estimation

IEEE Transactions on Information Theory

Volumn 39, Issue 4, 1993, Pages 1333-1355

  Moura, José M F ^b  

^a IBM   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

dom fields; Gauss Markov ran ; maximum likelihood parameter estimation; noncausal; parameter space in random fields; Random fields

Indexed keywords

MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; RANDOM PROCESSES; RECURSIVE FUNCTIONS; SIGNAL FILTERING AND PREDICTION; SIGNAL THEORY; STATE SPACE METHODS;

FINITE LATTICES; MARKOV RANDOM FIELDS; MAXIMUM LIKELIHOOD ESTIMATOR; NONCAUSAL MODELS; PARAMETER SPACE; PARAMETER STRUCTURE;

SIGNAL PROCESSING;

EID: 0027634634     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.243450     Document Type: Article

References (38)

1. K. Abend, T. J. Harley, and L. N. Kanal “Classification of binary random patterns,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 538–544, Oct. 1965.
2. H. C. Andrews and B. R. Hunt, Digital Image Restoration. Englewood Cliffs, NJ: Prentice Hall, 1977.
3. N. Balram, “A recursive framework for noncausal Gauss Markov random fields,” Ph.D. thesis, Carnegie Mellon Univ., Pittsburgh, PA, Jan. 1992.
4. J. E. Besag, “Spatial interaction and the statistical analysis of lattice systems (with discussion),” J. Roy. Statist. Soc., B, vol. 36, no. 2, pp. 192–236, 1974.
5. J. E. Besag, “Statistical analysis of non-lattice data, The Statistician, vol. 14, pp. 179–195, 1975.
6. J. E. Besag, “Errors-in-variable estimation for Gaussian lattice schemes,” J. R. Statist. Soc., B, pp. 73–78, 1977.
7. J. E. Besag and P. A. P. Moran, “On the estimation and testing of spatial interaction in Gaussian lattice - processes,” Biometrika, vol. 62, pp. 555–562, 1975.
8. R. Chellappa, “Two-dimensional discrete Gaussian Markov random field models for image processing, in Progress in Pattern Recognition 2. Amsterdam: North-Holland, 1985, 79–112.
9. R. Chellappa and R. L. Kashyap, “Digital image restoration using spatial interaction models,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 30, pp. 461–472, June 1982.
10. P. B. Chou and R. Raman, “On relaxation algorithms based on Markov random fields,” Tech. Rep. 212, Dept. of Comput. Sci., Univ. of Rochester, July 1987.
11. H. Derin and C. Won, “A parallel image segmentation algorithm using relaxation with varying neighbourhoods and its mapping to array processors,” Comput. Vision, Graphics, Image Process., vol. 40, pp. 54–78, 1987.
12. C. F. Fischer and R. A. Usmani, “Properties of some tridiagonal matrices and their application to boundary value problems,” Siam J. Nutner. AnaL, vol. 6, no. 1, pp. 127–142, Mar. 1969.
13. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distribution, and Bayesian restoration of images,” IEEE Trans. Pattern Anal Machine Intell., vol. PAMI-6, pp. 721–741, Nov. 1984.
14. A. Graham, Kronecker Products and Matrix Calculus With Applications. Chichester, England: Ellis Horwood, Ltd., 1981.
15. S. L. Handy and J. L. Barlow, “Eigenvalue bounds for banded, symmetric Toeplitz Matrices,” Tech. Rep. CS-88-19, Dept. Comput. Sc., Pennsylvania State Univ., May 1988.
16. M. Hassner and J. Sklansky, “The use of Markov random fields as models of texture,” Computer Graphics and Image Processing, vol. 12, pp. 357–370, 1980.
17. A. K. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice Hall, 1989.
18. A. K. Jain, “A sinusoidal family of unitary transforms,” IEEE Trans. Pattern Anal. Machine InizIL, vol. PAMI-1, pp. 356-365, Oct. 1979
19. H. Jinchi and R. Chellappa, “Restoration of blurred and noisy images using Gaussian Markov random field models,” in 20th Ann. Conf Inform. ScL Syst., Princeton, NJ, Mar. 1986, 34–39.
20. R. L. Kashyap, “Finite lattice random field models for finite images,” in 15th Ann. Conf. Inform. Sci. Syst., Baltimore, MD, Mar. 1981, pp. 215–220.
21. H. Kaufman, J. W. Woods, S. Dravida, and A. M. Tekalp, “Estimation and identification of two-dimensional images,” IEEE Trans. Automat. Cont., vol. AC-28, no. 7, pp. 745–756, July 1983.
22. S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, 1983.
23. S. Lakshmanan and H. Derin, “Parameter space for Gaussian Markov random fields with separable autocorrelation,” in 24th Ann. Conf Inform. ScL Syst., Princeton, NJ, Mar. 1990, pp. 226–231.
24. S. Lakshmanan and H. Derin, “Necessary and sufficient conditions for the parameters of Gaussian Markov randon fields,” presented at the 25th Ann. Conf. Inform. Sci. Syst., Baltimore, MD, Mar. 1991.
25. J. R. Magnus and H. Neudecker. Matrix Differential Calculus with Applications in Statistics and Econometrics. New York: John Wiley, 1988.
26. J. Marroquin, S. K. Mitter, and T. Poggi, “Probabilistic solution of ill-posed posed problems in computational vision,” J. Amer. Statist. Soc., vol. 82, pp. 76–89, 1987.
27. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equations of state calculations by fast computing machines,” J. Phys. Chem., vol. 21, no. 6, pp. 1087–1091, 1953.
28. P. A. P. Moran, “A Gaussian Markovian process on a square lattice,” J. AppL Probab., vol. 10, pp. 54–62, 1971
29. J. M. F. Moura and N. Balram, “A recursive framework for noncausal Gauss Markov random fields,” in 24th Ann. Conf Inform. Sci. Syst., Princeton, NJ, Mar. 1990, pp. 608–613.
30. J. M. F. Moura and N. Balram, “Recursive structure of noncausal Gauss-Markov random fields,” IEEE Trans. Inform. Theory, vol. 38, no. 2, pp. 334–354, Mar. 1992.
31. J. O’Brien, Ed., Advanced Physical Oceanographic Numerical Modeling. New York: D. Reidel, 1986.
32. K. Ord, “Estimation methods for models of spatial interaction,” J. Amer. Statist. Assoc., vol. 70, no. 349, pp. 120–126, Mar. 1975.
33. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C, The Art of Scientific Computing. Cambridge, MA: Cambridge Univ. Press, 1989.
34. T. J. Rivlin, The Chebyshev Polynomials. New York: Wiley-Interscience, ence, 1974.
35. G. Sharma and R. Chellappa, “A model-based approach for estimation of two-dimensional maximum entropy power spectra,” IEEE Trans. Inform. Theory, vo l. IT-31, no. 1, pp. 90–99, Jan. 1985.
36. T. Simchony, R. Chellappa, and Z. Lichtenstein, “Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise,” IEEE Trans. Inform. Theory, vol. 36, no. 3, pp. 608–613, May 1990.
37. R. S. Varga, Matrix Iterative Analysis. Englewood Cliffs, NJ: Prentice Hall, 1962.
38. J. W. Woods and C. H. Radewan, “Kalman filtering in two dimensions,” IEEE Trans. Inform. Theory, vol. IT-23, no. 4, pp. 473–481, July 1977.