Wikipedia

Data compression

"Source coding" redirects here. For the term in computer programming, seeSource code.

Ininformation theory,data compression,source coding,[1]orbit-rate reductionis the process of encodinginformationusing fewerbitsthan the original representation.[2]Any particular compression is eitherlossyorlossless.Lossless compression reduces bits by identifying and eliminatingstatistical redundancy.No information is lost in lossless compression. Lossy compression reduces bits by removing unnecessary or less important information.[3]Typically, a device that performs data compression is referred to as an encoder, and one that performs the reversal of the process (decompression) as a decoder.

The process of reducing the size of adata fileis often referred to as data compression. In the context ofdata transmission,it is called source coding: encoding is done at the source of the data before it is stored or transmitted.[4]Source coding should not be confused withchannel coding,for error detection and correction orline coding,the means for mapping data onto a signal.

Data Compression algorithms present aspace-time complexity trade-offbetween the bytes needed to store or transmit information, and theComputational resourcesneeded to perform the encoding and decoding. The design of data compression schemes involves balancing the degree of compression, the amount of distortion introduced (when usinglossy data compression), and the computational resources or time required to compress and decompress the data.[5]

Lossless

edit
Main article:Lossless compression

Lossless data compressionalgorithmsusually exploitstatistical redundancyto represent data without losing anyinformation,so that the process is reversible. Lossless compression is possible because most real-world data exhibits statistical redundancy. For example, an image may have areas of color that do not change over several pixels; instead of coding "red pixel, red pixel,..." the data may be encoded as "279 red pixels". This is a basic example ofrun-length encoding;there are many schemes to reduce file size by eliminating redundancy.

TheLempel–Ziv(LZ) compression methods are among the most popular algorithms for lossless storage.[6]DEFLATEis a variation on LZ optimized for decompression speed and compression ratio,[7]but compression can be slow. In the mid-1980s, following work byTerry Welch,theLempel–Ziv–Welch(LZW) algorithm rapidly became the method of choice for most general-purpose compression systems. LZW is used inGIFimages, programs such asPKZIP,and hardware devices such as modems.[8]LZ methods use a table-based compression model where table entries are substituted for repeated strings of data. For most LZ methods, this table is generated dynamically from earlier data in the input. The table itself is oftenHuffman encoded.Grammar-based codeslike this can compress highly repetitive input extremely effectively, for instance, a biologicaldata collectionof the same or closely related species, a huge versioned document collection, internet archival, etc. The basic task of grammar-based codes is constructing a context-free grammar deriving a single string. Other practical grammar compression algorithms includeSequiturandRe-Pair.

The strongest modern lossless compressors useprobabilisticmodels, such asprediction by partial matching.TheBurrows–Wheeler transformcan also be viewed as an indirect form of statistical modelling.[9]In a further refinement of the direct use ofprobabilistic modelling,statistical estimates can be coupled to an algorithm calledarithmetic coding.Arithmetic coding is a more modern coding technique that uses the mathematical calculations of afinite-state machineto produce a string of encoded bits from a series of input data symbols. It can achieve superior compression compared to other techniques such as the better-known Huffman algorithm. It uses an internal memory state to avoid the need to perform a one-to-one mapping of individual input symbols to distinct representations that use an integer number of bits, and it clears out the internal memory only after encoding the entire string of data symbols. Arithmetic coding applies especially well to adaptive data compression tasks where the statistics vary and are context-dependent, as it can be easily coupled with an adaptive model of theprobability distributionof the input data. An early example of the use of arithmetic coding was in an optional (but not widely used) feature of theJPEGimage coding standard.[10]It has since been applied in various other designs includingH.263,H.264/MPEG-4 AVCandHEVCfor video coding.[11]

Archive software typically has the ability to adjust the "dictionary size", where a larger size demands morerandom-access memoryduring compression and decompression, but compresses stronger, especially on repeating patterns in files' content.[12][13]

Lossy

edit
Main article:Lossy compression
Composite image showing JPG and PNG image compression. Left side of the image is from a JPEG image, showing lossy artefacts; the right side is from a PNG image.

In the late 1980s, digital images became more common, and standards for losslessimage compressionemerged. In the early 1990s, lossy compression methods began to be widely used.[14]In these schemes, some loss of information is accepted as dropping nonessential detail can save storage space. There is a correspondingtrade-offbetween preserving information and reducing size. Lossy data compression schemes are designed by research on how people perceive the data in question. For example, the human eye is more sensitive to subtle variations inluminancethan it is to the variations in color. JPEG image compression works in part by rounding off nonessential bits of information.[15]A number of popular compression formats exploit these perceptual differences, includingpsychoacousticsfor sound, andpsychovisualsfor images and video.

Most forms of lossy compression are based ontransform coding,especially thediscrete cosine transform(DCT). It was first proposed in 1972 byNasir Ahmed,who then developed a working algorithm with T. Natarajan andK. R. Raoin 1973, before introducing it in January 1974.[16][17]DCT is the most widely used lossy compression method, and is used in multimedia formats for images (such as JPEG andHEIF),[18]video(such asMPEG,AVCand HEVC) and audio (such asMP3,AACandVorbis).

Lossy image compression is used indigital cameras,to increase storage capacities. Similarly,DVDs,Blu-rayandstreaming videouse lossyvideo coding formats.Lossy compression is extensively used in video.

In lossy audio compression, methods of psychoacoustics are used to remove non-audible (or less audible) components of theaudio signal.Compression of human speech is often performed with even more specialized techniques;speech codingis distinguished as a separate discipline from general-purpose audio compression. Speech coding is used ininternet telephony,for example, audio compression is used for CD ripping and is decoded by the audio players.[9]

Lossy compression can causegeneration loss.

Theory

edit

