ISO/IEC13818-2:2013标准 - 移动图像和音频编码技术

需积分: 26 155 浏览量更新于2024-07-15 收藏 3.14MB PDF 举报

"ISOIEC13818-2-2013.pdf - ISO/IEC 13818-2标准英文版，关于视频编码技术" ISO/IEC 13818-2是国际标准化组织（ISO）和国际电工委员会（IEC）联合制定的一项标准，它属于MPEG-2（Moving Picture Experts Group-2）的一部分，该标准详细规定了用于编码运动图像和相关音频信息的通用方法。这个标准的第三版发布于2013年10月1日，标题为“Information technology—Generic coding of moving pictures and associated audio information—Part 2: Video”，即信息技术——运动图像及其相关音频信息的通用编码——第二部分：视频。 MPEG-2标准是多媒体编码领域的重要里程碑，尤其在数字电视、视频压缩和存储等方面广泛应用。它定义了如何高效地压缩视频数据，使得在有限的带宽下传输高质量的视频成为可能。ISO/IEC 13818-2主要关注视频数据的编码，其核心技术包括： 1. **帧间预测（Inter-frame prediction）**：通过比较和利用相邻帧之间的相似性，预测当前帧的像素值，减少需要编码的信息量。 2. **帧内预测（Intra-frame prediction）**：在没有相邻帧可参考的情况下，基于当前宏块内部的像素模式进行预测，常用于I帧（独立帧）编码。 3. **离散余弦变换（Discrete Cosine Transform, DCT）**：将像素值转换到频率域，通过去除高频成分，压缩数据。 4. **量化（Quantization）**：根据图像区域的重要性，对DCT系数进行非线性量化，进一步减少数据量，允许调整压缩率。 5. **熵编码（Entropy Encoding）**：包括霍夫曼编码（Huffman Coding）和算术编码，用于将量化后的数据编码为更紧凑的位流。 6. **运动补偿（Motion Compensation）**：通过估计像素块在不同帧间的移动，生成预测误差，提高压缩效率。 7. **错误恢复机制**：如GOP（Group of Pictures）结构，I/P/B帧的组合使用，以及错误隐藏技术，增强在有损传输或信道噪声环境下的视频播放质量。 8. **流式传输支持**：MPEG-2标准支持多码率和不同分辨率的视频流，适应不同的网络条件和终端设备。这个标准的2013年版本可能包含了技术改进、修订或澄清，以应对不断发展的技术和市场需求。虽然具体内容未给出，但可以推断，更新可能涉及增强的编码效率、更好的画质和兼容性，以及对新技术的适应，如高清和超高清视频的支持。 ISO/IEC 13818-2对于视频编码领域的专业人员，如软件工程师、系统设计师、数字媒体专家，以及与数字视频处理相关的研究和开发工作，都具有重要的参考价值。同时，由于版权保护，未经许可，该标准的复制和使用需遵循ISO的相关规定。

ISO/IEC 13818-2:2013 (E)

6 Rec. ITU-T H.262 (02/2012)

3.111 reference frame: A reference frame is a reconstructed frame that was coded in the form of a coded I-frame or

a coded P-frame. Reference frames are used for forward and backward prediction when P-pictures and B-pictures are

decoded.

3.112 re-ordering delay: A delay in the decoding process that is caused by frame re-ordering.

3.113 reserved: The term "reserved" when used in the clauses defining the coded bitstream, indicates that the value

may be used in the future for ITU-T | ISO/IEC defined extensions.

3.114 sample aspect ratio (SAR): This specifies the relative distance between samples. It is defined (for the

purposes of Rec. ITU-T H.262 | ISO/IEC 13818-2), as the vertical displacement of the lines of luminance samples in a

frame divided by the horizontal displacement of the luminance samples. Thus, its units are (metres per line) ÷ (metres per

sample).

3.115 scalable hierarchy: Coded video data consisting of an ordered set of more than one video bitstream.

3.116 scalability: Scalability is the ability of a decoder to decode an ordered set of bitstreams to produce a

reconstructed sequence. Moreover, useful video is output when subsets are decoded. The minimum subset that can thus

be decoded is the first bitstream in the set which is called the base layer. Each of the other bitstreams in the set is called

an enhancement layer. When addressing a specific enhancement layer, "lower layer" refer to the bitstream which

precedes the enhancement layer.

3.117 side information: Information in the bitstream necessary for controlling the decoder.

3.118 16 × 8 prediction: A prediction mode similar to field-based prediction but where the predicted block size is

