Image analysis – Image compression or coding – Interframe coding
Reexamination Certificate
1995-04-12
2001-07-24
Chang, Jon (Department: 2623)
Image analysis
Image compression or coding
Interframe coding
C382S238000, C382S239000, C348S400100, C348S419100
Reexamination Certificate
active
06266447
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a coding apparatus for performing coding by adaptively switching two or more coding systems.
2. Related Background Art
Conventionally, various coding systems have been proposed in order to reduce the quantity of transmission data in digitally transmitting image information.
One of the proposed coding systems is to perform coding by switching intraframe coding and interframe coding.
The intraframe compression is a system of reducing the quantity of information by using the characteristic of an image that neighboring pixels have similar brightnesses and similar colors.
In the bulk of an actual image, such as a portion of sky or wall of an image, brightnesses and colors respectively continue at substantially the same levels, and so compression of about ⅕ to {fraction (1/10)} is possible even by the use of the intraframe compression alone.
The interframe compression is a system of obtaining images from corrected information alone by using analogous images.
In normal dynamic images, patterns of adjacent frames are similar to each other although there are some movements or deformations. By taking advantage of this characteristic, the similarity (e.g., movement, color, and brightness) between a frame to be compression-coded and its adjacent frame is calculated. On the basis of this calculation, a “predicted value,” i.e., the value of a frame which is more similar to the “frame to be coded” than the “adjacent frame” is calculated.
Subsequently, only information indicating the difference between the frame to be coded and the “predicted value” is coded (recorded and transmitted). For this reason, the quantity of data (the quantity of correction) is reduced.
That is, when a person moves to the right in a dynamic image in which only the person is shown, pixels at which the person exists in the immediately preceding frame, including correction information of the movement, correspond to the predicted value, and a value obtained by subtracting the predicted value from the whole pixels which have moved to the right corresponds to the difference.
It is generally known that when compression is performed by the interframe processing in conventional coding apparatuses, if an error occurs in a transmission path, this error propagates. Therefore, the intraframe processing is automatically performed after the interframe processing is performed a predetermined number of times.
The quantity of data per frame of a coded image is approximately 16K to 25K bytes, in the intraframe processing, and approximately 7K to 10K bytes, in the interframe processing.
That is, the quantity of generated data in the intraframe processing is generally larger than that in the interframe processing.
When the intraframe coding is performed periodically, therefore, the quantity of generated data abruptly increases if quantization is performed by using the immediately preceding quantization step (the quantization step used in the interframe coding), and this poses a problem of a transmission rate.
To reduce the quantity of generated data, however, if coding is performed while changing the quantization step, another problem of degradation in image quality arises.
In addition, when compression coding is performed by using DCT (Discrete Cosine Transform), no bias occurs in generated information with respect to a DC (direct current) component in the intraframe compression processing. This makes it impossible to reduce the quantity of information by the use of entropy coding (in which the quantity of information generated is reduced by assigning a short codeword to information which is generated at a high probability and a long codeword to information which is generated at a low probability).
The above problems take place in coding apparatuses (having at least a predictive coding mode) for performing coding by adaptively switching a plurality of coding modes.
Under these circumstances, the present invention is directed to a coding apparatus which prevents degradation in signals by eliminating the above conventional problems.
SUMMARY OF THE INVENTION
The present invention has been made in consideration of the above situations and has as its object to provide a coding apparatus which prevents degradation in signals by eliminating the above conventional problems.
According to one preferable aspect of the present invention, there is provided a coding apparatus comprising block forming means for forming a block of sample values of an input signal, coding means having a first coding mode, in which the block of the input signal is coded by using a difference signal obtained by subtracting a predicted value from the block of the input signal, and a second coding mode, in which the block of the input signal is coded without using the difference signal, comparing means for comparing a data quantity of the difference signal with a data quantity of the input signal in units of blocks, counting means for counting the number of coding operations performed in the first coding mode, and selecting means for selecting one of the coding modes in accordance with outputs from the comparing means and the counting means.
Other objects and advantages of the invention will become apparent from the following detailed description taken in conjunction with the appended claims.
REFERENCES:
patent: 4217609 (1980-08-01), Hatori et al.
patent: 4562468 (1985-12-01), Koga
patent: 4608607 (1986-08-01), Adachi
patent: 4691329 (1987-09-01), Juri et al.
patent: 4797741 (1989-01-01), Sato et al.
patent: 4831439 (1989-05-01), Fedele et al.
patent: 4888640 (1989-12-01), Acampora et al.
patent: 4903124 (1990-02-01), Hoshi et al.
patent: 4924311 (1990-05-01), Ohki et al.
patent: 4929946 (1990-05-01), O'Brien et al.
patent: 4959868 (1990-09-01), Tanioka
patent: 4965754 (1990-10-01), Stansfield et al.
patent: 4999704 (1991-03-01), Ando
patent: 5045852 (1991-09-01), Mitchell et al.
patent: 5054103 (1991-10-01), Yasuda et al.
patent: 5089888 (1992-02-01), Zdepski et al.
patent: 5122875 (1992-06-01), Raychaudhuri
patent: 5177453 (1993-01-01), Clark
patent: 5185819 (1993-02-01), Ng et al.
patent: 5223926 (1993-06-01), Stone et al.
patent: 5301242 (1994-04-01), Gonzales et al.
patent: 5644660 (1997-07-01), Bruder
patent: 0267581 (1988-05-01), None
patent: 0444839 (1991-09-01), None
patent: 0474388 (1992-03-01), None
patent: 2691272 (1993-11-01), None
patent: 5091782 (1992-02-01), None
patent: 5109437 (1992-04-01), None
ISO/IEC JTC1/SC29/WG11 ‘Coding of moving pictures and associated audio for digital storage media’, Apr. 20, 1992, International Organization for Standardization, pp. 117, 58-63, 76-94, 113-118, 148-157 and 157-164.
R. Plompen ‘Motion Video Coding for Visual Telephony’1990, PTT Research NEHR Labs., NL, Leidschendam, p. 252.
Hoshi Nobuhiro
Ikeda Shingo
Canon Kabushiki Kaisha
Chang Jon
Fitzpatrick ,Cella, Harper & Scinto
LandOfFree
Coding apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Coding apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding apparatus will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2505460