CN116208764A

CN116208764A - Data compression method and device for limiting value range of chroma component transformation coefficient symbol

Info

Publication number: CN116208764A
Application number: CN202310098693.1A
Authority: CN
Inventors: 林涛
Original assignee: Shanghai Tianhe Electronic Information Co ltd
Current assignee: Shanghai Tianhe Electronic Information Co ltd
Priority date: 2018-06-30
Filing date: 2019-06-30
Publication date: 2023-06-02
Also published as: CN116320396A; CN110662028B; CN116233415A; CN110662028A

Abstract

The invention provides a method for limiting the value range of the sign of a transformation coefficient in each frame of image in the coding of a sequence of images and a chroma residual component transformation coefficient used for video coding, namely, the coefficient used for transforming one component of the chroma residual into another component, thereby playing the roles of reducing the actual value range of the sign of the transformation coefficient of each frame of image, reducing the number of bits consumed for coding the sign of the transformation coefficient and improving the coding efficiency.

Description

Data compression method and device for limiting value range of chroma component transformation coefficient symbol

This application is a divisional application of the following original applications:

filing date of the original application: 2019-06-30

Application number of the original application: 2019105822607

The invention of the original application creates the name: data compression method and apparatus for encoding parameters by hierarchically defined subsets (name at the time of handling registration procedure: encoding method and apparatus for compressing sequence of images, decoding method and apparatus)

Technical Field

The present invention relates to a system for encoding and decoding (also called decoding) data compression, and more particularly to a method and apparatus for encoding and decoding a data set having a limited range of values.

Background

As human society enters the era of big data, cloud computing, mobile computing, cloud-mobile computing, ultra-high definition (4K) and ultra-high definition (8K) video image resolution, 4G/5G communication, virtual reality, ultra-high compression ratio and ultra-high quality data compression are indispensable techniques for various raw data including big data, image data, video data, audio data, voice data, neural network data.

A very large class of data compression problems can be summarized as to the data set y= { y=f (x): the compression problem of X ε X, where ε represents "belong to"; the set X is a definition field of Y or f, and consists of all X, which is called an element of X; the set Y consists of all y=f (x), which is called an element of Y, typically a value (one-dimensional, i.e. a value with one component, or multidimensional, i.e. a value with several components) or equivalent to a value or expressed as a value; f is a correspondence defined on X, also called correspondence rule or functional relationship or simply function, for each X in X there is a unique y=f (X) corresponding to X. Different x may correspond to the same y=f (x), i.e. x ₁ ∈X，x ₂ ∈X，x ₁ And x ₂ Is a different element in X, but f (X ₁ ) And f (x) ₂ ) There are equal values. Another equivalent representation of the data set Y is that for each X e X there is y=f (X) e Y corresponding to X.

The compression problem for the data set Y is in fact to represent all elements f (x) of Y with as few bits as possible. The notation indicates the number of bits consumed per f (x) as B (x), then the notation indicates the total number of bits consumed B required for all elements f (x) of Y _total Equal to the sum of all B (x), B _total = ∑ _x∈X b (x), wherein Σ represents the summation operation and the subscript of Σ _x∈X Representing the summation of b (X) over all X's in X.

The value of the element (i.e., data) Y of the data set Y is referred to as the value taken by the element Y, simply referred to as the value or value of Y. The range of values of the total composition Y, which are allowed to be taken by Y and are different from each other, is denoted as r= { R [ k ]: k=0 to K-1, where, when i+.j, r [ i+.r [ j ]. Obviously, K is the size of the value range R, i.e. the number of elements of R.

B (x) and B _total Are directly related to the size K of the value range R of Y. For example, when k=2 ^b And the elements of R are represented by fixed-length binary codes of length b (i.e. bits, i.e. binary codes with a bit number equal to b), all b (x) being equal to b=log ₂ (K) Thus, B _total = N×b = N×log ₂ (K) Where N is the number of elements in X. Obviously, when K increases, B _total Will also increase. It can be seen that the effect of data compression is directly related to the size of the range of values of the data.

In the prior art, when data compression is performed on a data set Y, the value range R is fixed, so the size K of the value range is also fixed. When K is large, a large number of bits is used and consumed every time one data y is encoded or decoded, so that improvement of encoding efficiency becomes difficult.

In the compression of image and video data, a frame of image is typically divided into encoded blocks, each of which is represented by a block number, and the encoded blocks are encoded (and decoded accordingly) one by one. If one encoded block is an intra-coded block, an intra-prediction mode is used to specify which intra-prediction is to be performed on the intra-coded block. Each intra prediction mode of intra coding is represented by an intra prediction mode number. In this case, the data set y= { y=f (x): the definition field X in X e X is the set of all intra-coded blocks or their block numbers in the image or image sequence, i.e. video, and the value range R is the set of all intra-prediction modes or their numbers. Obviously, in this example, the size K of the value range R represents a total of K predetermined intra prediction modes. In the HEVC international video coding standard, k=35. In the next generation of international video coding standards currently under development, K may increase to 65.

In the second example of data sets and their fields and ranges of values, in the compression of image and video data, a color transform (also called color conversion or color conversion) is also typically required for one encoded block to eliminate the correlation between the components of the pixels. To accommodate situations where different areas in images and videos often have unique color characteristics and unique color correlations, there are also many types of color transforms, each represented by a color transform pattern. When one encoded block is encoded and decoded, a color transform mode is used to specify which color transform is to be performed on the encoded block. Each color conversion pattern is represented by a color conversion pattern number. In this case, the data set y= { y=f (x): the definition field X in X e X is the set of all coded blocks or their block numbers in the image or video, and the value range R is the set of all color transform modes or their numbers. Obviously, in this example, the size K of the value range R represents a total of K predetermined color conversion modes. In the prior art, the variety of color transforms actually used is often more than 100, i.e., K >100.

In the third example of the data set, the definition field and the value range thereof, in compression of image and video data, a string matching or string prediction technique is often used to divide one encoded block into a plurality of pixel strings, and matching or prediction is performed in units of strings. Each string is characterized by string encoding parameters including string length, offset (i.e., the positional offset between the current string and the reference string). Within a code block, each string has a string number. In this case, the data set y= { y=f (x): the definition field X in X e X is a combination of all string-matching encoded blocks or block numbers thereof and strings or string numbers thereof within the encoded blocks in the image or video, i.e. a set of all two-dimensional combinations (encoded blocks or block numbers thereof, strings or string numbers thereof within the blocks), while the value range R is a set of possible values allowed to be taken by the string encoding parameters. Example 1: let the number of pixels of a code block be N (typically N is 64, 256, 1024, 4096, 16384), the possible values allowed by the string coding parameter string length are 1,2, … …, N-1, N, and N total, so the size K of the range R of values of Y is equal to N. Example 2: if the reference string is limited to a predetermined area of the image, the possible value allowed by the string encoding parameter is the value of the offset that causes the reference string to fall within said predetermined area.

In the fourth example of data sets and their fields and value ranges, in the compression of image and video data, block matching or block prediction techniques are often used to match (also called predict) a current coded block using a reference block, either inter or intra, for the current coded block. Each current coded block represents the position of the reference block by the frame number (abbreviated reference frame number) and the motion vector of the frame in which the reference block is located (abbreviated reference frame). In this case, the data set y= { y=f (x): the definition field X in X e X is the set of all the blocks in the image or video that match the coded block or its block number, while the value range R is the set of possible values allowed by the reference frame or its number and the motion vector. Such as: if the reference block is limited to a number of predetermined areas of the frames, the possible values allowed to be taken by the reference frame or its number and the motion vector are the values of the reference frame or its number and the motion vector that have the reference block fall within said predetermined areas.

Disclosure of Invention

In order to solve the problem that when the value range of a data set is larger, the number of bits used for data encoding and decoding is more, so that the encoding efficiency is low, the invention provides a data compression method and a device adopting a sub-range and a sub-definition domain.

The invention is characterized in that I sub-ranges R are defined in the value range R of a data set Y ₁ ，R ₂ ，R ₃ ，……，R _I The method comprises the steps of carrying out a first treatment on the surface of the Dividing a definition field X of a data set into M sub-definition fields X ₁ ，X ₂ ，X ₃ ，……，X _M The method comprises the steps of carrying out a first treatment on the surface of the For X _m All elements X in (i.e. any X ε X) _m ) The value of the data f (x) corresponding to x is limited to a sub-range R _i And (3) inner part. Due to R _i Since R is smaller, the number of bits required to be consumed to represent f (x) is also reduced when data compression is performed, thereby improving coding efficiency. Of course, for each X _m Some number of bits may be consumed to indicate to which sub-range R the value of the data f (x) corresponding to x is limited _i And (3) inner part. However, although this has a negative effect, as long as each X is properly selected and defined _m And each R _i The present invention has the effect of improving the coding efficiency as a whole.

In the present invention, preferably, in each R _i Further define J _i The next layer (layer 2) subrange R _i1 ，R _i2 ，……，R _iJi The method comprises the steps of carrying out a first treatment on the surface of the Each X is _m Also further divided into N _m The next layer (layer 2) of sub-fields X _m1 ，X _m2 ，……，X _mNm The method comprises the steps of carrying out a first treatment on the surface of the Arbitrary X ε X _mn The value of the data f (x) corresponding to x is limited to a sub-range R _ij And (3) inner part.

In the present invention, it is preferable that a plurality of layer 3 sub-ranges are further defined in each layer 2 sub-range; dividing each layer 2 subdomain into a plurality of layer 3 subdomains; for all elements x in a layer 3 sub-definition domain, the value of the data f (x) corresponding to x is limited to a layer 3 sub-range.

In the present invention, preferably, and so on, a number of l+1-th layer sub-ranges are further defined in each L-th layer sub-range; dividing each L-th layer sub-definition domain into a plurality of L+1-th layer sub-definition domains; for all elements x in an L+1 layer sub-definition domain, the value of the data f (x) corresponding to x is limited to an L+1 layer sub-range.

One data set Y may have multiple definition fields. The most trivial definition field is the dataset Y itself, where y=x. Another field is a number or sequence number or index or coordinates or address or control signals etc. naturally present or assigned to the element of the dataset Y itself.

The most basic characteristic technical feature of the coding method or device of the present invention is that for a range of values (also referred to as a value range or a set of output values or a candidate list or a candidate parameter set or a candidate pattern set) of a data set defined on one suitable definition field (also referred to as an input set or an input variable set or an input independent variable set or an independent variable set or a control signal set), the definition field is divided into a plurality of sub-definition fields, a plurality of sub-ranges allowing intersection are defined in the value range, and the relevant coding function and operation are completed under the condition that the values of the data corresponding to all elements belonging to the same sub-definition field are limited within the same sub-range without exception, and a compressed data stream containing at least information which can be used for directly or indirectly mixedly representing or deriving in which sub-range the values of the data corresponding to the elements of each sub-definition field are limited respectively. Fig. 1 is a schematic diagram of the encoding method or apparatus of the present invention.

The most basic characteristic technical feature of the decoding method or device of the present invention is that for the value range (also referred to as value range or output value set or candidate list or candidate parameter set or candidate pattern set) of the data set defined on one suitable definition field (also referred to as input set or input variable set or input independent variable set or control signal set), the definition field is divided into a plurality of sub-definition fields, a plurality of sub-ranges allowing intersection are defined in the value range, the related decoding function and operation are completed under the limitation condition that the value of the data corresponding to all elements belonging to the same sub-definition field is limited in the same sub-range, and the information required in the decoding process for directly or indirectly or directly and indirectly mixedly representing or deriving the sub-range in which the value of the data corresponding to the elements of each sub-definition field is limited respectively is obtained by analyzing the compressed data code stream. Fig. 2 is a schematic diagram of the decoding method or apparatus of the present invention.

According to one aspect of the present invention, there is provided an encoding method or apparatus or a decoding method or apparatus for compressing a data set, at least comprising steps or modules for performing the following functions and operations:

Determining a suitable definition field for said dataset;

dividing the definition domain into a plurality of sub-definition domains;

defining a plurality of sub-ranges allowing intersection among the value ranges of the data sets;

the values of the data corresponding to all elements belonging to the same sub-definition domain are limited in the same sub-range;

the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixedly representing or deriving the sub-range within which the value of the data corresponding to the elements of each sub-definition domain is limited.

From a first aspect, the present invention provides a method of encoding a data set and its data compression, characterized in that it comprises at least the following steps:

1) Defining a definition domain for the data set and establishing a corresponding relation between the definition domain and elements thereof and the data set and elements thereof;

2) Dividing the definition domain into a plurality of sub-definition domains;

3) Defining a plurality of sub-ranges allowing intersection among the value ranges of the data sets;

4) Establishing a corresponding relation between the sub-definition domain and the sub-range, namely defining that the values of the data corresponding to all elements belonging to the same sub-definition domain are limited in the same sub-range;

5) A compressed data code stream is generated which contains at least information which can be used to directly or indirectly or a mixture of directly and indirectly represent or derive the sub-ranges in which the values of the data corresponding to the elements of the respective sub-fields are respectively limited.

