CN114245130A

CN114245130A - Data coding and decoding method and device for multiplexing point vector by using historical point prediction information table

Info

Publication number: CN114245130A
Application number: CN202111158855.3A
Authority: CN
Inventors: 林涛; 周开伦; 赵利平; 焦孟草; 王淑慧
Original assignee: Tongji University
Current assignee: Tongji University
Priority date: 2021-09-30
Filing date: 2021-09-30
Publication date: 2022-03-25

Abstract

The invention discloses a data coding and decoding method and a device for multiplexing point vectors by using a historical point prediction information table, and the technical scheme is as follows: adding and storing parameters of partial point vectors or all point vectors used in any integral compression unit into a historical point prediction information table; the point vector used by any one whole compression unit of point prediction coding is from the historical point prediction information table and is called a multiplexing point vector, or is not in the historical point prediction information table and is called a new point vector; and for the new point vector, at least according to the element values of the primary component and/or the secondary component determined by a preset rule in the compressed data code stream, and according to the preset rule, writing the element values at the frequently-occurring position represented by the new point vector into the compressed data code stream. The data coding and decoding method provided by the invention can realize the quick calling of the common positions and the point vectors thereof with the same element values, thereby greatly improving the coding efficiency.

Description

Data coding and decoding method and device for multiplexing point vector by using historical point prediction information table

Technical Field

The invention relates to the technical field of data decoding and encoding, in particular to a data encoding and decoding method and device for multiplexing point vectors by using a historical point prediction information table.

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 correspondingly 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 certain spatial (one-dimensional, two-dimensional, or multi-dimensional) shape, especially a two-dimensional or more data sets, the data set is sometimes divided into a plurality of subsets having predetermined shapes and/or sizes (i.e., the number of elements), called whole compression units, and the data set is encoded or decoded in units of whole compression units, in a predetermined order, in units of whole compression units. At any one time, 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 both the data set and the entire compression unit consist of N components. The components of an element are also referred to as component elements.

