Image analysis – Image compression or coding – Adaptive coding
Reexamination Certificate
1999-02-12
2001-01-23
Tadayon, Bijan (Department: 2721)
Image analysis
Image compression or coding
Adaptive coding
C382S235000
Reexamination Certificate
active
06178266
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to the recovery of data. More particularly, the present invention relates to the recovery of lost/damaged compression constants in a bitstream of compressed data.
2. Art Background
It is often desirable to compress data, such as video images or sound data, for transmission and storage. Typically, when data is compressed, compression constants are generated. These constants are transmitted or stored along with the compressed image. Problems can arise if the compression constants are lost or damaged prior to decompression of the data. As an illustration, the discussion below illustrates the problems that arise if image data compression constants are lost.
The discrete data points that make up a digital image are known as pixels. Typically, each pixel is represented independently using 8 bits, but other representations also are used for the purposes of compression or analysis. Most of the alternative representations begin by dividing this raw data into disjoint sets. For historical reasons, these sets are referred to as “blocks”, even though they may not have a traditional block shape. The alternative representation then characterizes the data by some block-wide information and per-pixel information.
Examples of block-wide information include the minimum pixel value (MIN), the maximum pixel value (MAX), and the dynamic range of the pixel values (DR). Per-pixel information may indicate where the pixel value lies within the range specified by the global information. For compression to be achieved, the per-pixel information must use only a few bits of storage so that the total number of bits used is less than that required to store the raw image.
In one example, the block data is comprised of the MIN, DR and Qbit number (defined below), and the pixel data is comprised of Q codes. A Q code is an integer in the range [0,2
Q
−1] that identifies one value in the set {MIN, MIN+1, . . . , MAX}. Since the Qbit number is generally small and the DR value may be relatively large, it is generally not possible to represent all pixel values exactly. Therefore, some quantization error is introduced when pixel values are reduced to Q code values. For instance, if the Qbit number is 3, then it is generally possible to represent 2
3
=8 values from the set {MIN, MIN+1, . . . , MAX} without any error. Pixels with other values are rounded to one of these eight values. This rounding introduces quantization error.
Temporal compression is feasible for a sequence of like images spanning more than one instance in time. An image frame is defined as the 2-dimensional collection of pixels arising within a given time period. It is well known that data from corresponding locations of temporally close image frames is likely to contain similar values. When this is true, compression is improved by encoding each of these like values only once.
In a second example, multiple image frames are encoded by adding a motion flag (MF) to the block information of the first example. This MF indicates whether or not data from each frame is encoded using separate Q codes. If no motion is indicated, the same Q codes are used to represent each frame of data. If motion is indicated, then separate Q codes are used to encode each frame.
If any of the block information is lost, the damage to the image is potentially large since many pixels are affected. For this reason, it is desirable to have techniques for estimating the values of this lost data. For example, if the MF value is damaged, there are two possible interpretations of the input bitstream. One interpretation expects the same Q codes to be used for both frames, and the second interpretation expects the frames to use different Q codes. If the wrong interpretation is chosen, then all the pixels in the block are potentially damaged. Even worse, all the pixels in subsequent blocks could be damaged since the decoder has lost its place in the bitstream. For this reason it is important to have a highly accurate recovery method.
Recovery methods fall into two categories: decoded domain, and encoded domain. Decoded domain techniques restore portions of the image to its raw data format and then exploit local correlation properties to estimate the missing data. Data recovery, including recovery of compression constants, may be performed in the decoded domain. However, additional computation and time, and therefore additional expense, is required to perform and evaluate decodings.
SUMMARY OF THE INVENTION
The system and method of the present invention provides an innovative technique for recovering lost or damaged (lost/damaged) compression constants in the encoded domain. In one embodiment, a lost/damaged compression constant is recovered by determining at least one candidate compression constant, adjusting encoded data to a common scale, scoring the candidate compression constant using the adjusted encoded data, and selecting the candidate compression constant with the best score as the recovered compression constant. In one embodiment, the encoded data is adjusted by the addition of an offset. Furthermore, in another embodiment, the encoded data may have been randomized prior to the function which caused data loss (e.g., transmission/storage of the encoded data); therefore a derandomization process may be applied to the data. In another embodiment, a plurality of blocks may be processed wherein the scoring is performed across a plurality of blocks.
REFERENCES:
patent: 3311879 (1967-03-01), Daher
patent: 3805232 (1974-04-01), Allen
patent: 4361853 (1982-11-01), Remy et al.
patent: 4381519 (1983-04-01), Wilkinson et al.
patent: 4419693 (1983-12-01), Wilkinson et al.
patent: 4574393 (1986-03-01), Blackwell et al.
patent: 4703351 (1987-10-01), Kondo
patent: 4703352 (1987-10-01), Kondo
patent: 4710811 (1987-12-01), Kondo
patent: 4722003 (1988-01-01), Kondo
patent: 4729021 (1988-03-01), Kondo
patent: 4772947 (1988-09-01), Kono
patent: 4788589 (1988-11-01), Kondo
patent: 4815078 (1989-03-01), Shimura
patent: 4845560 (1989-07-01), Kondo et al.
patent: 4890161 (1989-12-01), Kondo
patent: 4924310 (1990-05-01), Von Brandt
patent: 4953023 (1990-08-01), Kondo
patent: 4975915 (1990-12-01), Sako et al.
patent: 5023710 (1991-06-01), Kondo et al.
patent: 5122873 (1992-06-01), Golin
patent: 5142537 (1992-08-01), Kutner et al.
patent: 5159452 (1992-10-01), Kinoshita et al.
patent: 5196931 (1993-03-01), Kondo
patent: 5208816 (1993-05-01), Seshardi et al.
patent: 5237424 (1993-08-01), Nishino et al.
patent: 5241381 (1993-08-01), Kondo
patent: 5243428 (1993-09-01), Challapali et al.
patent: 5258835 (1993-11-01), Kato
patent: 5327502 (1994-07-01), Katata et al.
patent: 5359694 (1994-10-01), Concordel
patent: 5379072 (1995-01-01), Kondo
patent: 5398078 (1995-03-01), Masuda et al.
patent: 5416651 (1995-05-01), Uetake et al.
patent: 5416847 (1995-05-01), Boze
patent: 5428403 (1995-06-01), Andrew et al.
patent: 5434716 (1995-07-01), Sugiyama et al.
patent: 5438369 (1995-08-01), Citta et al.
patent: 5446456 (1995-08-01), Seo
patent: 5455629 (1995-10-01), Sun et al.
patent: 5469216 (1995-11-01), Takahashi et al.
patent: 5471501 (1995-11-01), Parr et al.
patent: 5481554 (1996-01-01), Kondo
patent: 5481627 (1996-01-01), Kim
patent: 5495298 (1996-02-01), Uchida et al.
patent: 5552608 (1996-09-01), Shimizume
patent: 5594807 (1997-01-01), Liu
patent: 5598214 (1997-01-01), Kondo et al.
patent: 5617333 (1997-04-01), Oyamada et al.
patent: 5625715 (1997-04-01), Trew et al.
patent: 5636316 (1997-06-01), Oku et al.
patent: 5663764 (1997-09-01), Kondo et al.
patent: 5689302 (1997-11-01), Jones
patent: 5703889 (1997-12-01), Shimoda et al.
patent: 5737022 (1998-04-01), Yamaguchi et al.
patent: 5751361 (1998-05-01), Kim
patent: 5751743 (1998-05-01), Takizawa
patent: 5790195 (1998-08-01), Ohsawa
patent: 5796786 (1998-08-01), Lee
patent: 5805762 (1998-09-01), Boyce et al.
patent: 5852470 (1998-12-01), Kondo et al.
patent: 5861922 (1999-01-01), Murashita et al.
patent: 5878183 (1999-03-01),
Carrig James J.
Fujimori Yasuhiro
Ghosal Sugata
Kondo Tetsujiro
Nakaya Hideo
Azarian Seyed
Blakely , Sokoloff, Taylor & Zafman LLP
Sony Corporation
Tadayon Bijan
LandOfFree
Method and apparatus for the recovery of 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 Method and apparatus for the recovery of compression..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for the recovery of compression... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2445692