Apparatus for encoding and decoding key data and key value data of coordinate interpolator and recording medium containing bitstream into which coordinate interpolator is encoded

• US 7,809,203 B2
• Filed: 11/27/2002
• Issued: 10/05/2010
• Est. Priority Date: 11/27/2001
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd. (Samsung Group)
• Original Assignee: Samsung Electronics Co. Ltd. (Samsung Group)
• Inventors: Jung, Seok-yoon, Kim, Do-kyoon, Han, Mahn-jin, Jang, Euee-seon, Lee, Shin-jun, Jang, Gyeong-ja, Woo, Sang-oak
• Primary Examiner(s): PANNALA, SATHYANARAYA R
• Application Number:
  US10/305,123
• Publication Number:
  US 20030147470A1
• Time in Patent Office: 2,869 Days
• Field of Search: 345473-475
• US Class Current: 382/243
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• CPC Class Codes: H03M 7/40 Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
• CPC Class Codes: H04N 19/00 Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
• CPC Class Codes: H04N 19/103 Selection of coding mode or of prediction mode
• CPC Class Codes: H04N 19/12 Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
• CPC Class Codes: H04N 19/126 Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
• CPC Class Codes: H04N 19/13 Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
• CPC Class Codes: H04N 19/136 Incoming video signal characteristics or properties
• CPC Class Codes: H04N 19/14 Coding unit complexity, e.g. amount of activity or edge presence estimation H04N19/146 takes precedence
• CPC Class Codes: H04N 19/25 with scene description coding, e.g. binary format for scenes [BIFS] compression
• CPC Class Codes: H04N 19/46 Embedding additional information in the video signal during the compression process H04N19/517, H04N19/68, H04N19/70 take precedence
• CPC Class Codes: H04N 19/537 Motion estimation other than block-based
• CPC Class Codes: H04N 19/577 Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
• CPC Class Codes: H04N 19/70 characterised by syntax aspects related to video coding, e.g. related to compression standards

Abstract

An apparatus for encoding and decoding key data and key value data of a coordinate interpolator and a recording medium, on which a bitstream, into which a coordinate interpolator is encoded, is written, are provided. The bitstream includes key data encoding/decoding information, into which key data and information necessary to decode the key data are encoded, and key value data encoding/decoding information, into which key value data and information necessary to decode the key value data are encoded. The key data encoding/decoding information includes inverse DND operation information including the order of inverse DND indicating a predetermined number of cycles of inverse DND to be performed on differential data generated by entropy-decoding the bitstream in order to extend the range of the differential data.

Claims

1. A method of decoding a bitstream, the method comprising:

decoding, in a computer, a key header included in a coordinate interpolator, the coordinate interpolator including the location of each vertex constituting a 3D object in a keyframe-based animation; and

decoding key data included in the coordinate interpolator according to the result of the decoding, the key data representing the position of a key frame on a time axis.

2. The method of claim 1, wherein the decoding of the key data comprises decoding the key data by performing entropy decoding, inverse shift, inverse differential pulse code modulation (DPCM), inverse quantization, and linear key decoding.

3. A method of decoding a bitstream into which a coordinate interpolator that comprises key data and a key header comprising information regarding the key data is encoded, the key data representing the position of a key frame on a time axis, the method comprising:

(a) decoding the key header in a computer;

(b) decoding the key data according to the result of the decoding

performed in (a) in said computer; and

outputting the decoded key data,

wherein (b) comprises decoding the key data by performing entropy decoding, inverse shift, inverse differential pulse code modulation (DPCM), inverse quantization, and linear key decoding,

wherein the key header comprises;

a quantization bit quantity (nKVQBit) which indicates the number of bits used to quantize the key data;

a key data quantity (nNumberOfKey) which indicates the number of the key data;

a key data digit number (nKeyDigit) which indicates the number of digits of the key data;

a linear key flag (blsLinearKeySubRegion) which indicates whether the key data comprises a linear key region;

beginning/ending key data (IKey) which is included in the key header if the linear key flag (bIsLinearKeySubRegion) is set to a value of 1, the beginning/ending key data (IKey) indicating where the linear key region begins and ends;

a quantization error adjustment flag (bRangeFlag) which indicates whether to adjust a maximum and minimum of the key data using a method by which a quantization error can be minimized;

