The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 26, 2005
Filed:
Jun. 04, 2001
Egbert Ammicht, Budd Lake, NJ (US);
Paul David Davis, Mount Tabor, NJ (US);
Richard Robert Shively, Morristown, NJ (US);
Egbert Ammicht, Budd Lake, NJ (US);
Paul David Davis, Mount Tabor, NJ (US);
Richard Robert Shively, Morristown, NJ (US);
Lucent Technologies Inc., Murray Hill, NJ (US);
Abstract
An improved method is disclosed for the encoding phase for Wavelet-based compression of digital data representing an object or image. Subband decomposition transforms the data into hierarchical tree data. Two terms are precomputed: the highest bit-plane in which any descendant of a node v has a non-zero bit (B(v) and the highest bit-plane in which any indirect descendant (grandchild and beyond) becomes significant (B(v). Node traversal is initiated but its extent is limited by a fixed bit-budget. The number of bits emitted by a node as a function of the bit-plane are counted through to the last bit-plane which exhausts the bit-budget. The user can predetermine the coefficient, bit-plane and specific bit at which the algorithm will halt. The tree structure is read only once, thus greatly accelereating the encoding and reducing the memory reference rate by a factor of 2 or more. Accumulators for each of the stacked bit-planes are provided which are incremented as each said Wavelet coefficient is produced, by the number of bits that the coefficient adds to the relevant bit-plane.