16 × 8 luminance samples.

3.119 run: The number of zero coefficients preceding a non-zero coefficient, in the scan order. The absolute value of

the non-zero coefficient is called "level".

3.120 saturation: Limiting a value that exceeds a defined range by setting its value to the maximum or minimum of

the range as appropriate.

3.121 skipped macroblock: A macroblock for which no data is encoded.

3.122 slice: A consecutive series of macroblocks which are all located in the same horizontal row of macroblocks.

3.123 SNR scalability: A type of scalability where the enhancement layer(s) contain only coded refinement data for

the DCT coefficients of the lower layer.

3.124 source; input: Term used to describe the video material or some of its attributes before encoding.

3.125 spatial prediction: Prediction derived from a decoded frame of the lower layer decoder used in spatial

scalability.

3.126 spatial scalability: A type of scalability where an enhancement layer also uses predictions from sample data

derived from a lower layer without using motion vectors. The layers can have different frame sizes, frame rates or

chrominance formats.

3.127 start codes (system and video): 32-bit codes embedded in that coded bitstream that are unique. They are used

for several purposes including identifying some of the structures in the coding syntax.

3.128 stuffing (bits); stuffing (bytes): Code-words that may be inserted into the coded bitstream that are discarded in

the decoding process. Their purpose is to increase the bit rate of the stream which would otherwise be lower than the

desired bit rate.

3.129 temporal prediction: Prediction derived from reference frames or fields other than those defined as spatial

prediction.

3.130 temporal scalability: A type of scalability where an enhancement layer also uses predictions from sample data

derived from a lower layer using motion vectors. The layers have identical frame size, and chrominance formats, but can

have different frame rates.

3.131 top field

: One of two fields that comprise a frame. Each line of a top field is spatially located immediately

above the corresponding line of the bottom field.

3.132 top layer: The topmost layer (with the highest layer_id) of a scalable hierarchy.

3.133 variable bit rate: Operation where the bit rate varies with time during the decoding of a coded bitstream.

3.134 variable length coding (VLC): A reversible procedure for coding that assigns shorter code-words to frequent

events and longer code-words to less frequent events.

--`,`,,``,``,,,,,,,`,,,,``,```,,-`-`,,`,,`,`,,`---

ISO/IEC 13818-2:2013 (E)

Rec. ITU-T H.262 (02/2012) 7

3.135 video buffering verifier (VBV): A hypothetical decoder that is conceptually connected to the output of the

encoder. Its purpose is to provide a constraint on the variability of the data rate that an encoder or editing process may

produce.

3.136 video sequence: The highest syntactic structure of coded video bitstreams. It contains a series of one or more

coded frames.

3.137 xxx profile decoder: Decoder able to decode one or a scalable hierarchy of bitstreams of which the top layer

conforms to the specifications of the xxx profile (with xxx being any of the defined Profile names).

3.138 xxx profile scalable hierarchy: Set of bitstreams of which the top layer conforms to the specifications of the

xxx profile.

3.139 xxx profile bitstream: A bitstream of a scalable hierarchy with a profile indication corresponding to xxx. Note

that this bitstream is only decodable together with all its lower layer bitstreams (unless it is a base layer bitstream).

3.140 zigzag scanning order: A specific sequential ordering of the DCT coefficients from (approximately) the

lowest spatial frequency to the highest.

4 Abbreviations and symbols

The mathematical operators used to describe this Specification are similar to those used in the C programming language.

However, integer divisions with truncation and rounding are specifically defined. Numbering and counting loops

generally begin from zero.

4.1 Arithmetic operators

+ Addition

– Subtraction (as a binary operator) or negation (as a unary operator)

+ Increment, i.e. x+ + is equivalent to x = x + 1

–

– Decrement, i.e. x– – is equivalent to x = x – 1







Multiplication

^ Power

/ Integer division with truncation of the result toward zero. For example, 7/4 and –7/–4 are truncated to

1 and –7/4 and 7/–4 are truncated to –1.

// Integer division with rounding to the nearest integer. Half-integer values are rounded away from zero

unless otherwise specified. For example 3//2 is rounded to 2, and –3//2 is rounded to –2.

DIV Integer division with truncation of the result toward minus infinity. For example 3 DIV 2 is rounded

to 1, and –3 DIV 2 is rounded to –2.

÷ Used to denote division in mathematical equations where no truncation or rounding is intended.

% Modulus operator. Defined only for positive numbers.

Sign( ) Sign(x) =











<−