From a second aspect, the present invention provides a decoding method for compressing a data set and data thereof, characterized by comprising at least the steps of:

1) Analyzing the compressed data code stream to obtain information which can be used for directly or indirectly or directly and indirectly mixedly representing or exporting the data corresponding to the elements of each sub-definition domain and respectively limiting the value of the data in which sub-range;

2) According to the information, determining a sub-range within which the value of the data corresponding to all elements belonging to the same sub-definition domain is limited, namely a value sub-range of the data corresponding to the elements of one sub-definition domain;

3) And decoding data corresponding to the elements of the sub-definition domain in the value sub-range.

From a third aspect, the present invention provides an encoding device for compressing a data set and data thereof, comprising at least the following modules:

1) The data set comprises a definition domain construction module, a definition domain construction module and a data set generation module, wherein the definition domain is defined for the data set, and the definition domain and the corresponding relation between the elements of the definition domain and the data set and the elements of the definition domain are constructed;

2) The definition domain dividing module divides the definition domain into a plurality of sub definition domains;

3) The subset selection module of the value range of the data set selects and prescribes a plurality of sub-ranges allowing intersection among the value ranges of the data set;

4) The relation construction module of the sub-definition domain and the sub-range constructs the corresponding relation between the sub-definition domain and the sub-range, and limits the value of the data corresponding to all elements belonging to the same sub-definition domain to the same sub-range;

5) The compressed data code stream generating module generates a compressed data code stream containing at least information which can be used for directly or indirectly and mixedly representing or exporting the value of the data corresponding to the elements of each sub-definition domain in which sub-range is limited respectively.

From a fourth aspect, the present invention provides a decoding device for compressing a data set and data thereof, comprising at least the following modules:

1) The compressed data code stream analysis module analyzes the compressed data code stream to obtain information which can be used for directly or indirectly mixed representation or derivation of the sub-scope in which the value of the data corresponding to the elements of each sub-domain is limited respectively;

2) The value sub-range determining module determines a sub-range in which the value of the data corresponding to all elements belonging to the same sub-definition domain is limited, namely a value sub-range of the data corresponding to the elements of one sub-definition domain, according to the information obtained by the compressed data code stream analyzing module;

3) And the data decoding module decodes the data corresponding to the elements of the sub-definition domain in the value sub-range.

"Domain" may also have other forms or names, such as: a set of inputs, a set of input variables, a set of input arguments, a set of control signals.

Preferably, the sub-definition domain is a layer 1 sub-definition domain, allowing to be further divided into a plurality of layer 2 sub-definition domains; the sub-range is a layer 1 sub-range, allowing a number of layer 2 sub-ranges to be further defined therein; the values of the data corresponding to all elements belonging to the same layer 2 sub-definition domain are limited in the same layer 2 sub-range; the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixedly representing or exporting the value of the data corresponding to the elements of each layer 2 sub-definition domain to limit the value of the data in which layer 2 sub-range is respectively limited.

Preferably, the layer 2 sub-domain is allowed to be further divided into a plurality of layer 3 sub-domains; a number of layer 3 sub-ranges are allowed to be further specified in the layer 2 sub-range; the values of the data corresponding to all elements belonging to the same layer 3 sub-definition domain are limited in the same layer 3 sub-range; the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixedly representing or exporting the value of the data corresponding to the elements of each layer 3 sub-definition domain to limit the value of the data in which layer 3 sub-range is respectively limited.

Preferably, and so on and extends to the case of L >2, the L-th layer sub-definition domain allows further division into a plurality of l+1-th layer sub-definition domains; a number of l+1-th layer sub-ranges are allowed to be further specified in the L-th layer sub-range; the values of the data corresponding to all elements belonging to the same L+1 layer sub-definition domain are limited in the same L+1 layer sub-range; the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixedly representing or exporting the value of the data corresponding to the elements of each L+1 layer sub-definition domain, and the value of the data is limited in which L+1 layer sub-range.