The theoretical basis for compression is provided byinformation theoryand, more specifically,Shannon's source coding theorem;domain-specific theories includealgorithmic information theoryfor lossless compression andrate–distortion theoryfor lossy compression. These areas of study were essentially created byClaude Shannon,who published fundamental papers on the topic in the late 1940s and early 1950s. Other topics associated with compression includecoding theoryandstatistical inference.[19]

Machine learning

edit

There is a close connection betweenmachine learningand compression. A system that predicts theposterior probabilitiesof a sequence given its entire history can be used for optimal data compression (by usingarithmetic codingon the output distribution). Conversely, an optimal compressor can be used for prediction (by finding the symbol that compresses best, given the previous history). This equivalence has been used as a justification for using data compression as a benchmark for "general intelligence".[20][21][22]

An alternative view can show compression algorithms implicitly map strings into implicitfeature space vectors,and compression-based similarity measures compute similarity within these feature spaces. For each compressor C(.) we define an associated vector space ℵ, such that C(.) maps an input string x, corresponding to the vector norm ||~x||. An exhaustive examination of the feature spaces underlying all compression algorithms is precluded by space; instead, feature vectors chooses to examine three representative lossless compression methods, LZW, LZ77, and PPM.[23]

According toAIXItheory, a connection more directly explained inHutter Prize,the best possible compression of x is the smallest possible software that generates x. For example, in that model, a zip file's compressed size includes both the zip file and the unzipping software, since you can not unzip it without both, but there may be an even smaller combined form.

Examples of AI-powered audio/video compression software includeNVIDIA Maxine,AIVC.[24]Examples of software that can perform AI-powered image compression includeOpenCV,TensorFlow,MATLAB's Image Processing Toolbox (IPT) and High-Fidelity Generative Image Compression.[25]

Inunsupervised machine learning,k-means clusteringcan be utilized to compress data by grouping similar data points into clusters. This technique simplifies handling extensive datasets that lack predefined labels and finds widespread use in fields such asimage compression.[26]

Data compression aims to reduce the size of data files, enhancing storage efficiency and speeding up data transmission. K-means clustering, an unsupervised machine learning algorithm, is employed to partition a dataset into a specified number of clusters, k, each represented by thecentroidof its points. This process condenses extensive datasets into a more compact set of representative points. Particularly beneficial inimageandsignal processing,k-means clustering aids in data reduction by replacing groups of data points with their centroids, thereby preserving the core information of the original data while significantly decreasing the required storage space.[27]

Large language models(LLMs) are also capable of lossless data compression, as demonstrated byDeepMind's research with the Chinchilla 70B model. Developed by DeepMind, Chinchilla 70B effectively compressed data, outperforming conventional methods such asPortable Network Graphics(PNG) for images andFree Lossless Audio Codec(FLAC) for audio. It achieved compression of image and audio data to 43.4% and 16.4% of their original sizes, respectively.[28]

Data differencing

edit
Comparisonof two revisions of a file

Data compression can be viewed as a special case ofdata differencing.[29][30]Data differencing consists of producing adifferencegiven asourceand atarget,with patching reproducing thetargetgiven asourceand adifference.Since there is no separate source and target in data compression, one can consider data compression as data differencing with empty source data, the compressed file corresponding to a difference from nothing. This is the same as considering absoluteentropy(corresponding to data compression) as a special case ofrelative entropy(corresponding to data differencing) with no initial data.

The termdifferential compressionis used to emphasize the data differencing connection.

Uses

edit

Image

edit
Main article:Image compression

Entropy codingoriginated in the 1940s with the introduction ofShannon–Fano coding,[31]the basis forHuffman codingwhich was developed in 1950.[32]Transform codingdates back to the late 1960s, with the introduction offast Fourier transform(FFT) coding in 1968 and theHadamard transformin 1969.[33]

An important image compression technique is thediscrete cosine transform(DCT), a technique developed in the early 1970s.[16]DCT is the basis for JPEG, alossy compressionformat which was introduced by theJoint Photographic Experts Group(JPEG) in 1992.[34]JPEG greatly reduces the amount of data required to represent an image at the cost of a relatively small reduction in image quality and has become the most widely usedimage file format.[35][36]Its highly efficient DCT-based compression algorithm was largely responsible for the wide proliferation ofdigital imagesanddigital photos.[37]

Lempel–Ziv–Welch(LZW) is alossless compressionalgorithm developed in 1984. It is used in theGIFformat, introduced in 1987.[38]DEFLATE,a lossless compression algorithm specified in 1996, is used in thePortable Network Graphics(PNG) format.[39]

Wavelet compression,the use ofwaveletsin image compression, began after the development of DCT coding.[40]TheJPEG 2000standard was introduced in 2000.[41]In contrast to the DCT algorithm used by the original JPEG format, JPEG 2000 instead usesdiscrete wavelet transform(DWT) algorithms.[42][43][44]JPEG 2000 technology, which includes theMotion JPEG 2000extension, was selected as thevideo coding standardfordigital cinemain 2004.[45]

Audio

edit
See also:Audio coding formatandAudio codec

Audio data compression, not to be confused withdynamic range compression,has the potential to reduce the transmissionbandwidthand storage requirements of audio data.Audio compression formats compression algorithmsare implemented insoftwareas audiocodecs.In both lossy and lossless compression,information redundancyis reduced, using methods such ascoding,quantization,DCT andlinear predictionto reduce the amount of information used to represent the uncompressed data.

Lossy audio compression algorithms provide higher compression and are used in numerous audio applications includingVorbisandMP3.These algorithms almost all rely onpsychoacousticsto eliminate or reduce fidelity of less audible sounds, thereby reducing the space required to store or transmit them.[2][46]