For example, elements of one frame image, i.e., pixels, are arranged in a rectangular shape, have a size (resolution) of 1920 (width) x 1080 (height), and are composed of 3 components: g (green), B (blue), R (red) or Y (luminance), U (Cb), V (Cr).

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. Data in which the N components all have the same sample rate and size (i.e., the number of component samples) is referred to as full sample format data. The N components have different sampling rates and sizes, wherein data of which the sampling rate and size of N1 components, referred to as primary components, are integer multiples of the sampling rate and size of the remaining N-N1 components, referred to as secondary components, are referred to as downsampled format data. The integer multiple is typically 2 times, 4 times, 8 times, 2x2 times, 4x2 times, etc. In full-sample format data, all components are considered primary components and no secondary components. In the downsampled formatted data, at least one component is a primary component and at least one component is a secondary component. For example, for an array of two-dimensional data elements of the type comprising computer-generated graphics and text-containing images, a sampling format known as 4:4:4 (or simply 444) is commonly employed, i.e., 3 components of the data set all have the same sampling rate and size (i.e., number of component samples). For another type of two-dimensional data element array, including natural images and videos captured by a camera, a sampling format called 4:2:0 (abbreviated 420) is commonly used, that is, the sampling rate and size of 2 components called minor components (D-component and E-component) of a data set (e.g., an image or video) having a rectangular shape and 3 components are each one quarter of the other component called major component (F-component), that is, there is a 4:1 downsampling relationship between the major and minor components. 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, the resolutions of the D and E components are M × N (M component elements horizontally, N component elements vertically), i.e., the D and E components of the dataset are D { D [ M ] [ N ]: m is 0 to M-1, N is 0 to N-1, and E is { E [ M ] [ N ]: m is 0 to M-1, and N is 0 to N-1. Where higher quality is also required for the subcomponents, a sampling format called 4:2:2 (422 for short) is often used, i.e. the sampling rate and size of the 2 subcomponents (D-component and E-component) of a data set (e.g. an image or video) having a rectangular shape and 3 components are each half of the other principal component (F-component), i.e. there is a 2:1 down-sampling relationship between the principal and subcomponents. 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 2 mxn, i.e., the F component of the dataset is F ═ F [ M ] [ N ]: m is 0 to 2M-1, N is 0 to N-1, and the resolutions of the D and E components are mxn, respectively, i.e., the D and E components of the dataset are D { D [ M ] [ N ]: m is 0 to M-1, N is 0 to N-1, and E is { E [ M ] [ N ]: m is 0 to M-1, and N is 0 to N-1. In images and video in YUV or YCbCr or YCgCo color formats, the F, D, E components described above are typically the Y, U, V components or the Y, Cb, Cr components or the Y, Cg, Co 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. The chroma format in which the components all have the same sampling rate is referred to as the panchromatic format. A chroma format having a downsampled relationship between a portion of components and another portion of components is referred to as a downsampled chroma format.

In the down-sampling format, the position where one secondary component is located (generally referred to as a secondary component position) and its element correspond to the positions where a plurality of primary components are located (generally referred to as primary component positions, which do not cause confusion even if simply referred to as positions) and their elements. This one-to-many correspondence has uncertainty. To eliminate such uncertainty, a primary component positive position and its positive element (e.g., a position at the upper left corner among the 2x2 positions and its elements or a position at the left side among the 2x1 positions and its elements) are usually pre-specified among a plurality of positions (e.g., 2x2 positions in 420 format or 2x1 positions in 422 format) and its elements corresponding to a secondary component position and its elements as unique normal primary component positions and their elements corresponding to the secondary component positions and their elements one-to-one. The primary component position and the secondary component position have a one-to-one correspondence relationship, and therefore, the primary component position and the secondary component position are collectively referred to as a "positive position", which means that the position is both a primary component positive position and a secondary component position, and the positive position and the secondary component position also have a one-to-one correspondence relationship, and the positions other than the positive position among the plurality of primary component positions corresponding to one secondary component position are referred to as "non-positive positions". The positive element of the primary component and the secondary component element also have a one-to-one correspondence relationship, so that the positive element of the primary component and the secondary component element are collectively called a positive element, which means that the element is both a positive element of the primary component and a secondary component element, the positive element and the secondary component element also have a one-to-one correspondence relationship, and the other elements except the positive element in the plurality of primary component elements corresponding to one secondary component element are called non-positive elements. On the other hand, in the full-sampling format, all positions are considered as principal component positive positions and positive positions, and all elements are considered as principal component positive elements and positive elements.

In the case where the data is an array or sequence of arrays of two-dimensional data elements of 420 sample format, there is one primary component F and two secondary components D and E;

the sampling rate and size of the secondary components D and E are respectively one quarter of that of the primary component F, i.e. there is a downsampling relationship of 4:1, i.e. 2x2:1, between the primary and secondary components;

one D component element D [ i ] [ j ] and one E component element E [ i ] [ j ] correspond to 2 × 2, that is, 4F component elements F [2i ] [2j ], F [2i +1] [2j ], F [2i ] [2j +1], F [2i +1] [2j +1 ];

the resolution of the F component elements is 2 mx 2N, i.e., the F component elements form an array F ═ F [ M ] [ N ]: m is 0 to 2M-1, N is 0 to 2N-1},

the resolution of the D component elements is M × N, i.e., the D component elements form an array D ═ D [ M ] [ N ]: m is 0 to M-1, N is 0 to N-1},

the resolution of the E component elements is also M × N, i.e., the E component elements form an array E ═ { E [ M ] [ N ]: m is 0 to M-1, and N is 0 to N-1.

The main component positive element on the pre-designated positive position is F2 i 2j, which is called the upper left corner type main component positive position and the positive element thereof;

or,

the main component positive element on the preassigned positive position is F [2i +1] [2j ], which is called the upper right corner type main component positive position and the positive element thereof;

or,

the main component positive element at the pre-specified positive position is F [2i ] [2j +1], which is called the main component positive position of the lower left corner type and the positive element thereof;

or,

the principal component positive element at the pre-specified positive position is F [2i +1] [2j +1], referred to as the principal component positive position of the lower right corner type and its positive element.

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 string prediction, also known as string matching. String prediction divides an element of a current whole compression unit into variable-length element strings, and for a current element string, called a current string for short, among a set of elements which have been coded and decoded to a predetermined degree called a reference set or a subset thereof, a reference element string, called a reference string for short, having the same or similar numerical value as the current string, also called a reference string or a prediction string or a matching string of the current string, is obtained. For a reference string of a current string, only a plurality of parameters are needed to record the position and/or shape and/or size and/or dimension of the reference string in a reference set, and the numerical value of each element in the current string is not needed to be recorded one by one, so that all elements of the current string and the numerical value thereof can be completely represented and reconstructed anytime and anywhere when needed, and the purpose of data compression is achieved. The elements of the current string that are generated by the reconstruction are referred to as reconstructed elements, and their values are referred to as reconstructed values of the current string and its elements. Data compression in which the reconstructed value of an element is identical to the original value of the element is called lossless compression. Data compression in which the reconstructed value of an element is not identical to the original value of the element is referred to as lossy compression.

For example, if a current string is sequentially ordered according to a certain scanning mode, if a corresponding reference string can be found in a reference set, the position and the size of the reference string in the reference set only need to be recorded by using two parameters, namely the position relation between the first element of the current string and the first element of the reference string and the string length, and the numerical value of each element in the current string is not required to be recorded one by one, so that all elements of the current string and the numerical values thereof can be completely represented and reconstructed anytime and anywhere when needed, and the reconstructed values of the current string and the elements thereof can be obtained. The number of bits consumed by recording the two parameters is often much smaller 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.

In string prediction, unpredictable (also referred to as unmatched or unmatched) elements may also appear within the reference set for which no reference element is found. The components, principal components, and secondary components of the unpredictable element are referred to as unpredictable components, unpredictable principal components, and unpredictable secondary components, respectively. For the unpredictable elements, only the accurate or approximate values of the unpredictable elements can be recorded, the unpredictable elements are compressed according to a preset mode, and the unpredictable elements are reconstructed anytime and anywhere when needed to obtain the reconstructed values of the unpredictable elements.

Scanning methods often used in string 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 in-row scanning directions are arranged from left to right or all the in-row scanning directions 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 row is arranged after the row is arranged, the in-row scanning direction of one row in any two adjacent rows is arranged from left to right, the in-row scanning direction of the other row is arranged from right to left, the row arranged from left to right is called a forward row, and the row arranged from right to left is called a reverse row;

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 in-column scanning directions are arranged from top to bottom or all in-column scanning directions 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 by one along the vertical direction, the next column is arranged after one column is arranged, the in-column scanning direction of one column in any two adjacent columns is arranged from top to bottom, the in-column scanning direction of 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 reverse columns.

The first element in the scan, i.e., the permutation, of the string is called the starting element and the last element in the scan, i.e., the permutation, of the string is called the terminating element.

One special case of string prediction is block prediction, also known as block matching. In this particular case, each string forms a block of rectangular shape.

Point prediction is another special case of string prediction and is an effective means of data compression.

The point prediction technique stores the positions of a plurality 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, into a common position array, wherein each common position stored in the array is marked by an index, which is called a common position index. The data elements in the current positions are used as reference elements or prediction elements or matching elements. 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 number parameter of a constant-current position indicated by the index to represent that the values of all elements of the equal-value string are equal to the values of the elements at the constant-current position indicated by the index (the constant-current position can be the position of a certain element in a data set before the equal-value string and can also be the position of an element in the equal-value string), and the values of each element in the equal-value string do not need to be recorded one by one, so that the purpose of data compression is achieved. The common location is usually represented by a point vector, and the common location array is usually a point vector array, i.e. an array storing parameters of the point vector, the parameters of the point vector at least including the point vector and information related to the point vector, and the point vector is usually represented by some form of coordinates. The point vector array is sometimes also referred to as a point prediction information table.

And if the normal position element appears in a positive position, namely the position designated by the point vector representing the normal position is a positive position, the normal position element has all N components including the secondary components, all N components including the secondary components exist in the compressed data code stream, the encoder writes the numerical values of all N components including the secondary components into the compressed data code stream, the decoder obtains the numerical values of all N components including the secondary components from the compressed data code stream, otherwise, only the primary components but no secondary components exist in the compressed data code stream, the encoder writes the numerical values of only the primary components into the compressed data code stream, and the decoder obtains the numerical values of only the primary components from the compressed data code stream. The values of the minor components of the common position elements are stored in the minor component space at the positive position. The current position element, on the one hand, is the reconstruction element of the position where the current position element is located, and on the other hand, is also a reference element of other elements, and is used to obtain the reconstruction value of other elements.

In the entire compression unit that performs encoding and decoding using the point prediction technique, there is a possibility that an unmatched element for which the reference element cannot be found exists. And if the unmatched elements appear at the positive positions, the unmatched elements have all N components including secondary components, all N components including the secondary components exist in the compressed data code stream, the encoder writes the numerical values of all N components including the secondary components into the compressed data code stream, and the decoder obtains the numerical values of all N components including the secondary components from the compressed data code stream, otherwise, only the primary components exist but no secondary components exist in the compressed data code stream, the encoder only writes the numerical values of the primary components into the compressed data code stream, and the decoder only obtains the numerical values of the primary components from the compressed data code stream. The unmatched element itself is also allowed to be used as a reference element for the other elements for obtaining reconstructed values of the other elements, and in this case, the unmatched element is also referred to as an unmatched reference element.

The point prediction technology divides elements of a whole compression unit into element strings with variable lengths of the following three string types along a path formed by continuously sorting the elements according to a preset scanning mode:

string type 1: an equal value string or an equal value string. The values of all elements on an equal value string are equal to the value of a common position element;

string type 2: a string of unmatched elements. All elements on an unmatched string of elements are unmatched elements;

string type 3: a string of unit basis vectors. The unit base vector string is a string in which the reference string is located one unit distance directly above the current string in the horizontal scanning mode and one unit distance directly to the left of the current string in the vertical scanning mode. The unit base vector string in the horizontal scanning mode is also referred to as a copy upper string, and the unit base vector string in the vertical scanning mode is also referred to as a copy left string.

The point prediction technique also enforces that: the unit base vector string is limited to copying elements inside the current whole compression unit, and cannot copy elements outside the current whole compression unit. Therefore, the original source of the elements inside one whole compression unit can only be the elements of the current position or the elements which are not matched. That is, all elements of an entire compression unit whose reference elements are derived without exception directly from the current position elements or from the unmatched elements.

Therefore, in the whole compression unit for encoding and decoding using the point prediction technique, the values of the reconstructed elements (i.e., the reconstructed values of the elements) are obtained from the elements of the current positions or the elements of the non-matching positions.

Point prediction as a special case of string prediction, when reconstructing an element, as with string prediction, the primary component of the current element must always be reconstructed, and if the current element is in the positive position, the secondary component of the current element must also be reconstructed, otherwise the secondary component of the current element is not reconstructed.

In the existing point prediction technology, a common position and a point vector thereof appearing in one integral compression unit are only used in the current integral compression unit, and if the common position and the point vector thereof with the same element value appear in a subsequent integral compression unit, the element value also needs to be retransmitted through a compressed data code stream, so that the coding efficiency of the point prediction technology is obviously reduced.

Therefore, there is a need to design a new technical solution to overcome the above-mentioned drawbacks.

Disclosure of Invention

The invention aims to provide a data coding and decoding method and a data coding and decoding device for multiplexing point vectors by using a historical point prediction information table, which are used for solving the problems that in the prior point prediction technology, a common position and a point vector thereof appearing in one integral compression unit are only used in the current integral compression unit, and if the common position and the point vector thereof with the same element value appear in the subsequent integral compression unit, the element value also needs to be retransmitted by a compressed data code stream, so that the coding efficiency of the point prediction technology is obviously reduced.

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

a data encoding method for multiplexing point vectors using a history point prediction information table, said data encoding method comprising at least the steps of:

step 1: adding and storing parameters of partial point vectors or all point vectors used in any integral compression unit into a historical point prediction information table;

step 2: the point vector used by any one whole compression unit of point prediction coding is from the historical point prediction information table and is called a multiplexing point vector, or is not in the historical point prediction information table and is called a new point vector;

and step 3: and for the new point vector, at least according to the element values of the primary component and/or the secondary component determined by a preset rule in the compressed data code stream, and according to the preset rule, writing the element values at the frequently-occurring position represented by the new point vector into the compressed data code stream.

A data encoding apparatus for multiplexing a point vector with a history point prediction information table, the data encoding apparatus including at least modules capable of realizing the following functions and operations;

adding and storing parameters of partial point vectors or all point vectors used in any integral compression unit into a historical point prediction information table;

the point vector used by any one whole compression unit of point prediction coding is from the historical point prediction information table and is called a multiplexing point vector, or is not in the historical point prediction information table and is called a new point vector;

and for the new point vector, at least according to the element values of the primary component and/or the secondary component determined by a preset rule in the compressed data code stream, and according to the preset rule, writing the element values at the frequently-occurring position represented by the new point vector into the compressed data code stream.

A data decoding method for multiplexing point vectors using a history point prediction information table, said decoding method comprising at least the steps of:

point vectors used by any one whole compression unit of point prediction decoding are called multiplexing point vectors from the historical point prediction information table or are called new point vectors which are not in the historical point prediction information table;

and for the new point vector, at least the element values of the primary component and/or the secondary component determined according to a preset rule exist in the compressed data code stream, and the element values at the frequently-occurring position represented by the new point vector are obtained from the compressed data code stream at least according to the preset rule.

Data decoding apparatus for multiplexing point vectors using a table of historical point prediction information, said decoding apparatus comprising at least modules capable of performing the following functions and operations:

Preferably, the entire compression unit includes a macroblock, a coding unit CU, a sub-region of a CU, a sub coding unit SubCU, a prediction block, a prediction unit PU, a sub-region of a PU, a sub prediction unit SubPU, a transform block, a transform unit TU, a sub-region of a TU, or a sub transform unit SubTU.

Preferably, the parameters of the point vector comprise at least one or more dimensional coordinates of the current position represented by the point vector in a predetermined one or more dimensional area.

Preferably, the parameters of all the point vectors used in the stitching unit are stored in a point prediction information table dedicated to the compression unit, the point prediction information table being composed of two parts, the first part storing the parameters of the multiplexed point vector or being empty, the second part storing the parameters of the new point vector or being empty.

Preferably, in the above encoding method or decoding method, for example, the original data includes an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video, and the data is an array or a sequence of arrays of two-dimensional data elements in a 420-sample format, and has a primary component F and two secondary components D and E.

Preferably, in the above encoding method or decoding method, for the new point vector, the predetermined rule at least includes: if the common position represented by the new point vector is the main component positive position, the element values of the main component and the secondary component exist in the compressed data code stream, the encoder writes the element values of the main component and the secondary component into the compressed data code stream, and the decoder obtains the element values of the main component and the secondary component from the compressed data code stream; otherwise, the element value of the main component exists in the compressed data code stream, the encoder writes the element value of the main component into the compressed data code stream, and the decoder obtains the element value of the main component from the compressed data code stream.

Preferably, in the above encoding method or decoding method, for the new point vector, the predetermined rule at least includes: the element values of the principal components at the frequently-occurring positions represented by the new point vectors always exist in the compressed data code stream, the encoder always writes the element values of the principal components into the compressed data code stream, and the decoder always obtains the element values of the principal components from the compressed data code stream; if the current position represented by the new point vector is the main component positive position, the element numerical value of the secondary component of the current position represented by the new point vector also exists in the compressed data code stream, the encoder also writes the element numerical value of the secondary component into the compressed data code stream, and the decoder also obtains the element numerical value of the secondary component from the compressed data code stream.

Preferably, when encoding or decoding a current integer compression unit, on one hand, taking out the parameters of the multiplexing point vector from the history point prediction information table, putting the parameters into the current point prediction information table dedicated for the current integer compression unit, and marking the multiplexing point vector as being multiplexed in the history point prediction information table; on the other hand, the parameters of the new point vector are put into the current prediction information table.

Preferably, when encoding or decoding a current integer compression unit, firstly, taking out the parameters of the multiplexing point vector from the history point prediction information table, putting the parameters into the current point prediction information table special for the current integer compression unit, and marking the multiplexing point vector as being multiplexed in the history point prediction information table; then, the parameters of the new point vector are put into the current point prediction information table.

Preferably, in the process of taking out the parameters of the multiplexed point vector from the history point prediction information table and putting the parameters into the current point prediction information table dedicated to the current entire compression unit, the multiplexed point vector is selected and taken out using the difference between the address or index of the multiplexed point vector in the history point prediction information table and the address or index of the previous multiplexed point vector in the history point prediction information table.

Preferably, after the parameters of all point vectors used in a current integer compression unit are put into a current point prediction information table dedicated to the current integer compression unit, the current point prediction information table and the historical point prediction information table are merged as follows to generate a new historical point prediction information table: on one hand, the current point prediction information table is put into the new historical point prediction information table and occupies one part of the new historical point prediction information table; on the other hand, the parameters of the point vectors in the history point prediction information table that are not multiplexed by the current full compression unit are put in the new history point prediction information table and occupy another part of the new history point prediction information table.

Preferably, after the parameters of all point vectors used in a current integer compression unit are put into a current point prediction information table dedicated to the current integer compression unit, the current point prediction information table and the historical point prediction information table are merged as follows to generate a new historical point prediction information table: firstly, the current point prediction information table is put into the new historical point prediction information table to occupy the front part of the new historical point prediction information table; and then, the parameters of the point vectors which are not multiplexed by the current whole compression unit in the historical point prediction information table are put into the new historical point prediction information table to occupy the rear part of the new historical point prediction information table.

The present invention is applicable to encoding and decoding for lossy compression of data, and is also applicable to encoding and decoding for lossless compression of data. 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 lossy compression, the values of the elements on the original constant value string before encoding are allowed to differ, but the difference is less than a predetermined threshold.

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

One-dimensional data;

two-dimensional data;

multidimensional data;

a graph;

dimension division graphics;

an image;

a sequence of images;

video;

audio frequency;

a file;

a byte;

a bit;

a pixel;

a three-dimensional scene;

a sequence of continuously changing three-dimensional scenes;

a virtual reality scene;

sequence of scenes of continuously changing virtual reality

An image in the form of pixels;

transform domain data of the image;

a set of bytes in two or more dimensions;

a set of bits in two or more dimensions;

a set of pixels;

a set of single component pixels;

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

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

a set of three-component pixels (Y, Cb, Cr);

a set of three-component pixels (Y, Cg, Co);

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

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

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

a set of four component pixels (Y, Cb, Cr, A);

a set of four component pixels (Y, Cg, Co, a).

The technical features of the present invention are explained above by specific embodiments. Other advantages and effects of the present invention will be readily apparent to those skilled in the art from the disclosure herein. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention.

In conclusion, the invention has the following beneficial effects:

the invention relates to a data coding and decoding method and a device for multiplexing point vectors by using a historical point prediction information table, which add and store parameters of partial point vectors or all point vectors used in a current compression unit into the historical point prediction information table for repeated use of a subsequent whole compression unit, solve the problems that in the prior point prediction technology, a common position and a point vector of the common position and the point vector of the point vector in the whole compression unit are only used in the current whole compression unit, and the common position and the point vector with the same element value need to retransmit the element value by compressing a data code stream if the common position and the point vector of the point vector appear in the subsequent whole compression unit, and remarkably improve the coding efficiency of the point prediction technology.

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.

The invention provides a data coding method for multiplexing point vectors by using a historical point prediction information table, which at least comprises the following steps:

step 2: the point vector used by any one whole compression unit of point prediction coding is called a multiplexing point vector from the historical point prediction information table or is called a new point vector not in the historical point prediction information table;

the point vector used by any one whole compression unit of point prediction coding is called a multiplexing point vector from the historical point prediction information table or is called a new point vector not in the historical point prediction information table;

A data decoding apparatus for multiplexing point vectors using a historical point prediction information table, said decoding apparatus comprising at least modules capable of performing the following functions and operations:

Example 1

The whole compression unit includes a macroblock, 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 transform block, a transform unit TU, a sub-region of the TU, or a sub transform unit SubTU.

Example 2

The parameters of the point vector comprise at least one or more dimensional coordinates of the common location represented by the point vector in a predetermined one or more dimensional area.

Example 3

The parameters of all point vectors used in the whole compression unit are stored in a point prediction information table special for the whole compression unit, the point prediction information table is composed of two parts, the first part stores the parameters of the multiplexing point vector or is empty, and the second part stores the parameters of the new point vector or is empty.

Example 4

In the above encoding method or decoding method, for example, the original data includes an image, a sequence of images, an array or a sequence of arrays of two-dimensional data elements of a video, and the data is an array or a sequence of arrays of two-dimensional data elements in a 420-sample format, and has a primary component F and two secondary components D and E.

For a new point vector, the predetermined rules include at least:

if the frequently-occurring position represented by the new point vector is the main component positive position, the element numerical values of the main component and the secondary component exist in the compressed data code stream; otherwise, the element value of the main component exists in the compressed data code stream;

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

for a new point vector, the predetermined rules include at least:

the element values of the principal components of the frequently occurring positions represented by the new point vectors always exist in the compressed data code stream; and if the current position represented by the new point vector is the primary component positive position, the element values of the secondary component of the current position represented by the new point vector also exist in the compressed data code stream.

Example 5

In the encoding method or the encoding device or the decoding method or the decoding device, when encoding or decoding a current integer compression unit, on one hand, the parameters of the multiplexing point vector are taken out from the historical point prediction information table and are put into a current point prediction information table special for the current integer compression unit, and the multiplexing point vector is marked as being multiplexed in the historical point prediction information table; on the other hand, the parameters of the new point vector are put into the current point prediction information table;

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

in the encoding method or the encoding apparatus or the decoding method or the decoding apparatus, in a process of taking out a parameter of a multiplexed point vector from the history point prediction information table and putting the parameter into a current point prediction information table dedicated to the current entire compression unit, the multiplexed point vector is selected and taken out using a difference between an address or an index of the multiplexed point vector in the history point prediction information table and an address or an index of a previous multiplexed point vector in the history point prediction information table;

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

in the encoding method or the encoding apparatus or the decoding method or the decoding apparatus, after parameters of all point vectors used in one current whole compression unit are put into a current point prediction information table dedicated to the current whole compression unit, the current point prediction information table and the historical point prediction information table are combined according to the following mode to generate a new historical point prediction information table:

on one hand, the current point prediction information table is put into the new historical point prediction information table and occupies one part of the new historical point prediction information table;

on the other hand, the parameters of the point vectors in the history point prediction information table that are not multiplexed by the current full compression unit are put in the new history point prediction information table and occupy another part of the new history point prediction information table.

Example 6

In the encoding method or encoding apparatus or decoding method or decoding 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,

taking out the parameters of the multiplexing point vector from the history point prediction information table composed of PrevPpInfoList, PrevFopYonly, PrevEvsDpbIndex, PrevEvsDpbReactivatedYonly, PrevCompLumaFreqOccurPos, and putting the parameters into a syntax description table of the process in the current point prediction information table composed of PpInfoList, FopYonly, EvsDpbIndex, EvDpbReactivatedYonly and CompLumaFreQOccurPos which is dedicated for the current integer compression unit, wherein the syntax description table at least comprises the following steps:

in the above syntax description table, isc _ num _ of _ reused _ pv and isc _ prev _ pv _ not _ reused _ run are syntax elements present in the codestream; IscNumOfReusedPv and IscPrevPvNotReusedRun are the values of isc _ num _ of _ reused _ pv and isc _ prev _ pv _ not _ reused _ run, respectively;

preferably, in the encoding method or encoding apparatus or decoding method or decoding 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,

for a new point vector, the predetermined rules include at least: the element values of the principal components of the frequently occurring positions represented by the new point vectors always exist in the compressed data code stream; if the current position represented by the new point vector is the main component positive position, the element numerical value of the secondary component of the current position represented by the new point vector also exists in the compressed data code stream; the syntax description table of the predetermined rule at least includes:

in the above syntax description table, isc _ pixel _ y, isc _ pixel _ cb, and isc _ pixel _ cr are syntax elements present in the code stream; IscFopixelY, IscFopixelCb, and IscFopixelCr are the values of isc _ fopixely, isc _ fopixelcb, and isc _ fopixelcr, respectively;

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

after parameters of all point vectors used in a current integer compression unit are placed in a current point prediction information table composed of PpInfoList, FopYonly, EvsDpbIndex, EvsDpbreactivedYonly and CompuleFreQOccurPos dedicated to the current integer compression unit, merging the current point prediction information table with a historical point prediction information table composed of PrevPpInfoList, PrevFopYonly, PrevEvsDpbIndex, PrevEvsDpbreactivetdyYonly and PrevCompuleFreQOccurPos, and generating a new historical point prediction information table at least comprises the following operations:

let PrevPvBufSize equal the total number of point vectors in the history point prediction information table, PvBufSize equal the total number of point vectors in the current point prediction information table, tmppVBuf [ I ], tmpFag [ I ], tmpevsDpbIndex [ I ], tmpevsDpbReactitedYonly [ I ], and tmppCompLumaFreqOccurPos [ I ] (I ═ 0 to I-1) be point prediction information temporary buffers, and perform a merge operation at least in the manner indicated in the following table:

the above I is the upper limit of the number of point vectors that can be stored in PrevPpInfoList.

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

1. A data encoding method for multiplexing point vectors using a history point prediction information table, characterized by comprising at least the steps of:

and step 3: and for the new point vector, at least element values of the primary component and/or the secondary component determined according to a preset rule exist in the compressed data code stream, and the element values at the frequently-existing position represented by the new point vector are written into the compressed data code stream according to the preset rule.

2. A data encoding apparatus for multiplexing point vectors using a history point prediction information table, characterized in that the data encoding apparatus comprises at least modules capable of realizing the following functions and operations;

and for the new point vector, at least element values of the primary component and/or the secondary component determined according to a preset rule exist in the compressed data code stream, and the element values at the frequently-existing position represented by the new point vector are written into the compressed data code stream according to the preset rule.

3. A data decoding method for multiplexing point vectors using a history point prediction information table, the decoding method comprising at least the steps of:

point vectors used by any whole compression unit of point prediction decoding are called multiplexing point vectors from the historical point prediction information table or are not in the historical point prediction information table and are called new point vectors;

4. Data decoding apparatus for multiplexing point vectors using a table of historical point prediction information, said decoding apparatus comprising at least modules capable of performing the following functions and operations:

5. The method or apparatus of claim 3 or 4, wherein the original data is a sequence comprising an image, a sequence of images, an array or array of two-dimensional data elements of a video, and the whole compression unit comprises a macroblock, a coding unit CU, a sub-region of a CU, a sub-coding unit SubCU, a prediction block, a prediction unit PU, a sub-region of a PU, a sub-prediction unit SubPU, a transform block, a transform unit TU, a sub-region of a TU, or a sub-transform unit SubTU.

6. The method or apparatus for decoding data using a table of historical point prediction information to multiplex a point vector according to claim 3 or 4, wherein the parameters of the point vector include at least one-dimensional or multi-dimensional coordinates of a current position represented by the point vector in a predetermined one-dimensional or multi-dimensional region.

7. The method or apparatus for decoding data of a multiplexed point vector using a history point prediction information table according to claim 3 or 4, wherein the parameters of all the point vectors used in the integer compression unit are stored in a point prediction information table dedicated to the integer compression unit, and the point prediction information table is composed of two parts, the first part stores the parameters of the multiplexed point vector or is empty, and the second part stores the parameters of the new point vector or is empty.

8. The method or apparatus of claim 3 or 4, wherein the original data is a sequence of two-dimensional data elements including images, sequences of images, and videos, and the data is a sequence of two-dimensional data elements or arrays of two-dimensional data elements in 420-sample format, and the decoding method or apparatus has a primary component F and two secondary components D and E;

also comprises the following steps of (1) preparing,

for a new point vector, if the current position represented by the new point vector is the main component positive position, the element values of the main component and the secondary component exist in the compressed data code stream, otherwise, the element values of the main component exist in the compressed data code stream;

or,

for a new point vector, the element value of the principal component of the current position represented by the new point vector always exists in the compressed data code stream; and if the current position represented by the new point vector is the primary component positive position, the element values of the secondary component of the current position represented by the new point vector also exist in the compressed data code stream.

9. The method or apparatus for decoding data using a historical point prediction information table multiplexing point vector according to claim 3 or 4, wherein the method or apparatus comprises one or any combination of the following features,

the method is characterized in that:

when a current integral compression unit is coded or decoded, on one hand, the parameters of a multiplexing point vector are taken out from a history point prediction information table and are put into a current point prediction information table special for the current integral compression unit, and the multiplexing point vector is marked as being multiplexed in the history point prediction information table; on the other hand, the parameters of the new point vector are put into the current point prediction information table;

and (2) feature:

in the process of taking out the parameters of the multiplexing point vector from the historical point prediction information table and putting the parameters into a current point prediction information table special for the current whole compression unit, selecting and taking out the multiplexing point vector by using the difference between the address or index of the multiplexing point vector in the historical point prediction information table and the address or index of the previous multiplexing point vector in the historical point prediction information table;

and (3) feature:

after parameters of all point vectors used in a current whole compression unit are put into a current point prediction information table special for the current whole compression unit, merging the current point prediction information table and the historical point prediction information table according to the following mode to generate a new historical point prediction information table;

10. The method or apparatus for decoding data using a historical point prediction information table multiplexing point vector according to claim 3 or 4, wherein the method or apparatus comprises one or any combination of the following features,

the method is characterized in that:

in the decoding method or the decoding apparatus, the original data is a sequence including a picture, a sequence of pictures, an array or an array of two-dimensional data elements of a video, the parameter of the multiplexing point vector is taken out from the history point prediction information table composed of prevpplnfolist, prevfoppyonly, prevevsddpreptactedyony, prevcomplumimafreqoccrpos, and the syntax description table of the procedure placed in the current point prediction information table composed of pplnfolist, foppyony, EvsDpbIndex, evsddpreactivedastedyony, and complumefqoccrpos dedicated to the current integral compression unit at least includes:

if (PrevPvBufSize >0& & IscNumOfNewPv <15)// there is a point vector available for multiplexing

isc _ num _ of _ reused _ PV// number of Point Vectors (PV) multiplexed in the current full compression unit

for (k ═ 0; PvNum < IscNumOfReusedPv; k + + {// cycle to fetch and put the reuse PV

isc _ prev _ PV _ not _ reused _ run// difference between addresses of current and previous multiplexed PVs

k + -/set k to the address of the current multiplex PV in PrevPpNotReusedRun// PrevPpInfoList

PpInfoList [ PvNum ] [0] ═ PrevPpInfoList [ k ] [0]// PV parameter 1: horizontal component of PV

PpInfoList [ PvNum ] [1] ═ PrevPpInfoList [ k ] [1]// PV parameter 2: vertical component of PV

FopYonly [ PvNum ] ═ PrevFopYonly [ k ]// PV parameter 3: whether the current location has only principal components

EvsDpbIndex [ PvNum ] ═ PrevEvsDpbIndex [ k ]// PV parameter 4: state parameter of PV

EvsDpbreactedYonly [ PvNum ] -/PrevEvsDpbreactedYonly [ k ]// parameter 5

CompLumaFreqOccurPos [ PvNum ] ═ PrevCompLumaFreqOccurPos [ k ]// parameter 6

PvNum + +// setting PvNum to the address in PpInfoList where the parameter for the next PV is stored

PrevPpInfoList [ k ] [0] ═ -1// mark the fetched dot vectors in PrevPpInfoList as multiplexed

PrevPpInfoList [ k ] [1] -1// marking the fetched point vector as multiplexed in PrevPpInfoList }

and (2) feature:

in the decoding method or the decoding 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,

if (PvType [ i ] ═ 1| | | PvType [ i ] ═ 3) {// there is a new point vector and its current location

isc _ fopixel _ y// compressed data stream there is always a value of the element of the principal component in the stream

LcuRowBufY [ PpInfoList [ PvAddr [ NumCoded Pixel ] ] [0] ] [ PpInfoList [ PvAddr [ NumCoded Pixel ] ] [1] ] [ IscFopixelY// storing element values of principal components in the current positions

}

if (PvType [ i ] ═ 2| | | PvType [ i ] ═ 3) {// the current position is the principal component normal position

Element values of a secondary component also exist in the isc _ fopixel _ cb// compressed data code stream

The elementary values of the secondary component also exist in the isc _ fopixel _ cr// compressed data code stream

LcuRowBufU [ PpInfoList [ PvAddr [ NumCodPixel ] ] [1] > >1] - [ IscFopixelCb// storing the element values of the minor components in the common position

}

and (3) feature:

in the decoding method or the decoding apparatus, 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,

tmpIndex＝0；

for (k ═ 0; k < PrevPvBufSize; k + + {// temporarily storing the unused PV in PrevPpInfoList in tmppVBuf

if(PrevPpInfoList[k][0]！＝-1&&PrevPpInfoList[k][1]！＝-1){

tmpPvBuf [ tmptindex ] [0] ═ PrevPpInfoList [ k ] [0]// PV parameter 1: horizontal component of PV

tmpPvBuf [ tmplndex ] [1] ═ PrevPpInfoList [ k ] [1]// PV parameter 2: vertical component of PV

tmpFlag [ tmpIndex ] ═ prevfopnyonly [ k ]// PV parameter 3: whether the current location has only principal components

tmpevsddpbindex [ tmpIndex ] ═ prevevsddpbindex [ k ]// PV parameter 4: state parameter of PV

tmpevsdpbreactivedyonoly [ tmpIndex ] ═ prevevsdpbreactivedyonoly [ k ]// parameter 5

tmpcplumefeqcucurpos [ tmpIndex ] ═ prevcomp lumefuqucurpos [ k ]// parameter 6

tmpIndex++

}

PrevPvBufSize＝Min(I,PvNum+tmpIndex)

for(k＝0；k<PrevPvBufSize；k++){

if (k < PvBufSize) {// Place PpInfoList first in the front part of PrevPpInfoList

PrevPpInfoList [ k ] [0] ═ PpInfoList [ k ] [0]// PV parameter 1: horizontal component of PV

PrevPpInfoList [ k ] [1] ═ PpInfoList [ k ] [1]// PV parameter 2: vertical component of PV

Prevfoplonly [ k ] ═ foplonly [ k ]// PV parameter 3: whether the current location has only principal components

PrevEvsDpbIndex [ k ] ═ EvsDpbIndex [ k ]// PV parameter 4: state parameter of PV

PrevEdpbreactivedYonly [ k ] -/parameter 5

PrevCompLumaFreqOccurPos [ k ] ═ CompLumaFreqOccurPos [ k ]// parameter 6

}

else {// then put tmpPvBuf in the latter part of PrevPpInfoList

PrevPpInfoList [ k ] [0] ═ tmpPvBuf [ k-PvNum ] [0]// PV parameter 1: horizontal component of PV

PrevPpInfoList [ k ] [1] ═ tmpPvBuf [ k-PvNum ] [1]// PV parameter 2: vertical component of PV

Prevfopnyonly [ k ] ═ tmpFlag [ k-PvNum ]// PV parameter 3: whether the current location has only principal components

PrevEvsDpbIndex [ k ] ═ tmpEvsDpbIndex [ k-PvNum ]// PV parameter 4: state parameter of PV

PrevEvsDpbreactivedYonly [ k ] ═ tmpevsDpbreactivedYonly [ k-PvNum ]// parameter 5

PrevCompLumaFreqOccurPos [ k ] ═ tmpompLumaFreqOccurPos [ k-PvNum ]// parameter 6

}