CN115190316A - Data coding and decoding method and device for sealing and activating out-of-range equivalent string normal position - Google Patents

Abstract

The invention discloses a method and a device for sealing and activating point predictive coding and point predictive decoding of a boundary-crossing normal position, when a reference range changes to cause a normal position to cross the boundary, temporarily sealing an element value on the normal position and placing the element value into a boundary-crossing normal position decoding element buffer area; when the element value reappears at the current position, the sealed and saved current position is reactivated, the current position becomes the reactivated and updated current position, the sealed and saved element value is taken out, the updated current position is put in, namely the current position, and becomes the reference element again, and the corresponding point vector also points to the updated current position, namely the current position. The invention is suitable for coding and decoding data by lossy compression or lossless compression, and is suitable for coding and decoding one-dimensional data and data with two or more dimensions.

Description

Data coding and decoding method and device for sealing and activating out-of-range equivalent string normal position

Technical Field

The present invention relates to an encoding and decoding system for lossy or lossless compression of data, and more particularly to an encoding method and apparatus and a decoding method and apparatus for compression using point prediction.

Background

With the human society entering the era of artificial intelligence, big data, virtual reality, augmented reality, mixed reality, cloud computing, mobile computing, cloud-mobile computing, ultra-high definition (4K) and ultra-high definition (8K) video image resolution, 4G/5G communication, it becomes an indispensable technology to perform ultra-high compression ratio and extremely high quality data compression on various data including big data, image data, video data, and various new forms of data.

A data set is a set of data elements (e.g., bytes, bits, pixels, pixel components, spatial sampling points, transform domain coefficients).

When encoding or decoding a data set (abbreviated as "codec"), data elements are usually ordered according to a predetermined rule, that is, in a predetermined order, and then encoded and decoded in the order.

When encoding (and corresponding decoding) data compression of a data set (e.g., a one-dimensional data queue, a two-dimensional data file, a frame of image, a video sequence, a transform domain, a transform block, a plurality of transform blocks, a three-dimensional scene, a sequence of continuously-changing three-dimensional scenes) arranged in a spatial (one-dimensional, two-dimensional, or multi-dimensional) shape, particularly a two-dimensional or more data sets, the data set is generally divided into a plurality of compressed subsets having predetermined shapes and/or sizes (i.e., the number of elements), and the data set is encoded or decoded sequentially one after another in a predetermined order in the unit of compressed subsets.

When encoding or decoding a compressed subset, the compressed subset is generally divided into a number of maximum compression units having a predetermined shape and/or size (i.e., number of elements), and one maximum compression unit is sequentially encoded or decoded after another maximum compression unit in a predetermined order by the maximum compression unit.

Within a maximum compression unit, the maximum compression unit is further divided into a plurality of sub-units having a predetermined shape and/or size (i.e., the number of elements), called whole compression units, and the encoding or decoding is performed on a whole compression unit-by-whole compression unit basis in a predetermined order.

In short, the above process finally divides the data set into several subsets having predetermined shapes and/or sizes (i.e., number of elements), called whole compression units, which are encoded or decoded one by one in a predetermined order in units of whole compression units.

At any one time, the compression subset being encoded or decoded is referred to as the current compression subset. The largest compression unit being encoded or decoded is called the current largest compression unit. The integer compression unit being encoded or decoded is referred to as the current integer compression unit. A data element (also sometimes simply referred to as an element) being encoded or decoded is referred to as a currently encoded data element or a currently decoded data element, collectively referred to as a current data element, simply referred to as a current element. An element consists of N components (typically 1 ≦ N ≦ 5), so the data set, compression subset, maximum compression unit, and full compression unit all consist of N components as well. The components of an element are also referred to as component elements.

For example, the compression subset is an image of one frame whose elements, i.e., pixels, are arranged in a rectangular shape, having a size (resolution) of 4096 (width) x2048 (height), and consisting of 3 components: g (green), B (blue), R (red) or Y (luminance), U (Cb), V (Cr). One frame image is divided into maximum compression units of 128 × 128 size. Each maximum compression unit is further divided into square or rectangular whole compression units of varying sizes from 4x4 to 64x 64.

In the case of a data set divided into compression subsets, maximum compression units, and full compression units, one predetermined rule for ordering the elements is to first order the compression subsets, then the maximum compression units within each compression subset, then order the full compression units within each maximum compression unit, and then order the elements within each full compression unit.

