Computational graceful degradation method using priority...

Image analysis – Image compression or coding

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07062097

ABSTRACT:
A computational graceful degradation method is disclosed using priority information in multiple objects case. The method degrades the amount of computation in different ratio every object using the priority information if computational power of a decoder does not come up to that necessary for processing encoded multimedia data as decoding the multimedia data encoded by several objects unit, the priority information being determined by an encoder for optimal graceful degradation in terms of relatively importance between respective objects.

REFERENCES:
patent: 5815689 (1998-09-01), Shaw et al.
patent: 5978510 (1999-11-01), Chung et al.
patent: 6091857 (2000-07-01), Shaw et al.
patent: 6233356 (2001-05-01), Haskell et al.
patent: 6301303 (2001-10-01), Chung et al.
patent: 05-236286 (1993-09-01), None
patent: 6-291777 (1994-10-01), None
patent: 8-130739 (1996-09-01), None
patent: 09-182071 (1997-07-01), None
patent: WO - 96/42 169 (1996-12-01), None

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

Computational graceful degradation method using priority... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computational graceful degradation method using priority..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational graceful degradation method using priority... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3625691

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