Scanning and sequential decision making for multidimensional data - Part I: The noiseless case

IEEE Transactions on Information Theory

Volumn 53, Issue 9, 2007, Pages 3001-3020

  Cohen, Asaf ^a,b   Merhav, Neri ^a   Weissman, Tsachy ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b California Institute of Technology   (United States)

^c Stanford University   (United States)

Author keywords

Individual image; Multidimensional data; Random field; Scandiction; Sequential decision making; Universal scanning

Indexed keywords

INDIVIDUAL IMAGE; MULTIDIMENSIONAL DATA; RANDOM FIELD; SCANDICTION; SEQUENTIAL DECISION MAKING; UNIVERSAL SCANNING;

DECISION MAKING; IMAGE CODING; OPTIMIZATION;

SCANNING;

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

References (41)

1. M. J. Weinberger, G. Seroussi, and G. Sapiro, "LOCO-I: A low complexity, context-based, lossless image compression algorithm," in Proc. IEEE Data Compression Conf., Snowbird, UT, 1996, pp. 140-149.
2. C.-H. Lamarque and F. Robert, "Image analysis using space-filling curves and 1D wavelet bases," Pattern Recogn., vol. 29, no. 8, pp. 1309-1322, 1996.
3. A. Krzyzak, E. Rafajłowicz, and E. Skubalska-Rafajłowicz, "Clipped median and space filling curves in image filtering," Nonlinear Anal. vol. 47, pp. 303-314, 2001.
4. L. Velho and J. M. Gomes, "Digital halftoning with space filling curves," Comp. Graph., vol. 25, no. 4, pp. 81-90, July 1991.
5. E. Skubalska-Rafajłowicz, "Pattern recognition algorithms based on space-filling curves and orthogonal expansions," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 1915-1927, Jul. 2001.
6. T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer, "Space-filling curves and their use in the design of geometric data structures," Theor. Comp. Sci., vol. 181, pp. 3-15, 1997.
7. K.-L. Chung, Y.-H. Tsai, and F.-C. Hu, "Space-filling approach for fast window query on compressed images," IEEE Trans. Image Process., vol. 9, no. 12, pp. 2109-2116, Dec. 2000.
8. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, "Analysis of the clustering properties of the Hilbert space-filling curve," IEEE Trans. Knowl. Data Eng,, vol. 13, no. 1, pp. 124-141, Jan./Feb. 2001.
9. A. Bogomjakov and C. Gotsman, "Universal rendering sequences for transparent vertex caching of progressive meshes," Comp. Graph. Forum, vol. 21, no. 2, pp. 137-148, 2002.
10. R. Niedermeier, K. Reinhardt, and P. Sanders, "Towards optimal locality in mesh-indexings," Discr. Appl. Math., vol. 117, pp. 211-237, 2002.
11. H. Tang, S.-I. Kamata, K. Tsuneyoshi, and M.-A. Kobayashi, "Lossless image compression via multi-scanning and adaptive linear prediction," in IEEE Asia-Pacific Conf. Circuits and Systems, Tainan, Taiwan, Dec. 2004, pp. 81-84.
12. N. D. Memon, K. Sayood, and S. S. Magliveras, "Lossless image compression with a codebook of block scans," IEEE J. Sel. Areas Commun., vol. 13, no. 1, pp. 24-30, Jan. 1995.
13. R. Dafner, D. Cohen-Or, and Y. Matias, "Context-based space filling curves," in Proc. EUROGRAPHICS, Interlaken, Switzerland, Aug. 2000.
14. A. Lempel and J. Ziv, "Compression of two-dimensional data," IEEE Trans. Inf. Theory, vol. IT-32, no. 1, pp. 2-8, Jan. 1986.
15. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inf. Theory, vol. IT-24, no. 5, pp. 530-536, Sep. 1978.
16. T. Weissman and S. Mannor, "On universal compression of multi-dimensional data arrays using self-similar curves," in Proc. 38th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2000, vol. I, pp. 470-479.
17. Z. Ye and T. Berger, Information Measures for Discrete Random Fields Beijing: Science, 1998.
18. J. Ziv, "On universal quantization," IEEE Trans. Inf. Theory, vol. IT-31, no. 3, pp. 344-347, May 1985.
19. A. Dembo and I. Kontoyiannis, "Source coding, large deviations, and approximate pattern matching," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1590-1615, Jun. 2002.
20. I. Kontoyiannis, "Pattern matching and lossy data compression on random fields," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 1047-1051, Apr. 2003.
21. N. Memon, D. L. Neuhoff, and S. Shende, "An analysis of some common scanning techniques for lossless image coding," IEEE Trans. Image Proc., vol. 9, no. 11, pp. 1837-1848, Nov. 2000.
22. N. Merhav and T.Weissman, "Scanning and prediction in multidimensional data arrays," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 65-82, Jan. 2003.
23. N. Merhav and M. Feder, "Universal prediction," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2124-2147, Oct. 1998.
24. L. Gyorfi, G. Lugosi, and G. Morvai, "A simple randomized algorithm for sequential prediction of ergodic time series," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2642-2650, Nov. 1999.
25. T. Weissman and N. Merhav, "Universal prediction of random binary sequences in a noisy environment," Ann. App. Probab., vol. 14, no. 1, pp. 54-89, Feb. 2004.
26. V. G. Vovk, "Aggregating strategies," in Proc. 3rd Annu. Workshop Computational Learning Theory, San Mateo, CA, 1990, pp. 372-383.
27. A. Cohen, T.Weissman, and N. Merhav, "Scanning and sequential decision making for multi-dimensional data - Part II: The noisy case," IEEE Trans. Inf. Theory, submitted for publication.
28. T.Weissman and N. Merhav, "Universal prediction of individual binary sequences in the presence of noise," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2151-2173, Sep. 2001.
29. T. Weissman, E. Ordentlich, M. Weinberger, A. Somekh-Baruch, and N. Merhav, "Universal filtering via prediction," IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1253-1264, Apr. 2007.
30. T. Linder and G. Lugosi, "A zero-delay sequential scheme for lossy coding of individual sequences," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2533-2538, Sep. 2001.
31. T. Weissman and N. Merhav, "On limited-delay lossy coding and filtering of individual sequences," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 721-733, Mar. 2002.
32. A. Gyorgy, T. Linder, and G. Lugosi, "Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding," IEEE Trans. Signal Process., vol. 52, no. 8, pp. 2337-2347, Aug. 2004.
33. N. Merhav, E. Ordentlich, G. Seroussi, and M. J. Weinberger, "On sequential strategies for loss functions with memory," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1947-1958, Jul. 2002.
34. D. Haussler, J. Kivinen, and M. K. Warmuth, "Sequential prediction of individual sequences under general loss functions," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1906-1925, Sep. 1998.
35. R. M. Gray and J. C. Kieffer, "Asymptotically mean stationary measures," Ann. Probab., vol. 8, no. 5, pp. 962-973, 1980.
36. B. Porat, Digital Processing of Random Signals. Englewood Cliffs, NJ: Prentice-Hall, 1994.
37. A. A. Tempelman, "Ergodic theorems for general dynamical systems," Trans. Moscow Math. Soc., pp. 94-132, 1972.
38. X. Guyon, Ramdom Fields on a Network. New York: Springer-Verlag, 1995.
39. H. Sagan, Space-Filling Curves. New York: Springer-Verlag, 1994.
40. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
41. M. Feder, N. Merhav, and M. Gutman, "Universal prediction of individual sequences," IEEE Trans. Inf. Theory, vol. 38, no. 4, pp. 1258-1270, Jul. 1992.