The relationship between the multi-component data set as an encoding object and the sampling rates of the components of the integral compression unit is generally expressed in a sampling format. For example, for an array of two-dimensional data elements of the type comprising computer-generated graphics and text-containing images, a sampling format called 4. For another type of two-dimensional data element array including natural images and videos captured by a camera, a sampling format called 4. In this case, one D component D [ i ] [ j ] and one E component E [ i ] [ j ] correspond to four (2 × 2) F components F [2i ] [2j ], F [2i +1] [2j ], F [2i ] [2j +1], F [2i +1] [2j +1]. If the resolution of the F component is 2 mx 2N (2M component elements horizontally, 2N component elements vertically), i.e., the F component of the data set is F = { F [ M ] [ N ]: m = 0-2M-1, N = 0-2N-1 }, then the resolutions of the D and E components are each M × N (horizontal M component elements, vertical N component elements), i.e., the D and E components of the dataset are each D = { D [ M ] [ N ]: m =0 to M-1, N =0 to N-1} and E = { E [ M ] [ N ]: m = 0-M-1, N = 0-N-1 }. Where higher quality is also required for the secondary components, a sampling format called 4. In this case, in one direction (e.g., horizontal direction) of a data set (e.g., image or video), one D component D [ i ] [ j ] and one E component E [ i ] [ j ] correspond to two (2 × 1) F components F [2i ] [ j ] and F [2i +1] [ j ]. If the resolution of the F component is 2M N, i.e., the F component of the data set is F = { F [ M ] [ N ]: m = 0-2M-1, N = 0-N-1 }, then the resolutions of the D and E components are each M × N, respectively, i.e., the D and E components of the dataset are each D = { D [ M ] [ N ]: m =0 to M-1, N =0 to N-1} and E = { E [ M ] [ N ]: m = 0-M-1, N = 0-N-1 }. In images and video in YUV color format, the F, D, E components described above are typically Y, U, V components, respectively. In images and video in RGB color format, the F, D, E components described above are typically G, B, R components or G, R, B components, respectively. Where the data is an image or video, the sampling format is also often referred to as a chroma format.

In the case of a data set divided into whole compression units, one predetermined rule of ordering is to first order the whole compression units, and then order the elements within each whole compression unit.

One effective means of data compression is point prediction. The point prediction stores a plurality of positions, called common positions, of data elements in the data set, which have been coded and decoded to a predetermined degree and whose values frequently repeatedly appear in or near the current whole compression unit, in a common position array, also called a point prediction array or a point vector array, in the form of a point vector. Each of the commonly occurring locations and their point vectors stored in the array of commonly occurring locations or a subset thereof is designated by an index, also known as a point vector address. The data element in the current position is used as a reference element or a prediction element or a matching element. An equal value string to be encoded or decoded with equal values in the current whole compression unit only needs to use an index parameter and a repetition parameter, i.e. a length parameter, of a common position indicated by the index to indicate that the values of all elements of the equal value string are equal to or close to (i.e. the error does not exceed a predetermined threshold) the value of an element at the common position indicated by the index (the common position may be the position of a certain element in a data set before the equal value string, or the position of the first element of the equal value string), and does not need to record the value of each element in the equal value string one by one, thereby achieving the purpose of data compression.

For example, if a current string arranged according to a predetermined scanning manner can find a point vector in the array of commonly occurring positions or a subset thereof, and the value of the reference element pointed to by the point vector is the predicted value of all elements on the current string, it is only necessary to record the value of each element in the current string by using two parameters, namely the point vector address of the point vector and the current string length, and it is not necessary to record the value of each element in the current string one by one, so that all elements of the current string and the value thereof can be completely represented. The number of bits consumed by recording the two parameters is often much less than the number of bits consumed by recording the numerical value of each element in the current string one by one, so that the purpose of data compression is achieved.

Scanning methods often used in point prediction include:

horizontal raster scanning: the elements in the whole compression unit are arranged one by one along the horizontal direction, the next row is arranged after one row is arranged, and all the rows are arranged from left to right or all the rows are arranged from right to left;

or