Abs( ) Abs(x) =







<−

0xx



if )(

The summation of the f (i) with i taking integral values from a up to, but not including b.

Floor( ) the largest integer less than or equal to the argument.

Round( ) Sign( x ) * Floor( Abs( x ) + 0.5 ), for an argument x.

--`,`,,``,``,,,,,,,`,,,,``,```,,-`-`,,`,,`,`,,`---

ISO/IEC 13818-2:2013 (E)

Rec. ITU-T H.262 (02/2012)

4.2 Logical operators

|| Logical OR

&& Logical AND

! Logical NOT

4.3 Relational operators

> Greater than

>= Greater than or equal to

< Less than

<= Less than or equal to

= Equal to

!= Not equal to

max [, … ,] The maximum value in the argument list

min [, … ,] The minimum value in the argument list

4.4 Bitwise operators

& AND

| OR

>> Shift right with sign extension

<< Shift left with zero fill

4.5 Assignment

= Assignment operator

4.6 Mnemonics

The following mnemonics are defined to describe the different data types used in the coded bitstream.

bslbf Bit string, left bit first, where "left" is the order in which bit strings are written in this Specification.

Bit strings are generally written as a string of 1s and 0s within single quote marks, e.g. '1000 0001'.

Blanks within a bit string are for ease of reading and have no significance. For convenience, large

strings are occasionally written in hexadecimal; in this case, conversion to a binary in the

conventional manner will yield the value of the bit string. Thus, the left most hexadecimal digit is

first and in each hexadecimal digit the most significant of the four bits is first.

uimsbf Unsigned integer, most significant bit first.

simsbf Signed integer, in two's complement format, most significant (sign) bit first.

vlclbf Variable length code, left bit first, where "left" refers to the order in which the VLC codes are

written. The byte order of multibyte words is the most significant byte first.

In the clauses describing the syntax, any syntactic element that can only take positive or unsigned values (such as a flag

that can be equal to 0 or 1) is described with the mnemonic 'uimsbf'. If the syntactic element can have a negative value, it

is described with the mnemonic 'simsbf'. If the syntactic element has a constant value (e.g. marker_bit) then it is

described with the mnemonic 'bslbf'. If the syntactic element represents a variable-length code, it is described with the

mnemonic 'vlclbf'.

4.7 Constants

π 3.141 592 653 58...

e 2.718 281 828 45...

--`,`,,``,``,,,,,,,`,,,,``,```,,-`-`,,`,,`,`,,`---

ISO/IEC 13818-2:2013 (E)

Rec. ITU-T H.262 (02/2012) 9

5 Conventions

5.1 Method of describing bitstream syntax

The bitstream retrieved by the decoder is described in 6.2. Each data item in the bitstream is in bold type. It is described

by its name, its length in bits, and a mnemonic for its type and order of transmission.

The action caused by a decoded data element in a bitstream depends on the value of that data element and on data

elements previously decoded. The decoding of the data elements and definition of the state variables used in their

decoding are described in 6.3. The following constructs are used to express the conditions when data elements are

present, and are in normal type:

This syntax uses the 'C-code' convention that a variable or expression evaluating to a non-zero value is equivalent to a

condition that is true and a variable or expression evaluating to a zero value is equivalent to a condition that is false. In

many cases a literal string is used in a condition. For example:

if ( scalable_mode =

= "spatial scalability" ) …

In such cases the literal string is that used to describe the value of the bitstream element in 6.3. In this example, we see

that "spatial scalability" is defined in Table 6-10 to be represented by the two bit binary number '01'.

As noted, the group of data elements may contain nested conditional constructs. For compactness, the {} are omitted

when only one data element follows:

data_element [n] data_element [n] is the (n + 1)-th element of an array of data.

data_element [m][n] data_element [m][n] is the (m + 1, n + 1)-th element of a two-dimensional array of data.

data_element [l][m][n] data_element [l][m][n] is the (l + 1, m + 1, n + 1)-th element of a three-dimensional array

of data.

While the syntax is expressed in procedural terms, it should not be assumed that 6.2 implements a satisfactory decoding

procedure. In particular, it defines a correct and error-free input bitstream. Actual decoders must include means to look

for start codes in order to begin decoding correctly, and to identify errors, erasures or insertions while decoding. The

methods to identify these situations, and the actions to be taken, are not standardized.

5.2 Definition of functions

Several utility functions for picture coding algorithm are defined as follows.

while ( condition ) {

data_element

. . .

}

If the condition is true, then the group of data elements occurs

next in the data stream. This repeats until the condition is not true.

do {

data_element

. . .

} while ( condition )

The data element always occurs at least once.

The data element is repeated until the condition is not true.

if ( condition ) {

data_element

. . .

} else {

data_element

. . .

}

If the condition is true, then the first group of data elements occurs

next in the data stream.

If the condition is not true, then the second group of data elements

occurs next in the data stream.

for ( i = m; i < n; i+ +) {

data_element

. . .

}

The group of data elements occurs (m – n) times. Conditional

constructs within the group of data elements may depend on the

value of the loop control variable i, which is set to zero for the

first occurrence, incremented by one for the second occurrence, and so forth.

/* comment ... */

Explanatory comment that may be deleted entirely without in any

way altering the syntax.

--`,`,,``,``,,,,,,,`,,,,``,```,,-`-`,,`,,`,`,,`---

ISO/IEC 13818-2:2013 (E)

Rec. ITU-T H.262 (02/2012)

5.2.1 Definition of bytealigned() function

The function bytealigned () returns 1 if the current position is on a byte boundary, that is the next bit in the bitstream is

the first bit in a byte. Otherwise it returns 0.

5.2.2 Definition of nextbits() function

The function nextbits () permits comparison of a bit string with the next bits to be decoded in the bitstream.

5.2.3 Definition of next_start_code() function

The next_start_code() function removes any zero bit and zero byte stuffing and locates the next start code.

This function checks whether the current position is byte aligned. If it is not, zero stuffing bits are present. After that any

number of zero stuffing bytes may be present before the start code. Therefore, start codes are always byte aligned and

may be preceded by any number of zero stuffing bits.

5.3 Reserved, forbidden and marker_bit

The terms "reserved" and "forbidden" are used in the description of some values of several fields in the coded bitstream.

The term "reserved" indicates that the value may be used in the future for ITU-T | ISO/IEC defined extensions.

The term "forbidden" indicates a value that shall never be used (usually in order to avoid emulation of start codes).

The term "marker_bit" indicates a one bit integer in which the value zero is forbidden (and it therefore shall have the

value '1'). These marker bits are introduced at several points in the syntax to avoid start code emulation.

5.4 Arithmetic precision

In order to reduce discrepancies between implementations of this Specification, the following rules for arithmetic

operations are specified:

a) Where an arithmetically-precise result is not fully specified, such as in the calculation of the IDCT, the

