# Image compression

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Image_compression
> Markdown URL: https://mediated.wiki/source/Image_compression.md
> Source: https://en.wikipedia.org/wiki/Image_compression
> Source revision: 1354396884
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

Reduction of image size to save storage and transmission costs

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (April 2010) (Learn how and when to remove this message)

**Image compression** is a type of [data compression](/source/Data_compression) applied to [digital images](/source/Digital_image), to reduce their cost for [storage](/source/Computer_data_storage) or [transmission](/source/Data_transmission). [Algorithms](/source/Algorithm) may take advantage of [visual perception](/source/Visual_perception) and the [statistical](/source/Statistical) properties of image data to provide superior results compared with generic [data compression](/source/Data_compression) methods which are used for other digital data.[1]

Comparison of [JPEG](/source/JPEG) images saved by Adobe Photoshop at different quality levels and with or without "save for web"

## Lossy and lossless image compression

Image compression may be [lossy](/source/Lossy_compression) or [lossless](/source/Lossless_compression). Lossless compression is preferred for archival purposes and often for medical imaging, technical drawings, [clip art](/source/Clip_art), or comics. Lossy compression methods, especially when used at low [bit rates](/source/Bit_rate), introduce [compression artifacts](/source/Compression_artifact). Lossy methods are especially suitable for natural images such as photographs in applications where minor (sometimes imperceptible) loss of fidelity is acceptable to achieve a substantial reduction in bit rate. Lossy compression that produces negligible differences may be called visually lossless.

Methods for [lossy compression](/source/Lossy_compression):

- [Transform coding](/source/Transform_coding) – This is the most commonly used method. - [Discrete Cosine Transform](/source/Discrete_Cosine_Transform) (DCT) – The most widely used form of lossy compression. It is a type of [Fourier-related transform](/source/List_of_Fourier-related_transforms), and was originally developed by [Nasir Ahmed](/source/N._Ahmed), T. Natarajan and [K. R. Rao](/source/K._R._Rao) in 1974.[2] The DCT is sometimes referred to as "DCT-II" in the context of a family of discrete cosine transforms (see [discrete cosine transform](/source/Discrete_cosine_transform)). It is generally the most efficient form of image compression. - DCT is used in [JPEG](/source/JPEG), the most popular lossy format, and the more recent [HEIF](/source/HEIF). - The more recently developed [wavelet transform](/source/Wavelet_transform) is also used extensively, followed by [quantization](/source/Quantization_(image_processing)) and [entropy coding](/source/Entropy_coding).

- [Color quantization](/source/Color_quantization) - Reducing the [color space](/source/Color_space_encoding) to a few "representative" colors in the image. The selected colors are specified in the color [palette](/source/Palette_(computing)) in the header of the compressed image. Each pixel just references the index of a color in the color palette. This method can be combined with [dithering](/source/Dithering) to avoid [posterization](/source/Posterization). - Whole-image palette, typically 256 colors, used in GIF and PNG file formats. - block palette, typically 2 or 4 colors for each block of 4x4 pixels, used in [BTC](/source/Block_Truncation_Coding), [CCC](/source/Color_Cell_Compression), [S2TC](/source/S2TC), and [S3TC](/source/S3_Texture_Compression).

- [Chroma subsampling](/source/Chroma_subsampling). This takes advantage of the fact that the human eye perceives spatial changes of brightness more sharply than those of color, by averaging or dropping some of the chrominance information in the image.

- [Fractal compression](/source/Fractal_compression).

- More recently, methods based on [Machine Learning](/source/Machine_Learning) were applied, using [Multilayer perceptrons](/source/Multilayer_perceptron), [Convolutional neural networks](/source/Convolutional_neural_network), [Generative adversarial networks](/source/Generative_adversarial_network)[3] and [Diffusion models](/source/Diffusion_model).[4] Implementations are available in [OpenCV](/source/OpenCV), [TensorFlow](/source/TensorFlow), [MATLAB](/source/MATLAB)'s Image Processing Toolbox (IPT), and the High-Fidelity Generative Image Compression (HiFiC) open source project.[5]

Methods for [lossless compression](/source/Lossless_compression):