Horizontal back and forth scanning is also known as reciprocating scanning or arcuate scanning: the elements in the whole compression unit are arranged one by one along the horizontal direction, the next line is arranged after one line is arranged, one line in any two adjacent lines is arranged from left to right, the other line is arranged from right to left, the line arranged from left to right is called a forward line, and the line arranged from right to left is called a reverse line;

or

Vertical raster scanning: the elements in the whole compression unit are arranged one by one along the vertical direction, the next column is arranged after one column is arranged, and all the columns are arranged from top to bottom or all the rows are arranged from bottom to top;

or

The vertical back and forth scan is also called a back and forth scan or an arcuate scan: the elements in one whole compression unit are arranged one element by one element along the vertical direction, one column is arranged after the elements are arranged, one column in any two adjacent columns is arranged from top to bottom, the other column is arranged from bottom to top, the columns arranged from top to bottom are called positive columns, and the columns arranged from bottom to top are called negative columns.

In the existing point predictive coding technology, in order to reduce implementation complexity, a reference range is usually limited, and a current position is limited in a maximum compression unit where a current whole compression unit is located or a nearby maximum compression unit, so that improvement of coding efficiency is limited.

Disclosure of Invention

In order to solve the problem caused by the limited reference range in the existing string prediction coding, the invention provides a method and a device for sealing and activating point prediction coding and point prediction decoding of out-of-range normal positions, wherein the method comprises the following steps: when a border-crossing (exceeding the reference range) of a normal position is caused by the variation of the reference range, temporarily sealing the element value on the normal position and placing the element value into a border-crossing normal position decoding element buffer area; when the element value reappears at the current position, the sealed and saved current position is reactivated, the current position becomes the reactivated and updated current position, the sealed and saved element value is taken out, the updated current position is put in, namely the current position, and becomes the reference element again, and the corresponding point vector also points to the updated current position, namely the current position.

The frequently-occurring position after the sealing is still kept in the frequently-occurring position array, but the frequently-occurring position is marked to be in a sealing state, and the point vector of the frequently-occurring position is illegal and cannot be used for point prediction. When a new frequently-occurring location is placed in the frequently-occurring location array, which causes the frequently-occurring location array to overflow, and a sealed frequently-occurring location needs to be deleted from the frequently-occurring location array according to a predetermined rule, the sealed frequently-occurring location is also deleted from the border-crossing frequently-occurring location decoding element buffer area naturally.

Activation allows for stepping, such as activating a portion of the components of an element before activating the remaining components. The commonly occurring position after full activation and the point vector and the reference element thereof have the same functions as the commonly occurring position before sequestration and the point vector and the reference element thereof, and are used for the prediction value of the element on the current string.

The technical purpose of the invention is realized by the following technical scheme:

a point prediction coding method, comprising at least the following steps:

1) Sealing and storing the element value at the border-crossing current position, and placing the element value into a border-crossing current position element cache region, wherein the border-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed frequent position is reactivated to become an updated frequent position after reactivation, the sealed element value is taken out from the border-crossing frequent position element cache region and is placed in the reappearing position, and the corresponding point vector also points to the reappearing position.

An apparatus for encoding point prediction, comprising at least the following modules:

a sealing and storing module: sealing and storing the element value at the border-crossing current position, and placing the element value into a border-crossing current position element cache region, wherein the border-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed at the reappearing position, and the corresponding point vector also points to the reappearing position.

A decoding method for point prediction, comprising at least the following steps:

1) Sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

A decoding apparatus for point prediction, comprising at least the following modules:

a sealing and storing module: sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

Further, in the decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

the compressed subsets involved in the point prediction include pictures, sub-pictures of pictures, tiles tile, slice;

the maximum compression unit related to the point prediction comprises a tile, a maximum coding unit LCU and a coding tree unit CTU;

the whole compression unit involved in the point prediction comprises a macro block, a coding unit CU, a sub-region of the CU, a sub-coding unit SubCU, a prediction block, a prediction unit PU, a sub-region of the PU, a sub-prediction unit SubPU, a transformation block, a transformation unit TU, a sub-region of the TU, and a sub-transformation unit SubTU.

Further, the scanning modes involved in the point prediction include horizontal raster scanning, horizontal back and forth scanning, vertical raster scanning and vertical back and forth scanning.

Further, the point prediction involves data,

is an array or sequence of arrays of two-dimensional data elements of 420 sample format;

alternatively, the first and second electrodes may be,

