Results 251 to 260 of about 85,769 (303)
Some of the next articles are maybe not open access.

Related searches:

Compressive sensing: To compress or not to compress

2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011
In this paper, we consider the compressive sensing scheme from the information theory point of view and derive the lower bound of the probability of error for CS when length N of the information vector is large. The result has been shown that, for an i.i.d.
Davis Kirachaiwanich, Qilian Liang
openaire   +1 more source

To compress or not to compress?

Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference, 2002
For practical communications which transmit finite blocks of source data over noisy channels, we question the common practice to compress (C) the source and then to add redundancy for error control. Rather we exploit the redundancy of the non-compressed source (NC) at the channel decoder by source-controlled channel-decoding. For a simple binary Markov
G. Buch   +3 more
openaire   +1 more source

Compressed sensing of compressible signals

2017 IEEE International Symposium on Information Theory (ISIT), 2017
A novel low-complexity robust-to-noise iterative algorithm named compression-based gradient descent (C-GD) algorithm is proposed. C-GD is a generic compressed sensing recovery algorithm, that at its core, employs compression codes, such as JPEG2000 and MPEG4.
Sajjad Beygi   +3 more
openaire   +2 more sources

Compressive Sampling and Lossy Compression

IEEE Signal Processing Magazine, 2008
Recent results in compressive sampling have shown that sparse signals can be recovered from a small number of random measurements. This property raises the question of whether random measurements can provide an efficient representation of sparse signals in an information-theoretic sense.
Vivek K. Goyal   +2 more
openaire   +2 more sources

High compression ratio image compression

1993 IEEE International Symposium on Circuits and Systems, 2002
An image compression method is proposed. It makes use of the wavelet transform (WT) with better frequency localization and the adaptive hierarchical vector quantization (AHVQ) technique. The WT provides a multifrequency channel representation for the image from which proper coding methods can be drawn.
Sheng Zhong, Qing-Yun Shi, Min-Teh Cheng
openaire   +2 more sources

Compression and Ranking

SIAM Journal on Computing, 1985
A complexity-theoretic approach to the classical data compression problem is presented. A notion of language compressibility is defined, and it is shown that essentially all strings in a sufficiently sparse “easy” (e.g., polynomial-time) language can be compressed efficiently. A notion of ranking as a form of optimal compression is also defined, and it
Andrew V. Goldberg, Michael Sipser
openaire   +3 more sources

Home - About - Disclaimer - Privacy