多媒体技术chapter-3-Graphics-and-Image-Data-Representations.ppt

* * Median-cut algorithm A simple alternate solution that does a better job for this color reduction problem. (a) The idea is to sort the R byte values and find their median; then values smaller than the median are labelled with a “0” bit and values larger than the median are labelled with a “1” bit. (b) This type of scheme will indeed concentrate bits where they most need to differentiate between high populations of close colors. * * Median-cut algorithm (c) One can most easily visualize finding the median by using a histogram showing counts at position 0..255. * * Fig. 3.11 Histogram of R bytes for the 24-bit color image “forestfire.bmp” results in a 0 bit or 1 bit label for every pixel. * * 3.2 Popular File Formats 3.2.1 8-bit GIF : one of the most important format because of its historical connection to the WWW and HTML markup language as the first image type recognized by net browsers. 3.2.2 JPEG: currently the most important common file format. * * 3.2.1 GIF GIF standard: Limited to 8-bit (256) color images only, which, while producing acceptable color images, is best suited for images with few distinctive colors (e.g., graphics or drawing). GIF standard supports interlacing successive display of pixels in widely-spaced rows by a 4-pass display process. * * GIF87——Fig. 3.12: GIF file format. * * Screen Descriptor * * Chapter 3Graphics and Image Data Representations 3.1 Graphics/Image Data Types 3.2 Popular File Formats * * 3.1 Graphics/Image Data Types 3.1.1 1-bit Images 3.1.2 8-bit Gray-level Images 3.1.3 Image Data Types 3.1.4 24-bit Color Images 3.1.5 8-bit Color Images 3.1.6 Color Look-up Tables (LUTs) * * 3.1 Graphics/Image Data Types * * 3.1.1 1-bit Images Each pixel is stored as a single bit (0 or 1), so also referred to as binary image. Such an image is also called a 1-bit monochrome image since it contains no color. Fig. 3.1 shows a 1-bit monochrome image (called “Lena” by multimedia scientists—— this is a standard image used to illust