A data compression system including successive approximation...

H - Electricity – 03 – M

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 7/30 (2006.01) G06T 9/00 (2006.01) H04N 7/26 (2006.01) H04N 7/13 (1990.01)

Patent

CA 2130478

A data processing system augments compression of non-zero values of significant coefficients by coding entries of a significance map independently of coding the values of significant non-zexo coefficients. A dedicated symbol,(from 1038) represents a zerotree structure encompassing a related association of insignificant coefficients within the tree structure. The zero-tree; symbol represents that a coefficient is a root of a zerotree if, at a threshold (T), the coefficient (from 1002) and all of its descendants that have been found to be insignificant at larger thresholds have magnitudes less than threshold T. The zerotree structure is disclosed in the context of a pyramid-type image subband processor together with successive refinement quantization and entropy coding to facilitate data compression.

LandOfFree

Say what you really think

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

Rating

A data compression system including successive approximation... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with A data compression system including successive approximation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A data compression system including successive approximation... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1798185

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