The acceptable trade-off between loss of audio quality and transmission or storage size depends upon the application. For example, one 640 MBcompact disc(CD) holds approximately one hour of uncompressedhigh fidelitymusic, less than 2 hours of music compressed losslessly, or 7 hours of music compressed in theMP3format at a mediumbit rate.A digital sound recorder can typically store around 200 hours of clearly intelligible speech in 640 MB.[47]

Lossless audio compression produces a representation of digital data that can be decoded to an exact digital duplicate of the original. Compression ratios are around 50–60% of the original size,[48]which is similar to those for generic lossless data compression. Lossless codecs usecurve fittingor linear prediction as a basis for estimating the signal. Parameters describing the estimation and the difference between the estimation and the actual signal are coded separately.[49]

A number of lossless audio compression formats exist. Seelist of lossless codecsfor a listing. Some formats are associated with a distinct system, such asDirect Stream Transfer,used inSuper Audio CDandMeridian Lossless Packing,used inDVD-Audio,Dolby TrueHD,Blu-rayandHD DVD.

Someaudio file formatsfeature a combination of a lossy format and a lossless correction; this allows stripping the correction to easily obtain a lossy file. Such formats includeMPEG-4 SLS(Scalable to Lossless),WavPack,andOptimFROG DualStream.

When audio files are to be processed, either by further compression or forediting,it is desirable to work from an unchanged original (uncompressed or losslessly compressed). Processing of a lossily compressed file for some purpose usually produces a final result inferior to the creation of the same compressed file from an uncompressed original. In addition to sound editing or mi xing, lossless audio compression is often used for archival storage, or as master copies.

Lossy audio compression

edit
Comparison ofspectrogramsof audio in an uncompressed format and several lossy formats. The lossy spectrograms showbandlimitingof higher frequencies, a common technique associated with lossy audio compression.

Lossy audio compression is used in a wide range of applications. In addition to standalone audio-only applications of file playback in MP3 players or computers, digitally compressed audio streams are used in most video DVDs, digital television, streaming media on theInternet,satellite and cable radio, and increasingly in terrestrial radio broadcasts. Lossy compression typically achieves far greater compression than lossless compression, by discarding less-critical data based onpsychoacousticoptimizations.[50]

Psychoacoustics recognizes that not all data in an audio stream can be perceived by the humanauditory system.Most lossy compression reduces redundancy by first identifying perceptually irrelevant sounds, that is, sounds that are very hard to hear. Typical examples include high frequencies or sounds that occur at the same time as louder sounds. Those irrelevant sounds are coded with decreased accuracy or not at all.

Due to the nature of lossy algorithms,audio qualitysuffers adigital generation losswhen a file is decompressed and recompressed. This makes lossy compression unsuitable for storing the intermediate results in professional audio engineering applications, such as sound editing and multitrack recording. However, lossy formats such asMP3are very popular with end-users as the file size is reduced to 5-20% of the original size and a megabyte can store about a minute's worth of music at adequate quality.

Several proprietary lossy compression algorithms have been developed that provide higher quality audio performance by using a combination of lossless and lossy algorithms with adaptive bit rates and lower compression ratios. Examples includeaptX,LDAC,LHDC,MQAandSCL6.

Coding methods
edit

To determine what information in an audio signal is perceptually irrelevant, most lossy compression algorithms use transforms such as themodified discrete cosine transform(MDCT) to converttime domainsampled waveforms into a transform domain, typically thefrequency domain.Once transformed, component frequencies can be prioritized according to how audible they are. Audibility of spectral components is assessed using theabsolute threshold of hearingand the principles ofsimultaneous masking—the phenomenon wherein a signal is masked by another signal separated by frequency—and, in some cases,temporal masking—where a signal is masked by another signal separated by time.Equal-loudness contoursmay also be used to weigh the perceptual importance of components. Models of the human ear-brain combination incorporating such effects are often calledpsychoacoustic models.[51]

Other types of lossy compressors, such as thelinear predictive coding(LPC) used with speech, are source-based coders. LPC uses a model of the human vocal tract to analyze speech sounds and infer the parameters used by the model to produce them moment to moment. These changing parameters are transmitted or stored and used to drive another model in the decoder which reproduces the sound.

Lossy formats are often used for the distribution of streaming audio or interactive communication (such as in cell phone networks). In such applications, the data must be decompressed as the data flows, rather than after the entire data stream has been transmitted. Not all audio codecs can be used for streaming applications.[50]

Latencyis introduced by the methods used to encode and decode the data. Some codecs will analyze a longer segment, called aframe,of the data to optimize efficiency, and then code it in a manner that requires a larger segment of data at one time to decode. The inherent latency of the coding algorithm can be critical; for example, when there is a two-way transmission of data, such as with a telephone conversation, significant delays may seriously degrade the perceived quality.

In contrast to the speed of compression, which is proportional to the number of operations required by the algorithm, here latency refers to the number of samples that must be analyzed before a block of audio is processed. In the minimum case, latency is zero samples (e.g., if the coder/decoder simply reduces the number of bits used to quantize the signal). Time domain algorithms such as LPC also often have low latencies, hence their popularity in speech coding for telephony. In algorithms such as MP3, however, a large number of samples have to be analyzed to implement a psychoacoustic model in the frequency domain, and latency is on the order of 23 ms.

Speech encoding
edit

Speech encodingis an important category of audio data compression. The perceptual models used to estimate what aspects of speech a human ear can hear are generally somewhat different from those used for music. The range of frequencies needed to convey the sounds of a human voice is normally far narrower than that needed for music, and the sound is normally less complex. As a result, speech can be encoded at high quality using a relatively low bit rate.

This is accomplished, in general, by some combination of two approaches:

  • Only encoding sounds that could be made by a single human voice.
  • Throwing away more of the data in the signal—keeping just enough to reconstruct an "intelligible" voice rather than the full frequency range of humanhearing.

