Image analysis – Image compression or coding – Pyramid – hierarchy – or tree structure
Reexamination Certificate
1999-03-12
2004-08-17
Mehta, Bhavesh M. (Department: 2721)
Image analysis
Image compression or coding
Pyramid, hierarchy, or tree structure
C348S395100, C348S398100, C348S405100, C348S408100, C348S420100, C358S426140, C382S235000, C382S248000, C382S251000, C375S240110, C375S240180, C375S240210, C375S240240
Reexamination Certificate
active
06778709
ABSTRACT:
BACKGROUND OF THE INVENTION
The invention relates to data compression. More specifically, the invention relates to data coding and embedded bitstreams.
Data compression is often used for reducing the cost of storing large data files on computers as well as reducing the time for transmitting large data files between computers. In the so-called “transform methods” data is transformed into coefficients that represent the data in a frequency domain. Coefficients may be quantized (lossy compression) without significantly affecting the quality of data that is eventually reconstructed from the quantized coefficients. Redundancy in the coefficients may then be reduced or eliminated (lossless compression) without affecting quality of the reconstructed data.
One well known class of transforms are Wavelet transforms. The Wavelet transforms may be used to perform subband decomposition and produce coefficients that describe the data in a hierarchical multiscale representation. Wavelet transforms have proven useful for the compression of images and the analysis of signals. They have been proposed as the transforms for the emerging “JPEG-2000” standard.
Among the advantages of the Wavelet transforms, the transform coefficients can be ordered in a hierarchical structure and transmitted in an “embedded bitstream.” The embedded bitstream has a property whereby prefixes of the bitstream yield a continuum of lower rate descriptions of the data at the highest possible levels of quality. If the embedded bitstream is truncated during transmission of image data, for instance, the information already transmitted allows an entire image to be reconstructed. The quality of the reconstructed image is dependent upon the amount information transmitted. If an embedded bitstream is truncated, a complete image of reduced quality can be reconstructed from the transmitted bits. In contrast, truncation of a non-embedded transmission might only allow several rows of an image to be reconstructed.
As additional information is transmitted, the quality of the reconstructed image is improved. If the entire bitstream is transmitted without truncation, a lossless or near-lossless image can be reconstructed.
The transmission just described is often referred to as a “progressive-by-quality” image transmission. The coefficients are described by bit-planes, and the most significant coefficient bits (that is, the coefficient bits conveying the most important information) are transmitted first.
Another type of transmission is often referred to as a “progressive-by-resolution” transmission. The progressive-by-resolution transmission involves ordering the coefficients according to different levels of image resolution. The different levels are identified by markers in the embedded bitstream. A computer may use the markers to parse the bitstream and transmit the data for the coefficients corresponding to a resolution that is specified by the receiving computer. The receiving computer can reconstruct an image according to the specified resolution.
Versatility is very desirable for systems that compress and reconstruct images. The following features for such systems are very desirable: scalability, random access, rate control and resolution control. Perhaps even more desirable is a system that can combine all of these features.
SUMMARY OF THE INVENTION
According to one aspect of the present invention, a subband decomposition can be processed by partitioning each subband into a plurality of blocks; and encoding the blocks of each subband, wherein a block bitstream is generated for each block. The blocks of each subband are coded independently of each other.
Such processing allows a layered embedded bitstream to be generated with greater scalability, random access, error resilience and coding efficiency.
It also allows for efficient rate control, low complexity, low memory and region-of-interest (“ROI”) reconstruction. The present invention can be used to provide better support for client-server applications and greater flexibility for proprietary encoders to optimize the bitstream by exploiting “psycho-visual” properties without making any changes to the decoder or bitstream syntax.
Other aspects and advantages of the present invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the invention.
REFERENCES:
patent: 5276525 (1994-01-01), Gharavi
patent: 5321776 (1994-06-01), Shapiro
patent: 5481308 (1996-01-01), Hartung et al.
patent: 5825935 (1998-10-01), Murakoshi
patent: 5982938 (1999-11-01), Dube
patent: 6021224 (2000-02-01), Castelli et al.
patent: 6125201 (2000-09-01), Zador
patent: 6141453 (2000-10-01), Banham et al.
patent: 6160846 (2000-12-01), Chiang et al.
patent: 6259819 (2001-07-01), Andrew et al.
patent: 6263109 (2001-07-01), Ordentlich et al.
patent: 6263110 (2001-07-01), Andrew et al.
patent: 6266450 (2001-07-01), Yip et al.
patent: 6269192 (2001-07-01), Sodagar et al.
patent: 6298167 (2001-10-01), Martucci et al.
patent: 6314452 (2001-11-01), Dekel et al.
patent: 6337929 (2002-01-01), Kajiwara et al.
patent: 6347157 (2002-02-01), Chui
patent: 6381280 (2002-04-01), Lynch et al.
patent: 6389074 (2002-05-01), Andrew
Desire Gregory
Hewlett--Packard Development Company, L.P.
Mehta Bhavesh M.
LandOfFree
Embedded block coding with optimized truncation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Embedded block coding with optimized truncation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedded block coding with optimized truncation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3285083