Where the original data is image or video data, for compression of the image and video data, a frame of the image is typically divided into code blocks (from a decoding perspective, also commonly referred to as codec blocks or as whole compression units) of a predetermined constant size (e.g., 64 x 64 pixels or 128x128 pixels) or one or several rectangular region sizes (e.g., K x L + M x N pixels, where K, L, M, N are positive integers), each code block typically having a unique code block number, and each code block is further divided into code blocks (from a decoding perspective, also commonly referred to as codec blocks or whole compression units) in a four-or three-forked or bifurcate-free structure, each code block typically having a unique code block number that allows for both code block numbers and code block relative numbers.

In the present invention, where the original data is image or video data, the elements of the dataset include combinations, composites or fusions of one of the following codec parameters or various forms or relationships thereof, including juxtaposition, interleaving, inclusion, dependent, merging, partial merging, interleaving merging, union, intersection, difference, complement, occurring in the image or video codec:

1) A code tree branching pattern, the range of values of which includes a part or all of the following sets 1 and/or 2 expressed by enumeration:

the set 1 = { various bifurcation structures of one or more four-bifurcation and one or more two-bifurcation or three-bifurcation }, where any bifurcation structure can obviously be represented by the number of recursive four-bifurcation and the number of subsequent recursive two-bifurcation or three-bifurcation performed by the coding tree unit as the bifurcation start point, or equivalently by the size partSize of the recursive four-bifurcation and the size of the subsequent recursive two-bifurcation or three-bifurcation performed, where, since the size of the division is always an index of 2, partSize can equivalently be represented by the log partsizeinbit=log of partSize based on 2 ₂ (partSize) to indicate that,

set 2= { no bifurcation, four bifurcation, horizontal tri-bifurcation, vertical tri-bifurcation, horizontal di-bifurcation, vertical di-bifurcation };

2) Coding tree luminance component bifurcation patterns, the range of values of which includes a part or all of the following sets 1 and/or 2 expressed by enumeration:

the set 1 = { various bifurcation structures of four bifurcation one or more times before two bifurcation or three bifurcation },

3) Coding tree chroma component bifurcation mode, its value range includes a part or whole of the following set 1 and/or set 2 expressed by enumeration:

4) Coding tree luminance and chrominance fusion bifurcation patterns, the range of values of which includes a part or all of set 1 and/or set 2 represented by the following enumeration method:

the aggregate 1 = { various branching structures of the coding tree having a common, i.e., single, luminance and chromaticity, the various branching structures of the coding tree having a respective one, i.e., luminance coding tree and chromaticity coding tree having at least a portion thereof being different, the various branching structures of the coding tree having a common, i.e., single trunk portion, but having a respective branching portion, the luminance and chromaticity, the various branching structures of the coding tree having a common, i.e., single, one or more four branching trunk portions, but having a respective one or more two branching portions, or three branching portions, respectively },

The set 2= { luminance and chromaticity are not bifurcated, luminance is bifurcated but chromaticity is not bifurcated, luminance level is bifurcated but chromaticity is not bifurcated, luminance is vertically bifurcated but chromaticity is not bifurcated, luminance is horizontally bifurcated but chromaticity is not bifurcated, luminance is vertically bifurcated but chromaticity is not bifurcated, luminance is not bifurcated but chromaticity is bifurcated, luminance is bifurcated but chromaticity is bifurcated, luminance level is bifurcated but chromaticity is bifurcated, luminance vertical triad but chrominance tetrad, luminance horizontal triad but chrominance tetrad, luminance vertical triad but chrominance tetrad, and so on, luminance and chrominance tetrad, luminance tetrad but chrominance horizontal triad, luminance tetrad but chrominance vertical triad, and so on };

5) The coding mode of the coding and decoding block comprises a part or whole of the following set expressed by an enumeration method: { IPCM, intra-frame prediction, inter-frame prediction, string prediction, palette, block prediction, microblock prediction, stripe prediction };

4) The fusion with 5), namely the brightness code tree structure and the coding mode of the coding tree brightness and chroma bifurcation mode and the coding mode of the coding and decoding block, the range of the brightness code tree structure and the coding mode comprises a part or the whole of the following collection expressed by an enumeration method: { intra-frame coding mode and luminance and chromaticity have various branching structures of a common, i.e., single, coding tree, intra-frame coding mode and luminance and chromaticity have various branching structures of a respective coding tree, intra-frame coding mode and luminance and chromaticity have various branching structures of a common, i.e., single trunk portion, but have various branching structures of a respective branching portion, intra-frame coding mode and luminance and chromaticity have various branching structures of a common, i.e., single, one or more, four branching trunk portions, but have various branching structures of a respective, one or more, two, or three branching trunk portion, inter-frame coding mode and luminance and chromaticity have various branching structures of a common, i.e., single, coding tree, inter-frame coding mode and luminance and chromaticity have various branching structures of a respective coding tree, inter-frame coding mode and luminance and chromaticity have various branching structures of a common, i.e., single trunk portion, but have various branching structures of a respective, one or more, four branching trunk portions, but have various branching structures of a respective, one or two, three branching portions;

6) Associating coding parameters with coding modes of the coding and decoding blocks;

7) The intra-frame brightness prediction mode of the encoding and decoding block has a value range including a part or whole of one of the following 7 sets respectively expressed by an enumeration method:

(1) { DC, planar, direction 1, direction 2, and so on, direction 65};

(2) { DC, planar, bilinear, direction 1, direction 2, and so on, direction M }, where typically M is a constant between 30 and 130;

(3) { DC, planar, direction 1, direction 2, and so on, direction M, expansion 1, expansion 2, and so on, expansion N }, where M and N are each typically constants between 30 and 130;

(4) A plurality of elements dynamically selected in a set of modes (e.g., { DC, planar, direction 1, direction 2, and so on, direction 65 }) according to a predetermined rule (e.g., the value of the intra-luminance prediction mode of a plurality of neighboring codec blocks of the current codec block or the value of the intra-luminance prediction mode of a plurality of nearest codec blocks according to the codec order);

(5) A set of modes (e.g., { DC, planar, direction 1, direction 2, and so on, direction 65 }) minus a difference set obtained by dynamically selecting a number of elements according to a predetermined rule (e.g., the value of the intra-luminance prediction mode of a number of neighboring codec blocks of the current codec block or the value of the intra-luminance prediction mode of a number of nearest codec blocks according to the codec order);

(6) Taking out all the value ranges (such as: { element 0, element 4, element 8, and so on }) consisting of elements with the sequence number being a multiple of a predetermined constant (such as: 4) from the difference set (5) as an ordered set { element 0, element 1, element 2, element 3, element 4, element 5, element 6, element 7, element 8, and so on };

(7) Taking out the value range (such as { element 1, element 2, element 3, element 5, element 6, element 7, element 8, and so on }) composed of all elements whose sequence numbers are not multiples of a predetermined constant (such as 4) from the difference set of (5) as an ordered set { element 0, element 1, element 2, element 3, element 4, element 5, element 6, element 7, and so on };

8) The prediction mode of the coding and decoding block is associated with coding parameters, including motion vectors of inter prediction and/or intra block prediction, motion vector difference, offset of the motion vector difference, motion vector candidate set index, predicted value, interpolation of the predicted value and interpolation weight of the predicted value;

9) Inter prediction and/or intra block prediction modes of the codec block, the range of values of which includes a part or all of one of the following 3 sets, each represented by enumeration:

(1) { Skip, merge candidate 1, merge candidate 2, and so on, merge candidate I, conventional pattern expressed directly in terms of motion vectors and/or motion vector differences and/or offsets of motion vector differences }, where I is typically a constant between 2 and 10;

(2) { Skip, merge candidate 1, merge candidate 2, and so on, merge candidate I, affine1, affine2, and so on, affineJ, conventional pattern expressed directly in terms of motion vectors and/or motion vector differences and/or offsets of motion vector differences }, where I is typically a constant between 2 and 10, J is typically a constant between 1 and 5;

(3) { Skip, merge candidate 1, merge candidate 2, and so on, merge candidate I, affine1, affine2, and so on, affineJ, extension 1, extension 2, and so on, extension K, which is conventionally a direct representation of motion vector and/or motion vector difference and/or offset of motion vector difference for motion or pattern of motion amount }, where I is typically a constant between 0 and 10 (I is 0 representing no Merge candidate element), J is typically a constant between 0 and 5 (J is 0 representing no Affine element), K is typically a constant between 0 and 8 (K is 0 representing no extension element), the extension comprising one or a combination of the following: the latest historical sub-mode uses the associated coding parameters of the latest coding and decoding block or blocks appearing in the coding and decoding process as the associated coding parameters of the current coding and decoding block, the line sub-mode, the half line sub-mode and the micro block sub-mode;

