In computer science and information theory, set redundancy compression are methods of data compression that exploits redundancy between individual data groups of a set, usually a set of similar images.
It is wide used on medical and satellital images.[1][2][3][4] The main methods are min-max differential, min-max predictive and centroid method.
^Karadimitriou, Kosmas (August 1996), Set redundancy, the enhanced compression model, andmethods for compressing sets of similar images, CiteSeerX 10.1.1.35.7146, This statistical correlation among similar images is a result of inter-image redundancy. In this study, the term "set redundancy" is introduced to describe this type of redundant information, and is defined as follows: Definition: Set redundancy is the inter-image redundancy that exists in a set of similar images, and refers to the common information found in more than one image in the set. Set redundancy can be used to improve compression. A limit to compression is imposed by the image entropy. In the next section it is shown how set redundancy can be used to decrease the average image entropy in a set of similar images. Ph.D. thesis, Department of Computer Science, Louisiana State University, Baton Rouge, La, USA
^Ait-Aoudia, Samy; Gabis, Abdelhalim (2005-02-27), "A Comparison of Set Redundancy Compression Techniques" (PDF), EURASIP Journal on Applied Signal Processing, 2006: 092734, Bibcode:2006EJASP2006..234A, doi:10.1155/ASP/2006/92734, retrieved 2012-09-28, Medical imaging applications produce a huge amount of similar images. Storing such amount of data needs gigantic disk space. Thus a compression technique is necessary to reduce space storage. In addition, medical images must be stored without any loss of information since the fidelity of images is critical in diagnosis. This requires lossless compression techniques. Lossless compression is an error-free compression. The decompressed image is the same as the original image. Classical image compression techniques (see [1–5]) concentrate on how to reduce the redundancies presented in an individual image. These compression techniques use the same model of compression as shown in Figure 1. Thismodel ignores an additional type of redundancy that exists in sets of similar images, the "set redundancy." The term "set redundancy" was introduced for the first time by Karadimitriou [6] and defined as follows: "Set redundancy is the interimage redundancy that exists in a set of similar images, and refers to the common information found in more than one image in the set.
^Ait-Aoudia, Samy; Gabis, Abdelhalim; Naimi, Amina, Compressing Sets of Similar Images(PDF), Applications using these types of data, produce a large amount of similar images. Thus a compression technique is useful to reduce transmission time and space storage. Lossless compression methods are necessary in such critical applications. Set Redundancy Compression (SRC) methods exploit the interimage redundancy and achieve better results than individual image compression techniques when applied to sets of similar images.
^Karadimitriou, Kosmas; Tyler, John M. (1998), "The Centroid method for compressing sets of similar images", Pattern Recognition Letters, 19 (7): 585–593, Bibcode:1998PaReL..19..585K, CiteSeerX 10.1.1.39.3248, doi:10.1016/S0167-8655(98)00033-6, Karadimitriou (1996) proposed the Enhanced Compression Model as a more appropriate model for compressing sets of similar images. […] Methods that achieve set redundancy reduction are referred to as SRC (Set Redundancy Compression) methods. Two SRC methods are the Min-Max Differential method (Karadimitriou and Tyler, 1996) and the Min-Max Predictive method (Karadimitriou and Tyler, 1997).[…] One of the best application areas for SRC methods is medical imaging. Medical image databases usually store similar images; therefore, they contain large amounts of set redundancy.
and 24 Related for: Set redundancy compression information
theory, setredundancycompression are methods of data compression that exploits redundancy between individual data groups of a set, usually a set of similar...
particular compression is either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy. No information...
information. Lossless compression is possible because most real-world data exhibits statistical redundancy. By contrast, lossy compression permits reconstruction...
Corporation, an American non-profit research consortium Setredundancycompression, compression methods for similar images Short rotation coppice, an energy...
type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm...
efficiently Fractal compression: method used to compress images using fractals Set Partitioning in Hierarchical Trees (SPIHT) Wavelet compression: form of data...
Robust Header Compression (ROHC) is a standardized method to compress the IP, UDP, UDP-Lite, RTP, and TCP headers of Internet packets. In streaming applications...
Golomb coding is a lossless data compression method using a family of data compression codes invented by Solomon W. Golomb in the 1960s. Alphabets following...
class of lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in...
known as data differencing. Delta encoding is sometimes called delta compression, particularly where archival histories of changes are required (e.g....
Silence compression is an audio processing technique used to effectively encode silent intervals, reducing the amount of storage or bandwidth needed to...
language processing, semantic compression is a process of compacting a lexicon used to build a textual document (or a set of documents) by reducing language...
for solid compression, where multiple files of like type are compressed within a single stream, in order to exploit the combined redundancy inherent in...
this task is known as intraframe compression and is closely related to image compression. Likewise, temporal redundancy can be reduced by registering differences...
method of lossy compression for digital images, particularly for those images produced by digital photography. The degree of compression can be adjusted...
PEE-en-JEE) is a raster-graphics file format that supports lossless data compression. PNG was developed as an improved, non-patented replacement for Graphics...
distance can be increased by reducing the plaintext redundancy. One way to do this is to deploy data compression techniques prior to encryption, for example by...
coding): While data compression removes as much redundancy as possible, an error-correcting code adds just the right kind of redundancy (i.e., error correction)...
can result in both redundancy and image error. These provide optimal visibility sets, where there is no image error and no redundancy. They are, however...
IANA. Compression-only formats should often be denoted by the media type of the decompressed data, with a content coding indicating the compression format...
spatially varying BRDF. To cope with a massive BTF data with high redundancy, many compression methods were proposed. Application of the BTF is in photorealistic...
brain damage. The asphyxia can be caused by facial compression, neck compression, or chest compression. This occurs mostly during restraint and handcuffing...
Zstandard is a lossless data compression algorithm developed by Yann Collet at Facebook. Zstd is the corresponding reference implementation in C, released...
Global Information