an adjusted maximum and minimum (KeyMinMax) of the key data which are included in the key header if the quantization error adjustment flag(bRangeFlag) is set to a value of 1, the adjusted maximum and minimum (KeyMinMax) being used to perform inverse quantization;

a DPCM order (nKDPCMOrder) which indicates how many iterations of DPCM which have been performed;

reference key data (nQlntraKey) which is used to determine whether to perform DPCM, wherein the number of the reference key data (nQlntraKey) corresponds to the DPCM order (nKDPCMOrder);

key data sign bits (nQlntraKeySign), wherein the number of the key data sign bits(nQlntraKeySign) corresponds to the DPCM order (nKDPCMOrder);

a shift flag (bShiftFlag) which indicates whether to shift all the key data based on the key data with a highest frequency among all the key data obtained by DPCM;

a shift value (nKeyShift) which represents the degree to which all the key data is to be shifted;

a shift value sign bit (nKeyShiftSign) which is a sign bit of the shift value (nKeyShift);

a divide-and-divide (DND) order (nDNDOrder) which indicates how many iterations of DND have been performed to adjust a range of DPCM results;

at least one (nKeyMax) of maximums and minimums which are used to perform DND, wherein the number of the maximums and minimums corresponds to the DND order(nDNDOrder);

a sign bit (nKeyMaxSign) which identifies the at least one (nKeyMax) of the maximums and minimums, wherein the number of the sign bit (nKeyMaxSlgfl) corresponds to the DND order (nDNDOrder);

an invert-down flag (bKeylnvertDownFlag) which indicates whether to invert down DND results;

an invert-down value (nKeylnvertDown) which indicates the degree to which the DND results are to be inverted down; and

an adaptive arithmetic coding (AAC) flag (bSignedAACFlag) which indicates whether entropy encoding has been performed using a signed AAC method or an unsigned AAC method,

wherein the linear key region is a region where the key data linearly increases.

4. The method of claim 3, wherein (b) comprises:

performing entropy-decoding on the encoded key data by performing inverse signed AAC if the AAC flag (bSignedAACF lag) indicates that the encoded key data has been encoded using the signed AAC method and performing inverse unsigned AAC if the AAC flag (bSignedAACFlag) indicates that the encoded key data has been encoded using the unsigned AAC method;

performing inverse DND on the result of the entropy decoding if the DND order (nDNDOrder) is set to a value of 1 or greater;

performing inverse fold on the result of the entropy decoding if the DND order (nDNDOrder) is set to a value other than −

1;

inversely shifting the result of the inverse fold by as much as the shift value (nKeyShift) if the DND order (nDNDOrder) is set to a value other than −

1, and inversely shifting the result of the entropy decoding by as much as the shift value (nKeyShift) if the DND order (nDNDOrder) is set to a value of −

1;

performing inverse DPCM on the result of the inversely shifting according to the DPCM order (nKDPCMOrder);

adjusting the result of the inverse DPCM if the maximum and minimum key data have been adjusted, and performing inverse quantization on the result of the adjusting according to the quantization bit size (nKeyQBit); and

if the decoded key header comprises the linear key region, decoding the key data of the linear key region using the beginning/ending key data (IKey), and performing linear key synthesis on the result of the decoding and the result of the inverse quantization.

5. The method of claim 4 wherein, in the performing of the inverse DND, if the DND order (nDNDOrder) is set to a value of 1 or greater and the invert-down value is not −

1, an invert-down operation, which is an inverse operation of a shift-up operation performed during entropy encoding, is performed, if the DND order (nDNDOrder) is set to a value of 1 or greater and the invert-down value is −

1, not performing the invert-down operation, and the performing of the inverse DND comprises performing the inverse DND a predetermined number of times corresponding to the DND order (nDNDOrder),

wherein, if a current iteration of the inverse DND is not a final iteration of the inverse DND and the at least one (nKeyMax) is a positive value, the current iteration of the inverse DND is performed using an invert-divide-down method, if the current iteration of the inverse DND is not the final iteration of the inverse DND and the at least one (nKeyMax) is a negative value, the current iteration of the inverse DND is performed using an inverse-divideup method, and If the current iteration of the inverse DND is the final iteration of the inverse DND, the current iteration of the inverse DND is performed using an inverse-divide-up method regardless of whether the at least one (nKeyMax) is a positive value or a negative value.