Multi-directional context sets with applications to universal denoising and compression

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1270-1274

  Ordentlich, Erik ^a   Weinberger, Marcelo J ^a   Weissman, Tsachy ^a,b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-TREE MODELS; DENOISING ALGORITHM; PRUNING ALGORITHMS;

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; DECISION MAKING; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

INFORMATION THEORY;

EID: 33749439327     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523546     Document Type: Conference Paper

References (8)

1. J. Rissanen, "A universal data compression system," IEEE Trans. Inform. Theory, vol. IT-29, pp. 656-664, Sept. 1983.
2. M. J. Weinberger, J. Rissanen, and M. Feder, "A universal finite memory source," IEEE Trans. Inform. Theory, vol. IT-41, pp. 643-652, May 1995.
3. R. Nohre, Some Topics in Descriptive Complexity. PhD thesis, Department of Computer Science, The Technical University of Linkoping, Sweden, 1994.
4. A. Martín, G. Seroussi, and M. J. Weinberger, "Linear time universal coding and time reversal of tree sources via FSM closure," IEEE Trans. Inform. Theory, vol. IT-50, pp. 1442-1468, July 2004.
5. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "Context weighting for general finite-context sources," IEEE Trans. Inform. Theory, vol. IT-42, pp. 1514-1520, Sept. 1996.
6. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú, and M. Weinberger, "Universal discrete denoising: Known channel," IEEE Trans. Inform. Theory, vol. IT-51, pp. 5-28, Jan. 2005.
7. E. Ordentlich, T. Weissman, M. J. Weinberger, A. Baruch-Somekh, and N. Merhav, "Discrete universal filtering through incremental parsing," Proceedings of the 2004 Data Compression Conference (DCC'04), pp. 352-361, Mar. 2004.
8. J. Yu and S. Verdü, "Schemes for bi-directional modeling of discrete stationary sources," 2005 Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, Md., Mar. 16, 2005.