Partition Function Estimation of Gibbs Random Field Images Using Monte Carlo Simulations

IEEE Transactions on Information Theory

Volumn 39, Issue 4, 1993, Pages 1322-1332

  Potamianos, Gerasimos G ^a   Goutsias, John K ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DESCRIBING FUNCTIONS; IMAGE ANALYSIS; ITERATIVE METHODS; MATHEMATICAL MODELS; MONTE CARLO METHODS; OPTIMIZATION; PARAMETER ESTIMATION; RANDOM PROCESSES; SAMPLING; STATE ESTIMATION;

GIBBS RANDOM FIELD IMAGES; IMPORTANCE SAMPLING; PARTITION FUNCTION ESTIMATION; PARTITION FUNCTIONS;

IMAGE PROCESSING;

EID: 0027635090     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.243449     Document Type: Article

References (18)

1. R. C. Davis, “Diode-configured Viterbi algorithm error correcting decoder for convolutional codes,” U.S. Patent 4 545 054, Oct. 1, 1985.
2. G. D. Forney, Jr., “The Viterbi algorithm,” Proc. IEEE, vol. 61, no. 3, Mar. 1973.
3. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, no. 1, pp. 76–80, Jan. 1978.
4. D. J. Muder, “Minimal trellises for block codes,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1049–1053, Sept. 1988.
5. G. Fettweis and H. Meyr, “A modular variable speed Viterbi decoding implementation for high. data rates,” Signal Processing IV: Theories and Applications, J. L Lacoume, A. Chehikian, N. Martin, and J. Malbos, Eds. Amsterdam: Elsevier Science Publ. (North Holland), 1988.
6. G. Fettweis and H. Meyr“Cascaded feedforward architectures for parallel Viterbi decoding,” in ProcIEEE ISCAS’90, New Orleans. LA May 1-3, 1990, paper SS 1.7.
7. J. L. Massey “Error bounds for tree codes, trellis codes, and convolutional codes with encoding and decoding procedures,” in Coding and Complexity, G. Longo, Ed. New York: Springer, 1976.
8. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
9. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, Apr. 1967, pp. 260–269.
10. R. Bellman and S. Dreyfus, Applied Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1962.
11. G. J. Minty, “A comment on the shortest route problem,” Open Res., vol. 5, p. 724, Oct. 1957.
12. R. S. Muller and T. I. Karnins, Device Electronics for Integrated Circuits. New York: Wiley, 1977.
13. J. B. Dennis, Mathematical Programming and Electrical Networks. New York: Wiley, 1959.
14. M. Iri, Network Flow, Transportation and Scheduling—Theory and Algorithms. New York: Academic Press, 1969.
15. G. V. Karandakov, “Network shortest path detector-1s simplified using spark elektrodes between graph nodes,” Soviet patent appl. SU 397 931, 1974.
16. L. V. Fedotov, V. I. Mikhailenk, and S. V. Ozirskii, “Graph shortest path determination apparatus,” Soviet patent appl. SU 1 488 824, 1989.
17. A. V. Itholin, “Shortest path computing circuit,” Soviet patent appl. SU 552 617, 1977.
18. A. A. Lelis, V. A. Klishin, and G. S. Polishchuk, “Topological graph shortest path finder,” Soviet patent appl. SU 1 314 354, 1987.