8) The fusion of the inter motion vector in 9) and the inter prediction mode, i.e. the multisource motion vector predictor (including the case that the motion vector predictor is equal to the motion vector itself if the prediction difference is zero), the range of values comprises the union of a part of or all of the following sets or subsets thereof:

a set 1 = motion vector and/or motion vector difference and/or offset candidate set of motion vector differences for Skip sub-mode,

a set 2 = offset candidate set of motion vectors and/or motion vector differences for the Merge sub-mode,

set 3 = motion vector and/or motion vector difference and/or offset candidate set of motion vector differences for the most recent history sub-mode,

set 4 = a predetermined default motion vector and/or motion vector difference and/or offset candidate set of motion vector differences,

set 5 = a conventional set of motion vectors directly represented (horizontal component, vertical component);

10 Inter-component prediction mode of the codec block;

11 Inter-component prediction mode associated coding parameters of the codec block;

12 Inter-component prediction coefficients of the codec block;

13 Inter-component prediction coefficient associated coding parameters of the codec block;

14 Inter-residual component prediction mode of the codec block;

15 Inter-residual component prediction coefficients of the codec block;

16 Inter-component color transform mode of the codec block, the range of values of which includes a part or all of the following set represented by enumeration: { RGB-YCoCg transform, GBR-YCoCg transform, BRG-YCoCg transform, RGB-YCoCg transform variant 1, GBR-YCoCg transform variant 1, BRG-YCoCg transform variant 1, RGB-YCoCg transform variant 2, GBR-YCoCg transform variant 2, BRG-YCoCg transform variant 2, RGB-YCoCg transform variant 3, GBR-YCoCg transform variant 3, BRG-YCoCg transform variant 3, and so on }, examples of variants including fine tuning of transform coefficients;

17 Inter-component color transform mode associated coding parameters of the codec block;

18 Color transform coefficients between components of the codec block;

19 Color transform coefficient associated coding parameters between components of the codec block;

20 A color transform mode between residual components of the codec block, the range of values of which includes a part or all of the following sets represented by enumeration: { RGB-YCoCg transform, GBR-YCoCg transform, BRG-YCoCg transform, RGB-YCoCg transform variant 1, GBR-YCoCg transform variant 1, BRG-YCoCg transform variant 1, RGB-YCoCg transform variant 2, GBR-YCoCg transform variant 2, BRG-YCoCg transform variant 2, RGB-YCoCg transform variant 3, GBR-YCoCg transform variant 3, BRG-YCoCg transform variant 3, and so on, cb-Cr after the chrominance residual inverse component transform is not the same }, examples of variants include fine adjustment of transform coefficients;

21 Color transform coefficients or their associated coding parameters between residual components of the codec block, such as: chrominance residual component transform coefficients;

22 Residual of block prediction (including intra prediction and inter prediction) of the codec block;

23 Transform coefficients of a residual of block prediction of a codec block;

24 Coding parameters of the string prediction of the codec block;

25 String length of string prediction (also known as string matching or string duplication) of the codec block;

26 String displacement of string prediction of the codec block;

27 String displacement horizontal component of string prediction of the codec block;

28 String-displacement vertical component of string prediction of the codec block;

29 String type flag for string prediction of the codec block;

30 Secondary reference buffer (Secondary Reference Buffer simply SRB) address of the string prediction of the codec block (referred to as string SRB address);

31 String SRB color repetition number of string prediction of the codec block;

32 Coding parameters of the image coordinate string;

33 Number of consecutive image coordinate strings;

34 Length of image coordinate string;

35 Number of repetitions of pixels at image coordinates in the image coordinate string;

36 Address of the image coordinates of the image coordinate string in the image coordinate array (PCA);

37 A) the encoding parameters of the offset string;

38 A number of consecutive offset strings;

39 A length of the offset string.

In the present invention, in the case where the original data is image or video data, a frame of image is divided into encoded blocks, which are one region of the image, including the following cases: the method comprises the steps of sub-images of images, slice groups formed by a plurality of slices, tile group groups formed by a plurality of tiles, brick blocks, brick group groups formed by a plurality of bricks, maximum coding units LCU, maximum coding unit groups formed by a plurality of maximum coding units, coding tree units CTU and coding tree unit groups formed by a plurality of coding tree units.

In the present invention, in the case where the original data is image or video data, a frame of image is further divided into codec blocks, which are one encoded area or one decoded area of the image, including the following cases: sub-pictures of pictures, macro-blocks, largest coding units LCU, coding tree units CTU, coding units CU, sub-areas of CU, sub-coding units sub-CU, prediction units PU, sub-areas of PU, sub-prediction units sub-PU, sub-areas of transform units TU, sub-transform units sub-TU.

The technical features of the present invention are described above by means of several specific embodiments. Other advantages and effects of the present invention will be readily apparent to those skilled in the art from the present disclosure. The invention may be practiced or carried out in other embodiments that depart from the spirit and scope of the present invention, and the details of the present invention may be modified or changed from various points of view and applications.

Drawings

Fig. 1 is a schematic diagram of the encoding method or apparatus of the present invention.

Fig. 2 is a schematic diagram of the decoding method or apparatus of the present invention.

Description of the embodiments

Further details or variations of the invention are set forth below.

Examples or variants 1

In the encoding method or apparatus or the decoding method or apparatus, the original data is image or video data, each frame of image of the image or video is divided into encoding blocks, each encoding block is further divided into encoding and decoding blocks, and the element of the definition field is one of the following cases: the code block or its number or the code block or its number satisfying the predetermined condition or the code block or its number having the predetermined feature;

Dividing the domain into a plurality of sub-domains or layer 1 sub-domains according to one of the following ways:

according to the boundary division of each coding block (i.e. one sub-field corresponds to one coding block), the elements of each sub-field or layer 1 sub-field are one of the following cases:

each coding and decoding block divided by the coding block or its number

Or each of the codec blocks or the numbers thereof, into which the coding block is divided, satisfying a predetermined condition or having a predetermined characteristic;

or according to the boundary division of groups of 2×1 coded blocks (i.e., one subdomain corresponds to 2×1 coded blocks), each subdomain or layer 1 subdomain element is one of the following:

two coding blocks or numbers constituting the sub-definition domain or layer 1 sub-definition domain

Or all coded blocks or their numbers that constitute the sub-definition domain or layer 1 sub-definition domain and satisfy a predetermined condition or have a predetermined characteristic

Or each coding and decoding block or number thereof divided by the 2X 1 coding blocks

Or each of the codec blocks or numbers thereof satisfying a predetermined condition or having a predetermined characteristic, into which the 2×1 coding blocks are divided, respectively;

or according to the boundary division of a group of 1×2 coded blocks (i.e., one subdomain corresponds to 1×2 coded blocks), each subdomain or the element of the layer 1 subdomain is one of the following:

Or each coding and decoding block or number thereof divided by the 1X 2 coding blocks

Or each of the codec blocks or numbers thereof satisfying a predetermined condition or having a predetermined characteristic into which the 1×2 coding blocks are respectively divided;

or according to the boundary division of groups of 2 x 2 code blocks (i.e. one subdomain corresponds to 2 x 2 code blocks), each subdomain or layer 1 subdomain element is one of the following:

four coding blocks or numbers constituting the sub-definition field or layer 1 sub-definition field

Or each coding and decoding block or number thereof divided by the 2 x 2 coding blocks

Or each of the 2×2 coded blocks divided into respective coded blocks satisfying a predetermined condition or having a predetermined characteristic or a number thereof;

or so on, according to the boundary division of the coding block group consisting of s×t (S and T are typically predetermined constants between 1 and 10, respectively) (i.e., one sub-domain corresponds to s×t coding blocks), the elements of each sub-domain or layer 1 sub-domain are one of the following cases:

sxT code blocks or numbers thereof constituting the sub-definition domain or layer 1 sub-definition domain

Or all the coding blocks or the numbers thereof into which the sxt coding blocks are respectively divided

Or all the codec blocks or their numbers, into which the sχt encoded blocks are respectively divided, satisfying a predetermined condition or having a predetermined characteristic.

In implementing or modifying example 2 the encoding method or apparatus or decoding method or apparatus, the original data is image or video data, each frame of image of the image or video is divided into encoding blocks, each encoding block is further divided into encoding and decoding blocks, the encoding and decoding blocks are further divided into V primitives with relative sequence number V (1V) (the types of primitives include strings, lines, bars, microblocks, subregions of CU, subregions of subcode units sub CU, subregions of PU, subregions of sub prediction units sub PU, sub TU, sub transform units sub TU; V is a constant or variable, v=1 means that there is only one primitive equivalent to a coding and decoding block; the numbers of the encoding and decoding blocks and the relative sequence numbers of the primitives together constitute the sequence numbers of the primitives), the elements defining the domain are one of the following cases:

