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

Authors

14.3K

  1. BG
    Bernd Girod

    Stanford University, United States

    54 publications · 6.1K citations

    30

    h-index

  2. TW
    Thomas Wiegand

    Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute, Germany

    42 publications · 9.6K citations

    26

    h-index

  3. SW
    Shiqi Wang

    City University of Hong Kong, Hong Kong SAR China

    37 publications · 1.6K citations

    25

    h-index

  4. SM
    Siwei Ma

    Peking University, China

    37 publications · 2K citations

    24

    h-index

  5. FC
    Franck Cappello

    Argonne National Laboratory, United States

    31 publications · 2.2K citations

    23

    h-index

1–5 of 14.3K

Venues

  1. 85

    h-index

  2. IEEE Transactions on Information Theory

    192 publications · 26.2K citations

    67

    h-index

  3. IEEE Transactions on Image Processing

    254 publications · 15.7K citations

    64

    h-index

  4. arXiv (Cornell University)

    Repository · 252 publications · 21.1K citations

    59

    h-index

  5. IEEE Transactions on Multimedia

    119 publications · 5.8K citations

    40

    h-index

1–5