is an array or sequence of arrays of two-dimensional data elements in 422 sample format;

alternatively, the first and second electrodes may be,

is an array or sequence of arrays of two-dimensional data elements in a 444 sample format.

Further, in the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

the reference range is a predetermined integer number of maximum compression units or a predetermined integer number of quarter maximum compression units;

when the reference range is changed, namely a new maximum compression unit or a quarter maximum compression unit is added according to a preset rule and an old maximum compression unit or a quarter maximum compression unit is deleted, the normal position in the old maximum compression unit or the quarter maximum compression unit is the out-of-range normal position, the element value on the out-of-range normal position exceeding the changed reference range is sealed and put into an out-of-range normal position element buffer area.

Further, in the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

activating only a portion of the components of the element when the reproduction location of the first occurrence has only a portion of the components; when the reproduction positions of all the components of the existing element are present, the remaining components of the element are activated, and the common position is updated to the reproduction positions of all the components of the existing element.

Further, in the decoding method or apparatus of the point prediction, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of video,

the maximum compression unit is a 128x128 pixel LCU;

each 128x128 pixel LCU is divided into 4 quarter LCUs of 64x64 pixels;

coding and decoding LCU by LCU according to a preset LCU sequence, coding and decoding one LCU by one quarter according to the sequence of an upper left quarter LCU, an upper right quarter LCU, a lower left quarter LCU and a lower right quarter LCU in each LCU;

the reference range is the current quarter LCU and 3 quarter LCUs preceding the current quarter LCU in codec order, for a total of 4 quarter LCUs, 128x128=16384 pixels;

when encoding and decoding the Kth quarter LCU, the reference range is the Kth-3 quarter LCU, the Kth-2 quarter LCU, the Kth-1 quarter LCU and the Kth quarter LCU;

when encoding and decoding are carried out on the K +1 th quarter LCU, the reference range is K-2 th quarter LCU, K-1 th quarter LCU and K +1 th quarter LCU;

after completing the codec of the kth quarter LCU and before starting the codec of the K +1 th quarter LCU, the reference range is changed as follows: adding a K +1 quarter LCU and deleting a K-3 quarter LCU; at this time, the constant positions in the K-3 th quarter LCU are the out-of-range constant positions, the element values on the out-of-range constant positions are sealed and stored, and the element values are placed into an out-of-range constant position element cache region;

or alternatively

The largest compression unit is the LCU of NxN pixels, where N =8 or 16 or 32 or 64;

coding and decoding one LCU and one LCU according to a preset LCU sequence;

the reference range is 128x 128/(NxN) maximum compression units including the current maximum compression unit, for a total of 128x128=16384 pixels;

when encoding and decoding the Kth LCU, the reference range is the Kth-3 LCU, the Kth-2 LCU, the Kth-1 LCU and the Kth LCU;

when encoding and decoding the K +1 LCU, the reference range is the K-2 LCU, the K-1 LCU, the K LCU and the K +1 LCU;

after completing the codec of the kth LCU and before starting the codec of the K +1 th LCU, the reference range is changed as follows: adding the K +1 LCU and deleting the K-3 LCU; at this time, the normal positions in the K-3 LCU are all the border-crossing normal positions, the element values on the border-crossing normal positions are sealed and stored, and the border-crossing normal positions are placed in an element cache region;

preferably, when the reproduction position of the first occurrence comprises YUV three components of an element, activating the YUV three components of the element, and updating the reproduction position of the common occurrence position as the YUV three components comprising the element;

preferably, when the reproduction position appearing for the first time has only the Y component of the element, activating only the Y component of the element and updating the reproduction position of which the current position is the Y component of the element only; when the reproduction position comprising the YUV three components of the element appears, further activating the U component and the V component of the element, and updating the reproduction position comprising the YUV three components of the element as the common position again;

preferably, when the reproduction position appearing for the first time is a non-upper-left corner position of 2x2 pixels, only the Y component of the element is activated, and the updated frequent position is the non-upper-left corner position of the 2x2 pixels; when the reappearing position appears to be the upper left corner position of the 2x2 pixel, further activating the U component and the V component of the element, and updating the common appearing position to be the upper left corner position of the 2x2 pixel;