The earliest algorithms used in speech encoding (and audio data compression in general) were theA-law algorithmand theμ-law algorithm.

History

edit
Solidyne 922: The world's first commercial audio bit compressionsound cardfor PC, 1990

Early audio research was conducted atBell Labs.There, in 1950,C. Chapin Cutlerfiled the patent ondifferential pulse-code modulation(DPCM).[52]In 1973,Adaptive DPCM(ADPCM) was introduced by P. Cummiskey,Nikil S. JayantandJames L. Flanagan.[53][54]

Perceptual codingwas first used forspeech codingcompression, withlinear predictive coding(LPC).[55]Initial concepts for LPC date back to the work ofFumitada Itakura(Nagoya University) and Shuzo Saito (Nippon Telegraph and Telephone) in 1966.[56]During the 1970s,Bishnu S. AtalandManfred R. SchroederatBell Labsdeveloped a form of LPC calledadaptive predictive coding(APC), a perceptual coding algorithm that exploited the masking properties of the human ear, followed in the early 1980s with thecode-excited linear prediction(CELP) algorithm which achieved a significantcompression ratiofor its time.[55]Perceptual coding is used by modern audio compression formats such asMP3[55]andAAC.

Discrete cosine transform(DCT), developed byNasir Ahmed,T. Natarajan andK. R. Raoin 1974,[17]provided the basis for themodified discrete cosine transform(MDCT) used by modern audio compression formats such as MP3,[57]Dolby Digital,[58][59]and AAC.[60]MDCT was proposed by J. P. Princen, A. W. Johnson and A. B. Bradley in 1987,[61]following earlier work by Princen and Bradley in 1986.[62]

The world's first commercialbroadcast automationaudio compression system was developed by Oscar Bonello, an engineering professor at theUniversity of Buenos Aires. [63] In 1983, using the psychoacoustic principle of the masking of critical bands first published in 1967,[64]he started developing a practical application based on the recently developedIBM PCcomputer, and the broadcast automation system was launched in 1987 under the nameAudicom. [65] 35 years later, almost all the radio stations in the world were using this technology manufactured by a number of companies because the inventor refuses to get invention patents for his work. He prefers declaring it of Public Domain publishing it [66]

A literature compendium for a large variety of audio coding systems was published in the IEEE'sJournal on Selected Areas in Communications(JSAC), in February 1988. While there were some papers from before that time, this collection documented an entire variety of finished, working audio coders, nearly all of them using perceptual techniques and some kind of frequency analysis and back-end noiseless coding.[67]

Video

edit
See also:Video coding formatandVideo codec

Uncompressed videorequires a very highdata rate.Althoughlossless video compressioncodecs perform at a compression factor of 5 to 12, a typicalH.264lossy compression video has a compression factor between 20 and 200.[68]

The two key video compression techniques used invideo coding standardsare the DCT andmotion compensation(MC). Most video coding standards, such as theH.26xandMPEGformats, typically use motion-compensated DCT video coding (block motion compensation).[69][70]

Most video codecs are used alongside audio compression techniques to store the separate but complementary data streams as one combined package using so-calledcontainer formats.[71]

Encoding theory

edit

Video data may be represented as a series of still image frames. Such data usually contains abundant amounts of spatial and temporalredundancy.Video compression algorithms attempt to reduce redundancy and store information more compactly.

Mostvideo compression formatsandcodecsexploit both spatial and temporal redundancy (e.g. through difference coding withmotion compensation). Similarities can be encoded by only storing differences between e.g. temporally adjacent frames (inter-frame coding) or spatially adjacent pixels (intra-frame coding).Inter-framecompression (a temporaldelta encoding) (re)uses data from one or more earlier or later frames in a sequence to describe the current frame.Intra-frame coding,on the other hand, uses only data from within the current frame, effectively being still-image compression.[51]

Theintra-frame video coding formatsused in camcorders and video editing employ simpler compression that uses only intra-frame prediction. This simplifies video editing software, as it prevents a situation in which a compressed frame refers to data that the editor has deleted.

Usually, video compression additionally employslossy compressiontechniques likequantizationthat reduce aspects of the source data that are (more or less) irrelevant to the human visual perception by exploiting perceptual features of human vision. For example, small differences in color are more difficult to perceive than are changes in brightness. Compression algorithms can average a color across these similar areas in a manner similar to those used in JPEG image compression.[10]As in all lossy compression, there is atrade-offbetweenvideo qualityandbit rate,cost of processing the compression and decompression, and system requirements. Highly compressed video may present visible or distractingartifacts.

Other methods other than the prevalent DCT-based transform formats, such asfractal compression,matching pursuitand the use of adiscrete wavelet transform(DWT), have been the subject of some research, but are typically not used in practical products.Wavelet compressionis used in still-image coders and video coders without motion compensation. Interest in fractal compression seems to be waning, due to recent theoretical analysis showing a comparative lack of effectiveness of such methods.[51]

Inter-frame coding
edit
Main article:Inter frame
Further information:Motion compensation

In inter-frame coding, individual frames of a video sequence are compared from one frame to the next, and thevideo compression codecrecords thedifferencesto the reference frame. If the frame contains areas where nothing has moved, the system can simply issue a short command that copies that part of the previous frame into the next one. If sections of the frame move in a simple manner, the compressor can emit a (slightly longer) command that tells the decompressor to shift, rotate, lighten, or darken the copy. This longer command still remains much shorter than data generated by intra-frame compression. Usually, the encoder will also transmit a residue signal which describes the remaining more subtle differences to the reference imagery. Using entropy coding, these residue signals have a more compact representation than the full signal. In areas of video with more motion, the compression must encode more data to keep up with the larger number of pixels that are changing. Commonly during explosions, flames, flocks of animals, and in some panning shots, the high-frequency detail leads to quality decreases or to increases in thevariable bitrate.

