Recursive Structure of Noncausal Gauss-Markov Random Fields

IEEE Transactions on Information Theory

Volumn 38, Issue 2, 1992, Pages 334-354

  Moura, José M F ^a   Balram, Nikhil ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

equivalent one sided representa ; Gauss Markov random fields; image processing; Noncausal; potential matrix; random fields; recursive 2 D processing; tions

Indexed keywords

MATHEMATICAL TECHNIQUES - MATRIX ALGEBRA;

COVARIANCE MATRICES; GAUSS-MARKOV RANDOM FIELDS; POTENTIAL MATRICES; RECURSIVE PROCEDURES; RICCATI EQUATIONS;

PROBABILITY;

EID: 0026838051     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.119691     Document Type: Article

References (32)

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. M. B. Averintsev, “The description of Markov random fields by Gibbs distribution,” Teor. Verojatrost. i Primen., vol. 17, pp. 21–35, 1972.
3. N. Balram and J. M. F. Moura, “Recursive enhancement of noncausal images,” in Proc. IEEE ICASSP'91, May 1991, pp. 2997–3000.
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 and P. A. P. Moran, “On the estimation and testing of spatial interaction in Gaussian lattice processes,” Biometrika, vol. 62, pp. 555–562, 1975.
6. D. Brook, “On the distinction between the conditional probability and the joint probability approaches in the specification of nearest-neighbor systems,” Biometrika, vol. 51, pp. 481–483, 1964.
7. R. S. Bucy, “A priori bounds for the Riccati equation,” in Proc. Sixth Berkeley Symp. Math. Statist. Probab., Univ. California Press, 1970, pp. 645-656.
8. R. S. Bucy, “Interpolation,” Int. J. Contr., vol. 39, no. 4, pp. 767–772, 1984.
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. D. C. Fraser and J. E. Potter, “The optimum linear smoother as a combination of two optimum linear filters,” IEEE Trans. Automat. Contr., vol. AC-14, pp. 387–390, Aug. 1969.
11. 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.
12. J. K. Goutsias, “Mutually compatible Gibbs random fields,” IEEE Trans. Inform. Theory, vol. 35, pp. 538–544, Nov. 1989.
13. A. Graham, Kronecker Products and Matrix Calculus With Applications. Chichester, England: Ellis Horwood Ltd., 1981.
14. A. Habibi, “Two-dimensional Bayesian estimate of images,” in Proc. IEEE, vol. 60, pp. 878–883, 1972.
15. M. Hassner and J. Sklansky, “The use of Markov random fields as models of texture,” Comput. Graphics Image Processing, vol. 12, pp. 357–370, 1980.
16. A. K. Jain, “A sinusoidal family of unitary transforms,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 356–365, Oct. 1979.
17. R. L. Kashyap, “Finite lattice random field models for finite images,” in Conf. Inform. Sci. Syst., Baltimore, MD, Mar. 1981.
18. B. Kaufman and Lars Onsager, “Crystal statistics, III, Short-range order in binary Ising lattice,” Phys. Rev., vol. 76, no. 4, pp. 1244–1252, Oct. 1949.
19. P. Lancaster and M. Tismenetsky, The Theory of Matrices, second ed. Orlando, FL: Academic Press, 1985.
20. B. C. Levy, R. Frezza, and A. J. Krener, “Modeling and estimation of discrete-time Gaussian reciprocal processes,” IEEE Trans. Automat. Cont., vol. 35, pp. 1013–1023, Sept. 1990.
21. J. R. Magnus and H. Neudecker, Matrix Differential Calculus with ill-posed problems in computational vision,” J. Am. Statist. Soc., vol. 82, pp. 76–89, 1987.
22. D. Q. Mayne, “A solution of the smoothing problem for linear dynamic systems,” Automatica, vol. 4, pp. 73–92, 1966.
23. P. A. P. Moran, “A Gaussian Markovian process on a square lattice,” J. Appl. Prob., vol. 10, pp. 54–62, 1973.
24. D. K. Pickard, “A curious binary lattice,” J. Appl. Probab., vol. 14, pp. 717–731, 1977.
25. H. E. Rauch, F. Tung, and C. T. Striebel, “Maximum likelihood estimates of linear dynamic systems,” J. AIAA, vol. 3, no. 8, pp. 1445–1450, Aug. 1965.
26. F. Riesz and B. SZ. Nagy, Functional Analysis, second ed. New York: Frederick Ungar Publishing Co., 1955. (Translated from the 2nd French edition by L. F. Boron.)
27. Frank Spitzer, “Markov random fields and Gibbs ensembles,” Am. Math. Monthly, vol. 78, pp. 142–154, Feb. 1971.
28. J. M. Varah, “On the solution of block-tridiagonal systems arising from certain finite-difference equations,” Math. Comput., vol. 26, no. 120, pp. 859–868, Oct. 1972.
29. J. M. Varah, “A lower bound for the smallest singular value of a matrix,” Linear Algebra and its Applicat., vol. 11, pp. 3–5, 1975.
30. R. S. Varga, Matrix Iterative Analysis. Englewood Cliffs, NJ: Prentice Hall, 1962.
31. J. W. Woods, “Two-dimensional discrete Markovian fields,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 232–240, Mar. 1972.
32. J. W. Woods and C. H. Radewan, “Kalman filtering in two dimensions,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 473–481, July 1977.