preferably, the coordinates of the reproduction position within the entire compression unit are (xInCu, yInCu); when ((xInCu | yInCu) &0x 1) is not equal to 0, the reproduction position is a non-upper left corner position of 2x2 pixels, only the Y component of the element is activated, and the update common position is the non-upper left corner position of the 2x2 pixels; when ((xInCu | yInCu) &0x 1) is equal to 0, the recurrence position is the upper left corner position of 2x2 pixels, further activating the U component and the V component of the element, and updating the recurrence position to the upper left corner position of the 2x2 pixels;

preferably, the out-of-range frequent occurrence location element buffer is a buffer outofRangeFrequantyOccuringPositionBuffer [3] [ I ] which can store up to I3-component elements;

preferably, I equals 28.

The invention is suitable for coding and decoding data by lossy compression, and is also suitable for coding and decoding data by lossless compression. The invention is suitable for encoding and decoding one-dimensional data such as character string data or byte string data or one-dimensional graphics or fractal graphics, and is also suitable for encoding and decoding data with two or more dimensions such as images, image sequences or video data.

In the present invention, the data involved in data compression includes one or a combination of the following types of data

1) One-dimensional data;

2) Two-dimensional data;

3) Multidimensional data;

4) A graph;

5) Dimension division graphics;

6) An image;

7) A sequence of images;

8) Video;

9) Audio frequency;

10 ) a file;

11 ) bytes;

12 Bit);

13 A pixel;

14 ) a three-dimensional scene;

15 A sequence of continuously changing three-dimensional scenes;

16 A scene of virtual reality;

17 ) a sequence of scenes of continuously changing virtual reality

18 Images in pixel form);

19 Transform domain data for the image;

20 A set of two or more bytes;

21 A set of bits in two or more dimensions;

22 ) a set of pixels;

23 A set of single component pixels;

24 A set of three-component pixels (R, G, B, A);

25 A set of three-component pixels (Y, U, V);

26 A set of three-component pixels (Y, cb, cr);

27 A set of three-component pixels (Y, cg, co);

28 A set of four component pixels (C, M, Y, K);

29 A set of four component pixels (R, G, B, A);

30 A set of four component pixels (Y, U, V, A);

31 A set of four component pixels (Y, cb, cr, A);

32 A set of four component pixels (Y, cg, co, A).

Detailed Description

In order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further described with the specific embodiments.

A point prediction coding method, comprising at least the following steps:

1) Sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed frequent position is reactivated to become an updated frequent position after reactivation, the sealed element value is taken out from the border-crossing frequent position element cache region and is placed in the reappearing position, and the corresponding point vector also points to the reappearing position.

A point prediction coding apparatus, comprising at least the following modules:

a sealing and storing module: sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed at the reappearing position, and the corresponding point vector also points to the reappearing position.

A decoding method for point prediction, comprising at least the following steps:

1) Sealing and storing the element value at the border-crossing current position, and placing the element value into a border-crossing current position element cache region, wherein the border-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

A decoding apparatus for point prediction, comprising at least the following modules:

a sealing and storing module: sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

Example 1

In the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video,

the compressed subsets involved in the point prediction include pictures, sub-pictures of pictures, tiles tile, slice;

the maximum compression unit related to the point prediction comprises a tile, a maximum coding unit (LCU) and a Coding Tree Unit (CTU);

the whole compression unit involved in the point prediction comprises a macro block, a coding unit CU, a sub-region of the CU, a sub-coding unit SubCU, a prediction block, a prediction unit PU, a sub-region of the PU, a sub-prediction unit SubPU, a transformation block, a transformation unit TU, a sub-region of the TU, and a sub-transformation unit SubTU.

Example 2

In the encoding and decoding method or device, scanning modes related to point prediction comprise horizontal raster scanning, horizontal back and forth scanning, vertical raster scanning and vertical back and forth scanning.

Example 3

In the encoding and decoding methods or apparatuses, a first encoding step,

the data is an array or sequence of arrays of two-dimensional data elements in a 420-sample format;

alternatively, the first and second electrodes may be,

the data is an array or sequence of arrays of two-dimensional data elements in 422 sample format;

alternatively, the first and second electrodes may be,

the data is an array or sequence of arrays of two-dimensional data elements in a 444 sample format.

Example 4

In the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video,

the reference range is a predetermined integer number of maximum compression units or a predetermined integer number of quarter maximum compression units;

