Lossy Data Compression
Lossy Data Compression is a form of source coding in information theory that encodes data into a representation with fewer bits than the original by allowing irreversible loss of information, such that the reconstructed data satisfies prescribed fidelity or distortion constraints.
7.3K
Publications
397.8K
Citations
14.3K
Authors
2.7K
Institutions
Publications per year
2017–2026
2K
7.3K
An Algorithm for Vector Quantizer Design
Y. Linde, A. Buzo, Robert M. Gray · IEEE Transactions on Communications · 1980 · 7.2K citations
Compressive Sensing [Lecture Notes]
Richard G. Baraniuk · IEEE Signal Processing Magazine · 2007 · 4.2K citations
1–5 of 7.3K
14.3K
30
h-index
Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute, Germany
42 publications · 9.6K citations
26
h-index
25
h-index
24
h-index
23
h-index
1–5 of 14.3K
2.7K
Stanford University
Stanford, United States
45 h-index
260 publications
29.8K citations

Peking University
Beijing, China
43 h-index
339 publications
14.2K citations
Princeton University
Princeton, United States
41 h-index
155 publications
12.1K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
41 h-index
212 publications
11.8K citations
University of Science and Technology of China
Hefei, China
39 h-index
257 publications
14.4K citations
University of Southern California
Los Angeles, United States
39 h-index
170 publications
9.3K citations
Nanyang Technological University
Singapore, Singapore
36 h-index
199 publications
9.1K citations
AT&T (United States)
Bedminster, United States
36 h-index
108 publications
11K citations
1–8 of 2.7K
360 publications · 43.3K citations
85
h-index
192 publications · 26.2K citations
67
h-index
254 publications · 15.7K citations
64
h-index
Repository · 252 publications · 21.1K citations
59
h-index
119 publications · 5.8K citations
40
h-index
1–5