- [Run-length encoding](/source/Run-length_encoding) – used in default method in [PCX](/source/PCX) and as one of possible in [BMP](/source/BMP_file_format), [TGA](/source/.tga), [TIFF](/source/TIFF)

- Predictive coding – used in [DPCM](/source/DPCM)

- [Entropy encoding](/source/Entropy_encoding) – the two most common entropy encoding techniques are [arithmetic coding](/source/Arithmetic_coding) and [Huffman coding](/source/Huffman_coding)

- Adaptive dictionary algorithms such as [LZW](/source/LZW) – used in [GIF](/source/Graphics_Interchange_Format) and [TIFF](/source/TIFF)

- [DEFLATE](/source/DEFLATE) – used in [PNG](/source/Portable_Network_Graphics), [MNG](/source/Multiple-image_Network_Graphics), and [TIFF](/source/TIFF)

- [Chain codes](/source/Chain_code)

## Other properties

The best image quality at a given compression rate (or [bit rate](/source/Bit_rate)) is the main goal of image compression, however, there are other important properties of image compression schemes:

**Scalability** generally refers to a quality reduction achieved by manipulation of the bitstream or file (without decompression and re-compression). Other names for scalability are *progressive coding* or *embedded bitstreams*. Despite its contrary nature, scalability also may be found in lossless codecs, usually in form of coarse-to-fine pixel scans. Scalability is especially useful for previewing images while downloading them (e.g., in a web browser) or for providing variable quality access to e.g., databases. There are several types of scalability:

- **Quality progressive** or layer progressive: The bitstream successively refines the reconstructed image.

- **Resolution progressive**: First encode a lower image resolution; then encode the difference to higher resolutions.[6][7]

- **Component progressive**: First encode grey-scale version; then adding full color.

**Region of interest coding**. Certain parts of the image are encoded with higher quality than others. This may be combined with scalability (encode these parts first, others later).

**Meta information**. Compressed data may contain information about the image which may be used to categorize, search, or browse images. Such information may include color and texture statistics, small [preview](/source/Preview_(computing)) images, and author or copyright information.

**Processing power**. Compression algorithms require different amounts of [processing power](/source/Processing_power) to encode and decode. Some high compression algorithms require high processing power.

The quality of a compression method often is measured by the [peak signal-to-noise ratio](/source/Peak_signal-to-noise_ratio). It measures the amount of noise introduced through a lossy compression of the image, however, the subjective judgment of the viewer also is regarded as an important measure, perhaps, being the most important measure.

## History

[Entropy coding](/source/Entropy_coding) started in the late 1940s with the introduction of [Shannon–Fano coding](/source/Shannon%E2%80%93Fano_coding),[8] the basis for [Huffman coding](/source/Huffman_coding) which was published in 1952.[9] [Transform coding](/source/Transform_coding) dates back to the late 1960s, with the introduction of [fast Fourier transform](/source/Fast_Fourier_transform) (FFT) coding in 1968 and the [Hadamard transform](/source/Hadamard_transform) in 1969.[10]

An important development in image [data compression](/source/Data_compression) was the [discrete cosine transform](/source/Discrete_cosine_transform) (DCT), a [lossy compression](/source/Lossy_compression) technique first proposed by [Nasir Ahmed](/source/N._Ahmed), T. Natarajan and [K. R. Rao](/source/K._R._Rao) in 1973.[11] [JPEG](/source/JPEG) was introduced by the [Joint Photographic Experts Group](/source/Joint_Photographic_Experts_Group) (JPEG) in 1992.[12] JPEG compresses images down to much smaller file sizes, and has become the most widely used [image file format](/source/Image_file_format).[13] JPEG was largely responsible for the wide proliferation of [digital images](/source/Digital_images) and [digital photos](/source/Digital_photo),[14] with several billion JPEG images produced every day as of 2015.[15]

[Lempel–Ziv–Welch](/source/Lempel%E2%80%93Ziv%E2%80%93Welch) (LZW) is a [lossless compression](/source/Lossless_compression) algorithm developed by [Abraham Lempel](/source/Abraham_Lempel), [Jacob Ziv](/source/Jacob_Ziv) and [Terry Welch](/source/Terry_Welch) in 1984. It is used in the [GIF](/source/GIF) format, introduced in 1987.[16] [DEFLATE](/source/DEFLATE), a lossless compression algorithm developed by [Phil Katz](/source/Phil_Katz) and specified in 1996, is used in the [Portable Network Graphics](/source/Portable_Network_Graphics) (PNG) format.[17]

The [JPEG 2000](/source/JPEG_2000) standard was developed from 1997 to 2000 by a JPEG committee chaired by Touradj Ebrahimi (later the JPEG president).[18] In contrast to the DCT algorithm used by the original JPEG format, JPEG 2000 instead uses [discrete wavelet transform](/source/Discrete_wavelet_transform) (DWT) algorithms. It uses the [CDF](/source/Cohen-Daubechies-Feauveau_wavelet) 9/7 wavelet transform (developed by [Ingrid Daubechies](/source/Ingrid_Daubechies) in 1992) for its lossy compression algorithm,[19] and the Le Gall–Tabatabai (LGT) 5/3 wavelet transform[20][21] (developed by Didier Le Gall and Ali J. Tabatabai in 1988)[22] for its lossless compression algorithm.[19] [JPEG 2000](/source/JPEG_2000) technology, which includes the [Motion JPEG 2000](/source/Motion_JPEG_2000) extension, was selected as the [video coding standard](/source/Video_coding_standard) for [digital cinema](/source/Digital_cinema) in 2004.[23]

## Notes and references

