Skip to content
Category

Data compression

page 1
video recording
thumbtime=1|thumb|upright=1.5|A one-minute animated video showing an example of a media production process|alt=Scenes in order: initial meeting, brainstorming, concept design, scripting, storyboards, shooting, initial editing, adding graphics, revising, add audio, final grading, delivery
MP3
MP3 (formally MPEG-1 Audio Layer III or MPEG-2 Audio Layer III) is an audio coding format developed largely by the Fraunhofer Society in Germany under the lead of Karlheinz Brandenburg. It was designed to greatly reduce the amount of data required to represent audio, yet still sound like a faithful reproduction of the original uncompressed audio to most listeners; for example, compared to CD-quality digital audio, MP3 compression can commonly achieve a 75–95% reduction in size, depending on the bit rate. In popular usage, MP3 often refers to files of sound or music recordings stored in the MP3
information theory
mathematical theory from the field of probability theory and statistics
data compression
process of encoding information using fewer bits than the original representation
display resolution
number of distinct pixels in each dimension that can be displayed
codec
A codec is a computer hardware or software component that encodes or decodes a data stream or signal. Codec is a portmanteau of coder/decoder.
information entropy
expected value of the amount of information delivered by a message
white noise
random signal having equal intensity at different frequencies, giving it a constant power spectral density
bit rate
information transmission rate expressed in bits per second
frame rate
measure of frequency of image frames in video
Huffman coding
entropy encoding algorithm used for lossless data compression
Nyquist–Shannon sampling theorem
theorem in signal processing describing discrete samples of a continuous signal
quantization
process of mapping a continuous set to a countable set
lossless compression
data compression approach allowing perfect reconstruction of the original data
MPEG-1
MPEG-1 is a standard for lossy compression of video and audio. It is designed to compress VHS-quality raw digital video and CD audio down to about 1.5 Mbit/s (26:1 and 6:1 compression ratios respectively) without excessive quality loss, making video CDs, digital cable/satellite TV and digital audio broadcasting (DAB) practical.
lossy compression
data compression approach that results in loss or change of some data
color space
standard that defines a specific range of colors
discrete cosine transform
technique representing data as sums of cosine functions
interlaced video
video displaying technique
image compression
reduction of image size to save storage and transmission costs
redundancy
in information theory, extra bits transmitted without adding information
Keyhole Markup Language
notation for expressing geographic annotation and visualization within Internet-based maps
Kolmogorov complexity
measure of algorithmic complexity
run-length encoding
simple form of data compression in which runs of data (sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count
Lempel–Ziv–Welch
Lempel–Ziv–Welch (LZW) is a universal lossless compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improvement to the LZ78 algorithm published by Lempel and Ziv in 1978. Claimed advantages include: simple to implement and the potential for high throughput in a hardware implementation.
ARJ
ARJ (Archived by Robert Jung) is a software tool designed in 1991 by Robert K. Jung for creating high-efficiency compressed file archives. ARJ is currently on version 2.86 for MS-DOS and 3.31 for Microsoft Windows and supports 16-bit, 32-bit and 64-bit Intel architectures.
video codec
apparatus or software that can transform video data into a coded format with different characteristics and/or back
DEFLATE
In computing, Deflate (stylized as DEFLATE, and also called Flate) is a lossless data compression algorithm that uses a combination of LZ77 and Huffman coding. It was designed by Phil Katz, for version 2 of his PKZIP archiving tool. Deflate was later specified in Request for Comments (RFC) 1951 (1996).
Burrows–Wheeler transform
algorithm used in data compression techniques
Lempel–Ziv–Markov chain algorithm
LZMA (Lempel–Ziv–Markov chain algorithm) is a lossless data compression algorithm developed since 1998 by Igor Pavlov, the developer of 7-Zip. It has been used in the 7z format of the 7-Zip archiver since 2001. This algorithm uses a dictionary compression scheme somewhat similar to the LZ77 algorithm published by Abraham Lempel and Jacob Ziv in 1977 and features a high compression ratio (generally higher than bzip2) and a variable compression-dictionary size (up to 4 GB), while still maintaining decompression speed similar to other commonly used compression algorithms.
Shannon–Fano coding
technique for constructing a prefix code
data deduplication
data processing technique to eliminate duplicate copies of repeating data
arithmetic coding
form of entropy encoding used in lossless data compression
fractal compression
method of digital image compression using fractals
compression artifact
noticeable distortion of media caused by the application of lossy data compression
adaptive differential pulse-code modulation
technique used to encode voices in telephony
chroma subsampling
encoding images using a lower resolution for chroma channels
wavelet transform
mathematical technique used in data compression and analysis
variable bitrate
rate control method that allows the bit rate of a multimedia file to vary over time
Golomb coding
lossless data compression method
Linear predictive coding
speech analysis and encoding technique
Shannon's source coding theorem
Data compression theory
μ-law algorithm
audio companding algorithm
Zstandard
Zstandard is a lossless data compression algorithm developed by Yann Collet at Facebook. Zstd is the corresponding reference implementation in C, released as open-source software on 31 August 2016.
differential pulse-code modulation
signal encoder
entropy coding
lossless data compression scheme that is independent of the specific characteristics of the medium
artifact
error in the perception or representation of any visual or aural information
delta modulation
signal conversion technique
prefix code
uniquely decodable code where, given a complete and accurate sequence, a receiver can identify each word without requiring a special marker between words
companding
thumb|upright=1.5|A signal before (top) and after μ-law algorithm|μ-law compression (bottom)
audio codec
device or program that encodes/decodes audio data in some bitstream format
scribal abbreviation
abbreviations used by ancient and medieval scribes writing in Latin, and later in Greek, Old Norse and other European languages
A-law algorithm
algorithm
LZ4
Compression algorithm
data compression ratio
measurement of the power of a data compression algorithm
speech coding
lossy audio compression applied to human speech
Unary coding
Entropy encoding
Motion compensation
Brotli
Brotli is a lossless data compression algorithm developed by Jyrki Alakuijala and Zoltán Szabadka. It uses a combination of the general-purpose LZ77 lossless compression algorithm, Huffman coding and 2nd-order context modelling. Brotli is primarily used by web servers and content delivery networks to compress HTTP content, making internet websites load faster. As successor to gzip, it is supported by all major web browsers and has become increasingly popular, as it provides better compression than gzip.
delta encoding
storing or transmitting data in the form of differences (deltas) between sequential data, as opposed to complete files