WO1994009594A1 - Encoder and decoder - Google Patents
Encoder and decoder Download PDFInfo
- Publication number
- WO1994009594A1 WO1994009594A1 PCT/JP1993/001470 JP9301470W WO9409594A1 WO 1994009594 A1 WO1994009594 A1 WO 1994009594A1 JP 9301470 W JP9301470 W JP 9301470W WO 9409594 A1 WO9409594 A1 WO 9409594A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- plane
- decoding
- msb
- bit
- data
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/24—Systems for the transmission of television signals using pulse code modulation
- H04N7/52—Systems for transmission of a pulse code modulated video signal with one or more other pulse code modulated signals, e.g. an audio signal or a synchronizing signal
- H04N7/54—Systems for transmission of a pulse code modulated video signal with one or more other pulse code modulated signals, e.g. an audio signal or a synchronizing signal the signals being synchronous
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
- H04N19/89—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/98—Adaptive-dynamic-range coding [ADRC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/236—Assembling of a multiplex stream, e.g. transport stream, by combining a video stream with other content or additional data, e.g. inserting a URL [Uniform Resource Locator] into a video stream, multiplexing software data into a video stream; Remultiplexing of multiplex streams; Insertion of stuffing bits into the multiplex stream, e.g. to obtain a constant bit-rate; Assembling of a packetised elementary stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/434—Disassembling of a multiplex stream, e.g. demultiplexing audio and video streams, extraction of additional data from a video stream; Remultiplexing of multiplex streams; Extraction or processing of SI; Disassembling of packetised elementary stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
Definitions
- the present invention relates to an encoder and a decoder suitable for being applied to, for example, a codec for encoding and compressing information and returning compressed information to original information.
- a codec is used for encoding and compressing image data when transmitting or recording the image data.
- the encoding of the image data was carried out in February, 1990 by the International Telecommunication Union (I Video Codec (coder, decoder) Recommendation H.261, which was established by the International Brass and Telephone Consultative Committee (CCI TT), which is affiliated with the TU), is standardized.
- Video coding is applied to applications that use standard television or high-definition (HD) television as a signal source and involve signal transmission to remote locations. For example, it covers the fields of broadcasting, communications, etc., and storage as an application of local signal processing.
- the encoding unit of a video codec encodes input video data with an encoder, multiplexes and encodes this data, temporarily stores this data in a transmission buffer, and then encodes the data with a transmission encoder.
- the encoded part is transmitted as an encoded bit sequence, and the decoding unit transmits the encoded encoded
- the bit stream video data is decoded by a transmission decoder, temporarily stored in a receiving buffer, multiplexed and decoded, and further decoded to obtain the original video signal.
- the video codec can be used not only for transmitting images but also for recording image data in, for example, a VTR.
- image data of the high-definition television system which has progressed rapidly in recent years, differs from that of the standard television system, and has a huge amount of data. Decoding to obtain the original image data is an indispensable issue in order to significantly reduce the recording cost.
- This DPCM focuses on the fact that the pixels of a television signal have a high correlation between pixels and a small difference between adjacent pixels, and quantizes and transmits this difference signal.
- the screen of one field is subdivided into minute blocks, and the average value and Some transmit standard deviation and 1-bit coding code for each pixel .
- aliasing distortion may occur because the sampling frequency is 1Z2.
- DPCM also had the problem that errors propagated to subsequent decoding. Also, was the method of performing coding in block units disadvantageous in that block distortion occurs at boundaries between blocks? '
- the present applicant first obtained a dynamic range defined by the maximum value and the minimum value of a plurality of pixels included in a two-dimensional block, and adapted the dynamic range.
- a high-efficiency coding apparatus which performs coding with a variable bit length (see Japanese Patent Application Laid-Open No. 61-144,891).
- Figure 6 shows the coding of a variable bit length proposed for the dynamic range proposed earlier, that is, the description of adaptive dynamics ⁇ Range coding (ADRC). Things.
- the minimum level (minimum value) in the block is removed from the input pixel data with 8 bits as one sample.
- the pixel data from which the minimum value has been removed is quantized.
- This quantization is a process of converting the pixel data from which the minimum value has been removed into a representative level.
- the maximum allowable value of the quantization distortion generated at the time of this quantization (described as the maximum distortion) is a predetermined value, for example, 4.
- Figure 6A shows the case where the dynamic range (the difference between the maximum value MAX and the minimum value MIN) is 8.
- the center level of the dynamic range is the representative level, and there is no need to transmit quantized data. Therefore, the required bit length Nb is zero.
- the representative level L0 is reconstructed from the minimum block value MIN and the dynamic range as the restored value. Is decoded.
- the pixel data contained in the same block is The level of change is small. Therefore, even if the dynamic range of the data DT1 after removing the minimum level MIN shared by the pixel data in the block is quantized with a smaller number of quantization bits than the original number of quantization bits. Almost no quantization distortion occurs. By reducing the number of quantization bits, the data transmission bandwidth can be made narrower than the original one.
- the allowable maximum distortion E is set to, for example, 4. If the value of the maximum distortion E is made larger, the bit length N b becomes smaller, and the compression ratio can be increased. However, if the maximum distortion E is increased, block distortion occurs. Therefore, the applicant further proposes that when the bit length Nb is determined, the dynamic range does not have a constant maximum distortion, but a nonlinear characteristic matching the human visual characteristic. By changing the maximum distortion in (1), the bit length Nb is made smaller, thereby increasing the compression ratio without degrading the restored image such as block distortion.
- An efficiency coding device has been proposed (see Japanese Patent Application Laid-Open No. Sho 62-26689).
- the ADRC method which considers the VTR recording system,
- the efficiency coding device does not perform compression using variable length codes.
- compression using variable-length coding for example, Run Length Limited, is a method of compressing information by using information indicating how long one piece of information is continuous. It is. This is because when this variable-length coding is performed, the original data cannot be restored when an error occurs.
- variable length codes are used, the original data cannot be restored when an error occurs, so that variable length coding with high compression efficiency cannot be adopted. There was a disadvantage that the compression ratio could not be improved.
- the present invention has been made in view of such a point, and employs variable-length coding to improve compression efficiency and to restore original data as much as possible even if an error occurs. It aims to propose an encoder and a decoder. Disclosure of the invention
- a first encoding unit that encodes pixel information by a first method, and information of a pixel encoded by the first encoding unit is divided into a plurality of bit planes Dividing means, second encoding means for encoding each of the plurality of bitplanes generated by the dividing means by the second method, and an image encoded by the second encoding means
- An error correction code adding means for adding an error correction code to the information.
- a dynamic range defined by a maximum value and a minimum value of a plurality of pixels included in a two-dimensional block is obtained by using the first method used by the first encoding means.
- the encoder is designed to perform encoding with a variable bit length adapted to the dynamic range.
- a third aspect of the present invention is an encoder wherein the second method used by the second encoding means performs encoding on a continuous length of pixel information.
- a fourth invention is an encoder wherein the second method used by the second encoding means performs an encoding process using a statistical property of pixel information.
- a fifth aspect of the present invention is an encoder configured to generate the bit plane for each block including a predetermined number of pixels.
- a sixth aspect of the present invention is an encoder configured to generate the bit plane on a screen basis.
- a seventh aspect of the present invention is an encoder configured to perform a bit shift when the bit plane is generated.
- An eighth aspect of the present invention is an encoder in which the plurality of bit planes are a plane composed of at least an MSB, a plane composed of an nth MSB, and a plane composed of an LSB.
- a ninth aspect of the present invention is an encoder which performs processing starting from the plane configured by the MSB among the plurality of bit planes.
- a tenth aspect of the present invention is an encoder in which the MSBs of the planes configured by the MSBs are arranged temporally or spatially according to a certain rule.
- all the MSB planes are set to "0" and are encoded by the second encoding means. It is an encoder.
- an encoder which is encoded by the second encoding means based on at least information of a plane constituted by the MSB and a plane constituted by the LSB.
- error correction processing means for performing error correction processing based on an error correction code added to input pixel information, and an output from the error correction processing means.
- First decoding means for performing decoding processing with the first method, conversion means for converting pixel information of a plurality of bit planes decoded by the first decoding means into original information, and this conversion means.
- a second decoding means for decoding the output from the second method by a second method to obtain original image information.
- a fifteenth aspect of the present invention is a decoder according to the first method, wherein the first method used by the first decoding means decodes information encoded with respect to a continuous length of pixel information.
- a dynamic range defined by a maximum value and a minimum value of a plurality of pixels included in a two-dimensional block is obtained by using the second method used by the second decoding means.
- a seventeenth aspect of the present invention is a decoder in which the first method used by the first decoding means decodes information encoded using statistical properties of pixel information. .
- An eighteenth invention is a decoder in which the plurality of bit planes obtained by decoding by the first decoding means are bit-shifted.
- a ninth aspect of the present invention is a method in which the plurality of bit planes obtained by decoding by the first decoding means are generated for each block composed of a predetermined number of pixels. It is a deco-maker.
- a decoding apparatus obtained by decoding by the first decryption means.
- the above-mentioned plurality of bit planes are generated in units of screens.
- a plurality of bit planes obtained by decoding by the first decoding means are composed of at least an MSB, a n-th MSB, This is a plane decoder composed of LSB.
- the encoded information corresponding to the plane constituted by the MSB is first decoded by the first decoding means in the same block or the same screen. This is the decoder that was used.
- MSBs of planes constituted by MSBs are arranged temporally or spatially according to a certain rule. This is a decoder.
- the twenty-fourth aspect of the present invention is to provide a decoder that, when all the planes composed of the MSBs obtained by decoding by the first decoding means are “0”, at least perform the quantization at the decoder side. This decoder recognizes that the number of allocated bits is "0".
- At least the number of allocated bits at the time of quantization is inputted when there is no information corresponding to the plane constituted by the MSB to be decoded by the first decoding means.
- the decoder recognizes information indicating "0".
- FIG. 1A is a configuration diagram showing an embodiment of the encoder of the present invention.
- FIG. 1B is a configuration diagram showing an embodiment of the encoder of the present invention.
- FIG. 2 is a block diagram showing a main part of an embodiment of the encoder of the present invention.
- FIG. 3 is a block diagram showing a main part of an embodiment of the decoder of the present invention.
- FIG. 4A is an explanatory diagram showing an example of block data used for describing an embodiment of an encoder and a decoder according to the present invention.
- FIG. 4B is an explanatory diagram showing an example of a case where the block data shown in FIG. 4A is represented by 3 bits, for use in describing an embodiment of the encoder and the decoder of the present invention.
- FIG. 4C is an explanatory diagram showing an example in which the MSB shown in FIG. 4B is divided into bit planes for explaining the encoder and the decoder according to the embodiment of the present invention.
- FIG. 4D is an explanatory diagram showing an example of a case where the 2nd MSB shown in FIG. 4B is divided into bit planes for describing an embodiment of the encoder and the decoder of the present invention.
- FIG. 4E is an explanatory diagram showing an example in which the LSB shown in FIG. 4B is divided into bit planes for explaining the embodiment of the encoder and the decoder of the present invention.
- FIG. 5 is an explanatory diagram for explaining an embodiment of an encoder and a decoder of the present invention.
- FIG. 6A is an explanatory diagram showing a case where the dynamic range used for explaining the ADRC process is “8”.
- FIG. 6B is an explanatory diagram showing a case where the dynamic range used for explaining the ADRC process is “17”.
- FIG. 6C is an explanatory diagram showing a case where the dynamic range used for explaining the ADRC process is “35”.
- FIG. 7 is an explanatory diagram showing the case of 7 1 ".
- FIG. 6E is an explanatory diagram showing a case where the dynamic range for explaining the ADRC process is “144”.
- FIG. 6F is an explanatory diagram showing a case where the dynamic range for explanation of the ADRC processing is “287”.
- FIG. 1A shows an encoder.
- reference numeral 1 denotes, for example, image data (digital television signal) from a VTR recording system (not shown) in which one sample is quantized to 8 bits, for example.
- the image data from the input terminal 1 is supplied to the encoding circuit 2.
- the encoding circuit (ADRC: adaptive dynamic ⁇ range coding circuit) 2 converts, for example, image data supplied via the input terminal 1 into a two-dimensional block of a predetermined unit.
- the dynamic range defined by the maximum value and the minimum value of a plurality of pixels included in the divided two-dimensional block is determined, and the variable bit length is adapted to the dynamic range.
- perform encoding perform encoding.
- the coded image data (hereinafter referred to as block data) is supplied to the dividing circuit 3.
- FIG. 5 shows an example of block data generated by this encoding.
- one block data is, for example, a data ⁇ ⁇ ⁇ block ⁇ ⁇ which indicates a data tab ⁇ block and the end of one block.
- the removable block is composed of MSB, 2 SB, ⁇ * LSB.
- the dividing circuit 3 further divides the block data into bit planes.
- the bit plane refers to the MSB, 2 SB,..., LSB constituting the data block as described in FIG. Dividing into one means that the following units are used as the units for the MSB, 2 SB, ⁇ ⁇ ⁇ ⁇ LSB.
- FIG. 4A shows image data (block data) processed by, for example, the ADDRC method.
- Each numerical value shown in FIG. 4A indicates, for example, the level of image data.
- FIG. 4B when the block data shown in FIG. 4A is represented by three bits of MSB, 2nd MSB, and LSB, the MSB is the most significant bit. 7 ",” 6 “,” 5 “, and” 4 “are each” 1 “, and decimal" 3 ",” 2 ",” 1 ", and” 0 “are each” 0 ".
- the MSBs in FIG. 4A correspond to “4”, “5”, “6”, and “7”, respectively. 1 ", otherwise” 0 ", as shown in Figure 4C.
- the portions corresponding to “7”, “6”, “3”, and “2” are “1”, respectively, and the other 2 bits are “0” in FIG. It becomes as shown in.
- portions corresponding to “1”, “3”, “5”, and “7” in FIG. 4A become “1”, respectively, and otherwise, “0”, that is, as shown in FIG. become. In this way, block data obtained by encoding using the ADRC method is divided into bit plane data.
- the bit plane data divided by the dividing circuit 3 is supplied to the encoding circuit 4.
- the encoding circuit 4 performs variable-length encoding processing such as run-length encoding and Novman encoding on the bit-plane data from the dividing circuit 3, and performs bit-processing on the variable-length encoding processing.
- the plane data is supplied to the framing circuit 5.
- the order is such that Huffman encoding is performed after run-length encoding. The reason for this is that encoding is more efficient if run-length encoding is performed before Huffman encoding.
- the frame conversion circuit 5 performs an error correction coding process on the bit-plane data from the coding circuit 4 and adds a synchronization signal to obtain transmission data (or recording data). It is supplied to, for example, a recording system of a VTR (not shown) through the interface.
- the variable length coded MSB bit plane data is arranged before the other 2nd MSB and LSB bit plane data, and the position of the MSB bit plane data is determined in advance, and the Be recorded in the layout. In this case, the influence of error propagation can be reduced.
- run-length coding all data after the occurrence of the error becomes unusable, so by setting the MSB bit plane that determines the most opposite flow first, the error The effect of this is minimized.
- coding only the MSB bit plane and not coding the 2nd MSB and LSB bit planes, or coding the MSB and 2nd MSB bit planes and coding the LSB bit plane May be prevented from being coded, or a bit shift may be performed, and such processing can make the error less likely.
- the data from the framing circuit 5 is subjected to various recording processes such as amplification and modulation, and thereafter, recording is performed on a magnetic tape (not shown) so as to form an inclined track. I do.
- the encoder shown in FIG. 1A will be described in more detail with reference to FIG. In FIG. 2, portions corresponding to those in FIG.
- image data in which, for example, one sample is quantized to 8 bits is input to the input terminal 1.
- This image data is supplied to the blocking circuit 13.
- the image data (pixel data) processed by the block circuit 13 is supplied to a dynamic range (DR) detection circuit 14 and an addition circuit 15, respectively.
- DR dynamic range
- 4 is the dynamic range and minimum value of the pixel data from the blocking circuit 13 for each block. And supplies the minimum value data to the adder circuit 15 and the framing circuit 5, respectively, and supplies the dynamic range to the bit length determining circuit 16 and the framing circuit 5, respectively.
- the adder 15 subtracts the minimum value data from the dynamic range detector 14 from the pixel data from the blocker 13 and supplies the result of the subtraction to the quantizer 17. .
- the bit length determination circuit 16 determines the number of quantization bits (bit length) corresponding to the dynamic range. In this case, the bit length is determined in consideration of human visual characteristics. In other words, the maximum distortion is increased when the dynamic range is large. As an example, the bit length determination circuit 16 determines the bit length according to the dynamic range as follows. In other words, when the dynamic range is 0 or more and 10 or less, the bit length is "0" and the maximum distortion is "5". When the dynamic range is 11 or more and 25 or less, The bit length is set to "1" and the maximum distortion is set to "6".
- the bit length is set to "2" and the maximum distortion is set to "1 2".
- the bit length is set to “3” and the maximum distortion is set to “16”.
- the determined bit length data is sent to the quantization circuit 17. Supplied.
- the quantization circuit 17 performs a quantization process on the addition result from the addition circuit 15, that is, the pixel data from which the minimum value has been removed, based on the bit length data from the bit length determination circuit 16. Then, data obtained by performing the quantization process, that is, the encoded code is supplied to the dividing circuit 3. As described with reference to FIG.
- the dividing circuit 3 divides the encoding code, that is, the block data into bit planes, and supplies the divided bit plane data to the encoding circuit 4.
- the encoding circuit 4 performs variable-length encoding or the like on each bit plane from the division circuit 3 and encodes the processed data into a frame.
- the framing circuit 5 includes a dynamic range (for example, 8 bits) and a minimum value data (for example, 8 bits 9) from the dynamic range detection circuit 14, and a block from the encoding circuit 4.
- the data is output to the VTR recording system via the output terminal 6. Supply.
- ⁇ is an input terminal to which reproduction data reproduced by a reproduction system such as a VTR (not shown) is supplied.
- the reproduction data is supplied to the frame decomposition circuit 8 via the input terminal 7.
- the frame decomposing circuit 8 decomposes the reproduced data supplied through the input terminal 7 into dynamic range, minimum value data, and block data (encoded code).
- the data subjected to the error correction processing is supplied to the decoding circuit 9.
- the decoding circuit 9 decodes the block data from the frame decomposition circuit 8 to obtain bit plane data, and supplies this to the conversion circuit 10.
- the conversion circuit 10 performs the reverse of the processing shown in FIG. 4 on the bit plane data from the decoding circuit 9 to obtain the original block data, and supplies this to the decoding circuit 11.
- the decoding circuit 11 converts the image data (digital television) in which one sample is quantized to 8 bits based on the block data, the dynamic range, and the minimum value data from the conversion circuit 10. Signal), and supplies this to an unillustrated VTR playback system via the output terminal 12.
- FIG. 3 the frame decomposition circuit 18 of the frame decomposition circuit 8 is shown via the input terminal 7. No Separates playback data from the VTR playback system into block data (encoded code), minimum value data, and dynamic range for each bit plane, and corrects errors for these data.
- the block data is supplied to the decoding circuit 9, the dynamic range is supplied to the bit length determining circuit 19, and the minimum value data is supplied to the adding circuit 20.
- the bit length determination circuit 19 determines the bit length of each block from the dynamic range, similarly to the encoder, and supplies the bit length data to the decoding circuit 11.
- the decoding circuit 9 decodes the block data for each bit plane from the frame decoding circuit 18 to obtain the original bit plane data, and supplies this bit plane data to the conversion circuit 10. .
- the conversion circuit 10 performs the reverse processing of the method shown in FIG. 4 on the bit-plane data from the decoding circuit 9 to obtain the original block data, and converts the block data to the decoding circuit 11 To supply.
- the decoding circuit 11 1 performs the reverse of the processing of the quantization circuit 17 of the encoder. That is, the 8-bit data after the minimum level is removed is decoded to a representative level, and this data is supplied to the adder circuit 20.
- the addition circuit 20 adds the data from the decoding circuit 11 and the minimum value data from the frame decomposition circuit 18 to decode the original pixel data.
- the output of the addition circuit 20 is supplied to the block decomposition circuit 21.
- the block decomposing circuit 21 converts the decoding data in the block order into the same order as the scanning of the television signal, and performs the conversion in the opposite manner to the blocking circuit 13 of the encoder.
- the supplied data is supplied to a VTR playback system (not shown) via the output terminal 13.
- data encoded by the ADRC method is divided into MSBs, 2nd MSBs, bit planes for each LSB, and run-length encoding and Huffman encoding are performed on these data, respectively. Since processing is performed, data can be compressed with a high compression ratio, and the resilience of data in the event of an error is not reduced. Can be minimal.
- block data obtained by encoding the MSB bit plane data is placed at the top, and the data is transmitted and recorded regularly. Can be strong.
- the pattern of the Huffman coding process for the MSB bit plane data and the LSB bit plane data is changed, for example, by switching a coding table, so that efficient coding can be performed. It can be carried out.
- variable length for each block is adopted has been described.
- variable length for each bit plane may be performed over the entire screen.
- the pixel data is encoded by the encoding circuit 2 by the ADRC method, and the block data encoded by the encoding circuit 2 is divided into a plurality of bit planes by the division circuit 3.
- the encoding circuit 4 encodes each of the plurality of bit planes by a variable-length encoding method such as a run-length-Huffman encoding, and the encoded image data is subjected to an error by the frame encoding circuit 5. Since a single correction code is added, a high compression rate can be obtained, and a reduction in the data resilience at the time of an error can be minimized.
- the encoding circuit 2 obtains a dynamic range defined by the maximum value and the minimum value of a plurality of pixels included in the two-dimensional block, and adapts to the dynamic range. Since encoding is performed with a variable bit length, compression efficiency can be improved in addition to the effects described above.
- the encoding is performed on the continuous length of the pixel information in the encoding circuit 4, so that the compression efficiency can be further improved in addition to the effects described above.
- the encoding process is performed using the statistical property of the pixel information in the encoding circuit 4, so that in addition to the above-described effects, it is possible to prevent the error from being propagated. .
- bit plane is generated for each block composed of a predetermined number of pixels, so that in addition to the above-described effects, the compression efficiency and the compression accuracy can be improved.
- bit plane is generated for each screen, so that the compression ratio can be improved in addition to the above-described effects.
- bit shift is performed when the bit plane is generated, so that in addition to the above-described effects, it is possible to suppress a decrease in the data resilience when an error occurs.
- At least a plurality of bit planes are configured by a plane configured by the MSB, a plane configured by the n-th MSB, and a plane configured by the LSB.
- the compression efficiency can be improved, and the propagation of error can be prevented.
- the processing is performed with the MSB first out of a plurality of bit planes, so that in addition to the above-described effects, the effect of error propagation is reduced.
- the MSBs of the plane composed of the MSBs are arranged temporally or spatially according to a certain rule, so that in addition to the above-mentioned effects, it is hardly affected by error propagation. can do.
- all the MSB planes are set to "0" and are coded by the coding circuit 4, so that in addition to the effects described above, The compression efficiency can be improved and the processing process can be simplified.
- the encoding is performed by the encoding circuit 4 based on at least the information of the plane constituted by the MSB and the plane constituted by the LSB. Can be stronger.
- an error correction process is performed by a frame decomposition circuit 8 based on an error correction code added to the input pixel data, and a run length or
- the decoding processing is performed by the Huffman coding method, the plurality of decoded bit-plane data is converted into block data by the conversion circuit 10, and the output is decoded by the decoding circuit 11 by the ADRC method to obtain the original data. Since the image data is obtained, the encoded data can be satisfactorily restored.
- the decoding circuit 9 decodes the encoded information with respect to the continuous length of the pixel information. In addition to the effects described above, data can be restored well.
- the decoding circuit 11 calculates a dynamic range defined by the maximum value and the minimum value of a plurality of pixels included in the two-dimensional block, and obtains the dynamic range.
- Information encoded with a variable bit length adapted to the image is decoded, so that in addition to the effects described above, data can be restored well.
- the decoding circuit 9 decodes the coded information by using the statistical property of the pixel information, so that in addition to the effects described above, even when an error occurs, The data can be restored well.
- a plurality of bit planes obtained by decoding by the decoding circuit 9 are bit-shifted, so that in addition to the above-described effects, even when an error occurs, Data can be restored well.
- a plurality of bit planes obtained by decoding by the decoding circuit 9 are generated for each block composed of a predetermined number of pixels. In addition, even if an error occurs, data can be restored well.
- a plurality of bit planes obtained by decoding by the decoding circuit 9 are generated in units of screens. It can be restored well.
- a plurality of bit planes obtained by decoding by the decoding circuit 9 are converted into a plane composed of at least the MSB, a plane composed of the MSB of the n-th test, and a plane composed of the LSB.
- the encoded information corresponding to the plane constituted by the MSB is first decoded in the first decoding circuit 9 within the same block or the same screen. Therefore, in addition to the effects described above, even when an error occurs, data can be restored well.
- the MSBs of the planes composed of the MSBs are arranged temporally or spatially according to a certain rule. Therefore, in addition to the effects described above, even when an error occurs, data can be restored well.
- At least the number of allocated bits at the time of quantization input when there is no information corresponding to the plane constituted by the MSB to be decoded by the decoding circuit 9 is "0". Since the information indicating is recognized, the data restoration process can be simplified in addition to the effects described above.
- the decoding circuit is based on at least the information of the plane constituted by the MSB and the plane constituted by the LSB. Since decoding is performed in step 11, in addition to the effects described above, data can be restored well even when an error occurs.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Image Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Error Detection And Correction (AREA)
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE1993623996 DE69323996T2 (de) | 1992-10-15 | 1993-10-13 | Codierer und decodierer |
EP19930922626 EP0618727B1 (en) | 1992-10-15 | 1993-10-13 | Encoder and decoder |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP27738492A JPH06133284A (ja) | 1992-10-15 | 1992-10-15 | エンコーダ及びデコーダ |
JP4/277384 | 1992-10-15 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1994009594A1 true WO1994009594A1 (en) | 1994-04-28 |
Family
ID=17582782
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP1993/001470 WO1994009594A1 (en) | 1992-10-15 | 1993-10-13 | Encoder and decoder |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP0618727B1 (ja) |
JP (1) | JPH06133284A (ja) |
KR (1) | KR100359671B1 (ja) |
DE (1) | DE69323996T2 (ja) |
WO (1) | WO1994009594A1 (ja) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5706009A (en) * | 1994-12-29 | 1998-01-06 | Sony Corporation | Quantizing apparatus and quantizing method |
JP4240554B2 (ja) * | 1997-07-11 | 2009-03-18 | ソニー株式会社 | 画像符号化装置および画像符号化方法、並びに画像復号化装置および画像復号化方法 |
AUPP686498A0 (en) | 1998-10-30 | 1998-11-26 | Canon Kabushiki Kaisha | A decoder for decoding a coded representation of a digital image |
AU746400B2 (en) * | 1998-10-30 | 2002-05-02 | Canon Kabushiki Kaisha | A method and apparatus for decoding a coded representation of a digital image |
US6606416B1 (en) | 1998-10-30 | 2003-08-12 | Canon Kabushiki Kaisha | Encoding method and apparatus for representing a digital image |
EP1030524A1 (en) * | 1999-02-19 | 2000-08-23 | Alcatel | Method for encoding a digital image and coder |
US7164369B2 (en) | 2001-06-19 | 2007-01-16 | Sharp Laboratories Of America, Inc. | System for improving storage efficiency of digital files |
US7116840B2 (en) | 2002-10-31 | 2006-10-03 | Microsoft Corporation | Decoding and error correction in 2-D arrays |
US8964851B2 (en) | 2009-06-09 | 2015-02-24 | Sony Corporation | Dual-mode compression of images and videos for reliable real-time transmission |
US8457425B2 (en) * | 2009-06-09 | 2013-06-04 | Sony Corporation | Embedded graphics coding for images with sparse histograms |
KR20100136890A (ko) | 2009-06-19 | 2010-12-29 | 삼성전자주식회사 | 컨텍스트 기반의 산술 부호화 장치 및 방법과 산술 복호화 장치 및 방법 |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH01162080A (ja) * | 1987-12-18 | 1989-06-26 | Sony Corp | ディジタルvtr |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS56128070A (en) * | 1980-03-13 | 1981-10-07 | Fuji Photo Film Co Ltd | Band compressing equipment of variable density picture |
EP0339589A3 (en) * | 1988-04-28 | 1992-01-02 | Sharp Kabushiki Kaisha | Orthogonal transform coding system for image data |
JP2900385B2 (ja) * | 1988-12-16 | 1999-06-02 | ソニー株式会社 | フレーム化回路及び方法 |
JPH0437367A (ja) * | 1990-06-01 | 1992-02-07 | Fujitsu General Ltd | データ圧縮制御方法 |
-
1992
- 1992-10-15 JP JP27738492A patent/JPH06133284A/ja active Pending
-
1993
- 1993-10-13 KR KR1019940702036A patent/KR100359671B1/ko not_active IP Right Cessation
- 1993-10-13 WO PCT/JP1993/001470 patent/WO1994009594A1/ja active IP Right Grant
- 1993-10-13 DE DE1993623996 patent/DE69323996T2/de not_active Expired - Lifetime
- 1993-10-13 EP EP19930922626 patent/EP0618727B1/en not_active Expired - Lifetime
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH01162080A (ja) * | 1987-12-18 | 1989-06-26 | Sony Corp | ディジタルvtr |
Non-Patent Citations (2)
Title |
---|
Broadcast Engineering, May 1992 (Tokyo), SHUICHI MATSUMOTO, "Trend of TV digital coding technology", p. 70-89, Figs. 4, 5. * |
See also references of EP0618727A4 * |
Also Published As
Publication number | Publication date |
---|---|
JPH06133284A (ja) | 1994-05-13 |
DE69323996T2 (de) | 1999-10-07 |
EP0618727A1 (en) | 1994-10-05 |
DE69323996D1 (de) | 1999-04-22 |
EP0618727A4 (en) | 1995-03-01 |
KR100359671B1 (ko) | 2003-01-14 |
EP0618727B1 (en) | 1999-03-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP2795420B2 (ja) | デジタル化映像信号の圧縮方法とその装置及びシステム | |
KR0129558B1 (ko) | 적응적 가변길이 부호화 방법 및 장치 | |
US5361098A (en) | Methods and apparatus for generating a picture-in-picture digital television frame by inserting a mean-only frame into a full-size frame | |
US20040252900A1 (en) | Spatial scalable compression | |
US5850261A (en) | Efficient variable length encoder and decoder | |
KR100307275B1 (ko) | 에러정정코드부가장치및에러정정장치 | |
WO1994009594A1 (en) | Encoder and decoder | |
EP0920212B1 (en) | Video signal coding apparatus | |
US20070230918A1 (en) | Video Quality Enhancement and/or Artifact Reduction Using Coding Information From a Compressed Bitstream | |
JP3166501B2 (ja) | 画像再圧縮方法及び画像再圧縮装置 | |
JPH07327227A (ja) | 画像伝送装置 | |
JP2001258037A (ja) | 符号化装置および復号装置 | |
JP3182920B2 (ja) | 高能率符号化装置 | |
JP4193252B2 (ja) | 信号処理装置及び方法、信号復号装置、並びに信号符号化装置 | |
JPH0216887A (ja) | 画像符号化装置 | |
KR100192778B1 (ko) | Ptsvq를 이용한 호환 부호기 및 복호기 | |
JPH0759092A (ja) | 画像信号の伝送装置 | |
JP3401273B2 (ja) | 符号化装置 | |
JPH1093977A (ja) | 画像信号処理装置とその方法 | |
JPH0759112A (ja) | 画像伝送装置 | |
Bartkowiak et al. | Chrominance vector quantization for cellular video-telephony | |
JPH0698305A (ja) | 高能率符号化装置 | |
JPH05292483A (ja) | 動画像符号化装置 | |
JPH04145727A (ja) | 直交変換方法 | |
JPS63272272A (ja) | 画像圧縮方式 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): KR US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1019940702036 Country of ref document: KR |
|
ENP | Entry into the national phase |
Ref document number: 1994 244856 Country of ref document: US Date of ref document: 19940615 Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1993922626 Country of ref document: EP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 1993922626 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 1993922626 Country of ref document: EP |