US 6,519,369 B1Grant
Method and apparatus for filter tap expansion
Issue Date:2003-02-11
•98 Claims
•20 Drawing Sheets
Abstract
A method, apparatus, and article of manufacture for restoring a deteriorated signal to an undeteriorated signal. A deteriorated signal consists of a plurality of deteriorated and undeteriorated data points. For each deteriorated data point, a plurality of class types is created based upon characteristics of the area containing the deteriorated data point. The data point is classified with respect to one of the plurality of class types and assigned a corresponding input signal class. The undeteriorated signal is generated by adaptively filtering the deteriorated input signal in accordance with the input signal classification result. More than one classification method is used to create the plurality of class types. An adaptive tap structure may optionally be used based on the corresponding plurality of class types. Filter tap expansion is used to reduce the number of filter coefficients. The number of filter coefficients that must be stored can be reduced by allocating the same coefficient to multiple taps. This process is referred to as filter tap expansion.
Metadata
Assignees
- SOny Corporation
- Sony ELectronics Inc.
Inventors
- Tetsuiiro Kondo
- Yasuhiro Fujimori
- Sugata Ghosal
- James J. Carrig
Application Information
Application Number:US 09/249,823
Filing Date:1999-02-12
Priority Date:1999-02-12
Art Unit:7
Classifications
IPC:
G06K 940G06T 500H04N 1409H04N 521H04N 5235
Field of Search:
3822613822633822643822663822693822753822543822243486063486073484483484523482413482083752402737524029
Patent Drawings (20 sheets)
Description
Field of the Invention
[0002] This invention relates generally to the processing of image, sound or other correlated signals, and more particularly, to a method, apparatus, and article of manufacture for restoring a deteriorated signal to an undeteriorated signal.
Background of the Invention
[0003] Conventionally, to restore an image that is deteriorated in image quality it is necessary to analyze the cause of the deterioration, determine a deterioration model function, and apply its inverse function to the deteriorated image. Various causes of deteriorations are possible, such as a uniform movement of a camera (imaging device such as a video camera) and blurring caused by the optical system of a camera. Therefore, in restoring an image, different model functions may be used for respective causes of deteriorations. Unless the cause of deterioration is found, it is difficult to restore a deteriorated image because a model function cannot be determined.
[0004] In addition, it is frequently the case that even if a model function of a deterioration is established, there is no inverse function for restoration that corresponds to the model function. In such a case, it is difficult to perform evaluation for determining the optimum model.
[0005] Conventionally, error recovery has been achieved by correlation evaluation. For example, some recovery choices have been implemented using a conventional error pixel recovery method. FIG. 1A shows a conventional error recovery block diagram. Using neighboring data, which are shown in FIG. 1B, spatial inclinations of the target data are detected. In this example, the inclinations regarding four directions are evaluated according to the formulae which are shown in FIG. 1C. An interpolation filter is chosen where the inclination value, Ei, is the smallest among four values. In addition to the spatial inclination, a motion factor is also evaluated for error recovery. In the case of the motion area, a selected spatial filter is used for error recovery. On the other hand, the previous frame data at the same location as the target data are used for error recovery. This evaluation is performed in the evaluation block of FIG. 1A.
[0006] The conventional error recovery process shown in FIGS. 1A-1C may cause many serious degradations on changing data, especially on object edges. Actual signal distribution typically varies widely, so these problems are likely to occur. Therefore, there is a need for a way to restore a deteriorated signal to an undeteriorated signal which minimizes degradations on changing data.
Summary of the Invention
[0007] The present invention provides a method, apparatus, and article of manufacture for restoring a deteriorated signal to an undeteriorated signal. A deteriorated signal consists of a plurality of deteriorated and undeteriorated data points. For each deteriorated data point, a plurality of class types is created based upon characteristics of the area containing the deteriorated data point. The data point is classified with respect to one of the plurality of class types and assigned a corresponding input signal class. The undeteriorated signal is generated by adaptive filtering of the input signal in accordance with the input signal classification results. More than one classification method may optionally be used to create the plurality of class types. Created classes may include a motion class, an error class, a spatial class or a spatial activity class. An adaptive class tap structure may optionally be used to create the plurality of class types. An adaptive filter tap structure may optionally be used base on the corresponding plurality of class types. Filter tap expansion may optionally be used to reduce the number of filter coefficients. The deteriorated input signal may optionally be modified by preprocessing peripheral erroneous data. A spatial class may optionally be modified according to spatial symmetry.
Brief Description of the Drawings
[0008] The present invention is illustrated by way of example and may be better understood by referring to the following description in conjunction with the accompanying drawings, in which like references indicate similar elements and in which:
[0009] FIGS. 1A-1C show a conventional error recovery method, filter tap, and correspondence between inclination value and interpolation filter;
[0010] FIGS. 2A-2D show a classified adaptive error recovery method and class compatible with an embodiment of the present invention;
[0011] FIG. 3 shows a motion class tap compatible with an embodiment of the present invention;
[0012] FIG. 4 shows an error class tap compatible with an embodiment of the present invention;
[0013] FIG. 5 shows an adaptive spatial class tap compatible with an embodiment of the present invention;
[0014] FIG. 6 shows an adaptive spatial class tap (error class 0) compatible with an embodiment of the present invention;
[0015] FIG. 7 shows an adaptive spatial class tap (error class 1) compatible with an embodiment of the present invention;
[0016] FIG. 8 shows an adaptive spatial class tap (error class 2) compatible with an embodiment of the present invention;
[0017] FIG. 9 shows an adaptive spatial class tap (error class 3) compatible with an embodiment of the present invention;
[0018] FIG. 10 shows an adaptive filter tap compatible with an embodiment of the present invention;
[0019] FIG. 11 shows a motion class adaptive filter tap compatible with an embodiment of the present invention;
[0020] FIG. 12 shows a motion class adaptive filter tap (error class 0) compatible with an embodiment of the present invention;
[0021] FIG. 13 shows a motion class adaptive filter tap (error class 1) compatible with an embodiment of the present invention;
[0022] FIG. 14 shows a motion class adaptive filter tap (error class 2) compatible with an embodiment of the present invention;
[0023] FIG. 15 shows a motion class adaptive filter tap (error class 3) compatible with an embodiment of the present invention;
[0024] FIG. 16 shows a preprocessing algorithm compatible with an embodiment of the present invention;
[0025] FIG. 17 shows a motion tap and stationary tap preprocessing algorithm compatible with an embodiment of the present invention;
[0026] FIG. 18 shows a system block diagram compatible with an embodiment of the present invention;
[0027] FIG. 19 shows coefficient memory contents compatible with an embodiment of the present invention;
[0028] FIG. 20 shows an ADRC class reduction based on a 4-tap 1-bit ADRC compatible with an embodiment of the present invention; and
[0029] FIG. 21 shows an example of audio signal adaptive classification compatible with an embodiment of the present invention.
Detailed Description of an Embodiment of the Present Invention
[0030] In the following description of an embodiment of the present invention, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration a specific embodiment in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
[0031] The present invention provides a method, apparatus, and article of manufacture for restoring a deteriorated signal to an undeteriorated signal using classified adaptive error recovery. Target data is the particular data of the deteriorated signal whose value is to be determined or estimated.
[0032] Classified adaptive error recovery is the technology which utilizes classified adaptive filter processing. A proper classification with respect to the deteriorated input signal is performed according to the input signal characteristics. An adaptive filter is prepared for each class prior to error recovery processing.
[0033] More than one classification method may optionally be used to generate the plurality of classes. Generated classes may include a motion class, an error class, a spatial activity class or a spatial class. An adaptive class tap structure may optionally be used to generate the plurality of classes. An adaptive filter tap structure may optionally be used according to the class which is detected in each deteriorated input signal. The adaptive filter tap structure may optionally be expanded based upon multiple taps. The number of filter coefficients that must be stored can be reduced by allocating the same coefficient to multiple taps. This process is referred to as filter tap expansion. The deteriorated input signal may optionally be modified by preprocessing peripheral erroneous data. A spatial class may optionally be eliminated according to a spatial class elimination formula.
[0034] The present invention can be applied to any form of correlated data, including without limitation photographs or other two-dimensional static images, holograms, or other three-dimensional static images, video or other two-dimensional moving images, three-dimensional moving images, a monaural sound stream, or sound separated into a number of spatially related streams, such as stereo. In the description, the term value, in one embodiment, may refer to a component within a set of received or generated data. Furthermore, a data point is a position, place, instance, location or range within data.
[0035] For the sake of clarity, some of the description herein focuses on video data comprising a pixel stream. However, it will be recognized that the present invention may be used with other types of data other than video data and that the terms and phrases used herein to describe the present invention cover a broad range of applications and data types. For example, an adaptive class tap structure is an adaptive structure for class tap definition used in multiple classification. A spatial class, a motion class and an error class may be used to define the structure. An adaptive filter tap structure is an adaptive structure for filter tap definition based upon a corresponding class.
[0036] A class may be defined based on one or more characteristics of the target data. For example, a class may also be defined based on one or more characteristics of the group containing the target data. A class ID is a specific value within the class that is used to describe and differentiate the target data from other data with respect to a particular characteristic. A class ID may be represented by a number, a symbol, or a code within a defined range. A parameter may be used as a predetermined or variable quantity that is used in evaluating, estimating, or classifying the data. For example, the particular motion class ID of a target data can be determined by comparing the level of motion quantity in the block containing the target data against a parameter which can be a pre-determined threshold.
[0037] Multiple Classification
[0038] In one embodiment, a multiple class may be used as a collection of specific values or sets of values used to describe at least two different characteristics of the target data. For example, a multiple class may be defined to be a combination of at least two different classes. For example, a multiple class may be defined to be a combination of an error class, a motion class, and a spatial class such as an ADRC class.
[0039] In one embodiment, the multiple class ID can be used as the memory address to locate the proper filter coefficients and other information that are used to determine or estimate the value of the target data. In one embodiment, a simple concatenation of different class IDs in the multiple class ID is used as the memory address.
[0040] Therefore, a multiple classification scheme is a way of classifying the target data with respect to more than one characteristic of the target data in order to more accurately determine or estimate the value of the target data.
[0041] An error class is a collection of specific values used to describe the various distribution patterns of erroneous data in the neighborhood of the target data. In one embodiment, an error class is defined to indicate which adjacent data to the target data is erroneous. An error class ID is a specific value within the error class used to describe a particular distribution pattern of erroneous data in the neighborhood of the target data. For example, an error class ID of “0” may be defined to indicate that there is no erroneous data to the left and to the right of the target data; an error class ID of “1” may be defined to indicate that the data to the left of the target data is erroneous, etc. A filter is a mathematical process, function or mask for selecting a group of data.
[0042] A motion class is a collection of specific values used to describe the motion characteristic of the target data. In one embodiment, the motion class is defined based on the different levels of motion of the block containing the target data, for example, no motion in the block, little motion in the block, or large motion in the block. A motion class ID is a specific value within the motion class used to indicate a particular level of motion quantity of the target data. For example, motion class ID of “0” may be defined to indicate no motion, motion class ID of “3” may be defined to indicate large motion.
[0043] A spatial class is a collection of specific values used to describe the spatial characteristic of the target data. For example, spatial classification of the data may be determined using Adaptive Dynamic Range Coding (ADRC), Differential Pulse Code Modulation (DPCM), Vector Quantization (VQ), Discrete Cosine Transform (DCT), etc. A spatial class ID is a specific value within the spatial class used to describe the spatial pattern of the target data in the group or block containing the target data.
[0044] For example, an ADRC class is a spatial class defined by the Adaptive Dynamic Range Coding method. An ADRC class ID is a specific value within the ADRC class used to describe the spatial pattern of the data distribution in the group or block containing the target data. A class is a collection of specific values used to describe certain characteristics of the target data. A variety of different types of classes exist, for example, a motion class, a spatial class, an error class, a spatial activity class, etc.
[0045] The present invention provides a method and apparatus for adaptive processing that generates data corresponding to a set of one or more data classes. This process is known as “classification”. Classification can be achieved by various attributes of signal distribution. For example, Adaptive Dynamic Range Coding (ADRC) may be used for generation of each class as a spatial class, but it will be recognized by one of ordinary skill in the art that other classes, including a motion class, an error class, and a spatial activity class may be used with the present invention without loss of generality. A spatial activity class is a collection of specific values used to describe the spatial activity characteristic of the target data. For example, spatial activity classification of the data may be determined using the dynamic range, the standard deviation, the Laplacian value or the spatial gradient value. Some classification methods provide advantages which are desirable before restoration of a deteriorated signal takes place. For example, ADRC can achieve classification by normalizing each signal waveform automatically.
[0046] For each class, a suitable filter for signal restoration is prepared for the adaptive processing. In one embodiment, each filter is represented by a matrix of filter coefficients which are applied to the data. The filter coefficients can be generated by a training process, an example of which is described subsequently, that occurs as a preparation process prior to filtering. In one embodiment of the present invention, the filter coefficients can be stored in a random access memory (RAM), shown in FIG. 2A at 207.
[0047] A typical signal processing flow of the present invention is shown in FIG. 2A. Target input data 201 can be accompanied with error flag data 203. Error flag data can indicate locations within the data that contain erroneous pixels. In one embodiment of the present invention, an ADRC class is generated for each input target data in classification block 205, filter coefficients corresponding to each class ID are output from the coefficient memory block 207, and filtering is executed with input data 201 and the filter coefficients in the filter block 209. The filtered data may correspond to an error recovered result. In the selector block 211, switching between error recovered data and error free data occurs according to the error flag data 203.
[0048] In FIG. 2B, an example is shown where the number of class taps is four. In the case of 1-bit ADRC, 16 class IDs are available as given by [formula 3], shown below. ADRC is realized by [formula 2], shown below. Detecting a local dynamic range (DR) is given by [formula 1], shown below,
[0049] DR=MAX−MIN+1 [formula 1 ]
[0050] where c corresponds to an ADRC class ID, DR represents the dynamic range of the four data area, MAX represents the maximum level of the four data, MIN represents the minimum level of the four data, qiis the ADRC encoded data, also referred to as a Q code, and Q is the number of quantization bits. The └•┘ operator represents a truncation operation.
[0051] In 1-bit ADRC, c may have a value from 0 to 15 with Q=1. This process is one type of spatial classification, but it will be recognized by one of ordinary skill in the art that other examples of spatial classification, including Differential PCM, Vector Quantization and Discrete Cosine Transform may be used with the present invention without loss of generality. Any method may be used if it can classify a target data distribution.
[0052] In the example shown in FIG. 2C, each adaptive filter has 12 taps. Output data is generated according to the linear combination operation given by [formula 4], shown below,
[0053] where xiis input data, wicorresponds to each filter coefficient, and y is the output data after error recovery. Filter coefficients can be generated for each class ID by a training process that occurs prior to the error recovery process.
[0054] For example, training may be achieved according to the following criterion.
[0055] where X, W, and Y are, for example, the following matrices: X is the input data matrix defined by [formula 6], W is the coefficient matrix defined by [formula 7], and Y corresponds to the target data matrix defined by [formula 8].
[0056] The coefficient wican be obtained according to [formula 5], so that estimation errors against target data are minimized.
[0057] In the example shown in FIG. 2C, 12 coefficients regarding each ADRC class ID are determined by the training method described above.
[0058] A flow diagram of an embodiment of the present invention is shown in FIG. 2D. The flow chart of FIG. 2D shows the basic processing stream for generating an undeteriorated signal from the deteriorated input signal. At step 215, the preprocessing for a peripheral erroneous pixel is performed. At step 217, each classification regarding the deteriorated input signal is executed to generate a class ID. Some class taps are selected adaptively according to another class ID. Multiple classification may be executed, such as motion classification, error classification, spatial activity classification and spatial classification.
[0059] The classification scheme can be defined during system design, where the classification scheme, the number of classes, and other specification are decided for the target data. The design stage may include, among others, considerations of system performance and hardware complexity.
[0060] At step 219, multiple classification generates a multiple class ID with a plurality of class IDs which are generated by various classification at step 217. At step 221, filter taps are adaptively selected according to the multiple class ID which is generated at step 219. At step 223, the filter tap structure is adaptively expanded according to the multiple class ID which is generated at step 219. The number of filter coefficients that must be stored can be reduced by allocating the same coefficient to multiple taps. This process is referred to as filter tap expansion. At step 224, filter coefficients are selected according to the multiple class ID which is generated at step 219. At step 225, filtering with respect to the deteriorated input signal is executed to generate an undeteriorated signal. Filter coefficients are selected adaptively according to the multiple class ID which is generated in step 219.
[0061] In one embodiment of the present invention, a three dimensional ADRC process may be used to realize spatio-temporal classification, because simple waveform classifications such as a two dimensional ADRC process typically cannot structurally achieve separation for general motion pictures in the class of FIG. 2B. If both stationary and motion areas are processed in the same class ID, error recovery quality is degraded because of differences in characteristics of the two areas.
[0062] In another embodiment of the present invention, motion classification, in addition to spatial classification, may also be used to provide compact definition of temporal characteristics. Further, multiple classification may be added to the classified adaptive error recovery method. For example, there are various types of classes, such as a motion class, an error class, a spatial activity class and a spatial class explained above. The combination of one or more of these different classification methods can also improve classification quality.
[0063] FIG. 3 shows an example of motion class tap structures. The example shows eight taps in neighborhood of the target error data. In this example, the eight tap accumulated temporal difference can be evaluated according to [formula 9], shown below, and is classified to four kinds of motion classes by thresholding based on [formula 10], shown below. In one embodiment of the present invention, th0 is equal to 3, th1 is equal to 8, and th2 is equal to 24.
[0064] In the above formulas, fd represents an accumulated temporal difference, xirepresents motion class tap data of the current frame, x′irepresents the previous frame tap data corresponding to the current frame, and mc represents a motion class ID. Three thresholds, th0, th1, th2, can be used for this motion classification.
[0065] In one embodiment of the present invention, an error class can be used in conjunction with the classified adaptive error recovery method. This classification is achieved according to the erroneous data distribution pattern in neighborhood of the target data, examples of which are shown in FIG. 4. This example has four error classes: an independent error case, a left error case, a right error case, and a three consecutive error case.
[0066] Generally speaking, filter coefficients of pixels adjacent to the target data have larger weights for error recovery. The data adjacent to the error data has a significant impact on the result of error recovery. Error classes can reduce this influence by separating different characteristic areas to other classes according to the adjacent erroneous data distribution. For the example shown in FIG. 2B, ADRC classification generates 16 kinds of ADRC class IDs, where motion and error classification generate four kinds of class IDs, respectively. Thus, the number of class IDs equals 16×4×4, or 256. Classification may be realized by representing each signal characteristic. Multiple classification can define a suitable class, the class ID, regarding the erroneous target data by combining different classification characteristics.
[0067] Adaptive Class Tap Structure
[0068] In one embodiment of the present invention, an adaptive class tap structure can be used in conjunction with the classified adaptive error recovery method. FIG. 5 shows one example of motion class adaptive spatial class tap structures. Intra-frame taps can be chosen in a stationary or a slow motion area. Intra-field taps are typically used for larger motion areas. Suitable spatial classification is achieved by this adaptive processing.
[0069] For example, if intra-frame taps are used for large motion area classification, then the generated class distribution may vary widely because of low correlation, and therefore it will be difficult to represent the target data characteristics properly. An adaptive class tap structure, such as that shown in FIG. 5, is therefore effective.
[0070] Additional examples are shown in FIGS. 6, 7, 8, 9. Spatial class taps are typically selected according to a motion and an error class. In addition to the motion factor, the erroneous data distribution is taken into account for the spatial class tap definition. The neighboring erroneous data is typically not introduced to the spatial classification. By this definition, only valid data is used and the classification accuracy is improved.
[0071] Adaptive Filter Tap Structure
[0072] In one embodiment of the present invention, an adaptive filter tap structure based on a corresponding class can be used in conjunction with the classified adaptive error recovery method. FIG. 10 shows one example of an adaptive filter tap structures based on an error class. The filter tap structure regarding the target data is typically defined adaptively, preferably avoiding damaged data in neighborhood. Damaged data is not chosen for filtering.
[0073] An adaptive filter tap structure can be also defined according to motion class, an example of which is shown in FIG. 11. In the motion class example shown in FIG. 10, motion class 0 corresponds to stationary areas, but motion class 3 corresponds to large motion areas. Motion classes 1 and 2 correspond to intermediate motion areas.
[0074] For stationary or quasi-stationary class areas, intra-frame taps are used as shown in FIG. 11. At the same time, previous frame data at the target data location may be used for error recovery filtering. These areas correspond to motion class 0 and 1. For fast motion or moderate motion areas, each filter typically has an intra-field taps structure, which is also shown in FIG. 11. As shown by the example in FIG. 11, previous frame data is not introduced, and thus weakly correlated data is ignored. Filtering quality is typically improved by intra-field taps in such cases.
[0075] FIG. 12 shows an example of motion and error class adaptive filter tap structures. FIGS. 10 and 11 represent error and motion class adaptive filter taps, respectively. The example shown in FIG. 12 illustrates both adaptive structures with error class0, which is the independent error case. Upper adaptive characteristics are also shown in this example. In a manner similar to that of FIG. 12, FIG. 13 corresponds to error class 1, FIG. 14 corresponds to error class 2 and FIG. 15 corresponds to error class 3.
[0076] Filter Tap Expansion
[0077] In one embodiment of the present invention, filter tap expansion by allocating the same coefficient to plural taps can be used in conjunction with the classified adaptive error recovery method. Filter tap expansion is also shown by the structures in FIGS. 12-15. For example, the filter tap structure has four of the same coefficient taps with motion class 3 in FIG. 12. According to the evaluation results, some tap coefficients can be replaced with the same coefficient. The example shown in FIG. 12 has four W3 coefficients that are allocated at horizontally and vertically symmetric locations. By this expansion, 14 coefficients can cover 18 tap areas. This reduction method can typically reduce the need for coefficient memory and filtering hardware such as adders and multipliers. In one embodiment of the present invention, the expansion tap definition may be achieved by evaluation of coefficient distribution and visual results.
[0078] Preprocessing For Peripheral Erroneous Data
[0079] In one embodiment of the present invention, preprocessing for peripheral erroneous data can be used in conjunction with the classified adaptive error recovery method. To achieve error recovery filtering, suitable data is necessary at peripheral error locations of filter taps.
[0080] One example of this preprocessing is shown by the flow diagram of FIG. 16. If at steps 1601, 1605, or 1609 there is erroneous data at a peripheral location of the target data, at steps 1603, 1607, 1611 the erroneous data is replaced with horizontal processed data in the case of no horizontal errors. If at steps 1613, 1617, or 1621 there are three consecutive horizontal errors, at steps 1615, 1619, or 1623 vertical processing is applied for generating preprocessed data. In all erroneous cases around the intra-frame data of this example, previous frame data is introduced for error processing, at step 1625.
[0081] FIG. 17 shows another preprocessing example that uses a motion adaptive process for preprocessing. Using error free data, motion quantity is detected at the motion detection step 1701. Generally speaking, an averaged motion quantity is calculated by averaging summed motion quantity with the number of error free data at the next step. Motion or stationary taps are chosen at step 1703 according to a threshold value of the result of averaged motion quantity. After these steps, processing steps 1705 through 1729 are performed in a manner similar to steps 1601 through 1625 of FIG. 16. The preprocessed data is generated according to these prioritized processes, and is introduced for error recovery filtering.
[0082] Spatial Class Reduction
[0083] In one embodiment of the present invention, spatial class reduction can be used in conjunction with the classified adaptive error recovery. As explained above, an ADRC class can be used for the spatial classification, given by [formula 3]. This has 16 kinds of class IDs in the definition of a 4 tap ADRC. These 16 class IDs can be reduced to eight kinds of class IDs according to [formula 11], shown below,
[0084] where c corresponds to the ADRC class ID, qiis the quantized data and Q is the number of quantization bits based on [formula 1] and [formula 2].
[0085] In one embodiment of the present invention, [formula 11] corresponds to a 1's complement operation in binary data of the ADRC code. This is related to the symmetric characteristics of each signal waveform. Because ADRC classification is a normalization of the target signal waveform, two waveforms which have the relation of 1's complement in each ADRC code can be classified in the same class ID. ADRC class IDs can typically be halved by this reduction process. An ADRC class reduction based on a 4-tap 1-bit ADRC is shown in FIG. 20. In this example, applying [formula 11] gives eight ADRC class pairs. Each pair contains spatial symmetric patterns, and therefore the number of ADRC class IDs can be reduced by half by taking advantage of these symmetric patterns. The spatial class reduction technique can also be applied to other spatial classification techniques, including but not limited to DPCM and Block Truncation Coding (BTC).
[0086] System Structure
[0087] An overall system structure for one embodiment of the present invention, including all the processes described above, is shown in FIG. 18. Input data 1801 and corresponding error flags 1803 are input to the system. Examining the error flags 1803, the input data 1801 is preprocessed at 1805. ADRC classification is performed at 1807, motion classification is performed at 1809, and error classification is performed at 1811.
[0088] In this example, ADRC class taps are chosen adaptively according to the error and motion class, such as shown in FIGS. 6, 7, 8, 9. Filter tap data are chosen at 1813 based on the error and motion class, such as shown in FIGS. 12, 13, 14, 15. Error recovery filtering is performed at 1817 with tap data and filter coefficients selected from the coefficient memory 1815 corresponding to the ADRC class ID of 1807, the motion class ID of 1809 and the error class ID of 1811. Error recovered data and error free input data 1817 are selected at 1821 according to the error flag 1803, which produces the output data 1823 of this system.
[0089] FIG. 19 shows an example of coefficient memory contents. It has 4×4×8 or 128 class IDs according to the multiple classification scheme. Four categories are used for an error class, four categories are for a motion class, and eight categories are for an ADRC class, which are typically halved according to [formula 11]. Each class corresponds to each memory address in FIG. 19. In this example, 14 coefficients are stored in each class ID address according to the filter definition, like FIGS. 12, 13, 14, 15.
[0090] The present invention may be used with any form of correlated data, including without limitation photographs or other two-dimensional static images, holograms, or other three-dimensional static images, video or other two-dimensional moving images, three-dimensional moving images, a monaural sound stream, or sound separated into a number of spatially related streams, such as stereo. FIG. 21 shows an example of audio signal adaptive classification compatible with the present invention. An example audio signal 2101 is monitored at one or more time points t0-t8. The level of the audio signal 2101 at time points t0-t8 is given by tap points X0-X8. The dynamic range of the audio signal 2101 is given as the difference between the lowest level tap point X0 and the highest level tap point X4. In case of error recovery for erroneous data at t4, multiple classification can be applied with spatial classification like ADRC classification and spatial activity classification like dynamic range classification. Dynamic range classification is performed by thresholding the dynamic range in a manner similar to the motion classification processing of [formula 10]. As described above, motion classification, error classification and spatial classification are referred to in multiple classification. Spatial activity classification can also be introduced to multiple classification for general applications such as video data. In addition to dynamic range, the standard deviation, the Laplacian value or the spatial gradient value can be introduced for spatial activity classification.
[0091] With the present invention, the quality of data that is recovered due to errors is improved by introducing the disclosed technologies to the classified adaptive error recovery method. The present invention provides a way to restore a deteriorated signal to an undeteriorated signal which minimizes degradations on changing data.
[0092] While the invention is described in terms of embodiments in a specific system environment, those of ordinary skill in the art will recognize that the invention can be practiced, with modification, in other and different hardware and software environments within the spirit and scope of the appended claims.
Claims
What is claimed is:
1. A method for restoring a deteriorated input signal comprising the steps of:
detecting a data point of the deteriorated input signal;
creating a classification result based upon an area containing the data point;
selecting a filter coefficient according to the classification result;
assigning the filter coefficient to a plurality of filter taps based upon the classification result;
creating an undeteriorated data by filtering the data with the filter coefficient; and
outputting an undeteriorated signal corresponding to the input signal.
2. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
3. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to the classification result.
4. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a class ID.
5. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a motion class.
6. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to an error class.
7. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial class.
8. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial activity class.
9. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
10. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
11. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
12. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
13. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a dynamic range class.
14. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a standard deviation class.
15. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Laplacian class.
16. The method of claim 1 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial gradient class.
17. A method for restoring a deteriorated input signal comprising the steps of:
detecting a data point of the deteriorated input signal;
classifying an area containing the data point with respect to a plurality of class types;
creating a multiple classification result with the plurality of class types;
selecting a filter coefficient according to the multple classification result;
assigning the filter coefficient to a plurality of filter taps based upon the multple classification result;
creating undeteriorated data by filtering the data with the filter coefficient; and
outputting an undeteriorated signal corresponding to the input signal.
18. The method of claim 17 wherein the step of creating a multiple classification result comprises creating the multiple classification result based upon a plurality of class IDs with the plurality of class types.
19. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
20. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to the multiple classification result.
21. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a motion class.
22. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to an error class.
23. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial class.
24. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial activity class.
25. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
26. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
27. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
28. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
29. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a dynamic range class.
30. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a standard deviation class.
31. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a Laplacian class.
32. The method of claim 17 further comprising the step of assigning the filter coefficient to a plurality of filter taps according to a spatial gradient class.
33. An article of manufacture for use in a computer system to restore a deteriorated input signal, the article of manufacture comprising a computer usable medium having computer readable program code means embodied in the medium, the program code means including:
computer readable program code means embodied in the computer usable medium for causing a computer to detect a data point of the deteriorated input signal;
computer readable program code means embodied in the computer usable medium for causing a computer to create a classification result based upon an area containing the data point;
computer readable program code means embodied in the computer usable medium for causing a computer to select a filter coefficient according to the classification result;
computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps based upon the classification result;
computer readable program code means embodied in the computer usable medium for causing a computer to create an undeteriorated data by filtering the data with the filter coefficient; and
computer readable program code means embodied in the computer usable medium for causing a computer to output an undeteriorated signal corresponding to the input signal.
34. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
35. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to the classification result.
36. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a class ID.
37. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a motion class.
38. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to an error class.
39. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial class.
40. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial activity class.
41. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
42. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
43. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
44. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
45. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a dynamic range class.
46. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a standard deviation class.
47. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Laplacian class.
48. The article of manufacture of claim 33 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial gradient class.
49. An article of manufacture for use in a computer system to restore a deteriorated input signal, the article of manufacture comprising a computer usable medium having computer readable program code means embodied in the medium, the program code means including:
computer readable program code means embodied in the computer usable medium for causing a computer to detect a data point of the deteriorated input signal;
computer readable program code means embodied in the computer usable medium for causing a computer to classify an area containing the data point with respect to a plurality of class types;
computer readable program code means embodied in the computer usable medium for causing a computer to create a multiple classification result with the plurality of class types;
computer readable program code means embodied in the computer usable medium for causing a computer to select a filter coefficient according to the multple classification result;
computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps based upon the classification result;
computer readable program code means embodied in the computer usable medium for causing a computer to create undeteriorated data by filtering the data with the filter coefficient; and
computer readable program code means embodied in the computer usable medium for causing a computer to output an undeteriorated signal corresponding to the input signal.
50. The article of manufacture of claim 49 wherein the computer readable program code means embodied in the computer usable medium for causing a computer to create a multiple classification result comprises computer readable program code means embodied in the computer usable medium for causing a computer to create the multiple classification result based upon a plurality of class IDs with the plurality of class types.
51. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
52. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to the multiple classification result.
53. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a motion class.
54. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to an error class.
55. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial class.
56. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial activity class.
57. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
58. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
59. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
60. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
61. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a dynamic range class.
62. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a standard deviation class.
63. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a Laplacian class.
64. The article of manufacture of claim 49 further comprising computer readable program code means embodied in the computer usable medium for causing a computer to assign the filter coefficient to a plurality of filter taps according to a spatial gradient class.
65. An apparatus for restoring a deteriorated input signal comprising:
a detector to detect a data point of the deteriorated input signal;
a result generator logically coupled to the detector to create a classification result with the plurality of class types;
a selector logically coupled to the result generator to select a filter coefficient according to the classification result;
an assignor logically coupled to the selector to assign the filter coefficient to a plurality of filter taps based upon the multple classification result;
a data restorer logically coupled to the assignor to create an undeteriorated data by filtering the data with the filter coefficient; and
a transmitter logically coupled to the data restorer to output an undeteriorated signal corresponding to the input signal.
66. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
67. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to the classification result.
68. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a class ID.
69. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a motion class.
70. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to an error class.
71. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial class.
72. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial activity class.
73. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
74. The apparatus of claim 69 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
75. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
76. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
77. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a dynamic range class.
78. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a standard deviation class.
79. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Laplacian class.
80. The apparatus of claim 65 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial gradient class.
81. An apparatus for restoring a deteriorated input signal comprising:
a detector to detect a data point of the deteriorated input signal;
classifier logically coupled to the detector to classify an area containing the data point with respect to a plurality of class types;
a result generator logically coupled to the classifier to create a multiple classification result with the plurality of class types;
a selector logically coupled to the result generator to select a filter coefficient according to the multiple classification result;
an assignor logically coupled to the selector to assign the filter coefficient to a plurality of filter taps based upon the multiple classification result;
a data restorer logically coupled to the assignor to create an undeteriorated data by filtering the data with the filter coefficient; and
a transmitter logically coupled to the data restorer to output an undeteriorated signal corresponding to the input signal.
82. The apparatus of claim 81 wherein the result generator comprises a result generator to create the multiple classification result based upon a plurality of class IDs with the plurality of class types.
83. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a characteristic of an area containing the data point.
84. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to the multiple classification result.
85. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a motion class.
86. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to an error class.
87. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial class.
88. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial activity class.
89. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to an Adaptive Dynamic Range Coding (ADRC) class.
90. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Differential Pulse Code Modulation (DPCM) class.
91. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Vector Quantization (VQ) class.
92. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Discrete Cosine Transform (DCT) class.
93. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a dynamic range class.
94. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a standard deviation class.
95. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a Laplacian class.
96. The apparatus of claim 81 further comprising a second assignor to assign the filter coefficient to a plurality of filter taps according to a spatial gradient class.
97. An apparatus for restoring a deteriorated input signal comprising:
means for detecting a data point of the deteriorated input signal;
means for creating a classification result based upon an area containing the data point;
means for selecting a filter coefficient according to the classification result;
means for assigning the filter coefficient to a plurality of filter taps based upon the classification result;
means for creating an undeteriorated data by filtering the data with the filter coefficient; and
means for outputting an undeteriorated signal corresponding to the input signal.
98. An apparatus for restoring a deteriorated input signal comprising:
means for detecting a data point of the deteriorated input signal;
means for classifying an area containing the data point with respect to a plurality of class types;
means for creating a multiple classification result with the plurality of class types;
means for selecting a filter coefficient according to the multple classification result;
means for assigning the filter coefficient to a plurality of filter taps based upon the multple classification result;
means for creating undeteriorated data by filtering the data with the filter coefficient; and
means for outputting an undeteriorated signal corresponding to the input signal.
Patent Citations (137)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3311879(A) | 1967-03-01 | Daher | Applicant |
| US3805232(A) | 1974-04-01 | Allen | Applicant |
| US4361853(A) | 1982-11-01 | Remy et al. | Applicant |
| US4381519(A) | 1983-04-01 | Wilkinson et al. | Applicant |
| US4419693(A) | 1983-12-01 | Wilkinson et al. | Applicant |
| US4438438(A) | 1984-03-01 | Arens, et al. | Applicant |
| US4532628(A) | 1985-07-01 | Matthews | Applicant |
| US4574393(A) | 1986-03-01 | Blackwell et al. | Applicant |
| US4586082(A) | 1986-04-01 | Wilkinson | Applicant |
| US4656514(A) | 1987-04-01 | Wilkinson et al. | Applicant |
| US4675735(A) | 1987-06-01 | Wilkinson et al. | Applicant |
| US4703351(A) | 1987-10-01 | Kondo | Applicant |
| US4703352(A) | 1987-10-01 | Kondo | Applicant |
| US4710811(A) | 1987-12-01 | Kondo | Applicant |
| US4722003(A) | 1988-01-01 | Kondo | Applicant |
| US4729021(A) | 1988-03-01 | Kondo | Applicant |
| US4772947(A) | 1988-09-01 | Kono | Applicant |
| US4788589(A) | 1988-11-01 | Kondo | Applicant |
| US4807033(A) | 1989-02-01 | Keesen et al. | Applicant |
| US4815078(A) | 1989-03-01 | Shimura | Applicant |
| US4845560(A) | 1989-07-01 | Kondo et al. | Applicant |
| US4890161(A) | 1989-12-01 | Kondo | Applicant |
| US4924310(A) | 1990-05-01 | Von Brandt | Applicant |
| US4953023(A) | 1990-08-01 | Kondo | Applicant |
| US4975915(A) | 1990-12-01 | Sako et al. | Applicant |
| US5023710(A) | 1991-06-01 | Kondo et al. | Applicant |
| US5043810(A) | 1991-08-01 | Vreeswijk et al. | Applicant |
| US5086489(A) | 1992-02-01 | Shimura | Applicant |
| US5093872(A) | 1992-03-01 | Tutt | Applicant |
| US5101446(A) | 1992-03-01 | Resnikoff et al. | Applicant |
| US5122873(A) | 1992-06-01 | Golin | Applicant |
| US5134479(A) | 1992-07-01 | Ohishi | Applicant |
| US5142537(A) | 1992-08-01 | Kutner et al. | Applicant |
| US5150210(A) | 1992-09-01 | Hoshi et al. | Applicant |
| US5159452(A) | 1992-10-01 | Kinoshita et al. | Applicant |
| US5166987(A) | 1992-11-01 | Kageyama | Applicant |
| US5177797(A) | 1993-01-01 | Takenaka et al. | Applicant |
| US5185746(A) | 1993-02-01 | Tanaka et al. | Applicant |
| US5196931(A) | 1993-03-01 | Kondo | Applicant |
| US5237424(A) | 1993-08-01 | Nishino et al. | Applicant |
| US5241381(A) | 1993-08-01 | Kondo | Applicant |
| US5243428(A) | 1993-09-01 | Challapali et al. | Applicant |
| US5247363(A) | 1993-09-01 | Sun et al. | Applicant |
| US5258835(A) | 1993-11-01 | Kato | Applicant |
| US5307175(A) | 1994-04-01 | Seachman | Applicant |
| US5337087(A) | 1994-08-01 | Mishima | Applicant |
| US5359694(A) | 1994-10-01 | Concordel | Applicant |
| US5379072(A) | 1995-01-01 | Kondo | Applicant |
| US5400076(A) | 1995-03-01 | Iwamura | Applicant |
| US5406334(A) | 1995-04-01 | Kondo et al. | Applicant |
| US5416651(A) | 1995-05-01 | Uetake et al. | Applicant |
| US5416847(A) | 1995-05-01 | Boze | Applicant |
| US5428403(A) | 1995-06-01 | Andrew et al. | Applicant |
| US5434716(A) | 1995-07-01 | Sugiyama et al. | Applicant |
| US5438369(A) | 1995-08-01 | Citta et al. | Applicant |
| US5446456(A) | 1995-08-01 | Seo | Applicant |
| US5455629(A) | 1995-10-01 | Sun et al. | Applicant |
| US5469216(A) | 1995-11-01 | Takahashi et al. | Applicant |
| US5469474(A) | 1995-11-01 | Kitabatake | Applicant |
| US5471501(A) | 1995-11-01 | Parr et al. | Applicant |
| US5473479(A) | 1995-12-01 | Takahura | Applicant |
| US5481554(A) | 1996-01-01 | Kondo | Applicant |
| US5495298(A) | 1996-02-01 | Uchida et al. | Applicant |
| US5499057(A) | 1996-03-01 | Kondo et al. | Applicant |
| US5528608(A) | 1996-06-01 | Shimizume | Applicant |
| US5546130(A) | 1996-08-01 | Hackett et al. | Applicant |
| US5557420(A) | 1996-09-01 | Yanagihara et al. | Applicant |
| US5557479(A) | 1996-09-01 | Yanagihara | Applicant |
| US5568196(A) | 1996-10-01 | Hamada et al. | Applicant |
| US5571862(A) | 1996-11-01 | Williams et al. | Applicant |
| US5577053(A) | 1996-11-01 | Dent | Applicant |
| US5579051(A) | 1996-11-01 | Murakami et al. | Applicant |
| US5594807(A) | 1997-01-01 | Liu | Applicant |
| US5617135(A) | 1997-04-01 | Noda et al. | Applicant |
| US5617333(A) | 1997-04-01 | Oyamada et al. | Applicant |
| US5625715(A) | 1997-04-01 | Trew et al. | Applicant |
| US5636316(A) | 1997-06-01 | Oku et al. | Applicant |
| US5649053(A) | 1997-07-01 | Kim | Applicant |
| US5673357(A) | 1997-09-01 | Shima | Applicant |
| US5677734(A) | 1997-10-01 | Oikawa et al. | Applicant |
| US5689302(A) | 1997-11-01 | Jones | Applicant |
| US5699475(A) | 1997-12-01 | Oguro et al. | Applicant |
| US5703889(A) | 1997-12-01 | Shimoda et al. | Applicant |
| US5724099(A) | 1998-03-01 | Hamdi et al. | Applicant |
| US5724369(A) | 1998-03-01 | Brailean et al. | Applicant |
| US5737022(A) | 1998-04-01 | Yamaguchi et al. | Applicant |
| US5751361(A) | 1998-05-01 | Kim | Applicant |
| US5751743(A) | 1998-05-01 | Takizawa | Applicant |
| US5756857(A) | 1998-05-01 | Yamaguchi | Applicant |
| US5778097(A) | 1998-07-01 | Nickerson | Applicant |
| US5790195(A) | 1998-08-01 | Ohsawa | Applicant |
| US5796786(A) | 1998-08-01 | Lee | Applicant |
| US5805762(A) | 1998-09-01 | Boyce et al. | Applicant |
| US5809041(A) | 1998-09-01 | Shikakura et al. | Applicant |
| US5809231(A) | 1998-09-01 | Yokoyama et al. | Applicant |
| US5852470(A) | 1998-12-01 | Kondo et al. | Examiner |
| US5861922(A) | 1999-01-01 | Murashita et al. | Applicant |
| US5878183(A) | 1999-03-01 | Sugiyama et al. | Applicant |
| US5883983(A) | 1999-03-01 | Lee et al. | Applicant |
| US5894526(A) | 1999-04-01 | Watanabe et al. | Applicant |
| US5903481(A) | 1999-05-01 | Kondo et al. | Applicant |
| US5903672(A) | 1999-05-01 | Yu | Applicant |
| US5928318(A) | 1999-07-01 | Araki | Applicant |
| US5936674(A) | 1999-08-01 | Kim | Applicant |
| US5940539(A) | 1999-08-01 | Kondo et al. | Applicant |
| US5946044(A) | 1999-08-01 | Kondo et al. | Applicant |
| US5991447(A) | 1999-11-01 | Eifrig et al. | Applicant |
| US6018317(A) | 2000-01-01 | Dogan et al. | Applicant |
| US6067636(A) | 2000-05-01 | Yao et al. | Applicant |
| US6104434(A) | 2000-08-01 | Nakagawa et al. | Applicant |
| US6137915(A) | 2000-10-01 | Chai | Applicant |
| US6151416(A) | 2000-11-01 | Kondo et al. | Applicant |
| US6164540(A) | 2000-12-01 | Bridgelall et al. | Applicant |
| US6192079(B1) | 2001-02-01 | Sharma et al. | Applicant |
| US6192161(B1) | 2001-02-01 | Kondo et al. | Applicant |
| EP398741 | 1990-11-01 | Applicant | |
| EP527611 | 1992-08-01 | Applicant | |
| EP558016 | 1993-02-01 | Applicant | |
| EP566412 | 1993-04-01 | Applicant | |
| EP571180 | 1993-05-01 | Applicant | |
| EP596826 | 1993-11-01 | Applicant | |
| EP605209 | 1993-12-01 | Applicant | |
| EP610587 | 1993-12-01 | Applicant | |
| EP592196 | 1994-04-01 | Applicant | |
| EP597576 | 1994-05-01 | Applicant | |
| EP651584 | 1994-10-01 | Applicant | |
| EP680209 | 1995-04-01 | Applicant | |
| EP746157 | 1996-05-01 | Applicant | |
| EP833517 | 1998-04-01 | Applicant | |
| GB2280812 | 1995-02-01 | Applicant | |
| GB2320836 | 1997-11-01 | Applicant | |
| JP7-67028 | 1995-03-01 | Applicant | |
| WO96/07987 | 1995-09-01 | Applicant | |
| WO97/46019 | 1997-12-01 | Applicant | |
| WO99/21285 | 1998-10-01 | Applicant | |
| WO9921090 | 1999-04-01 | Applicant | |
| WO/48126 | 2000-08-01 | Applicant |
Non-Patent Literature (82)
- Kondo, et al., “Adaptive Dynamic Range Coding Scheme for Future HDTV Digital VTR”, Fourth International Workshop on HDTV and Beyond, Sep. 4-6, Turin, Italy.Applicant
- Kondo, et al., “A New Concealment Method for Digital VCR's”, IEEE Visual Signal Processing and Communication, pp. 20-22, 9/93, Melbourne, Australia.Applicant
- Park, et al., “A Simple Concealment for ATM Bursty Cell Loss”, IEEE Transactions on Consumer Electronics, No. 3, Aug. 1993, pp. 704-709.Applicant
- Tom, et al., “Packet Video for Cell Loss Protection Using Deinterleaving and Scrambling”, ICASSP 91: 1991 International Conference on Acoustics, Speech and Signal Processing, vol. 4, pp. 2857-2860, Apr. 1991.Applicant
- NHK Laboratories Note, “Error Correction, Concealment and Shuffling”, No. 424, Mar. 1994, pp. 29-44.Applicant
- Translation of Japanese Patent #7-67028, 30 pgs.Applicant
- Kondo, et al., “Adaptive Dynamic Range Coding Scheme for Future Consumer Digital VTR”, pp. 219-226.Applicant
- Kim, et al., “Bit Rate Reduction Algorithm for a Digital VCR”, IEEE Transactions on Consumer Electronics, vol. 37, No.3, Aug. 1, 1992, pp. 267-274.Applicant
- Japanese Patent No. 05304659 and translation of Abstract.Applicant
- Japanese Patent No. 05244578 and translation of Abstract.Applicant
- Japanese Patent No. 05300485 and translation of Abstract.Applicant
- Japanese Patent No. 06070298 and translation of Abstract.Applicant
- Japanese Patent No. 06006778 and translation of Abstract.Applicant
- Japanese Patent No. 06113256 and translation of Abstract.Applicant
- Japanese Patent No. 06113275 and translation of Abstract.Applicant
- Japanese Patent No. 06253287 and translation of Abstract.Applicant
- Japanese Patent No. 06253280 and translation of Abstract.Applicant
- Japanese Patent No. 06253284 and translation of Abstract.Applicant
- Japanese Patent No. 06350981 and translation of Abstract.Applicant
- Japanese Patent No. 06350982 and translation of Abstract.Applicant
- Japanese Patent No. 08317394 and translation of Abstract.Applicant
- Japanese Patent No. 07023388 and translation of Abstract.Applicant
- Japanese Patent No. 04245881 and translation of Abstract.Applicant
- Japanese Patent No. 04115628 and translation of Abstract.Applicant
- Japanese Patent No. 04115686 and translation of Abstract.Applicant
- Translation of Abstract of Japanese Patent No. 61147690.Applicant
- Translation of Abstract of Japanese Patent No. 63256080.Applicant
- Translation of Abstract of Japanese Patent No. 63257390.Applicant
- Translation of Abstract of Japanese Patent No. 02194785.Applicant
- Translation of Abstract of Japanese Patent No. 03024885.Applicant
- Translation of Abstract of Japanese Patent No. 04037293.Applicant
- Translation of Abstract of Japanese Patent No. 04316293.Applicant
- Translation of Abstract of Japanese Patent No. 04329088.Applicant
- Translation of Abstract of Japanese Patent No. 05047116.Applicant
- Translation of Abstract of Japanese Patent No. 05244579.Applicant
- Translation of Abstract of Japanese Patent No. 05244580.Applicant
- Translation of Abstract of Japanese Patent No. 05244559.Applicant
- Translation of Abstract of Japanese Patent No. 05304659.Applicant
- Translation of Abstract of Japanese Patent No. 06086259.Applicant
- Translation of Abstract of Japanese Patent No. 06113258.Applicant
- Translation of Abstract of Japanese Patent No. 06125534.Applicant
- Translation of Abstract of Japanese Patent No. 06162693.Applicant
- Translation of Abstract of Japanese Patent No. 06253287.Applicant
- Translation of Abstract of Japanese Patent No. 06253280.Applicant
- Translation of Abstract of Japanese Patent No. 06253284.Applicant
- Translation of Abstract of Japanese Patent No. 07046604.Applicant
- Translation of Abstract of Japanese Patent No. 07085611.Applicant
- Translation of Abstract of Japanese Patent No. 07095581.Applicant
- Translation of Abstract of Japanese Patent No. 07177505.Applicant
- Translation of Abstract of Japanese Patent No. 07177506.Applicant
- Translation of Abstract of Japanese Patent No. 07240903.Applicant
- International Search Report, PCT/US98/22412, Oct. 5, 1999, 5 pgs.Applicant
- R. C. Gonzalez, et al., “Digital Image Processing”, Addison Wesley Publishing Company, Inc., 1992, pp. 346-348.Applicant
- R. Aravind, et al., “Image and Video Coding Standards”, AT&T Technical Journal, Jan./Feb. 1993, pp. 67-88.Applicant
- Zhu, et al., “Coding and Cell-Loss Recovery in DCT-Based Packet Video”, IEEE Transactions on Circuits and Systems for Video Technology, Jun. 3, 1993, No. 3, NY.Applicant
- International Search Report, PCT/US98/22347, Mar. 16, 1999, 2pgs.Applicant
- International Search Report, PCT/US95/22531, Apr. 1, 1999, 1pg.Applicant
- International Search Report, PCT/US98/22411, Feb. 25, 1999, 1 pg.Applicant
- International Search Report PCT/US00/03743, 4 pgs., Feb. 11, 2000.Applicant
- International Search Report PCT/US00/03439, Feb. 9, 2000, 8 pgs.Applicant
- International Search Report PCT/US00/03595, Feb. 10, 2000, 6 pgs.Applicant
- International Search Report PCT/US00/03611, Feb. 10, 2000, 8 pgs.Applicant
- International Search Report PCT/US00/03599, Feb. 10, 2000, 4 pgs.Applicant
- International Search Report PCT/US00/03742, Feb. 11, 2000, 5 pgs.Applicant
- International Search Report PCT/US00/03654, Feb. 10, 2000, 4 pgs.Applicant
- International Search Report PCT/US00/03299, Feb. 9, 2000, 5 pgs.Applicant
- Meguro, et al., “An Adaptive Order Statistics Filter Based On Fuzzy Rules For Image Processing”, pp. 70-80, XP-00755627, 1997 Scripta Technica, Inc.Applicant
- Jeng, et al., “Concealment Of Bit Error And Cell Loss In Inter-Frame Coded Video Transmission”, 1991 IEEE, 17.4.1-17.4.5.Applicant
- Monet, et al., “Block Adaptive Quantization Of Images”, IEEE 1993, pp. 303-306.Applicant
- International Search Report PCT/US00/03738, Feb. 11, 2000, 9 pgs.Applicant
- Stammnitz, et al., “Digital HDTV Experimental System”, pp. 535-542.Applicant
- International Search Report PCT/US00/03508, Feb. 9, 2000, 8 pgs.Applicant
- Chu, et al., Detection and Concealment of Transmission Errors in H.261 Images, XP-000737027, pp. 74-84, IEEE transactions, Feb. 1998.Applicant
- Park, et al., “Recovery of Block-coded Images from Channel Errors”, p. 396-400, pub. Date May 23, 1993.Applicant
- International Search Report PCT/US00/23035, 5 pgs., Jan. 22, 2001.Applicant
- International Search Report PCT/00/25223, 7 pages, Dec. 7, 2000.Applicant
- Meguro, et al., “An Adaptive Order Statistics Filter Based On Fuzzy Rules For Image Processing”, p. 70-80, © 1997 Scripta Technica, Inc.Applicant
- Ozkan, M.K., et al. Adaptive Motion-Compensated Filtering Of Noisy Image Sequences; IEEE Transactions on P. 277-290, Aug. 1993 vol. 3, Issue 4.Applicant
- Sezan, et al. “Temporally Adaptive Filtering Of Noisy Image Sequences Using A Robust Motion Estimation Algorithm”; 1991 International Conference on p. 2429-2432 vol. 4, Apr. 14-17, 1991.Applicant
- Crinon, R.J., et al. “Adaptive Model-Based Motion Estimation”; IEEE Transactions on p. 469-481, vol. 3, Issue 5, Sep. 1994.Applicant
- Wollborn, M. Prototype Prediction For Colour Update In Object-Based Analysis-Synthesis Coding; IEEE Transactions on p. 236-245, vol. 4, No. 3, Jun. 1994.Applicant
- Patti, A.J., et al., Robust Methods For High-Quality Stills From Interlaced Video In the Presence Of Dominant Motion; IEEE Transactions on p. 328-342, vol. 7, No. 2, Apr. 1997.Applicant