Bit allocation process for multi-stage image compression

Image analysis – Image compression or coding – Adaptive coding

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S251000

Reexamination Certificate

active

07099513

ABSTRACT:
A process and apparatus for allocating bits between the stages of a multi-stage digital image compression scheme with quantizer feedback is disclosed. The process selects a quantization schedule (from a finite number of possibilities) for all stages that minimizes an estimate of total distortion while keeping total bit demand below a constraint; uses said schedule to actually quantize one stage of the compression scheme; selects a new quantization schedule for the remaining stages using estimates for distortion and bit demand that are updated to reflect the quantization of the previous stage; actually quantizes the next stage according to the new quantization schedule; and continues recursively until it has chosen an actual quantization scale for every stage of the compression scheme.

REFERENCES:
patent: 5414469 (1995-05-01), Gonzales et al.
patent: 5724453 (1998-03-01), Ratnakar et al.
patent: 5734755 (1998-03-01), Ramchandran et al.
patent: 6111991 (2000-08-01), Ribas-Corbera et al.
patent: 6160846 (2000-12-01), Chiang et al.
patent: 6351491 (2002-02-01), Lee et al.
patent: 6925120 (2005-08-01), Zhang et al.
“Bit-rate control using piecewise approximated rate-distortion characteristics,” Lin, Liang-Jin and Ortega, Antonio, IEEE Transactions on Circuits and Systems for video Technology, No. 4, Vole. 8, Aug. 1998, pp. 446-459.
Peter J. Burt, et al. “The Laplacian Pyramid as a Compact Image Code”, IEEE Transactions on Communications, Apr. 1983, pp. 532-540, vol. Com-31 No. 4.
Xuan Kong, et al. “A Study of Pyramidal Techniques for Image Representation and Compression”, Joural of Visual Communication and Image Representation, 1994, pp. 190-203, vol. 5; Johns Hopkins University, Baltimore, MD.
K. Metin, et al. “Optimal BIT Allocation In The Presence Of Quantizer Feedback”, Proc. of ICASSP 1993, pp. 385-388, vol. 5; The David Sarnoff Research Center, Princeton, NJ.
Pankaj Batra, et al. “Alternative Formulations for BIT Allocation with Dependent Quantization”, submitted to IEEE Transactions on Image Processing, Nov. 2001 (24 pages); Department of Electrical Engineering, Columbia University, New York, NY.
Uwe Horn, et al. “Bit Allocation methods for closed-loop coding of oversampled pyramid decompositions”, Proceedings of the IEEE International Conference on Image Processing, Oct. 1997, pp. 26-29, University of Erlangen-Nuremberg, Erlangen, Germany.
Kannan Ramchandran, et al. “Bit Allocation for Dependent Quantization with Applications to Multiresolution and MPEG Video Coders”, IEEE Transactions on Image Processing, Sep. 1994, pp. 533-545, vol. 3, No. 5.
John G. Proakis, et al. “Digital Signal Processing: Principles, Algorithms, and Applications”, 1996, pp. 72-85; Prentice-Hall, Inc. Upper Saddle River, New Jersey.
Claude E. Shannon, “Coding Theorems for a Discrete Source with a Fidelity Criterion”, IRE Nat. . Conv/., 1959, pp. 142-163, Massachusetts Institute of Technology, Cambridge, Massachusetts.
U.S. Appl. No. 10/032,394, entitled, “Adaptive Transforms” filed Dec. 19, 2001.
U.S. Appl. No. 10/028,998, entitled, “Efficiently Adaptive Double Pyramidal Coding” filed Dec. 20, 2001.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Bit allocation process for multi-stage image compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bit allocation process for multi-stage image compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bit allocation process for multi-stage image compression will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3629390

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.