Primitives or sequence numbers thereof, or primitives or sequence numbers thereof that satisfy a predetermined condition or have a predetermined characteristic (e.g., predetermined one or several kinds of primitives);

each primitive or sequence number thereof in the coding block, or each primitive or sequence number thereof in the coding block meeting a predetermined condition or having a predetermined characteristic (e.g., a predetermined primitive or primitives);

each primitive or sequence number thereof in the 2 x 1 coding blocks, or each primitive or sequence number thereof in the 2 x 1 coding blocks which satisfies a predetermined condition or has a predetermined characteristic (e.g., a predetermined primitive or primitives);

Each primitive or sequence number thereof in the 1 x 2 coding blocks, or each primitive or sequence number thereof in the 1 x 2 coding blocks which satisfies a predetermined condition or has a predetermined characteristic (e.g., a predetermined primitive or primitives);

each primitive or sequence number thereof in the 2 x 2 coding blocks, or each primitive or sequence number thereof in the 2 x 2 coding blocks which satisfies a predetermined condition or has a predetermined characteristic (e.g., a predetermined primitive or primitives);

each primitive or sequence number thereof within the sχt encoded blocks, or each primitive or sequence number thereof within the sχt encoded blocks that satisfies a predetermined condition or has a predetermined characteristic (e.g., a predetermined primitive or primitives).

Examples or variants 3

In the encoding method or apparatus or decoding method or apparatus, the original data is image or video data, each frame of image of the image or video is divided into encoding blocks, each encoding block is further divided into encoding and decoding blocks, the range of values of the data set is a set r= { DC, planar, direction 1, direction 2, … …, direction M, extension 1, extension 2, … …, extension N }, where M and N are constants between 30 and 130,

the elements of the definition domain are the coding and decoding blocks or the numbers thereof adopting an intra-frame coding mode;

dividing the definition domain into a plurality of sub-definition domains or layer 1 sub-definition domains (i.e., one sub-definition domain corresponds to s×t coding blocks) according to boundaries of a coding block group consisting of s×t (S and T are generally predetermined constants between 1 and 10, respectively), it being apparent that elements of each sub-definition domain or layer 1 sub-definition domain are coding blocks employing an intra coding mode or numbers thereof within the corresponding s×t coding blocks;

at least two sub-ranges R are defined in the value range R ₁ And R is ₂ ：

R ₁ =at least a subrange comprising a part of { direction 1, direction 2, … …, direction M },

R ₂ A subrange comprising at least a portion of { extension 1, extension 2, … …, extension N };

the compressed data code stream at least contains elements (i.e. the coding blocks or the numbers thereof in the intra-frame coding mode in each corresponding S×T coding blocks) which can be used for directly or indirectly or directly and indirectly mixed to represent or derive each sub-definition domain, and the values of the corresponding data are respectively limited in which sub-range R _k Information within.

In carrying out or modifying the encoding method or apparatus or the decoding method or apparatus of example 4,

the raw data is divided into raw data blocks (e.g., encoded blocks of image or video data), each raw data block typically having a unique raw data block number, and each raw data block is further divided into raw data blocks (e.g., encoded blocks of image or video data), each raw data block typically having a unique raw data block number, which typically consists of two parts, the raw data block number and the raw data block relative number;

the element of the definition field X is one of the following cases:

original data blocks or numbers thereof, or original data blocks or numbers thereof which meet a predetermined condition or have a predetermined characteristic;

Dividing the definition domain into M mutually disjoint sub-definition domains or layer 1 sub-definition domains (i.e. one sub-definition domain corresponds to C original data blocks) according to the boundary of an original data block group consisting of C (C is typically a predetermined constant between 1 and 50): x is X ₁ ，X ₂ ，X ₃ ，……，X _M Obviously, the element of each subdomain or layer 1 subdomain is one of the following:

each original data block or the serial number thereof in the corresponding C original data blocks, or each original data block or the serial number thereof in the corresponding C original data blocks which meet the preset condition or have the preset characteristics;

the element of the data set Y is a coding parameter corresponding to the original data block or the number thereof (example 1: coding mode-related coding parameter of the codec block, example 2: prediction mode-related coding parameter of the codec block, example 3: inter-component prediction mode-related coding parameter of the codec block, example 4: inter-component color transform mode-related coding parameter of the codec block, example 5: inter-component prediction coefficient-related coding parameter of the codec block, example 6: inter-component color transform coefficient-related coding parameter of the codec block);

i subranges R are defined in the range R ₁ ，R ₂ ，R ₃ ，……，R _I ；

X _m The value of the data y=f (X) corresponding to all the elements X in the table is limited to the same value as X _m The corresponding sub-range R with subscript i (m) (i.e. sub-range index) _i(m) In, i.e. for any X ε X _m ，y = f(x) ∈R _i(m) ；

If y is a sum of

And X is _m The corresponding original data blocks or the serial numbers thereof in the C original data blocks

Corresponding one of the coding parameters

{ y has a value of R _i(m) Using and R _i(m) The code word set with the size being suitable for encoding and decoding y; }

The compressed data stream contains at least information that can be used to directly or indirectly or directly and indirectly represent or derive the values of the M sub-range indices i (M), consisting of one or more bit strings (bit strings) in the compressed data stream, for example in the form of an identification code or syntax element called ctu _sub-index; the information indirectly representing or deriving the value of the sub-range index i (m) is information derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream, e.g. from the information associated with the X _m Information derived from values of sub-range indexes and/or other coding parameters and/or other codec variables of one or several sub-fields that are spatially adjacent or nearest in codec order; the information directly and indirectly mixedly representing or deriving the value of the sub-range index i (m) is information partly directly (i.e. consisting of one or more bit strings in the compressed data stream) and partly indirectly (i.e. derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream) mixedly representing or deriving the value of the sub-range index i (m).

Examples or variants 5

The encoding method or apparatus or the decoding method or apparatus of embodiment 4, wherein the original data is image or video data, the original data block is an encoding block, and the original data block is a coding block; the C is sχt (S and T are typically predetermined constants between 1 and 10, respectively).

Implementation or modification 6 implementation or modification 4 of the encoding method or apparatus or decoding method or apparatus,

the C is equal to N ₁ ×C ₁ (e.g., N ₁ = C，C ₁ =1), layer 1 sub-domain X _m Further divided into N ₁ A number of layer 2 sub-fields, each layer 2 sub-field X _mn Wherein N is more than or equal to 1 and less than or equal to N ₁ Corresponding to C ₁ A plurality of original data blocks;

at each R _i Further define J _i The next layer (layer 2) subrange R _i1 ，R _i2 ，……，R _ij ，……，R _iJi ；

X _mn The value of the data y=f (X) corresponding to all the elements X in the table is limited to the same value as X _mn The corresponding 2-dimensional subscript (i.e., sub-range index) is the sub-range R of (i (m), j (m, n)) _i(m)j(m,n) In, i.e. for any X ε X _mn ，y = f(x) ∈R _i(m)j(m,n) ；

If y is a sum of

And X is _mn Corresponding C ₁ Original data blocks or numbers thereof in original data blocks

Corresponding one of the coding parameters

{ y has a value of R _i(m)j(m,n) Using and R _i(m)j(m,n) The code word set with the size being suitable for encoding and decoding y; }

The compressed data code stream contains at least information that can be used to directly or indirectly or directly and indirectly mixedly represent or derive the values of M sub-range index first components i (M) and m×n sub-range index second components j (M, N), the information that directly represents or derives the values of the sub-range index first components and the second components being composed of one or more bit strings (bit strings) in the compressed data code stream; the information indirectly representing or deriving the values of the sub-range index first and second components is derived from other coding parameters and/or codec variables and/or compressed data streamsInformation derived from other syntax elements, e.g. from the syntax elements associated with said X _mn Information derived from values of sub-range indexes and/or other coding parameters and/or other codec variables of one or several sub-fields that are spatially adjacent or nearest in codec order; the information directly and indirectly mixedly representing or deriving the values of the sub-range index first component and the second component is information that partially directly (i.e., consisting of one or more bit strings in the compressed data stream) partially indirectly (i.e., derived from other encoding parameters and/or codec variables and/or other syntax elements of the compressed data stream) mixedly represents or derives the values of the sub-range index first component and the second component;