when the reference range is changed, namely a new maximum compression unit or a quarter maximum compression unit is added according to a preset rule and an old maximum compression unit or a quarter maximum compression unit is deleted, the normal position in the old maximum compression unit or the quarter maximum compression unit is the out-of-range normal position, the element value on the out-of-range normal position exceeding the changed reference range is sealed and put into an out-of-range normal position element buffer area.

Example 5

In the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video,

activating only a portion of the elements when the reproduction location of the first occurrence has only a portion of the elements; when the reproduction positions of all the components of the existing element are present, the remaining components of the element are activated, and the common position is updated to the reproduction positions of all the components of the existing element.

Example 6

In the encoding, decoding method or apparatus, in the case where the original data is a sequence including an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video,

the maximum compression unit is a 128x128 pixel LCU;

each 128x128 pixel LCU is divided into 4 quarter LCUs of 64x64 pixels;

coding and decoding one LCU by one LCU according to a preset LCU sequence, wherein in each LCU, coding and decoding one fourth of LCU one by one according to the sequence of the upper left quarter of LCU, the upper right quarter of LCU, the lower left quarter of LCU and the lower right quarter of LCU;

the reference range is the current quarter LCU and 3 quarter LCUs preceding the current quarter LCU in codec order, for a total of 4 quarter LCUs, 128x128=16384 pixels;

when encoding and decoding the Kth quarter LCU, the reference range is the Kth-3 quarter LCU, the Kth-2 quarter LCU, the Kth-1 quarter LCU and the Kth quarter LCU;

when encoding and decoding the K +1 th quarter LCU, the reference range is the K-2 th quarter LCU, the K-1 th quarter LCU and the K +1 th quarter LCU;

after completing the codec of the kth quarter LCU and before starting the codec of the K +1 th quarter LCU, the reference range is changed as follows: adding a K +1 quarter LCU and deleting a K-3 quarter LCU; at the moment, the normal positions in the K-3 th quarter LCU are all border-crossing normal positions, the element values on the border-crossing normal positions are sealed and stored, and the border-crossing normal positions are placed in an element cache region;

or

The largest compression unit is the LCU of NxN pixels, where N =8 or 16 or 32 or 64;

coding and decoding one LCU and one LCU according to a preset LCU sequence;

the reference range is 128x 128/(NxN) maximum compression units including the current maximum compression unit, for a total of 128x128=16384 pixels;

when encoding and decoding the Kth LCU, the reference range is the Kth-3 LCU, the Kth-2 LCU, the Kth-1 LCU and the Kth LCU;

when encoding and decoding are carried out on the K +1 LCU, the reference range is the K-2 LCU, the K-1 LCU, the K LCU and the K +1 LCU;

after completing the codec of the kth LCU and before starting the codec of the K +1 th LCU, the reference range is changed as follows: adding the K +1 LCU and deleting the K-3 LCU; at this time, the normal positions in the K-3 LCU are all the border-crossing normal positions, the element values on the border-crossing normal positions are sealed and stored, and the border-crossing normal positions are placed in an element cache region;

preferably, the first and second electrodes are formed of a metal,

when the reproduction position appearing for the first time comprises the YUV three components of the element, activating the YUV three components of the element, and updating the common position to be the reproduction position of the YUV three components comprising the element;

preferably, the first and second liquid crystal display panels are,

when the reproduction position appearing for the first time has only the Y component of the element, activating only the Y component of the element and updating the reproduction position of which the frequently-appearing position is the Y component of the element only; when the reproduction position comprising the YUV three components of the element appears, further activating the U component and the V component of the element, and updating the reproduction position comprising the YUV three components of the element as the common position again;

preferably, the first and second electrodes are formed of a metal,

when the reproduction position appearing for the first time is the non-upper left corner position of the 2x2 pixel, only the Y component of the element is activated, and the frequently appearing position is updated to be the non-upper left corner position of the 2x2 pixel; when the reappearing position appears to be the upper left corner position of the 2x2 pixel, further activating the U component and the V component of the element, and updating the common appearing position to be the upper left corner position of the 2x2 pixel;

preferably, the first and second electrodes are formed of a metal,