Hybrid block-based transform formats

edit
Processing stages of a typical video encoder

Many commonly used video compression methods (e.g., those in standards approved by theITU-TorISO) share the same basic architecture that dates back toH.261which was standardized in 1988 by the ITU-T. They mostly rely on the DCT, applied to rectangular blocks of neighboring pixels, and temporal prediction usingmotion vectors,as well as nowadays also an in-loop filtering step.

In the prediction stage, variousdeduplicationand difference-coding techniques are applied that help decorrelate data and describe new data based on already transmitted data.

Then rectangular blocks of remainingpixeldata are transformed to the frequency domain. In the main lossy processing stage, frequency domain data gets quantized in order to reduce information that is irrelevant to human visual perception.

In the last stage statistical redundancy gets largely eliminated by anentropy coderwhich often applies some form of arithmetic coding.

In an additional in-loop filtering stage various filters can be applied to the reconstructed image signal. By computing these filters also inside the encoding loop they can help compression because they can be applied to reference material before it gets used in the prediction process and they can be guided using the original signal. The most popular example aredeblocking filtersthat blur out blocking artifacts from quantization discontinuities at transform block boundaries.

History

edit
Main article:Video coding format § History

In 1967, A.H. Robinson and C. Cherry proposed arun-length encodingbandwidth compression scheme for the transmission of analog television signals.[72]The DCT, which is fundamental to modern video compression,[73]was introduced byNasir Ahmed,T. Natarajan andK. R. Raoin 1974.[17][74]

H.261,which debuted in 1988, commercially introduced the prevalent basic architecture of video compression technology.[75]It was the firstvideo coding formatbased on DCT compression.[73]H.261 was developed by a number of companies, includingHitachi,PictureTel,NTT,BTandToshiba.[76]

The most popularvideo coding standardsused for codecs have been theMPEGstandards.MPEG-1was developed by theMotion Picture Experts Group(MPEG) in 1991, and it was designed to compressVHS-quality video. It was succeeded in 1994 byMPEG-2/H.262,[75]which was developed by a number of companies, primarilySony,ThomsonandMitsubishi Electric.[77]MPEG-2 became the standard video format forDVDandSD digital television.[75]In 1999, it was followed byMPEG-4/H.263.[75]It was also developed by a number of companies, primarily Mitsubishi Electric,HitachiandPanasonic.[78]

H.264/MPEG-4 AVCwas developed in 2003 by a number of organizations, primarily Panasonic,Godo Kaisha IP BridgeandLG Electronics.[79]AVC commercially introduced the moderncontext-adaptive binary arithmetic coding(CABAC) andcontext-adaptive variable-length coding(CAVLC) algorithms. AVC is the main video encoding standard forBlu-ray Discs,and is widely used by video sharing websites and streaming internet services such asYouTube,Netflix,Vimeo,andiTunes Store,web software such asAdobe Flash PlayerandMicrosoft Silverlight,and variousHDTVbroadcasts over terrestrial and satellite television.

Genetics

edit

Genetics compression algorithmsare the latest generation of lossless algorithms that compress data (typically sequences of nucleotides) using both conventional compression algorithms and genetic algorithms adapted to the specific datatype. In 2012, a team of scientists from Johns Hopkins University published a genetic compression algorithm that does not use a reference genome for compression. HAPZIPPER was tailored forHapMapdata and achieves over 20-fold compression (95% reduction in file size), providing 2- to 4-fold better compression and is less computationally intensive than the leading general-purpose compression utilities. For this, Chanda, Elhaik, and Bader introduced MAF-based encoding (MAFE), which reduces the heterogeneity of the dataset by sorting SNPs by their minor allele frequency, thus homogenizing the dataset.[80]Other algorithms developed in 2009 and 2013 (DNAZip and GenomeZip) have compression ratios of up to 1200-fold—allowing 6 billion basepair diploid human genomes to be stored in 2.5 megabytes (relative to a reference genome or averaged over many genomes).[81][82]For a benchmark in genetics/genomics data compressors, see[83]

Outlook and currently unused potential

edit

It is estimated that the total amount of data that is stored on the world's storage devices could be further compressed with existing compression algorithms by a remaining average factor of 4.5:1.[84]It is estimated that the combined technological capacity of the world to store information provides 1,300exabytesof hardware digits in 2007, but when the corresponding content is optimally compressed, this only represents 295 exabytes ofShannon information.[85]

See also

edit

References

edit
  1. ^Wade, Graham (1994).Signal coding and processing(2 ed.). Cambridge University Press. p. 34.ISBN978-0-521-42336-6.Retrieved2011-12-22.The broad objective of source coding is to exploit or remove 'inefficient' redundancy in thePCMsource and thereby achieve a reduction in the overall source rate R.
  2. ^abMahdi, O.A.; Mohammed, M.A.; Mohamed, A.J. (November 2012)."Implementing a Novel Approach an Convert Audio Compression to Text Coding via Hybrid Technique"(PDF).International Journal of Computer Science Issues.9(6, No. 3): 53–59.Archived(PDF)from the original on 2013-03-20.Retrieved6 March2013.
  3. ^Pujar, J.H.; Kadlaskar, L.M. (May 2010)."A New Lossless Method of Image Compression and Decompression Using Huffman Coding Techniques"(PDF).Journal of Theoretical and Applied Information Technology.15(1): 18–23.Archived(PDF)from the original on 2010-05-24.
  4. ^Salomon, David (2008).A Concise Introduction to Data Compression.Berlin: Springer.ISBN9781848000728.
  5. ^Tank, M.K. (2011). "Implementation of Lempel-ZIV algorithm for lossless compression using VHDL".Thinkquest 2010: Proceedings of the First International Conference on Contours of Computing Technology.Berlin: Springer. pp. 275–283.doi:10.1007/978-81-8489-989-4_51.ISBN978-81-8489-988-7.
  6. ^Navqi, Saud; Naqvi, R.; Riaz, R.A.; Siddiqui, F. (April 2011)."Optimized RTL design and implementation of LZW algorithm for high bandwidth applications"(PDF).Electrical Review.2011(4): 279–285.Archived(PDF)from the original on 2013-05-20.
  7. ^Document Management - Portable document format - Part 1: PDF1.7(1st ed.). Adobe Systems Incorporated. July 1, 2008.{{cite book}}:CS1 maint: date and year (link)
  8. ^Stephen, Wolfram (2002).New Kind of Science.Champaign, IL. p. 1069.ISBN1-57955-008-8.{{cite book}}:CS1 maint: location missing publisher (link)
  9. ^abMahmud, Salauddin (March 2012)."An Improved Data Compression Method for General Data"(PDF).International Journal of Scientific & Engineering Research.3(3): 2.Archived(PDF)from the original on 2013-11-02.Retrieved6 March2013.
  10. ^abLane, Tom."JPEG Image Compression FAQ, Part 1".Internet FAQ Archives.Independent JPEG Group.Retrieved6 March2013.
  11. ^G. J. Sullivan;J.-R. Ohm; W.-J. Han;T. Wiegand(December 2012). "Overview of the High Efficiency Video Coding (HEVC) Standard".IEEE Transactions on Circuits and Systems for Video Technology.22(12).IEEE:1649–1668.doi:10.1109/TCSVT.2012.2221191.S2CID64404.
  12. ^"How to choose optimal archiving settings – WinRAR".
  13. ^"(Set compression Method) switch – 7zip".Archived fromthe originalon 2022-04-09.Retrieved2021-11-07.
  14. ^Wolfram, Stephen (2002).A New Kind of Science.Wolfram Media, Inc. p.1069.ISBN978-1-57955-008-0.
  15. ^Arcangel, Cory."On Compression"(PDF).Archived(PDF)from the original on 2013-07-28.Retrieved6 March2013.
  16. ^abAhmed, Nasir(January 1991)."How I Came Up With the Discrete Cosine Transform".Digital Signal Processing.1(1): 4–5.Bibcode:1991DSP.....1....4A.doi:10.1016/1051-2004(91)90086-Z.
  17. ^abcNasir Ahmed;T. Natarajan; Kamisetty Ramamohan Rao (January 1974)."Discrete Cosine Transform"(PDF).IEEE Transactions on Computers.C-23(1): 90–93.doi:10.1109/T-C.1974.223784.S2CID149806273.Archived(PDF)from the original on 2016-12-08.
  18. ^CCITT Study Group VIII und die Joint Photographic Experts Group (JPEG) von ISO/IEC Joint Technical Committee 1/Subcommittee 29/Working Group 10 (1993), "Annex D – Arithmetic coding",Recommendation T.81: Digital Compression and Coding of Continuous-tone Still images – Requirements and guidelines(PDF),pp. 54 ff,retrieved2009-11-07{{citation}}:CS1 maint: numeric names: authors list (link)
  19. ^Marak, Laszlo."On image compression"(PDF).University of Marne la Vallee. Archived fromthe original(PDF)on 28 May 2015.Retrieved6 March2013.
  20. ^Mahoney, Matt."Rationale for a Large Text Compression Benchmark".Florida Institute of Technology.Retrieved5 March2013.
  21. ^Shmilovici A.; Kahiri Y.; Ben-Gal I.; Hauser S. (2009)."Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm"(PDF).Computational Economics.33(2): 131–154.CiteSeerX10.1.1.627.3751.doi:10.1007/s10614-008-9153-3.S2CID17234503.Archived(PDF)from the original on 2009-07-09.
  22. ^I. Ben-Gal (2008)."On the Use of Data Compression Measures to Analyze Robust Designs"(PDF).IEEE Transactions on Reliability.54(3): 381–388.doi:10.1109/TR.2005.853280.S2CID9376086.
  23. ^D. Scully;Carla E. Brodley(2006). "Compression and Machine Learning: A New Perspective on Feature Space Vectors".Data Compression Conference (DCC'06).p. 332.doi:10.1109/DCC.2006.13.ISBN0-7695-2545-8.S2CID12311412.
  24. ^Gary Adcock (January 5, 2023)."What Is AI Video Compression?".massive.io.Retrieved6 April2023.
  25. ^Mentzer, Fabian; Toderici, George; Tschannen, Michael; Agustsson, Eirikur (2020). "High-Fidelity Generative Image Compression".arXiv:2006.09965[eess.IV].
  26. ^"What is Unsupervised Learning? | IBM".ibm.23 September 2021.Retrieved2024-02-05.
  27. ^"Differentially private clustering for large-scale datasets".blog.research.google.2023-05-25.Retrieved2024-03-16.
  28. ^Edwards, Benj (2023-09-28)."AI language models can exceed PNG and FLAC in lossless compression, says study".Ars Technica.Retrieved2024-03-07.
  29. ^Korn, D.; et al. (July 2002)."RFC 3284: The VCDIFF Generic Differencing and Compression Data Format".Internet Engineering Task Force.Retrieved5 March2013.
  30. ^Korn, D.G.; Vo, K.P. (1995). B. Krishnamurthy (ed.).Vdelta: Differencing and Compression.Practical Reusable Unix Software. New York: John Wiley & Sons, Inc.
  31. ^Claude Elwood Shannon(1948). Alcatel-Lucent (ed.)."A Mathematical Theory of Communication"(PDF).Bell System Technical Journal.27(3–4): 379–423, 623–656.doi:10.1002/j.1538-7305.1948.tb01338.x.hdl:11858/00-001M-0000-002C-4314-2.Archived(PDF)from the original on 2011-05-24.Retrieved2019-04-21.
  32. ^David Albert Huffman(September 1952),"A method for the construction of minimum-redundancy codes"(PDF),Proceedings of the IRE,vol. 40, no. 9, pp. 1098–1101,doi:10.1109/JRPROC.1952.273898,archived(PDF)from the original on 2005-10-08
  33. ^Pratt, W.K.; Kane, J.; Andrews, H.C. (1969). "Hadamard transform image coding".Proceedings of the IEEE.57:58–68.doi:10.1109/PROC.1969.6869.
  34. ^"T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES"(PDF).CCITT.September 1992.Retrieved12 July2019.
  35. ^"The JPEG image format explained".BT.BT Group.31 May 2018. Archived fromthe originalon 5 August 2019.Retrieved5 August2019.
  36. ^Baraniuk, Chris (15 October 2015)."Copy protections could come to JPEGs".BBC News.BBC.Retrieved13 September2019.
  37. ^"What Is a JPEG? The Invisible Object You See Every Day".The Atlantic.24 September 2013.Retrieved13 September2019.
  38. ^"The GIF Controversy: A Software Developer's Perspective".27 January 1995.Retrieved26 May2015.
  39. ^L. Peter Deutsch(May 1996).DEFLATE Compressed Data Format Specification version 1.3.IETF.p. 1. sec. Abstract.doi:10.17487/RFC1951.RFC1951.Retrieved2014-04-23.
  40. ^Hoffman, Roy (2012).Data Compression in Digital Systems.Springer Science & Business Media.p. 124.ISBN9781461560319.Basically, wavelet coding is a variant on DCT-based transform coding that reduces or eliminates some of its limitations. (...) Another advantage is that rather than working with 8 × 8 blocks of pixels, as do JPEG and other block-based DCT techniques, wavelet coding can simultaneously compress the entire image.
  41. ^Taubman, David; Marcellin, Michael (2012).JPEG2000 Image Compression Fundamentals, Standards and Practice: Image Compression Fundamentals, Standards and Practice.Springer Science & Business Media.ISBN9781461507994.
  42. ^Unser, M.; Blu, T. (2003)."Mathematical properties of the JPEG2000 wavelet filters".IEEE Transactions on Image Processing.12(9): 1080–1090.Bibcode:2003ITIP...12.1080U.doi:10.1109/TIP.2003.812329.PMID18237979.S2CID2765169.
  43. ^Sullivan, Gary (8–12 December 2003)."General characteristics and design considerations for temporal subband video coding".ITU-T.Video Coding Experts Group.Retrieved13 September2019.
  44. ^Bovik, Alan C. (2009).The Essential Guide to Video Processing.Academic Press.p. 355.ISBN9780080922508.
  45. ^Swartz, Charles S. (2005).Understanding Digital Cinema: A Professional Handbook.Taylor & Francis.p. 147.ISBN9780240806174.
  46. ^Cunningham, Stuart; McGregor, Iain (2019)."Subjective Evaluation of Music Compressed with the ACER Codec Compared to AAC, MP3, and Uncompressed PCM".International Journal of Digital Multimedia Broadcasting.2019:1–16.doi:10.1155/2019/8265301.
  47. ^The Olympus WS-120 digital speech recorder, according to its manual, can store about 178 hours of speech-quality audio in.WMA format in 500 MB of flash memory.
  48. ^Coalson, Josh."FLAC Comparison".Retrieved2020-08-23.
  49. ^"Format overview".Retrieved2020-08-23.
  50. ^abJaiswal, R.C. (2009).Audio-Video Engineering.Pune, Maharashtra: Nirali Prakashan. p. 3.41.ISBN9788190639675.
  51. ^abcFaxin Yu; Hao Luo; Zheming Lu (2010).Three-Dimensional Model Analysis and Processing.Berlin: Springer. p.47.ISBN9783642126512.
  52. ^US patent 2605361,C. Chapin Cutler, "Differential Quantization of Communication Signals", issued 1952-07-29
  53. ^Cummiskey, P.; Jayant, N. S.; Flanagan, J. L. (1973). "Adaptive Quantization in Differential PCM Coding of Speech".Bell System Technical Journal.52(7): 1105–1118.doi:10.1002/j.1538-7305.1973.tb02007.x.
  54. ^Cummiskey, P.; Jayant, Nikil S.; Flanagan, J. L. (1973). "Adaptive quantization in differential PCM coding of speech".The Bell System Technical Journal.52(7): 1105–1118.doi:10.1002/j.1538-7305.1973.tb02007.x.ISSN0005-8580.
  55. ^abcSchroeder, Manfred R. (2014)."Bell Laboratories".Acoustics, Information, and Communication: Memorial Volume in Honor of Manfred R. Schroeder.Springer. p. 388.ISBN9783319056609.
  56. ^Gray, Robert M. (2010)."A History of Realtime Digital Speech on Packet Networks: Part II of Linear Predictive Coding and the Internet Protocol"(PDF).Found. Trends Signal Process.3(4): 203–303.doi:10.1561/2000000036.ISSN1932-8346.Archived(PDF)from the original on 2010-07-04.
  57. ^Guckert, John (Spring 2012)."The Use of FFT and MDCT in MP3 Audio Compression"(PDF).University of Utah.Archived(PDF)from the original on 2014-01-24.Retrieved14 July2019.
  58. ^Luo, Fa-Long (2008).Mobile Multimedia Broadcasting Standards: Technology and Practice.Springer Science & Business Media.p. 590.ISBN9780387782638.
  59. ^Britanak, V. (2011). "On Properties, Relations, and Simplified Implementation of Filter Banks in the Dolby Digital (Plus) AC-3 Audio Coding Standards".IEEE Transactions on Audio, Speech, and Language Processing.19(5): 1231–1241.doi:10.1109/TASL.2010.2087755.S2CID897622.
  60. ^Brandenburg, Karlheinz (1999)."MP3 and AAC Explained"(PDF).Archived(PDF)from the original on 2017-02-13.
  61. ^Princen, J.; Johnson, A.; Bradley, A. (1987). "Subband/Transform coding using filter bank designs based on time domain aliasing cancellation".ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.Vol. 12. pp. 2161–2164.doi:10.1109/ICASSP.1987.1169405.S2CID58446992.
  62. ^Princen, J.; Bradley, A. (1986). "Analysis/Synthesis filter bank design based on time domain aliasing cancellation".IEEE Transactions on Acoustics, Speech, and Signal Processing.34(5): 1153–1161.doi:10.1109/TASSP.1986.1164954.
  63. ^"Ricardo Sametband, La Nación Newspaper" Historia de un pionero en audio digital ""(in Spanish).
  64. ^Zwicker, Eberhard; et al. (1967).The Ear As A Communication Receiver.Melville, NY: Acoustical Society of America. Archived fromthe originalon 2000-09-14.Retrieved2011-11-11.
  65. ^"Summary of some of Solidyne's contributions to Broadcast Engineering".Brief History of Solidyne.Buenos Aires: Solidyne. Archived fromthe originalon 8 March 2013.Retrieved6 March2013.
  66. ^"Anuncio del Audicom, AES Journal, July-August 1992, Vol 40, # 7/8, pag 647".
  67. ^"File Compression Possibilities".A Brief guide to compress a file in 4 different ways.17 February 2017.
  68. ^Dmitriy Vatolin; et al. (Graphics & Media Lab Video Group) (March 2007).Lossless Video Codecs Comparison '2007(PDF)(Report). Moscow State University.Archived(PDF)from the original on 2008-05-15.
  69. ^Chen, Jie; Koc, Ut-Va; Liu, KJ Ray (2001).Design of Digital Video Coding Systems: A Complete Compressed Domain Approach.CRC Press.p. 71.ISBN9780203904183.
  70. ^Li, Jian Ping (2006).Proceedings of the International Computer Conference 2006 on Wavelet Active Media Technology and Information Processing: Chongqing, China, 29-31 August 2006.World Scientific.p. 847.ISBN9789812709998.
  71. ^"Video Coding".CSIP website.Center for Signal and Information Processing, Georgia Institute of Technology. Archived fromthe originalon 23 May 2013.Retrieved6 March2013.
  72. ^Robinson, A. H.; Cherry, C. (1967). "Results of a prototype television bandwidth compression scheme".Proceedings of the IEEE.55(3).IEEE:356–364.doi:10.1109/PROC.1967.5493.
  73. ^abGhanbari, Mohammed (2003).Standard Codecs: Image Compression to Advanced Video Coding.Institution of Engineering and Technology.pp. 1–2.ISBN9780852967102.
  74. ^Reader, Cliff (2016-08-31)."Patent landscape for royalty-free video coding".In Tescher, Andrew G (ed.).Applications of Digital Image Processing XXXIX.Applications of Digital Image Processing XXXIX. Vol. 9971. San Diego, California: Society of Photo-Optical Instrumentation Engineers. pp. 99711B.Bibcode:2016SPIE.9971E..1BR.doi:10.1117/12.2239493.Archived fromthe originalon 2016-12-08.Lecture recording, from 3:05:10.
  75. ^abcd"The History of Video File Formats Infographic — RealPlayer".22 April 2012.
  76. ^"Patent statement declaration registered as H261-07".ITU.Retrieved11 July2019.
  77. ^"MPEG-2 Patent List"(PDF).MPEG LA.Archived(PDF)from the original on 2019-05-29.Retrieved7 July2019.
  78. ^"MPEG-4 Visual - Patent List"(PDF).MPEG LA.Archived(PDF)from the original on 2019-07-06.Retrieved6 July2019.
  79. ^"AVC/H.264 – Patent List"(PDF).MPEG LA.Retrieved6 July2019.
  80. ^Chanda P, Bader JS, Elhaik E (27 Jul 2012)."HapZipper: sharing HapMap populations just got easier".Nucleic Acids Research.40(20): e159.doi:10.1093/nar/gks709.PMC3488212.PMID22844100.
  81. ^Christley S, Lu Y, Li C, Xie X (Jan 15, 2009)."Human genomes as email attachments".Bioinformatics.25(2): 274–5.doi:10.1093/bioinformatics/btn582.PMID18996942.
  82. ^Pavlichin DS, Weissman T, Yona G (September 2013)."The human genome contracts again".Bioinformatics.29(17): 2199–202.doi:10.1093/bioinformatics/btt362.PMID23793748.
  83. ^Hosseini, Morteza; Pratas, Diogo; Pinho, Armando (2016)."A Survey on Data Compression Methods for Biological Sequences".Information.7(4): 56.doi:10.3390/info7040056.
  84. ^"Data Compression via Logic Synthesis"(PDF).
  85. ^Hilbert, Martin; López, Priscila (1 April 2011)."The World's Technological Capacity to Store, Communicate, and Compute Information".Science.332(6025): 60–65.Bibcode:2011Sci...332...60H.doi:10.1126/science.1200970.PMID21310967.S2CID206531385.
edit
Retrieved from "https://en.wikipedia.org/w/index.php?title=Data_compression&oldid=1254725331"