And so on, performing operations of dividing the sub-definition domain of the 3 rd, 4 th and … … th layers, defining the sub-range, and limiting the encoding and decoding operations of the encoding parameters in one sub-range of the value range.

Implementation or modification 7

Implementing or modifying the encoding method or apparatus or the decoding method or apparatus of example 6, wherein the original data is image or video data, the original data block is an encoding block, and the original data block is a codec block; the C is sχt (S and T are typically predetermined constants between 1 and 10, respectively); the S is equal to U ₁ ×S ₁ (e.g., U ₁ = S，S ₁ =1), said T is equal to V ₁ ×T ₁ (e.g., V ₁ = T，T ₁ =1), said N ₁ Equal to U ₁ ×V ₁ The C is ₁ Equal to S ₁ ×T ₁ 。

Implementation or modification 8

In the encoding method or apparatus or decoding method or apparatus, the original data is image or video data, each frame of image of the image or video is divided into coding tree units CTU, each coding tree unit CTU is further divided into codec blocks according to one or more recursive four-forked or three-forked or two-forked or no-forked structures, and the element of the definition field is one of the following cases: the coding and decoding block or the number thereof, or the coding and decoding block number formed by two parts of coding tree unit number and coding and decoding block relative number, or the coding and decoding block or the number thereof meeting the preset condition or having the preset characteristic, or the coding and decoding block number formed by two parts of coding tree unit number and coding and decoding block relative number meeting the preset condition or having the preset characteristic;

A sub-definition field is composed of the coding and decoding blocks or the numbers thereof belonging to the same coding tree unit;

the data to be encoded and decoded is data in an inter-frame (also referred to as an inter-frame image, i.e., a frame or image that allows encoding and decoding of a coded block in both an inter-frame encoding mode and an intra-frame encoding mode)Coding of codec blocks ModeThe range of values includes a part or all of the following sets expressed by enumeration:

{ intra coding mode, inter coding mode, string prediction coding mode, palette coding mode, intra block matching coding mode }

The specific sub-range a of the value range is one of the following cases:

the specific sub-range A is { intra coding mode }

Or the specific sub-range A is { intra coding mode, string prediction coding mode }

Or a specific sub-range A is { intra coding mode, palette coding mode }

Or a particular sub-range A is { intra coding mode, intra block matching coding mode }

Or the specific sub-range A is { intra coding mode, string prediction coding mode, palette coding mode }

Or the specific sub-range A is { intra coding mode, string prediction coding mode, intra block matching coding mode }

Or a specific sub-range A is { intra coding mode, palette coding mode, intra block matching coding mode }

Or the specific sub-range a is { intra coding mode, string prediction coding mode, palette coding mode, intra block matching coding mode };

the compressed data stream contains at least information that can be used to directly or indirectly or a mixture of directly and indirectly indicate or derive whether the coding mode of the codec blocks of a coding tree unit is restricted in value within said specific sub-range a.

Implementation or modification 9 in the encoding method or apparatus or the decoding method or apparatus according to implementation or modification 8, the compressed data code stream includes at least one coding mode flag bit of a coding tree unit, and the flag bit limits the value of the coding mode of the coding block of the coding tree unit in the following manner:

if the flag bit is equal to a predetermined value (e.g., 1), the value of the coding mode of the coding block of the coding tree unit is limited to be within the specific sub-range a.

Implementation or modification 10 in the encoding method or apparatus or the decoding method or apparatus according to implementation or modification 8, the specific sub-range a is { intra coding mode }, and the compressed data code stream contains at least one coding mode flag bit of a coding tree unit, where the flag bit limits a value of a coding mode of the coding tree unit in the following manner:

If the flag bit is equal to a predetermined value (e.g., 1), then all of the codec blocks within the coding tree unit are in intra-coding mode.

Implementation or modification 11

as a codecThe data of the object is in inter-coded frames (also called inter-coded pictures, i.e. frames or pictures that allow both inter-and intra-coding modes to be used for coding and decoding the encoded and decoded blocks) Coding tree luminance and chrominance Brightness coding tree structure with bifurcation mode and coding mode of coding and decoding block fused and coding modeThe range of values includes a part or all of the following sets expressed by enumeration:

{ intra coding mode and luminance and chrominance have various branching structures of a common or single coding tree,

intra coding mode and luminance and chrominance have various branching structures of the respective coding tree,

intra coding mode and luminance and chrominance have various branching structures of the coding tree in common i.e. a single trunk portion but with respective branching portions,

the intra coding mode and luminance and chrominance have various bifurcated structures of the coding tree that are common or single one or more bifurcated trunk portions but have respective one or more bifurcated or triax bifurcated branch portions,

inter-coding modes and luminance and chrominance have various bifurcated structures in a common or unitary coding tree,

inter-coding mode and luminance and chrominance have various branching structures of the respective coding tree,

inter-coding mode and luminance and chrominance have various bifurcated structures of the coding tree that are common or unitary trunk portion but have respective branch portions,

Coding tree of inter-coding mode and coding tree having common, i.e. single, one or more four-forked trunk portions for luminance and chrominance, but one or more two-forked or three-forked branch portions for each

}

The specific sub-range a of the value range is one of the following cases:

the specific sub-range A is { intra coding mode and various branching structures of coding tree where luminance and chrominance are common, i.e., single }

Or the specific sub-range A is { intra coding mode and various branching structures of the respective coding tree for luminance and chrominance }

Or the specific sub-range A is { various branching structures of the coding tree of intra coding mode and having a common, i.e. single, trunk portion for luminance and chrominance but having respective branching portions }

Or the specific sub-range a is { various bifurcated structures of the coding tree of intra coding mode and luminance and chrominance have a common, i.e. single, one or more four-bifurcated trunk portions but have respective one or more two-bifurcated or three-bifurcated branch portions, respectively };

the compressed data code stream contains at least information which can be used to directly or indirectly or directly and indirectly mixedly represent or derive the brightness code tree structure of the code decoding block of one code tree unit and whether the value of the code mode is limited in the specific sub-range A.

Implementation or modification 12 in the encoding method or apparatus or the decoding method or apparatus according to implementation or modification 11, the compressed data code stream includes at least a luma coding tree structure and coding mode flag bits of a coding tree unit, and the flag bits limit values of the luma coding tree structure and coding mode of the coding tree unit in the following manner:

if the flag bit is equal to a predetermined value (e.g., 1), the brightness code tree structure and the code pattern of the code tree unit are limited to the specific sub-range a.

Implementation or modification example 13

In the encoding method or apparatus or the decoding method or apparatus according to embodiment 11, the specific sub-range a is { intra-frame encoding mode and luminance and chromaticity have respective branching structures of encoding trees, that is, luminance encoding tree and chromaticity encoding tree are at least partially different }, and the compressed data stream contains at least a luminance encoding tree structure and encoding mode flag bit of one encoding tree unit, and the flag bit restricts the luminance encoding tree structure and encoding mode of the encoding tree unit in the following manner:

if the flag bit is equal to a predetermined value (e.g., a value of 1), then all of the codec blocks within the coding tree unit are in intra coding mode and at least a portion of the luma coding tree and the chroma coding tree of the coding tree unit are different.

Implementation or modification 14

the data as the encoding and decoding object is the multisource motion vector predicted value of the encoding and decoding block adopting the inter prediction mode in the inter-frame coded image, and the value range comprises the union of a part of or all of the following sets or the subset thereof:

Set 1 = Skip sub-mode motion vector candidate set, set 2 = Merge sub-mode motion vector candidate set, set 3 = recent history sub-mode motion vector candidate set, set 4 = predetermined default motion vector candidate set, set 5 = conventional set of motion vectors directly represented (horizontal component, vertical component);

the compressed data stream contains at least information that can be used to directly or indirectly or a mixture of directly and indirectly represent or derive whether the value of a multi-source motion vector predictor of a coding tree unit is limited to a particular sub-range.

The encoding method or apparatus or the decoding method or apparatus according to embodiment or variation 15, wherein the original data is image or video data, each frame of image of the image or video is divided into coding tree units CTUs, each coding tree unit CTU is further divided into coding and decoding blocks according to one or more recursive four-forked or three-forked or two-forked or no-forked structures, and the element of the definition field is one of the following cases:

the coding and decoding block or the number thereof, or the coding and decoding block number formed by two parts of coding tree unit number and coding and decoding block relative number, or the coding and decoding block or the number thereof meeting the preset condition or having the preset characteristic, or the coding and decoding block number formed by two parts of coding tree unit number and coding and decoding block relative number meeting the preset condition or having the preset characteristic;

One sub-domain consists of codec blocks or their numbers belonging to the same C coding tree units, where C is a predetermined constant between 1 and 50;