precision shall be sufficient so that significant errors do not occur in the final integer values.

b) Where ranges of values are given by a colon, the end points are included if a bracket is present, and

excluded if the 'less than' (<) and 'greater than' (>) characters are used. For example, [a : b > means from

b, including a but excluding b.

6 Video bitstream syntax and semantics

6.1 Structure of coded video data

Coded video data consists of an ordered set of video bitstreams, called layers. If there is only one layer, the coded video

data is called non-scalable video bitstream. If there are two layers or more, the coded video data is called a scalable

hierarchy.

The first layer (of the ordered set) is called base layer, and it can always be decoded independently. See 7.1 to 7.6

and 7.12 for a description of the decoding process for the base layer, except in the case of Data partitioning, described

in 7.10.

Other layers are called enhancement layers, and can only be decoded together with all the lower layers (previous layers

in the ordered set), starting with the base layer. See 7.7 to 7.11 for a description of the decoding process for scalable

hierarchy.

next_start_code() { No. of bits Mnemonic

while ( !bytealigned() )

zero_bit 1 '0'

while ( nextbits() != '0000 0000 0000 0000 0000 0001' )

zero_byte 8 '0000 0000'

}

--`,`,,``,``,,,,,,,`,,,,``,```,,-`-`,,`,,`,`,,`---

剩余235页未读，继续阅读

old__fish

粉丝: 0
资源: 2

ISO/IEC13818-2:2013标准 - 移动图像和音频编码技术

ISO-IEC-13818-1_2000_MPEG2_Systems.pdf

ISO_IEC_13818-1_2000_PDF_version_(en)_031537_CPDF

ISO_IEC_13818-1_2007

ISOIEC13818-1-2018.pdf

ISOIEC 10918-1 ITU-T.81 jpeg.pdf

info_isoiec14496-10-2008en.pdf

ISOIEC 10918-1 ITU-T.81 jpeg带目录.pdf

ISOIEC 13818-1.pdf

isoiec 13818-2(1995,for MPEG-2).pdf

ISOIEC25010-2011软件质量模型.zip

最新资源