the coordinates of the reproduction position within the entire compression unit are (xInCu, yInCu); when ((xInCu | yInCu) &0x 1) is not equal to 0, the reproduction position is a non-upper left corner position of 2x2 pixels, only the Y component of the element is activated, and the update common position is the non-upper left corner position of the 2x2 pixels; when ((xInCu | yInCu) &0x 1) is equal to 0, the recurrence position is the upper left corner position of 2x2 pixels, further activating the U component and the V component of the element, and updating the recurrence position to be the upper left corner position of the 2x2 pixels;

preferably, the out-of-range frequent occurrence location element buffer is a buffer outofRangeFrequantyOccuringPositionBuffer [3] [ I ] which can store up to I3-component elements;

preferably, I equals 28.

Example 7

In the encoding and decoding method or device, for the frequently-occurring positions which are not sealed and the point vectors thereof, the point vectors are used for acquiring the reference elements from the frequently-occurring positions, and for the reproduction positions which are activated after being sealed, the reference elements are directly acquired from the border-crossing frequently-occurring position element buffer area.

As used herein, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, including not only those elements listed, but also other elements not expressly listed.

The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are given by way of illustration of the principles of the present invention, and that various changes and modifications may be made without departing from the spirit and scope of the invention as defined by the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (10)

1. A method for coding point prediction, comprising the steps of:

1) Sealing and storing the element value at the border-crossing current position, and placing the element value into a border-crossing current position element cache region, wherein the border-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed at the reappearing position, and the corresponding point vector also points to the reappearing position.

2. An apparatus for point prediction coding, comprising at least the following modules:

a sealing and storing module: sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current coding position, the sealed element value is reactivated to become a reference element, the current coding position is called a reappearing position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed at the reappearing position, and the corresponding point vector also points to the reappearing position.

3. A decoding method for point prediction, comprising at least the steps of:

1) Sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

2) When the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

4. A decoding apparatus for point prediction, comprising at least the following modules:

a sealing and storing module: sealing the element value at the boundary-crossing current position, and placing the element value into a boundary-crossing current position element cache region, wherein the boundary-crossing current position becomes a sealed current position;

an activation module: when the sealed element value reappears at a current decoding position, the sealed element value is reactivated to become a reference element, the current decoding position is called a reproduction position, the sealed constant position is reactivated to become an updated constant position after reactivation, the sealed element value is taken out from the border-crossing constant position element buffer area and is placed in the reproduction position, and the corresponding point vector also points to the reproduction position.

5. The point-prediction decoding method or device according to claim 3 or 4, wherein, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

the compressed subsets involved in the point prediction include pictures, sub-pictures of pictures, tiles tile, slice;

the maximum compression unit related to the point prediction comprises a tile, a maximum coding unit LCU and a coding tree unit CTU;

the whole compression unit involved in the point prediction comprises a macro block, a coding unit CU, a sub-region of the CU, a sub-coding unit SubCU, a prediction block, a prediction unit PU, a sub-region of the PU, a sub-prediction unit SubPU, a transformation block, a transformation unit TU, a sub-region of the TU, and a sub-transformation unit SubTU.

6. The decoding method or the decoding apparatus for point prediction according to claim 3 or 4, wherein the scanning manner involved in the point prediction includes horizontal raster scanning, horizontal back and forth scanning, vertical raster scanning, and vertical back and forth scanning.

7. The decoding method or device for point prediction according to claim 3 or 4, wherein the data related to the point prediction,

is an array or sequence of arrays of two-dimensional data elements of 420 sample format;

alternatively, the first and second electrodes may be,

is an array or sequence of arrays of two-dimensional data elements in 422 sample format;

alternatively, the first and second electrodes may be,

is an array or sequence of arrays of two-dimensional data elements in a 444 sample format.

8. The point-prediction decoding method or device according to claim 3 or 4, wherein, in the encoding or decoding method or device, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

the reference range is a predetermined integer number of maximum compression units or a predetermined integer number of quarter maximum compression units;

when the reference range is changed, namely a new maximum compression unit or a quarter maximum compression unit is added according to a preset rule and an old maximum compression unit or a quarter maximum compression unit is deleted, the normal position in the old maximum compression unit or the quarter maximum compression unit is the out-of-range normal position, the element value on the out-of-range normal position exceeding the changed reference range is sealed and put into an out-of-range normal position element buffer area.

9. The point-prediction decoding method or device according to claim 3 or 4, wherein, in the encoding or decoding method or device, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