the data as the encoding and decoding object is a merge candidate list MergeCandidateList index (also commonly called address, index, etc.) of motion vector predicted values of encoding and decoding blocks using inter prediction mode in inter coded images, and the value range is an integer from 0 to MaxMergeIndex-1, that is, mergeIndex satisfies 0.ltoreq.mergeindex < MaxMergeIndex, where MaxMergeIndex is a predetermined constant;

the value sub-range corresponding to one sub-field is an integer from 0 to ctuMaxMergeIndex-1, i.e., mergeIndex satisfies 0.ltoreq.MergeIndex < ctuMaxMergeIndex, where ctuMaxMergeIndex is an integer less than or equal to MaxMergeIndex, different sub-fields allow for different ctuMaxMergeIndex;

the compressed data code stream contains at least one or a combination of the following information:

1) Information that can be used to represent or derive the value of C directly or indirectly or a mixture of directly and indirectly,

2) Information that can be used to represent or derive the value of MaxMergeIndex directly or indirectly or a mixture of directly and indirectly,

3) Information that can be used to represent or derive the value of the corresponding ctumaxmmergeindex for every C coding tree units, either directly or indirectly or a mixture of directly and indirectly.

In implementing or modifying example 16, the encoding method or apparatus or the decoding method or apparatus, the original data is image or video data, each frame of image of the image or video is divided into slices or slice groups or tile groups or brick groups or coding tree units or coding tree unit groups or maximum coding units or maximum coding unit groups collectively referred to as coding blocks, each coding block is composed of one or several coding tree units, each coding tree unit is further divided into coding and decoding blocks according to a four-way or no-way structure that recursively first one or more times and then a three-way or two-way or no-way structure that recursively one or more times, and the element of the definition field is one of the following cases:

a sub-definition field is composed of the coding and decoding blocks belonging to the same coding block or the numbers thereof;

The data as the encoding and decoding object is the divided size or equivalent of 2-base logarithm partSizeInBit produced by dividing the encoding tree unit according to one or more recursion four-bifurcation structure, the value range of the partSizeInBit is from

2-base log MinCuSizeInBit of minimum size of codec block

To the point of

Base 2 logarithm ctuisizer inbit of the size of the coding tree unit

An integer therebetween or a subset or a fraction thereof,

i.e. partSizeInBit is satisfied with

MinCuSizeInBit ≤ partSizeInBit ≤ CtuSizeInBit

Wherein MinCuSizeInBit and ctuxiti are two predetermined constants in one image or video being encoded or decoded;

the value sub-range corresponding to one sub-definition domain is the slave in the corresponding coding block

The minimum size of a resulting codec block or its 2-base logarithm crminqtsize inbit, where the coding tree unit is partitioned in one or more recursive quadtroportions

To the point of

Base 2 logarithm ctuisizer inbit of the size of the coding tree unit

The integer between them, namely partSizeInBit, satisfies

crMinQtSizeInBit ≤ partSizeInBit ≤ CtuSizeInBit，

Where crminqtsize inbit is an integer equal to or greater than MinCuSizeInBit, different sub-fields allow for different crminqtsize inbit.

Examples or variants 17

In implementing or modifying example 16, the compressed data stream contains at least information that can be used to directly or indirectly mix values of crminqtsize inbit;

the directly represented or derived information consists of one or more bit strings (bit strings) in a compressed data stream; the indirectly represented or derived information is information derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream; the directly-indirectly-mixedly-represented or derived information is information that is partially directly (i.e., composed of one or more bit strings in the compressed data stream) and partially indirectly (i.e., derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream) mixedly-represented or derived.

Implementation or modification 18

The encoding method or apparatus or the decoding method or apparatus according to embodiment 17, wherein the information directly representing or deriving the value of crMinQtSizeInBit is the following information present in the encoded block header informationBold italicsSyntax element of representation:

coding interval minimum four-forking partition size minus coding block minimum size cr_minqtsitzeinbit/u minus_MinCuSizeInBit

From the slavecr_MinQtSizeInBit_minus_MinCuSizeInBitThe value of crMinQtSize inbit is calculated by the crMinQtSize inbit and the minimum size crMinQtSize of the resulting codec block, which is divided in one or more recursive four-pronged structures by the coding tree unit, is as follows:

crMinQtSizeInBit ＝ MinCuSizeInBit ＋ cr_MinQtSizeInBit_minus_MinCuSizeInBit

crminqtsize= (1 < < crMinQtSize inbit), where < < is a 2-bit left shift operation.

Implementation or modification 19 in the encoding method or apparatus or decoding method or apparatus as described in implementation or modification 16, at least under the condition that partSizeInBit is greater than crminqtssizeinbit, the compressed data code stream contains at least information that can be used to directly or indirectly or directly and indirectly mixedly indicate or derive whether the next four-forking structure division is performed;

Implementation or modification 20

The encoding method or apparatus or the decoding method or apparatus according to embodiment or variation 19, wherein the information directly indicating or deriving whether the next four-way branch structure division is performed is as followsBold italicsSyntax element of representation:

four-bifurcation dividing mark qt_split_flag

qt_split_flagA value qt_split_flag of '1' indicates that the next four-forked structure division is performed;qt_ split_flaga value qt_split_flag of '0' indicates terminationThe four-forked structure is divided.

Implementation or modification 21 (implementation or modification 16-20 combination) in the encoding method or apparatus or decoding method or apparatus, the original data is image or video data, each frame image of the image or video is divided into slices or slice groups or tile groups or bricks or block groups or coding tree units or coding tree unit groups or maximum coding units or maximum coding unit groups collectively referred to as coding blocks, each coding block is composed of one or several coding tree units, each coding tree unit is further divided into coding and decoding blocks according to a four-way or no-way structure that recursively first one or more times followed by a three-way or two-way or no-way structure that recursively one or more times, and the element of the definition field is one of the following cases:

2-base log MinCuSizeInBit of minimum size of codec block

To the point of

Base 2 logarithm ctuisizer inbit of the size of the coding tree unit

An integer therebetween or a subset or a fraction thereof,

i.e. partSizeInBit is satisfied with

MinCuSizeInBit ≤ partSizeInBit≤ CtuSizeInBit

To the point of

Base 2 logarithm ctuisizer inbit of the size of the coding tree unit

The integer between them, namely partSizeInBit, satisfies

crMinQtSizeInBit ≤ partSizeInBit≤ CtuSizeInBit，

Where crmin qtsize inbit is an integer equal to or greater than MinCuSizeInBit, different sub-fields allow for different crmin qtsize inbit;

the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixed to express or derive the value of crMinQtSizeInBit;

the directly represented or derived information consists of one or more bit strings (bit strings) in a compressed data stream; the indirectly represented or derived information is information derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream; the directly-indirectly-mixedly-represented or derived information is information that is partially directly (i.e., composed of one or more bit strings in the compressed data stream) and partially indirectly (i.e., derived from other coding parameters and/or codec variables and/or other syntax elements of the compressed data stream) mixedly-represented or derived;

The information directly representing or deriving the value of crMinQtSizeInBit is the following information present in the encoded block header informationBold italicsSyntax element of representation:

From the slavecr_MinQtSizeInBit_minus_MinCuSizeInBitThe value cr_MinQtSizeInBit_minus_MinCuSizeInBit calculation cThe value of rMinQtSizeInBit and the minimum size crMinQtSize of the resulting codec block, as a result of the coding tree unit being partitioned in one or more recursive quadtroportions, are as follows:

crMinQtSizeInBit ＝ MinCuSizeInBit ＋ cr_MinQtSizeInBit_minus_MinCuSizeInBit

At least under the condition that the partSizeInBit is larger than the crMinQtsizeinbit, the compressed data code stream at least contains information which can be used for directly or indirectly or directly and indirectly mixed to express or derive whether the next four-bifurcation structure division is carried out or not;

The information directly representing or deriving whether the next four-furcation structure division is used as followsBold italicsSyntax element of representation:

four-bifurcation dividing mark qt_split_flag

qt_split_flagA value qt_split_flag of '1' indicates that the next four-forked structure division is performed;qt_ split_flaga value qt_split_flag of '0' indicates termination of the four-forked structure division.

In the encoding method or apparatus or the decoding method or apparatus according to embodiment 22, the original data is image or video data, each frame of image of the image or video is divided into a slice or a slice group or a tile group or a brick group or a coding tree unit group or a maximum coding unit group, each coding block is composed of one or several coding tree units, each coding tree unit is further divided into coding and decoding blocks, and the element of the definition field is one of the following cases:

the data as the object of the encoding and decoding is the offset amount merge_mvd_offset in units of one-fourth pixel or one-half pixel or whole pixel of the motion vector difference mvd of the encoding and decoding block having the motion vector mv in the merge mode, and the value range thereof is r= {2 ⁱ : i=0, 1, 2, 3, 4, 5, 6, 7, 8, 9}；

The value sub-range corresponding to one sub-definition domain is R ₀ ={2 ⁱ I=0, 1, 2, 3, 4, 5, 6, 7} or R ₁ ={2 ⁱ I=2, 3, 4, 5, 6, 7, 8, 9}, different sub-fields allow for different sub-ranges of values;

the following uses exist in the header information of the coding blocks of the compressed data code streamBold italicsThe syntax element of the representation represents or derives in which sub-range the value of the data corresponding to the element of the coding block is limited:

coding block merge motion vector difference offset flag cr_merge_mvd_offset_flag

cr_merge_mvd_offset_flagThe value cr_merge_mvd_offset_flag of '1' represents that the sub-range of the data corresponding to the element of the coding block is R ₁ The method comprises the steps of carrying out a first treatment on the surface of the A cr_merge_mvd_offset_flag of '0' indicates that the sub-range of the data corresponding to the element of the encoded block is R ₀ 。

In the encoding method or apparatus or the decoding method or apparatus according to embodiment 23, the original data is image or video data, each frame of image of the image or video is divided into a slice or a slice group or a tile group or a brick group or a coding tree unit group or a maximum coding unit group, each coding block is composed of one or several coding tree units, each coding tree unit is further divided into coding and decoding blocks, and the element of the definition field is one of the following cases:

the data as the encoding and decoding object is interpolation weight when calculating the predicted value of the intra-frame prediction, and the value range is R= { k: 0.ltoreq.k.ltoreq.31 };

the value sub-range corresponding to one sub-definition domain is R ₀ = { k: k=0 } or R ₁ =r, different sub-fields allow for different value sub-ranges;

coding block intra prediction interpolation flag cr _ intra _ pred _ interaction _ flag

cr_intra_pred_interpolation_flagThe value cr_intra_pred_interaction_flag of '1' represents that the sub-range of the data corresponding to the element of the coding block is R ₁ I.e. interpolation operation is actually carried out; the cr_intra_pred_interaction_flag being '0' indicates that the sub-range of the value of the data corresponding to the element of the coding block is R ₀ I.e. no interpolation is actually performed.

The encoding method or apparatus or the decoding method or apparatus according to embodiment 24, wherein the original data is image or video data, each frame of image of the image or video is divided into slices or slice groups or tile groups or brick tree units or code tree unit groups or maximum encoding units or maximum encoding unit groups collectively referred to as encoding blocks, each encoding block is composed of one or several encoding tree units, each encoding tree unit is further divided into encoding and decoding blocks, and the elements of the definition field are one of the following cases:

the data to be encoded and decoded is a coefficient used when one component of the chroma residual is transformed into another component, and the value range is r= {1, -1};

the value sub-range corresponding to one sub-definition domain is R ₀ = {1} or R ₁ = { -1}, different sub-fields allow for different value sub-ranges;

coded block chroma residual component transform coefficient flag cr_chroma_resi_comp_trans_coeff_flag

cr_chroma_resi_comp_trans_coeff_flagA value cr_chroma_resi_comp_trans_coeff_flag of '0' indicates that the sub-range of values of the data corresponding to the elements of the encoded block is R ₀ I.e. the chroma residual component transform coefficient is 1; cR_chroma_resi_comp_trans_coeff_flag is '1', which indicates that the sub-range of values of the data corresponding to the elements of the coding block is R ₁ I.e. the chroma residual component transform coefficient is-1.

The encoding method or apparatus or the decoding method or apparatus according to embodiment 25, wherein the original data is image or video data, each frame of image of the image or video is divided into slices or slice groups or tile groups or brick tree units or code tree unit groups or maximum encoding units or maximum encoding unit groups collectively referred to as encoding blocks, each encoding block is composed of one or several encoding tree units, each encoding tree unit is further divided into encoding and decoding blocks, and the elements of the definition field are one of the following cases:

the data as the coding and decoding object is a component exchange mode after the predetermined chromaticity residual inverse component transformation, the value range is R= { the Cb-Cr is not exchanged after the chromaticity residual inverse component transformation, and the Cb-Cr is exchanged after the chromaticity residual inverse component transformation };

the value sub-range corresponding to one sub-definition domain is R ₀ Cb-Cr non-reciprocal after the inverse component transform of the = { chrominance residual }, or R ₁ The inverse component of the = { chromaticity residual is transformed to be Cb-Cr, and different sub-definition domains allow different value sub-ranges;

Coded block chroma residual inverse component transformed post-transformFlag cr_chroma_response_post-inv-comp- tran_exchange_flag

cr_chroma_resi_post-inv-comp-tran_exchange_flagA value cr_chroma_response_post-inv-comp-tran_exchange_flag of '0' indicates that the sub-range of values of the data corresponding to the elements of the encoded block is R ₀ I.e., cb-Cr is not exchanged after the chrominance residual inverse component is transformed; the cr_chroma_resi_post-inv-comp-tran_exchange_flag being '1' indicates that the sub-range of values of the data corresponding to the elements of the encoded block is R ₁ I.e., cb-Cr conversion after the inverse component transform of the chrominance residual.

Claims

1. A method of encoding a sequence of images, comprising at least the steps of:

1) The coding object is a chroma residual component transformation coefficient used when coding an image sequence, namely, a coefficient used when transforming one component of the chroma residual into another component, wherein the value range is R= {1, -1} that is, the transformation coefficient has two values, namely, positive 1 and negative 1;

2) When encoding a frame of image or a slice or a tile in the image sequence, defining the range of the chrominance residual component transform coefficients in the image or slice as a sub-range R of the range R ₀ = {1} or another value subrange R ₁ -1, allowing each of said images or said strips or said tiles to have a respective sub-range of values;

3) The following syntax elements are present in the header information of each of the pictures or the slices or the tiles of the compressed data stream, collectively referred to as coding blocks, to indicate or derive within which sub-range the values of the chroma residual component transform coefficients of the coding block are limited:

coded block chroma residual component transform coefficient flag cr_chroma_resi_comp_trans_coeff_flag

A value of cr_chroma_resi_comp_trans_coeff_flag of '0' represents the chroma residual within the coding blockThe value sub-range of the difference component transformation coefficient is R ₀ I.e. the value of the transformation coefficient of the chrominance residual error component is positive 1; a cr_chroma_resi_comp_trans_coeff_flag of '1' indicates that the sub-range of values of the chroma residual component transform coefficients within the coding block is R ₁ I.e. the chroma residual component transform coefficient takes a value of minus 1.

2. An encoding device for compressing a sequence of images, characterized in that it comprises at least the following modules:

A value of cr_chroma_resi_comp_trans_coeff_flag of '0' indicates that the sub-range of values of the chroma residual component transform coefficients within the encoded block is R ₀ I.e. the value of the transformation coefficient of the chrominance residual error component is positive 1; a cr_chroma_resi_comp_trans_coeff_flag of '1' indicates that the sub-range of values of the chroma residual component transform coefficients within the coding block is R ₁ I.e. chroma residual component transform systemThe number is negative 1.

3. A decoding method for compressing a sequence of images, characterized in that it comprises at least the following steps:

1) The decoding object is a chroma residual component transformation coefficient used when the image sequence is decoded, namely, a coefficient used when one component of the chroma residual is transformed into another component, wherein the value range is R= {1, -1} that is, the transformation coefficient has two values, namely, positive 1 and negative 1;

2) When decoding a frame of image or a slice or a tile in the image sequence, defining that the range of the chrominance residual component transform coefficients in the image or slice is a sub-range R of the range R ₀ = {1} or another value subrange R ₁ -1, allowing each of said images or said strips or said tiles to have a respective sub-range of values;

A value of cr_chroma_resi_comp_trans_coeff_flag of '0' indicates that the sub-range of values of the chroma residual component transform coefficients within the encoded block is R ₀ I.e. the value of the transformation coefficient of the chrominance residual error component is positive 1; a cr_chroma_resi_comp_trans_coeff_flag of '1' indicates that the sub-range of values of the chroma residual component transform coefficients within the coding block is R ₁ I.e. the chroma residual component transform coefficient takes a negative value of 1;

4) And decoding data corresponding to the value sub-range in the value sub-range.

4. A decoding device for compressing a sequence of images, characterized in that it comprises at least the following modules: