Filters








816 Hits in 7.6 sec

An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources [article]

Shirin Jalali, Andrea Montanari, Tsachy Weissman
2009 arXiv   pre-print
We present a new lossy compressor for discrete sources. For coding a source sequence x^n, the encoder starts by assigning a certain cost to each reconstruction sequence.  ...  We identify a choice of coefficients for the linear combination in the cost function which ensures that the algorithm universally achieves the optimum rate-distortion performance of any Markov source in  ...  CONCLUSIONS AND CURRENT DIRECTIONS In this paper, a new method for universal fixed-slope lossy compression of discrete Markov sources was proposed.  ... 
arXiv:0901.2367v2 fatcat:qweqciecgfbsllzbeiezr7z7le

An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources

Shirin Jalali, Andrea Montanari, Tsachy Weissman
2009 2009 Data Compression Conference  
We present a new lossy compressor for discrete sources. For coding a source sequence x n , the encoder starts by assigning a certain cost to each reconstruction sequence.  ...  We identify a choice of coefficients for the linear combination in the cost function which ensures that the algorithm universally achieves the optimum rate-distortion performance of any Markov source in  ...  CONCLUSIONS AND CURRENT DIRECTIONS In this paper, a new method for universal fixed-slope lossy compression of discrete Markov sources was proposed.  ... 
doi:10.1109/dcc.2009.72 dblp:conf/dcc/JalaliMW09 fatcat:kiewlqxoyjbxdmhhnu552daefe

An iterative scheme for near optimal and universal lossy compression

Shirin Jalali, Andrea Montanari, Tsachy Weissman
2009 2009 IEEE Information Theory Workshop on Networking and Information Theory  
We present a new lossy compression algorithm for discrete sources.  ...  We identify a choice of coefficients for the linear combination in the cost function which ensures that the algorithm universally achieves the optimum rate-distortion performance of any Markov source in  ...  CONCLUSIONS AND CURRENT DIRECTIONS In this paper, a new method for universal fixed-slope lossy compression of discrete Markov sources was proposed.  ... 
doi:10.1109/itwnit.2009.5158577 dblp:conf/itw/JalaliMW09 fatcat:cty62gjrmjbx5pyjnhlmx5dgyi

Denoising via MCMC-Based Lossy Compression

Shirin Jalali, Tsachy Weissman
2012 IEEE Transactions on Signal Processing  
of denoisers that compares favorably (both theoretically and in practice) with other MCMCbased schemes, and with the Discrete Universal Denoiser (DUDE).  ...  It has been established in the literature, in various theoretical and asymptotic senses, that universal lossy compression followed by some simple post-processing results in universal denoising, for the  ...  In this paper, we show how combining the lossy compression algorithm proposed in [12] and the denoising approach of [6] leads to an implementable universal denoiser.  ... 
doi:10.1109/tsp.2012.2190597 fatcat:oezq4y74svexlbhbefkcl6wu2y

Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo

Shirin Jalali, Tsachy Weissman
2008 2008 42nd Annual Conference on Information Sciences and Systems  
We propose an implementable new universal lossy source coding algorithm.  ...  We prove that, for any stationary ergodic source, the algorithm achieves the optimal rate-distortion performance asymptotically in the limits of large number of iterations, β, and n.  ...  AN EXHAUSTIVE SEARCH SCHEME FOR FIXED-SLOPE COMPRESSION Consider the following scheme for lossy source coding at fixed slope s ≤ 0.  ... 
doi:10.1109/ciss.2008.4558567 dblp:conf/ciss/JalaliW08 fatcat:27pqhzocabeyrihutqsi3a5274

Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

C. Gioran, I. Kontoyiannis
2012 Problems of Information Transmission  
In particular, the HYB algorithm is shown to outperform existing schemes for the compression of some simple discrete sources with respect to the Hamming distortion criterion.  ...  Motivated, in part, by recent results of Gupta-Verdú-Weissman (GVW) and their underlying connections with the pattern-matching scheme of Kontoyiannis' lossy Lempel-Ziv algorithm, we introduce a non-universal  ...  The more recent work [23] on the lossy compression of discrete Markov sources also contains promising results; it is based on the combination of a Viterbi-like optimization algorithm at the encoder followed  ... 
doi:10.1134/s0032946012040072 fatcat:6qfecwhkcbh2hjjyhvf2rvbjpy

Lossy Compression in Near-Linear Time via Efficient Random Codebooks and Databases [article]

Chris Gioran, Ioannis Kontoyiannis
2009 arXiv   pre-print
In particular, the HYB algorithm is shown to outperform existing schemes for the compression of some simple discrete sources with respect to the Hamming distortion criterion.  ...  Motivated, in part, by recent results of Gupta-Verdú-Weissman (GVW) and their underlying connections with the pattern-matching scheme of Kontoyiannis' lossy Lempel-Ziv algorithm, we introduce a non-universal  ...  Acknowledgments We thank Sergio Verdú for sharing with us preprints of [18] and [19] .  ... 
arXiv:0904.3340v1 fatcat:3i4kvsv5wjhhllxn7kl63susgm

Block and Sliding-Block Lossy Compression via MCMC

Shirin Jalali, Tsachy Weissman
2012 IEEE Transactions on Communications  
We propose an approach to lossy compression of finite-alphabet sources that utilizes Markov chain Monte Carlo (MCMC) and simulated annealing methods.  ...  Inspired by the proposed block-coding algorithm, we also propose an algorithm for constructing sliding-block (SB) codes using similar ideas.  ...  AN EXHAUSTIVE SEARCH SCHEME FOR FIXED-SLOPE COMPRESSION Consider the following scheme for lossy source coding at a fixed slope α > 0.  ... 
doi:10.1109/tcomm.2012.061412.110194 fatcat:jxsrcqik7fatnhyb4i6gnf7deu

Detection of binary Markov sources over channels with additive Markov noise

F. Alajaji, N. Phamdo, N. Farvardin, T.E. Fuja
1996 IEEE Transactions on Information Theory  
These results are in the same spirit as previous results on MAP detection of Markov sources over discrete memoryless channels [31> [lOI.  ...  CONCLUSION In this correspondence, we considered the MAP detection problems (sequence and instantaneous) of a source with an inherent redundancy transmitted over a discrete channel with additive Markov  ...  A similar result is shown in the context of fixed distortion lossy source coding. Index Terms-Universal lossy data compression, Lempel-Ziv algorithm, stationary sources, individual sequences.  ... 
doi:10.1109/18.481793 fatcat:sytwlp3cgzggzjs6ixwojypize

Variable-rate trellis source encoding

En-hui Yang, Zhen Zhang
1999 IEEE Transactions on Information Theory  
With k = 8 and the number of states in the decoder = 256, the meansquared error encoding performance at the rates of a fraction of 1 bit/sample for highly dependent Gauss-Markov sources with correlation  ...  An alternating minimization algorithm for computing the quantity is presented; this algorithm is based on a training sequence and in turn gives rise to a design algorithm for variable-rate trellis source  ...  ACKNOWLEDGMENT The authors would like to thank one of referees for helpful comments which improved the presentation of the paper.  ... 
doi:10.1109/18.749005 fatcat:67io5f44yjdhjmrujhun47kphu

An MCMC Approach to Lossy Compression of Continuous Sources

Dror Baron, Tsachy Weissman
2010 2010 Data Compression Conference  
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on a finite reproduction  ...  Our algorithm asymptotically achieves the optimum rate distortion (RD) function universally for stationary ergodic continuous amplitude sources.  ...  An interesting approach for compressing continuous amplitude sources universally was offered by Yang and Zhang [19] , but their recommended algorithm relies on availability of a training sequence.  ... 
doi:10.1109/dcc.2010.11 dblp:conf/dcc/BaronW10 fatcat:cbg2gqghs5cspkxq2dmm74lwoa

Lossy source coding

T. Berger, J.D. Gibson
1998 IEEE Transactions on Information Theory  
We chronicle the development of rate-distortion theory and provide an overview of its influence on the practice of lossy source coding.  ...  Today, however, rate-distortion theoretic concepts are an important component of many lossy compression techniques and standards.  ...  This suggests it is unlikely that the "holy grail" of implementable universal lossy source coding will be discovered soon. VII.  ... 
doi:10.1109/18.720552 fatcat:ncecrqlz5beybaxodcipbcm3fq

Low-Complexity Compression Method for Hyperspectral Images Based on Distributed Source Coding

Xuzhou Pan, Rongke Liu, Xiaoqian Lv
2012 IEEE Geoscience and Remote Sensing Letters  
In this letter, we propose a low-complexity discrete cosine transform (DCT)-based distributed source coding (DSC) scheme for hyperspectral images.  ...  Index Terms-Auxiliary reconstruction, discrete cosine transform (DCT), distributed source coding (DSC), hyperspectral images.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers and the editors who helped to improve the quality of this letter.  ... 
doi:10.1109/lgrs.2011.2165271 fatcat:cdgqsqxgubhivc6p2uvuj6yzu4

Rate-distortion via Markov chain Monte Carlo

Shirin Jalali, Tsachy Weissman
2008 2008 IEEE International Symposium on Information Theory  
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC).  ...  (both theoretically and in practice) with other MCMC-based schemes, and with the Discrete Universal Denoiser (DUDE).  ...  AN EXHAUSTIVE SEARCH SCHEME FOR FIXED-SLOPE COMPRESSION Consider the following scheme for lossy source coding at fixed slope s ≤ 0.  ... 
doi:10.1109/isit.2008.4595107 dblp:conf/isit/JalaliW08 fatcat:azfoieixrjbjffqahvwp5llm6u

Lossy Compression of Discrete Sources via the Viterbi Algorithm

Shirin Jalali, Andrea Montanari, Tsachy Weissman
2012 IEEE Transactions on Information Theory  
We present a new lossy compressor for discrete-valued sources. For coding a sequence x^n, the encoder starts by assigning a certain cost to each possible reconstruction sequence.  ...  performance of any stationary ergodic source in the limit of large n, provided that k diverges as o( n).  ...  In a recent work [33] , a new implementable algorithm for fixed-slope lossy compression of finite-alphabet sources was proposed.  ... 
doi:10.1109/tit.2011.2178059 fatcat:dehaz3fq55evnift7fgdo43ydi
« Previous Showing results 1 — 15 out of 816 results