Image analysis – Image compression or coding
Reexamination Certificate
1998-06-10
2001-07-03
Tran, Phuoc (Department: 2621)
Image analysis
Image compression or coding
C382S233000, C382S244000, C382S248000, C382S253000, C382S166000
Reexamination Certificate
active
06256415
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates generally to an image compression technique, and more particularly to an image compression technique that operates on blocks of pixels using a block-based coding scheme that codes different types of image data in different ways based on parameters that are determined by the coding process itself. Still more particularly, the image compression technique of the present invention evaluates the image to be compressed to determine its make-up and uses this information to determine the most effective combination of coding techniques to use to guarantee a desired compression ratio.
2. Description of the Related Art
A typical high quality digitized color image may use 24 bits per pixel (bpp)—8 bits for each of the three basic color components: red (R), green (G) and blue (B) in RGB color space or for each of the three basic luminance-chrominance components: luminance (Y), chrominance (C
b
) and chrominance (C
r
) in YC
b
C
r
color space. In the uncompressed state (i.e., in the spatial or pixel domain), such images are simply too costly and time consuming to transmit and store. The high transmission time and memory requirements for high quality color images is apparent when compared to gray-scale images that may use 8 bpp or bi-level images that use only 1 bpp. Thus, applications and devices which store or transmit high quality digitized color images typically do so in a compressed format, using one of the currently available compression techniques.
Various image compression techniques have been proposed to reduce the number of bits used to represent a digitized color image while, at the same time, providing quality image representation. These techniques generally seek to strike a balance between transmission time and memory requirements on the one hand and image quality on the other. Some of these techniques are “lossless,” meaning that they preserve all information of the original image so that it is reproduced exactly when the data is decompressed. Other techniques, commonly referred to as “lossy,” discard information which is visually insignificant. By only approximating the original image (rather than reproducing it exactly), lossy techniques are generally able to produce higher compression ratios than lossless techniques. In selecting the appropriate compression technique among those currently available, the user must consider the particular image to be compressed, the desired compression ratio and image quality as well as transmission time and memory requirements, with the understanding that higher compression ratios lead to lower transmission times and memory requirements but also produce lower quality images.
One of the problems with the currently available image compression techniques is that most tend to be designed for one type of data and generally do not work well on hybrid color images (that is, images containing text, graphics, as well as synthetic and natural images). Since different types of data have different frequency characteristics, it is difficult to achieve a high compression ratio by applying a single coding mode to a hybrid image without sacrificing image quality. In order to effectively compress hybrid images an adaptive coding technique is needed.
One such adaptive coding technique is proposed in U.S. Pat. No. 5,696,842 which provides a coding process that separates a document image into blocks and classifies them as “picture” blocks or “black-and-white” blocks using a block classification algorithm that employs a complex edge-detection mechanism. The blocks are then coded according to their classification. Arithmetic coding is used for “black-and-white” blocks and ADCT for “picture” blocks. While this coding system offers certain advantages over non-adaptive coding systems, it has certain disadvantages as well. For example, the block classification scheme is relatively complex and is not tied to the coding process itself, which makes for a relatively high overhead requirement. In addition, the adaptive coding technique of this patent does not offer guaranteed compression rate control.
OBJECTS OF THE INVENTION
Therefore, it is an object of the present invention to overcome the aforementioned problems.
It is another object of this invention to provide an image compression technique designed for high quality compression of hybrid color images.
It is a further object of this invention to provide an image compression technique that has low computational complexity, employs only two rows of buffer on both the compression and decompression side, and uses a block-based coding scheme to provide alternative coding techniques for different types of image blocks at a guaranteed compression rate.
It is yet another object of the present invention to provide an image compression technique using a block-based coding scheme that ties block classification to the coding process itself.
It is still another object of this invention to provide an image compression technique that uses palette (both global and local), lossless and wavelet transform coding techniques to provide guaranteed compression rate-control.
It is still a further object of the present invention to provide a wavelet transform coding technique for 32×2 image blocks that is targeted for high-quality compression, has low computation complexity and offers exact rate control.
SUMMARY OF THE INVENTION
One aspect of the invention is embodied in a method of compressing a digitized image, having different types of image data, such as text, graphics, synthetic image data and natural image data. The image is segmented into a plurality of 32×2 blocks of pixel data, wherein each image block is classified as being a natural block or a non-natural block. One of global-index coding, local-index coding, lossless coding or wavelet coding is selected to code each image block based on whether or not various coding conditions are satisfied. The coded data is output as a compressed bit stream.
The method may be carried out using an encoder/decoder system. In such a system an encoder, having a global-index coder, a local-index coder, a lossless coder and a wavelet coder, compresses the digitized image and generates the compressed bit stream. A decoder, which includes a global-index decoder, a local-index decoder, a lossless decoder and a wavelet decoder, is provided to reverse the steps of the encoder by regenerating the blocks of pixel data from the compressed bit stream. The encoder and decoder may be configured separately to respectively compress or decompress a digitized image in accordance with the invention.
The method may also be carried out using an article of manufacture which may be a computer, a computer peripheral device, a computer component such as a memory or processor, or a storage device such as a diskette or CD ROM. The article of manufacture has software or hardware embodied therein for compressing/decompressing the digitized image in accordance with the invention.
In another aspect of the invention, a digitized image is compressed and/or decompressed using a wavelet technique The underlying method of this technique comprises segmenting the image into a plurality of 32×2 blocks of pixel data, transforming each of these blocks of data into a corresponding block of subband coefficients, quantizing the subband coefficients; and coding the quantized subband coefficients. The transforming step comprises filtering each block of data using a 2-6 wavelet filter and a Haar filter for subband decomposition. The Haar filter is applied to each of the columns of data in each block and the 2-6 wavelet filter is applied to each of the rows of data in each block. The 2-6 wavelet filter is then repeatedly applied to the top row of data in each block to obtain a low pass coefficient for each block. The quantizing step comprises organizing the filtered subband coefficients together into 11 different groups using a tree structure in which each level of the tree corresponds to a particular level of resolution. The coding step comprises co
Seiko Epson Corporation
Tran Phuoc
LandOfFree
Two row buffer image compression (TROBIC) does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Two row buffer image compression (TROBIC), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two row buffer image compression (TROBIC) will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2443126