1. **[^](#cite_ref-1)** ["Image Data Compression"](http://user.engineering.uiowa.edu/~dip/lecture/DataCompression.html).

1. **[^](#cite_ref-2)** Ahmed, N.; Natarajan, T.; Rao, K.R. (1974). ["Discrete Cosine Transform"](https://web.archive.org/web/20111125071212/http://dasan.sejong.ac.kr/~dihan/dip/p5_DCT.pdf) (PDF). *IEEE Transactions on Computers*. **100** (1): 90–93. [Bibcode](/source/Bibcode_(identifier)):[1974ITCmp.100...90A](https://ui.adsabs.harvard.edu/abs/1974ITCmp.100...90A). [doi](/source/Doi_(identifier)):[10.1109/T-C.1974.223784](https://doi.org/10.1109%2FT-C.1974.223784). [S2CID](/source/S2CID_(identifier)) [149806273](https://api.semanticscholar.org/CorpusID:149806273). Archived from [the original](http://dasan.sejong.ac.kr/~dihan/dip/p5_DCT.pdf) (PDF) on 2011-11-25.

1. **[^](#cite_ref-3)** Gilad David Maayan (Nov 24, 2021). ["AI-Based Image Compression: The State of the Art"](https://web.archive.org/web/20211125163417/https://towardsdatascience.com/ai-based-image-compression-the-state-of-the-art-fb5aa6042bfa). *Towards Data Science*. Archived from [the original](https://towardsdatascience.com/ai-based-image-compression-the-state-of-the-art-fb5aa6042bfa) on 25 November 2021. Retrieved 6 April 2023.

1. **[^](#cite_ref-4)** Bühlmann, Matthias (2022-09-28). ["Stable Diffusion Based Image Compression"](https://pub.towardsai.net/stable-diffusion-based-image-compresssion-6f1f0a399202). *Medium*. Retrieved 2022-11-02.

1. **[^](#cite_ref-5)** ["High-Fidelity Generative Image Compression"](https://hific.github.io/). Retrieved 6 April 2023.

1. **[^](#cite_ref-6)** Burt, P.; Adelson, E. (1 April 1983). "The Laplacian Pyramid as a Compact Image Code". *IEEE Transactions on Communications*. **31** (4): 532–540. [Bibcode](/source/Bibcode_(identifier)):[1983ITCom..31..532B](https://ui.adsabs.harvard.edu/abs/1983ITCom..31..532B). [CiteSeerX](/source/CiteSeerX_(identifier)) [10.1.1.54.299](https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.299). [doi](/source/Doi_(identifier)):[10.1109/TCOM.1983.1095851](https://doi.org/10.1109%2FTCOM.1983.1095851). [S2CID](/source/S2CID_(identifier)) [8018433](https://api.semanticscholar.org/CorpusID:8018433).

1. **[^](#cite_ref-7)** Shao, Dan; Kropatsch, Walter G. (February 3–5, 2010). Špaček, Libor; Franc, Vojtěch (eds.). ["Irregular Laplacian Graph Pyramid"](http://www.prip.tuwien.ac.at/twist/docs/irregularLaplacian.pdf) (PDF). *Computer Vision Winter Workshop 2010*. Nové Hrady, Czech Republic: Czech Pattern Recognition Society. [Archived](https://web.archive.org/web/20130527045502/http://www.prip.tuwien.ac.at/twist/docs/irregularLaplacian.pdf) (PDF) from the original on 2013-05-27.

1. **[^](#cite_ref-Shannon_8-0)** [Claude Elwood Shannon](/source/Claude_Elwood_Shannon) (1948). Alcatel-Lucent (ed.). ["A Mathematical Theory of Communication"](http://www.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf) (PDF). *Bell System Technical Journal*. **27** (3–4): 379–423, 623–656. [Bibcode](/source/Bibcode_(identifier)):[1948BSTJ...27..379S](https://ui.adsabs.harvard.edu/abs/1948BSTJ...27..379S). [doi](/source/Doi_(identifier)):[10.1002/j.1538-7305.1948.tb01338.x](https://doi.org/10.1002%2Fj.1538-7305.1948.tb01338.x). [hdl](/source/Hdl_(identifier)):[11858/00-001M-0000-002C-4314-2](https://hdl.handle.net/11858%2F00-001M-0000-002C-4314-2). [Archived](https://web.archive.org/web/20110524064232/http://math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf) (PDF) from the original on 2011-05-24. Retrieved 2019-04-21.

1. **[^](#cite_ref-Huffman_9-0)** [David Albert Huffman](/source/David_Albert_Huffman) (September 1952), ["A method for the construction of minimum-redundancy codes"](http://compression.ru/download/articles/huff/huffman_1952_minimum-redundancy-codes.pdf) (PDF), *[Proceedings of the IRE](/source/Proceedings_of_the_IRE)*, vol. 40, no. 9, pp. 1098–1101, [Bibcode](/source/Bibcode_(identifier)):[1952PIRE...40.1098H](https://ui.adsabs.harvard.edu/abs/1952PIRE...40.1098H), [doi](/source/Doi_(identifier)):[10.1109/JRPROC.1952.273898](https://doi.org/10.1109%2FJRPROC.1952.273898), [archived](https://web.archive.org/web/20051008115257/http://compression.ru/download/articles/huff/huffman_1952_minimum-redundancy-codes.pdf) (PDF) from the original on 2005-10-08

1. **[^](#cite_ref-Hadamard_10-0)** Pratt, W.K.; Kane, J.; Andrews, H.C. (1969). "Hadamard transform image coding". *Proceedings of the IEEE*. **57** (1): 58–68. [Bibcode](/source/Bibcode_(identifier)):[1969IEEEP..57...58P](https://ui.adsabs.harvard.edu/abs/1969IEEEP..57...58P). [doi](/source/Doi_(identifier)):[10.1109/PROC.1969.6869](https://doi.org/10.1109%2FPROC.1969.6869).

1. **[^](#cite_ref-Ahmed_11-0)** [Ahmed, Nasir](/source/N._Ahmed) (January 1991). ["How I Came Up With the Discrete Cosine Transform"](https://www.scribd.com/doc/52879771/DCT-History-How-I-Came-Up-with-the-Discrete-Cosine-Transform). *[Digital Signal Processing](/source/Digital_Signal_Processing_(journal))*. **1** (1): 4–5. [Bibcode](/source/Bibcode_(identifier)):[1991DSP.....1....4A](https://ui.adsabs.harvard.edu/abs/1991DSP.....1....4A). [doi](/source/Doi_(identifier)):[10.1016/1051-2004(91)90086-Z](https://doi.org/10.1016%2F1051-2004%2891%2990086-Z).

1. **[^](#cite_ref-t81_12-0)** ["T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES"](https://www.w3.org/Graphics/JPEG/itu-t81.pdf) (PDF). [CCITT](/source/CCITT). September 1992. [Archived](https://web.archive.org/web/20000818020219/http://www.w3.org/Graphics/JPEG/itu-t81.pdf) (PDF) from the original on 2000-08-18. Retrieved 12 July 2019.

1. **[^](#cite_ref-13)** ["The JPEG image format explained"](https://home.bt.com/tech-gadgets/photography/what-is-a-jpeg-11364206889349). *[BT.com](/source/BT.com)*. [BT Group](/source/BT_Group). 31 May 2018. Retrieved 5 August 2019.

1. **[^](#cite_ref-Atlantic_14-0)** ["What Is a JPEG? The Invisible Object You See Every Day"](https://www.theatlantic.com/technology/archive/2013/09/what-is-a-jpeg-the-invisible-object-you-see-every-day/279954/). *[The Atlantic](/source/The_Atlantic)*. 24 September 2013. Retrieved 13 September 2019.

1. **[^](#cite_ref-15)** Baraniuk, Chris (15 October 2015). ["Copy protections could come to JPEGs"](https://www.bbc.co.uk/news/technology-34538705). *[BBC News](/source/BBC_News)*. [BBC](/source/BBC). Retrieved 13 September 2019.

1. **[^](#cite_ref-cloanto_16-0)** ["The GIF Controversy: A Software Developer's Perspective"](https://mike.pub/19950127-gif-lzw). 27 January 1995. Retrieved 26 May 2015.

1. **[^](#cite_ref-IETF_17-0)** [L. Peter Deutsch](/source/L._Peter_Deutsch) (May 1996). [*DEFLATE Compressed Data Format Specification version 1.3*](https://www.rfc-editor.org/rfc/rfc1951#section-Abstract). [IETF](/source/Internet_Engineering_Task_Force). p. 1. sec. Abstract. [doi](/source/Doi_(identifier)):[10.17487/RFC1951](https://doi.org/10.17487%2FRFC1951). [RFC](/source/Request_for_Comments) [1951](https://datatracker.ietf.org/doc/html/rfc1951). Retrieved 2014-04-23.

1. **[^](#cite_ref-18)** Taubman, David; Marcellin, Michael (2012). [*JPEG2000 Image Compression Fundamentals, Standards and Practice: Image Compression Fundamentals, Standards and Practice*](https://books.google.com/books?id=y7HeBwAAQBAJ&pg=PA402). [Springer Science & Business Media](/source/Springer_Science_%26_Business_Media). [ISBN](/source/ISBN_(identifier)) [9781461507994](https://en.wikipedia.org/wiki/Special:BookSources/9781461507994).

1. ^ [***a***](#cite_ref-Unser_19-0) [***b***](#cite_ref-Unser_19-1) Unser, M.; Blu, T. (2003). ["Mathematical properties of the JPEG2000 wavelet filters"](https://web.archive.org/web/20191013222932/https://pdfs.semanticscholar.org/6ed4/dece8b364416d9c390ba53df913bca7fb9a6.pdf) (PDF). *IEEE Transactions on Image Processing*. **12** (9): 1080–1090. [Bibcode](/source/Bibcode_(identifier)):[2003ITIP...12.1080U](https://ui.adsabs.harvard.edu/abs/2003ITIP...12.1080U). [doi](/source/Doi_(identifier)):[10.1109/TIP.2003.812329](https://doi.org/10.1109%2FTIP.2003.812329). [PMID](/source/PMID_(identifier)) [18237979](https://pubmed.ncbi.nlm.nih.gov/18237979). [S2CID](/source/S2CID_(identifier)) [2765169](https://api.semanticscholar.org/CorpusID:2765169). Archived from [the original](https://pdfs.semanticscholar.org/6ed4/dece8b364416d9c390ba53df913bca7fb9a6.pdf) (PDF) on 2019-10-13.

1. **[^](#cite_ref-20)** Sullivan, Gary (8–12 December 2003). ["General characteristics and design considerations for temporal subband video coding"](https://www.itu.int/wftp3/av-arch/video-site/0312_Wai/VCEG-U06.doc). *[ITU-T](/source/ITU-T)*. [Video Coding Experts Group](/source/Video_Coding_Experts_Group). Retrieved 13 September 2019.

1. **[^](#cite_ref-21)** Bovik, Alan C. (2009). [*The Essential Guide to Video Processing*](https://books.google.com/books?id=wXmSPPB_c_0C&pg=PA355). [Academic Press](/source/Academic_Press). p. 355. [ISBN](/source/ISBN_(identifier)) [9780080922508](https://en.wikipedia.org/wiki/Special:BookSources/9780080922508).

1. **[^](#cite_ref-22)** Le Gall, Didier; Tabatabai, Ali J. (1988). "Sub-band coding of digital images using symmetric short kernel filters and arithmetic coding techniques". *ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing*. pp. 761–764 vol.2. [doi](/source/Doi_(identifier)):[10.1109/ICASSP.1988.196696](https://doi.org/10.1109%2FICASSP.1988.196696). [S2CID](/source/S2CID_(identifier)) [109186495](https://api.semanticscholar.org/CorpusID:109186495).

1. **[^](#cite_ref-23)** Swartz, Charles S. (2005). [*Understanding Digital Cinema: A Professional Handbook*](https://books.google.com/books?id=tYw3ehoBnjkC&pg=PA147). [Taylor & Francis](/source/Taylor_%26_Francis). p. 147. [ISBN](/source/ISBN_(identifier)) [9780240806174](https://en.wikipedia.org/wiki/Special:BookSources/9780240806174).

v t e Data compression methods Lossless type Entropy Adaptive coding Arithmetic Asymmetric numeral systems Golomb Huffman Adaptive Canonical Modified Range Shannon Shannon–Fano Shannon–Fano–Elias Tunstall Unary Universal Exp-Golomb Fibonacci Gamma Levenshtein Dictionary Byte-pair encoding Lempel–Ziv 842 LZ4 LZJB LZO LZRW LZSS LZW LZWL Snappy Other BWT CTW CM Delta Incremental DMC DPCM Grammar Re-Pair Sequitur LDCT MTF PAQ PPM RLE Hybrid LZ77 + Huffman Deflate LZX LZS LZ77 + ANS LZFSE LZ77 + Huffman + ANS Zstandard LZ77 + Huffman + context Brotli LZSS + Huffman LHA/LZH LZ77 + Range LZMA LZHAM RLE + BWT + MTF + Huffman bzip2 Lossy type Transform Discrete cosine transform DCT MDCT DST FFT Wavelet Daubechies DWT SPIHT Predictive DPCM ADPCM LPC ACELP CELP LAR LSP WLPC Motion Compensation Estimation Vector Psychoacoustic Audio Concepts Bit rate ABR CBR VBR Companding Convolution Dynamic range Latency Nyquist–Shannon theorem Sampling Silence compression Sound quality Speech coding Sub-band coding Codec parts A-law μ-law DPCM ADPCM DM FT FFT LPC ACELP CELP LAR LSP WLPC MDCT Psychoacoustic model Image Concepts Chroma subsampling Coding tree unit Color space Compression artifact Image resolution Macroblock Pixel PSNR Quantization Standard test image Texture compression Methods Chain code DCT Deflate Fractal KLT LP RLE Wavelet Daubechies DWT EZW SPIHT Video Concepts Bit rate ABR CBR VBR Display resolution Frame Frame rate Frame types Interlace Video characteristics Video quality Codec parts DCT DPCM Deblocking filter Lapped transform Motion Compensation Estimation Vector Wavelet Daubechies DWT Theory Compressed data structures Compressed suffix array FM-index Entropy Information theory Timeline Kolmogorov complexity Prefix code Quantization Rate–distortion Redundancy Symmetry Smallest grammar problem Community Hutter Prize People Mark Adler David A. Huffman Phil Katz

v t e Multimedia compression and container formats Video compression ISO, IEC, MPEG DV MJPEG Motion JPEG 2000 MPEG-1 MPEG-2 Part 2 MPEG-4 Part 2 / ASP Part 10 / AVC Part 33 / IVC MPEG-H Part 2 / HEVC MPEG-I Part 3 / VVC MPEG-5 Part 1 / EVC Part 2 / LCEVC ITU-T, VCEG H.120 H.261 H.262 H.263 H.264 / AVC H.265 / HEVC H.266 / VVC H.267 / Enhanced Compression Model SMPTE VC-1 VC-2 VC-3 VC-5 VC-6 TrueMotion and AOMedia TrueMotion S VP3 VP6 VP7 VP8 VP9 AV1 AV2 Chinese Standard AVS1 P2/AVS+ (GB/T 20090.2/16) AVS2 P2 (GB/T 33475.2,GY/T 299.1) HDR Vivid (GY/T 358) AVS3 P2 (GY/T 368) Others Apple Video AVS Bink Cinepak Daala DVI FFV1 Huffyuv Indeo Lagarith Microsoft Video 1 MSU Lossless OMS Video Pixlet ProRes 422 4444 QuickTime Animation Graphics RealVideo RTVideo SheerVideo Smacker Sorenson Video/Spark Theora Thor Ut WMV XEB YULS Audio compression ISO, IEC, MPEG MPEG-1 Layer II Multichannel MPEG-1 Layer I MPEG-1 Layer III (MP3) AAC HE-AAC AAC-LD MPEG Surround MPEG-4 ALS MPEG-4 SLS MPEG-4 DST MPEG-4 HVXC MPEG-4 CELP MPEG-D USAC MPEG-H 3D Audio ITU-T G.711 A-law µ-law G.718 G.719 G.722 G.722.1 G.722.2 G.723 G.723.1 G.726 G.728 G.729 G.729.1 IETF Opus iLBC Speex Vorbis FLAC 3GPP AMR AMR-WB AMR-WB+ EVRC EVRC-B EVS GSM-HR GSM-FR GSM-EFR ETSI AC-3 AC-4 DTS Bluetooth SIG SBC LC3 Chinese Standard AVS1 P10 (GB/T 20090.10) AVS2 P3 (GB/T 33475.3) Audio Vivid (GY/T 363) DRA (GB/T 22726) ExAC (SJ/T 11299.4) Others ACELP ALAC Asao ATRAC CELT Codec 2 iSAC Lyra MELP Monkey's Audio MT9 Musepack OptimFROG OSQ QCELP RCELP RealAudio SD2 SHN SILK Siren SMV SVOPC TTA True Audio TwinVQ VMR-WB VSELP WavPack WMA MQA aptX aptX HD aptX Low Latency aptX Adaptive LDAC LHDC LLAC TrueHD Image compression IEC, ISO, IETF, W3C, ITU-T, JPEG CCITT Group 4 GIF HEIC / HEIF HEVC JBIG JBIG2 JPEG JPEG 2000 JPEG-LS JPEG XL JPEG XR JPEG XS JPEG XT PNG APNG TIFF TIFF/EP TIFF/IT Others AV1 AVIF BPG DjVu EXR FLIF ICER MNG PGF QOI QTVR WBMP WebP Containers ISO, IEC MPEG-ES MPEG-PES MPEG-PS MPEG-TS ISO/IEC base media file format MPEG-4 Part 14 (MP4) Motion JPEG 2000 MPEG-21 Part 9 MPEG media transport ITU-T H.222.0 T.802 IETF RTP Ogg Matroska SMPTE GXF MXF Others 3GP and 3G2 AMV ASF AIFF AVI AU BPG Bink Smacker BMP DivX Media Format EVO Flash Video HEIF IFF M2TS Matroska WebM QuickTime File Format RatDVD RealMedia RIFF WAV MOD and TOD VOB, IFO and BUP Collaborations NETVC MPEG LA Alliance for Open Media Methods Entropy Arithmetic Huffman Modified LPC ACELP CELP LSP WLPC Lossless Lossy LZ DEFLATE LZW PCM A-law µ-law ADPCM DPCM Transforms DCT FFT MDCT Wavelet Daubechies DWT Lists Comparison of audio coding formats Comparison of video codecs List of codecs See Compression methods for techniques and Compression software for codecs

---
Adapted from the Wikipedia article [Image compression](https://en.wikipedia.org/wiki/Image_compression) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Image_compression?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.