|
Progressive Graphics File
PGF (Progressive Graphics File) is a wavelet-based bitmapped image format that employs lossless and lossy data compression. PGF was created to improve upon and replace the JPEG format. It was developed at the same time as JPEG 2000 but with a focus on speed over compression ratio. PGF can operate at higher compression ratios without taking more encoding/decoding time and without generating the characteristic "blocky and blurry" artifacts of the original DCT-based JPEG standard. It also allows more sophisticated progressive downloads. Color models PGF supports a wide variety of color models: * Grayscale with 1, 8, 16, or 31 bits per pixel * Indexed color with palette size of 256 * RGB color image with 12, 16 (red: 5 bits, green: 6 bits, blue: 5 bits), 24, or 48 bits per pixel * ARGB color image with 32 bits per pixel * L*a*b color image with 24 or 48 bits per pixel * CMYK color image with 32 or 64 bits per pixel Technical discussion PGF claims to achieve an improved ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Indexed Color
In computing, indexed color is a technique to manage digital images' colors in a limited fashion, in order to save computer computer data storage, memory and Hard disk drive, file storage, while speeding up display refresh and file transfers. It is a form of Vector quantization#Use in data compression, vector quantization compression. When an image is encoding, encoded in this way, color information is not directly carried by the image pixel data, but is stored in a separate piece of data called a color lookup table (CLUT) or Palette (computing), palette: an array of color specifications. Every element in the array represents a color, indexed by its position within the array. Each image pixel does not contain the full specification of its color, but only its index into the ''palette''. This technique is sometimes referred as pseudocolor or indirect color, as colors are addressed indirectly. History Early graphics display systems that used 8-bit indexed color with frame buffers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chrominance
Chrominance (''chroma'' or ''C'' for short) is the signal used in video systems to convey the color information of the picture (see YUV color model), separately from the accompanying Luma (video), luma signal (or Y' for short). Chrominance is usually represented as two color-difference components: U = B-Y, B′ − Y′ (blue − luma) and V = R-Y, R′ − Y′ (red − luma). Each of these different components may have scale factors and offsets applied to it, as specified by the applicable video standard. In composite video signals, the U and V signals modulate a color subcarrier signal, and the result is referred to as the chrominance signal; the Phase (waves), phase and amplitude of this modulated chrominance signal correspond approximately to the hue and Saturation (color theory), saturation of the color. In digital-video and still-image color spaces such as Y′CbCr, the luma and chrominance components are digita ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Color Space
A color space is a specific organization of colors. In combination with color profiling supported by various physical devices, it supports reproducible representations of colorwhether such representation entails an analog or a digital representation. A color space may be arbitrary, i.e. with physically realized colors assigned to a set of physical color swatches with corresponding assigned color names (including discrete numbers infor examplethe Pantone collection), or structured with mathematical rigor (as with the NCS System, Adobe RGB and sRGB). A "color space" is a useful conceptual tool for understanding the color capabilities of a particular device or digital file. When trying to reproduce color on another device, color spaces can show whether shadow/highlight detail and color saturation can be retained, and by how much either will be compromised. A "color model" is an abstract mathematical model describing the way colors can be represented as tuples of numbers (e. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Run-length Encoding
Run-length encoding (RLE) is a form of lossless data compression in which ''runs'' of data (consecutive occurrences of the same data value) are stored as a single occurrence of that data value and a count of its consecutive occurrences, rather than as the original run. As an imaginary example of the concept, when encoding an image built up from colored dots, the sequence "green green green green green green green green green" is shortened to "green x 9". This is most efficient on data that contains many such runs, for example, simple graphic images such as icons, line drawings, games, and animations. For files that do not have many runs, encoding them with RLE could increase the file size. RLE may also refer in particular to an early graphics file format supported by CompuServe for compressing black and white images, that was widely supplanted by their later Graphics Interchange Format (GIF). RLE also refers to a little-used image format in Windows 3.x that is saved with the fil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bit-plane
A bit plane of a digital discrete signal (such as image or sound) is a set of bits corresponding to a given bit position in each of the binary numbers representing the signal. For example, for 16-bit data representation there are 16 bit planes: the first bit plane contains the set of the most significant bit, and the 16th contains the least significant bit. It is possible to see that the first bit plane gives the roughest but the most critical approximation of values of a medium, and the higher the number of the bit plane, the less is its contribution to the final stage. Thus, adding a bit plane gives a better approximation. If a bit on the nth bit plane on an m-bit dataset is set to 1, it contributes a value of 2m−n, otherwise it contributes nothing. Therefore, bit planes can contribute half of the value of the previous bit plane. For example, in the 8-bit value 10110101 (181 in decimal) the bit planes work as follows: Bit plane is sometimes used as synonymous to Bitmap; ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantization (image Processing)
Quantization, involved in image processing, is a lossy compression technique achieved by compressing a range of values to a single quantum (discrete) value. When the number of discrete symbols in a given stream is reduced, the stream becomes more compressible. For example, reducing the number of colors required to represent a digital image makes it possible to reduce its file size. Specific applications include DCT data quantization in JPEG and DWT data quantization in JPEG 2000. Color quantization Color quantization reduces the number of colors used in an image; this is important for displaying images on devices that support a limited number of colors and for efficiently compressing certain kinds of images. Most bitmap editors and many operating systems have built-in support for color quantization. Popular modern color quantization algorithms include the nearest color algorithm (for fixed palettes), the median cut algorithm, and an algorithm based on octrees. It is common ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Wavelet Transform
In numerical analysis and functional analysis Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, Inner product space#Definition, inner product, Norm (mathematics ..., a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency ''and'' location information (location in time). Definition One level of the transform The DWT of a signal x is calculated by passing it through a series of filters. First the samples are passed through a low-pass filter with impulse response g resulting in a convolution of the two: :y[n] = (x * g)[n] = \sum\limits_^\infty The signal is also decomposed simultaneously using a high-pass filter h. The outputs give the detail coefficients (fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Color Space
A color space is a specific organization of colors. In combination with color profiling supported by various physical devices, it supports reproducible representations of colorwhether such representation entails an analog or a digital representation. A color space may be arbitrary, i.e. with physically realized colors assigned to a set of physical color swatches with corresponding assigned color names (including discrete numbers infor examplethe Pantone collection), or structured with mathematical rigor (as with the NCS System, Adobe RGB and sRGB). A "color space" is a useful conceptual tool for understanding the color capabilities of a particular device or digital file. When trying to reproduce color on another device, color spaces can show whether shadow/highlight detail and color saturation can be retained, and by how much either will be compromised. A "color model" is an abstract mathematical model describing the way colors can be represented as tuples of numbers (e. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lossless Compression
Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information. Lossless compression is possible because most real-world data exhibits statistical redundancy. By contrast, lossy compression permits reconstruction only of an approximation of the original data, though usually with greatly improved compression rates (and therefore reduced media sizes). By operation of the pigeonhole principle, no lossless compression algorithm can shrink the size of all possible data: Some data will get longer by at least one symbol or bit. Compression algorithms are usually effective for human- and machine-readable documents and cannot shrink the size of random data that contain no redundancy. Different algorithms exist that are designed either with a specific type of input data in mind or with specific assumptions about what kinds of redundancy the uncompressed data are likely to contain. Lo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CMYK Color Model
The CMYK color model (also known as process color, or four color) is a subtractive color model, based on the CMY color model, used in color printing, and is also used to describe the printing process itself. The abbreviation ''CMYK'' refers to the four ink plates used: cyan, magenta, yellow, and key (most often black). The CMYK model works by partially or entirely masking colors on a lighter, usually white, background. The ink reduces the light that would otherwise be reflected. Such a model is called ''subtractive'', as inks ''subtract'' some colors from white light; in the CMY model, white light minus red leaves cyan, white light minus green leaves magenta, and white light minus blue leaves yellow. In additive color models, such as RGB, white is the ''additive'' combination of all primary colored lights, and black is the absence of light. In the CMYK model, it is the opposite: white is the natural color of the paper or other background, and black results from a full ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
