Marcelo J. Weinberger

IEEE Trans. Inf. Theory, 2015

One-to-one lossless codes in the variable input-length regime: Back to Kraft's inequality.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014

Universal Enumerative Coding for Tree Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

2013

Twice-Universal Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Universal variable to fixed-length random number generators for finite memory sources.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Twice-universal fixed to variable-length random number generators for finite memory sources.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Type Classes of Context Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Piecewise constant prediction.

[BibT_eX]

[DOI]

Yihong Wu

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

On Multi-Directional Context Sets.

[BibT_eX]

[DOI]

Cheng Chang

IEEE Trans. Inf. Theory, 2011

The iDUDE Framework for Grayscale Image Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2011

Energy-optimized lossless compression: Rate-variability tradeoff.

[BibT_eX]

[DOI]

Yihong Wu

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Deinterleaving Markov processes: The finite-memory switch case.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Twice-universal simulation of Markov sources and individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Minimax redundancy for large alphabets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Toward properties of twice-universality in denoising.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Efficient Algorithms for Constructing Optimal Bi-directional Context Sets.

[BibT_eX]

[DOI]

Fernando Fernandez

Alfredo Viola

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

Universal Simulation With Fidelity Criteria.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Deinterleaving Markov processes via penalized ML.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On concentration for denoiser-loss estimators.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Universal Delay-Limited Simulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Defect list compression.

[BibT_eX]

[DOI]

Giovanni Motta

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Enumerative coding for tree sources.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Universal Filtering Via Prediction.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

IEEE Trans. Inf. Theory, 2007

Type Classes of Tree Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Universal Simulation with a Fidelity Criterion.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Universal discrete denoising: known channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

A distribution dependent refinement of Pinsker's inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Addendum to "On Universal Simulation of Information Sources Using Training Data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

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

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The DUDE framework for continuous tone image denoising.

[BibT_eX]

[DOI]

Proceedings of the 2005 International Conference on Image Processing, 2005

2004

On universal simulation of information sources using training data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Linear time universal coding and time reversal of tree sources via FSM closure.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Efficient pruning of bi-directional context trees with applications to universal denoising and compression.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Channel decoding of systematically encoded unknown redundant sources.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Linear time universal coding of tree sources via FSM closure.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Discrete Universal Filtering Through Incremental Parsing.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

A discrete universal denoiser and its application to binary images.

[BibT_eX]

[DOI]

Sergio Verdú

Proceedings of the 2003 International Conference on Image Processing, 2003

2002

On delayed prediction of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

On sequential strategies for loss functions with memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Embedded block coding in JPEG 2000.

[BibT_eX]

[DOI]

David Taubman

Signal Process. Image Commun., 2002

Universal discrete denoising.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000

Coding of sources with two-sided geometric distributions and unknown parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Optimal prefix codes for sources with two-sided geometric distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS.

[BibT_eX]

[DOI]

Guillermo Sapiro

IEEE Trans. Image Process., 2000

Lossless compression of continuous-tone images.

[BibT_eX]

[DOI]

Bruno Carpentieri

Proc. IEEE, 2000

Embedded Block Coding in JPEG 2000.

[BibT_eX]

[DOI]

Ikuro Ueno

Fumitaka Ono

Proceedings of the 2000 International Conference on Image Processing, 2000

On-Line Decision Making for a Class of Loss Functions via Lempel-Ziv Parsing.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

1999

From LOCO-I to the JPEG-LS Standard.

[BibT_eX]

[DOI]

Guillermo Sapiro

Proceedings of the 1999 International Conference on Image Processing, 1999

Memory Efficient Scalable Line-based Image Coding.

[BibT_eX]

[DOI]

David Taubman

Michael W. Marcellin

Proceedings of the Data Compression Conference, 1999

1998

A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

Sequential prediction and ranking in universal context modeling and data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

On Adaptive Strategies for an Extended Family of Golomb-type Codes.

[BibT_eX]

[DOI]

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996

Applications of universal context modeling to lossless compression of gray-scale images.

[BibT_eX]

[DOI]

Jorma Rissanen

Ronald Arps

IEEE Trans. Image Process., 1996

Modeling and low-complexity adaptive coding for image prediction residuals.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm.

[BibT_eX]

[DOI]

Guillermo Sapiro

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

A universal finite memory source.

[BibT_eX]

[DOI]

Jorma Rissanen

Meir Feder

IEEE Trans. Inf. Theory, 1995

1994

Optimal sequential probability assignment for individual sequences.

[BibT_eX]

[DOI]

Meir Feder

IEEE Trans. Inf. Theory, 1994

1992

On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

A sequential algorithm for the universal coding of finite memory sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm.

[BibT_eX]

[DOI]

Eli Plotnik

IEEE Trans. Inf. Theory, 1992

On the Coding Delay of a General Coder.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

1990

Factorization of symmetric circulant matrices in finite fields.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1988

Self-Complementary Normal Bases in Finite Fields.

[BibT_eX]

[DOI]