Scanning and sequential decision making for multidimensional data - Part II: The noisy case

IEEE Transactions on Information Theory

Volumn 54, Issue 12, 2008, Pages 5609-5631

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b California Institute of Technology   (United States)

^c Stanford University   (United States)

Author keywords

Filtering; Hidden Markov model; Multidimensional data; Prediction; Random field; Scandiction; Scanning; Sequential decision making

Indexed keywords

DECISION MAKING; FORECASTING; HIDDEN MARKOV MODELS; IMAGE CODING; MARKOV PROCESSES; NEMATIC LIQUID CRYSTALS; PAPER; PROGRAMMING THEORY; RANDOM PROCESSES; REINFORCEMENT LEARNING; VIDEO RECORDING;

FILTERING; MULTIDIMENSIONAL DATA; PREDICTION; RANDOM FIELD; SCANDICTION; SEQUENTIAL DECISION MAKING;

SCANNING;

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

References (29)

1. B. Natarajan, K. Konstantinides, and C. Herley, "Occam filters for stochastic sources with application to digital images," IEEE Trans. Signal Process., vol. 46, no. 5, pp. 1434-1438, May 1998.
2. C.-H. Lamarque and F. Robert, "Image analysis using space-filling curves and 1D wavelet bases," Pattern Recog., 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, Jul. 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. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, "Analysis of the clustering properties ofthe hilbert space-filling curve," IEEE Trans. Knowl. Data Eng., vol. 13, no. 1, pp. 124-141, Jan./Feb. 2001.
8. 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.
9. R. Niedermeier, K. Reinhardt, and P. Sanders, "Towards optimal locality in mesh-indexings," Discr. Appl. Math., vol. 117, pp. 211-237, 2002.
10. A. Lempel and J. Ziv, "Compression of two-dimensional data," IEEE Trans. Inf.. Theory, vol. IT-32, no. 1, pp. 2-8, Jan. 1986.
11. 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.
12. A. Cohen, N. Merhav, and T. Weissman, "Scanning and sequential decision making for multidimensional data - Part I: The noiseless case," IEEE Trans. Inf. Theory, vol. 53, no. 9, pp. 3001-3020, Sep. 2007.
13. A. Cohen, "Topics in Scanning of Multidimensional Data," Ph.D. dissertation, Technion-Israel Inst. Technol., Haifa, Israel, 2007.
14. T. Weissman, N. Merhav, and A. Somekh-Baruch, "Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 1849-1866, Jul. 2001.
15. 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.
16. T. Weissman and N. Merhav, "Universal prediction of random binary sequences in a noisy environment," Ann. Appl. Probab., vol. 14, no. 1, pp. 54-89, Feb. 2004.
17. T. E. Duncan, "On calculation of mutual information," SIAM J. Appl. Math., vol. 19, pp. 215-220, July 1970.
18. D. Guo, S. Shamai (Shitz), and S. Verdú, "Mutual information and minimum mean-square error in Gaussian channels," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1261-1282, Apr. 2005.
19. 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.
20. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú, and M. Weinberger, "Universal discrete denoising: Known channel," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 5-28, Jan. 2005.
21. E. Ordentlich and T. Weissman, "On the optimality of symbol-by-symbol filtering and denoising," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 19-40, Jan. 2006.
22. D. Guo, "Gaussian Channels: Information, Estimation and Multiuser Detection," Ph.D. dissertation, Princeton Univ., Princeton, NJ, 2004.
23. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
24. S. Verdú and T. Weissman, "The information lost in erasures," IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 5030-5058, Nov. 2008.
25. Y. Ephraim and N. Merhav, "Hidden Markov processes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1518-1569, Jun. 2002.
26. H. Helson and D. Lowdenslager, "Prediction theory and Fourier series in several variables," Acta Math., vol. 99, pp. 165-202, 1958.
27. A. Papoulis, Probability, Random Variables, and Stochastic Processes 2nd ed. New York: McGraw-Hill, 1984.
28. N. M. Blachman, "The convolution inequality for entropy powers," IEEE Trans. Inf. Theory, vol. IT-11, no. 2, pp. 267-271, Apr. 1965.
29. V. G. Vovk, "Aggregating strategies," in Proc. 3rd Annu. Workshop Computational Learning Theory, San Mateo, CA, 1990, pp. 372-383.