activating only a portion of the components of the element when the reproduction location of the first occurrence has only a portion of the components; when the reproduction positions of all the components of the existing element are present, the remaining components of the element are activated, and the common position is updated to the reproduction positions of all the components of the existing element.

10. The decoding method or the decoding apparatus for point prediction according to claim 3 or 4,

in the decoding method or apparatus of the point prediction, in the case where the original data is a sequence including an image, a sequence of images, an array or array of two-dimensional data elements of a video,

the maximum compression unit is a 128x128 pixel LCU;

each 128x128 pixel LCU is divided into 4 quarter LCUs of 64x64 pixels;

coding and decoding one LCU by one LCU according to a preset LCU sequence, wherein in each LCU, coding and decoding one fourth of LCU one by one according to the sequence of the upper left quarter of LCU, the upper right quarter of LCU, the lower left quarter of LCU and the lower right quarter of LCU;

the reference range is the current quarter LCU and 3 quarter LCUs preceding the current quarter LCU in codec order, for a total of 4 quarter LCUs, 128x128=16384 pixels;

when encoding and decoding the Kth quarter LCU, the reference range is the Kth-3 quarter LCU, the Kth-2 quarter LCU, the Kth-1 quarter LCU and the Kth quarter LCU;

when encoding and decoding the K +1 th quarter LCU, the reference range is the K-2 th quarter LCU, the K-1 th quarter LCU and the K +1 th quarter LCU;

after completing the codec of the kth quarter LCU and before starting the codec of the K +1 th quarter LCU, the reference range is changed as follows: adding a K +1 quarter LCU and deleting a K-3 quarter LCU; at this time, the constant positions in the K-3 th quarter LCU are the out-of-range constant positions, the element values on the out-of-range constant positions are sealed and stored, and the element values are placed into an out-of-range constant position element cache region;

or

The largest compression unit is an LCU of NxN pixels, where N =8 or 16 or 32 or 64;

coding and decoding LCU one by one according to a preset LCU sequence;

the reference range is 128x 128/(NxN) maximum compression units including the current maximum compression unit, for a total of 128x128=16384 pixels;

when encoding and decoding the Kth LCU, the reference range is the Kth-3 LCU, the Kth-2 LCU, the Kth-1 LCU and the Kth LCU;

when encoding and decoding are carried out on the K +1 LCU, the reference range is the K-2 LCU, the K-1 LCU, the K LCU and the K +1 LCU;

after completing the codec of the kth LCU and before starting the codec of the K +1 th LCU, the reference range is changed as follows: adding the K +1 LCU and deleting the K-3 LCU; at this time, the normal positions in the K-3 LCU are all the border-crossing normal positions, the element values on the border-crossing normal positions are sealed and stored, and the border-crossing normal positions are placed in an element cache region;

preferably, when the reproduction position of the first occurrence comprises YUV three components of an element, activating the YUV three components of the element, and updating the reproduction position of the common occurrence position as the YUV three components comprising the element;

preferably, when the reproduction position appearing for the first time has only the Y component of the element, activating only the Y component of the element and updating the reproduction position of which the current position is the Y component of the element only; when a reproduction position comprising YUV three components of an element appears, further activating a U component and a V component of the element, and updating the reproduction position of the YUV three components comprising the element as a common position again;

preferably, when the reproduction position appearing for the first time is a non-upper-left corner position of 2x2 pixels, only the Y component of the element is activated, and the updated frequent position is the non-upper-left corner position of the 2x2 pixels; when the reappearing position appears to be the upper left corner position of the 2x2 pixel, further activating the U component and the V component of the element, and updating the common appearing position to be the upper left corner position of the 2x2 pixel;

preferably, the coordinates of the reproduction position within the entire compression unit are (xInCu, yInCu); when ((xInCu | yInCu) &0x 1) is not equal to 0, the reproduction position is a non-upper left corner position of 2x2 pixels, only the Y component of the element is activated, and the update common position is the non-upper left corner position of the 2x2 pixels; when ((xInCu | yInCu) &0x 1) is equal to 0, the recurrence position is the upper left corner position of 2x2 pixels, further activating the U component and the V component of the element, and updating the recurrence position to be the upper left corner position of the 2x2 pixels;

preferably, the out-of-range frequent occurrence location element buffer is a buffer outofRangeFrequantyOccuringPositionBuffer [3] [ I ] which can store up to I3-component elements;

preferably, I equals 28.