Professor Tsachy Weissman

Interests and Current Research

Research Interests

Information Theory

Statistical Signal Processing

Delay-Constrained and Complexity-Constrained Information Theory

Denoising, Filtering and Prediction

Tutorials

Recent Trends in Denoising

Workshops

Entropy of Hidden Markov Processes and Connections to Dynamical Systems

 Recent Sponsored Projects [link]

Some new lossy compression algorithms [link]

 

Doctoral Students

Additional Collaborators

Some Current Work

~Shannon Theory

T. Weissman, "The Relationship between Causal and Non-Causal Mismatched Estimation in Continuous-Time AWGN Channels," Submitted.

~Lossy Compression and Rate-Distortion Theory

~Denoising

~Communication, Channel Capacity, and Feedback

~Prediction, Learning, and Sequential Decision Making

~Entropy and Entropy Rate

Recent Talks


Doctoral Students

Current:

Shirin Jalali

Taesup Moon

Shahriyar Matloub 

Haim Permuter

Former:

Asaf Cohen (Postdoctoral fellow at Caltech)

George Gemelos (Director - Proprietary Trading,
FL Group
)

Styrmir Sigurjonsson (Portfolio Management - Straumur Investment Bank)

Kamakshi Sivaramakrishnan (Postdoctoral fellow -
HP Labs)

Rui Zhang (Assistant Professor - Institute for Infocomm Research (I²R)


Additional Collaborators


Some Current Work

Top of page

Lossy Compression and Rate-Distortion Theory

 Denoising

·         T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú and M. Weinberger, “Universal Discrete Denoising: Known Channel,” IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 5-28, January 2005.

·         A. Dembo and T. Weissman, “Universal Denoising for the Finite-Input- General-Output Channel”, IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1507-1517, April 2005.

·         R. Zhang and T. Weissman, “Discrete Denoising for Channels with Memory”, Comm. in Information and Systems, vol. 5, no. 2, pp. 257-288, 2005.

·         T. Weissman and E. Ordentlich, “The empirical distribution of rate-constrained codes”, IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 3718-3733, November 2005.

·         E. Ordentlich and T. Weissman, “On the Optimality of Symbol by Symbol Filtering and Denoising”, IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 19-40, January 2006.

·         G. Gemelos, S. Sigurjonsson and T. Weissman, “Algorithms for Discrete Denoising under Channel Uncertainty”, IEEE Trans. Signal Processing, vol. 54, no. 6, pp. 2263-2276, June 2006.

·         G. Gemelos, S. Sigurjonsson and T. Weissman, “Universal Minimax Discrete Denoising under Channel Uncertainty”, IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3476-3497, August 2006.

·         S. Pereira and T. Weissman, “Denoising and filtering under the probability of excess loss criterion”, IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1265 - 1281, April 2007.

·         T. Weissman, E. Ordentlich, M. Weinberger, A. Somekh-Baruch and N. Merhav, “Universal Filtering via Prediction”, IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1253 - 1264, April 2007.

·         E. Ordentlich, G. Seroussi, S. Verdú, M. Weinberger and T. Weissman, “Reflections on the DUDE”, IEEE Information Theory Society Newsletter, vol. 57, no. 2, pp. 5-10, June 2007 (invited).

·         T. Moon and T. Weissman, “Discrete Universal Filtering via Hidden Markov Modelling”, IEEE Trans. Inform. Theory, vol. 54, no. 2, pp. 692 – 708, February 2008.

·         T. Weissman, “How to filter an ‘individual sequence with feedback’,” IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3831–3841, August 2008.

·         K. Sivaramakrishnan and T. Weissman, “Universal denoising of discrete time continuous-amplitude signals,” accepted to IEEE Trans. Inform. Theory.

·         A. Cohen, T. Weissman and N. Merhav, “Scanning and sequential decision making for multi-dimensional data, Part II: the noisy case,” accepted to IEEE Trans. Inform. Theory.

·         S. Verdú and T. Weissman, “The Information Lost in Erasures,” accepted to IEEE Trans. Inform. Theory.

·         E. Ordentlich, M. Weinberger and T. Weissman, “Multi-Directional Context Sets with Applications to Universal Denoising and Compression,” Proc. Int. Symp. Inf. Th., p. 1270-1274, Adelaide, Australia, September 2005.

·         K. Sivaramakrishnan and T. Weissman, “Universal denoising of continuous valued signals with applications to images,” Proc. Int. Conf. Image Proc., Atlanta, Georgia, October 2006.

·         S. Jalali, S. Verdú and T. Weissman, “A Universal Wyner-Ziv Scheme for Discrete Sources,” Proc. Int. Symp. Information Theory, Nice, France, July 2007.

·         K. Sivaramakrishnan and T. Weissman, “A Context Quantization Approach to Universal Denoising,” Proc. Int. Symp. Information Theory, Nice, France, July 2007.

·         T. Moon and T. Weissman, “Competitive On-line Linear FIR MMSE Filtering,” Proc. Int. Symp. Information Theory, Nice, France, July 2007.

·         A. Cohen, N. Merhav and T. Weissman, “Scanning, Filtering, and Prediction for Random Fields Corrupted by Gaussian Noise,” Proc. Int. Symp. Information Theory, Nice, France, July 2007.

·         T. Moon and T. Weissman, “Discrete Denoising with Shifts,” Proc. 45th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, September 26 – 28th, 2007 (invited).

·         S. Jalali and T. Weissman, “Near Optimal Lossy Source Coding and Compression-Based Denoising via Markov Chain Monte Carlo,” Proc. 42nd Annu. Conf. on Information Sciences and Systems (CISS 2008), Princeton, NJ, March 19 – 21, 2008 (invited).

Top of Page

 Communication, Channel Capacity, and Feedback

 

Top of Page

Prediction, Learning, and Sequential Decision Making

·         E. Ordentlich and T. Weissman, “On the Optimality of Symbol by Symbol Filtering and Denoising”, IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 19-40, January 2006.

·         S. Matloub and T. Weissman, “Universal Zero-Delay Joint Source-Channel Coding”, IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5240 - 5250, December 2006.

·         S. Pereira and T. Weissman, “Denoising and filtering under the probability of excess loss criterion”, IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1265 - 1281, April 2007.

·         • T. Weissman, E. Ordentlich, M. Weinberger, A. Somekh-Baruch and N. Merhav, “Universal Filtering via Prediction”, IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1253 - 1264, April 2007.

·         A. Cohen, N. Merhav and T. Weissman, “Scanning and sequential decision making for multi-dimensional data, Part I: the noiseless case”, IEEE Trans. Inform. Theory, vol. 53, no. 9, pp. 3001 - 3020, September 2007.

·         T. Moon and T. Weissman, “Discrete Universal Filtering via Hidden Markov Modelling”, IEEE Trans. Inform. Theory, vol. 54, no. 2, pp. 692 – 708, February 2008.

·         T. Weissman, “How to filter an ‘individual sequence with feedback’,” IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3831–3841, August 2008.

·         A. Cohen, T. Weissman and N. Merhav, “Scanning and sequential decision making for multi-dimensional data, Part II: the noisy case,” accepted to IEEE Trans. Inform. Theory.

·         V. F. Farias, C. C. Moallemi, B. Van Roy and T. Weissman, “A Universal Scheme for Learning,” Proc. Int. Symp. Inf. Th., p. 1158–1162, Adelaide, Australia, September 2005.

·         T. Moon and T. Weissman, “Competitive On-line Linear FIR MMSE Filtering,” Proc. Int. Symp. Information Theory, Nice, France, July 2007.

·         H. Permuter, Y. H. Kim and T. Weissman, “On Directed Information and Gambling,” Proc. Int. Symp. Information Theory, Toronto, Ontario, Canada, July 2008.

Top of Page

 Entropy and Entropy Rate

·         E. Ordentlich and T. Weissman, “On the Optimality of Symbol by Symbol Filtering and Denoising”, IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 19-40, January 2006.

·         G. Gemelos and T. Weissman, “On the Entropy Rate of Pattern Processes”, IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 3994 - 4007, September 2006.

·         S. Verdú and T. Weissman, “The Information Lost in Erasures,” accepted to IEEE Trans. Inform. Theory.

·         E. Ordentlich and T. Weissman, “Approximations for the Entropy Rate of a Hidden Markov Process,” Proc. Int. Symp. Inf. Th., p. 2198–2202, Adelaide, Australia, September 2005.

·         C. Nair, E. Ordentlich and T. Weissman, “On asymptotic filtering and entropy rate for a hidden Markov process in the rare transitions regime,” Proc. Int. Symp. Inf. Th., p. 1838–1842, Adelaide, Australia, September 2005.


Recent Talks

* "On optimal filtering and entropy rate of a hidden Markov process ", Berkeley EECS dept.

* "Discrete Universal Filtering (Through Incremental Parsing)", Princeton EE dept. and Wharton school Statistics dept.

* "Universal Minimax Discrete Denoising under Channel Uncertainty", UCSD EECS dept.

* "New Bounds on the Entropy Rate of Hidden Markov Processes", ISL Colloquium, Stanford University.

* "Discrete Denoising for Channels with Memory", Stanford Statistics Seminar

* "On Coding with Feedback in presence of Side Information", Bay Area Signals, Information, and Control Symposium

* "Source Coding with Limited Side Information Lookahead at the Decoder", Princeton EE Dept. & at the Advanced Network Colloquium Series, University of Maryland


Back to Prof. Weissman's Home Page