Scanning and prediction in multidimensional data arrays

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 65-82

  Merhav, Neri ^a   Weissman, Tsachy ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Autoregressive representations; Gaussian fields; Kolmogorov's formula; Markov random fields (MRFs); Prediction; Random fields; Scandiction; Scanning

Indexed keywords

FUNCTIONS; IMAGE CODING; IMAGE COMPRESSION; MARKOV PROCESSES; PROBABILITY; SCANNING; SIGNAL FILTERING AND PREDICTION;

MULTIDIMENSIONAL DATA ARRAYS;

SIGNAL ENCODING;

EID: 0037268869     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806134     Document Type: Article

References (29)

1. L. Rabiner and R. Schafer, Digital Processing of Speech Signals. Englewood Cliffs, NJ: Prentice-Hall, 1978.
2. M. Weinberger, G. Seroussi, and G. Sapiro, "The large LOCI-I lossless image compression algorithm: Principles and standardization into JPEG-LS," IEEE Trans. Image Processing, vol. 9, pp. 1309-1324, Aug. 2000.
3. H. Li, S. Sun, and H. Derin, Video Data Compression for Multimedia Computing. Norwell, MA: Kluwer, Jan. 1997.
4. M. Seul, L. O'Gorman, and M. J. Sammon, Practical Algorithms for Image Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1999.
5. T. Sikora, "MPEG digital video-coding standards," IEEE Signal Processing Mag., vol. 14, pp. 82-100, Sept. 1997.
6. J. Rissanen, "Universal coding, information, prediction, and estimation," IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
7. N. Merhav and M. Feder, "A strong version of the redundancy-capacity theorem of universal coding," IEEE Trans. Inform. Theory, vol. 41, pp. 714-722, May 1995.
8. J. Rissanen, "Fisher information and stochastic complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 40-47, Jan. 1996.
9. N. Merhav and M. Feder, "Universal prediction," IEEE Trans. Inform. Theory, vol. 44, pp. 2124-2147, Oct. 1998.
10. M. Gardner, "Mathematical games," Sci. Amer., pp. 124-133, 1976.
11. B. B. Mandelbrot, Fractals: Form, Chance, and Dimension. San Francisco, CA: Freeman, 1977.
12. A. Lempel and J. Ziv, "Compression of two-dimensional data," IEEE Trans. Inform. Theory, vol. IT-32, pp. 2-8, Jan. 1986.
13. T. Weissman and S. Mannor, "On universal compression of multidimensional data arrays using self-similar curves," in Proc. 38th Annu. Allerton Conf. Communication, Control, and Computing, vol. I, Oct. 2000, pp. 470-479.
14. H. O. Georgii, Gibbs Measures and Phase Transitions. Berlin: Germany/New York: Walter de Gruyter, 1988.
15. N. Merhav and M. Feder, "Universal schemes for sequential decision from individual data sequences," IEEE Trans. Inform. Theory, vol. 39, pp. 1280-1292, July 1993.
16. Z. Ye and T. Berger, Information Measures for Discrete Random Fields. Beijing: China/New York: Science, 1998.
17. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed. New York: Springer-Verlag, 1998.
18. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. G. Schwartz, "Estimating the dimension of a model," Ann. Statist., vol. 6, no. 2, pp. 461-464, 1978.
20. P. J. Brockwell and R. A. Davis, Time Series: Theory and Methods, 2nd ed. New York: Springer-Verlag, 1991.
21. W. Rudin, Fourier Analysis on Group: Interscience, 1962.
22. H. Helson and D. Lowdenslager, "Prediction theory and Fourier series in several variables," Acta Math., vol. 99, pp. 165-202, 1958.
23. X. Guyon, Random Fields on a Network. New York: Springer-Verlag, 1995.
24. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
25. T. Weissman, "Optimal scandiction for Markov processes," in preparation.
26. N. Merhav and T. Weissman, "Scanning and prediction in multidimensional data arrays," Technion-I.I.T., CCIT Pub. 349, Aug. 2001.
27. T. Weissman and N. Merhav. (2002, Feb.) On competitive prediction and its relationship to rate-distortion theory and to channel capacity theory. [Online]. Available: http://tiger.technion.ac.il/users/merhav/
28. "Universal prediction of individual binary sequences in the presence of noise," IEEE Trans. Inform. Theory, vol. 47, pp. 2151-2173, Sept. 2001.
29. T. Weissman, N. Merhav, and A. Baruch, "Twofold universal pediction schemes for achieving the finite-state predictability of a noisy individual binary sequence," IEEE Trans. Inform. Theory, vol. 47, pp. 1849-1866, July 2001.