CN115134605A - Image encoding and decoding method and device using limited universal string prediction encoding mode - Google Patents
Image encoding and decoding method and device using limited universal string prediction encoding mode Download PDFInfo
- Publication number
- CN115134605A CN115134605A CN202210543875.0A CN202210543875A CN115134605A CN 115134605 A CN115134605 A CN 115134605A CN 202210543875 A CN202210543875 A CN 202210543875A CN 115134605 A CN115134605 A CN 115134605A
- Authority
- CN
- China
- Prior art keywords
- string
- prediction
- compression unit
- universal
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 238000007906 compression Methods 0.000 claims abstract description 156
- 230000006835 compression Effects 0.000 claims abstract description 156
- 238000005070 sampling Methods 0.000 description 15
- 238000013144 data compression Methods 0.000 description 7
- 230000004048 modification Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses an image coding and decoding method and device using a limited universal string prediction coding mode, wherein the coding method comprises the following steps: and encoding an unpredictable element string presence flag or a coordinate string presence flag, if the unpredictable element string presence flag or the value of the coordinate string presence flag indicates that an unpredictable element string or a coordinate string is present in the current entire compression unit, encoding the coordinate string presence flag or the unpredictable element string presence flag, otherwise, not encoding the coordinate string presence flag or the unpredictable element string presence flag and setting the value of the coordinate string presence flag or the unpredictable element string presence flag to a default value, the default value indicating that a coordinate string or an unpredictable element string is present in the current entire compression unit. The method of the invention carries out conditional coding on the coordinate string existence mark and the unpredictable element string existence mark of the whole compression unit of the limited universal string predictive coding mode, reduces the required bit number, improves the coding efficiency and has wide application prospect.
Description
Technical Field
The invention relates to the technical field of image coding and decoding, in particular to a coding and decoding method and a device for compressing images and videos by adopting universal string prediction, and particularly relates to a coding and decoding method and a device for conditionally coding a coordinate string existence mark and an unpredictable element string existence mark of a whole compression unit in a limited universal string prediction coding mode, and application thereof.
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 sequence data, i.e. video data, and various new-state data, such as data including mixed video (including image, i.e. single frame video) content of computer-generated content and photoelectric sensor-captured content.
A data set is a set of data elements (e.g., bytes, bits, pixels, pixel components, spatial sampling points, transform domain coefficients).
In data compression, an encoder encodes an input data set, also called an original data set, to generate a compressed data code stream; and the decoder decodes the compressed data code stream to generate an output data set and also constructs a data set or reconstructs the data set. Compression in which the input data set is identical to the output data set, i.e. without distortion, is called lossless compression. Compression in which the input data set is not identical to the output data set, i.e., distorted, is referred to as lossy compression.
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 generally 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 rate of each component 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 2M × 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 (horizontal M component elements, vertical N component elements), i.e., the D and E components of the data set 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 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 universal string prediction, also known as universal string matching. The general string prediction divides an element of a current whole compression unit into element strings with variable length after being arranged according to a preset scanning mode, and obtains a reference element string, called a reference string or a prediction string or a matching string of the current string, which has the same or similar numerical value with the current string, in a set or a subset of elements called a reference set and subjected to coding and decoding with preset degree, wherein the set or the subset is a current string for short. For a reference string of a current string, only a plurality of coding 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 the purpose of data compression is achieved.
For example, if a current string ordered according to a predetermined scanning manner can find a corresponding reference string in a reference set, only two encoding parameters, namely, the position relationship between the first element, i.e., the starting element, of the current string and the first element, i.e., the starting element, of the reference string and the string length (the number of elements in the string) need to be used to record the position and size of the reference string in the reference set, and the numerical value of each element in the current string itself does not need to be recorded one by one, so that all elements of the current string and the numerical value thereof can be completely represented. The number of bits consumed by recording the two encoding 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.
In general string prediction, unpredictable elements may also be present in 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.
Scanning methods often used in generic 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 alternatively
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 element by one element 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. The horizontal raster scan and the horizontal back-and-forth scan are collectively called a horizontal scan, and the vertical raster scan and the vertical back-and-forth scan are collectively called a vertical scan.
There is a limited universal string prediction coding mode in the universal string prediction, and the whole compression unit of the coding mode only allows the following three strings:
a coordinate string, wherein the reference elements of all current elements on one string are the same element in the reference set, and the position of the reference element in the reference set is represented by using an image coordinate;
strings of unpredictable elements, a string consisting of one or more unpredictable elements; the unpredictable element is the current element without reference element, the encoder writes its value into the compressed data code stream according to the predetermined mode, convey to the demoder;
the upper string is copied with the reference elements of all current elements on the string located directly above (in the case of horizontal scanning) or directly to the left (in the case of vertical scanning) the current element, and with the reference elements all inside the current integer compression unit.
In the prior art, when a whole compression unit of a limited universal string prediction coding mode is coded, the following two syntax elements with flags are always written into the initial part of the whole compression unit code stream, i.e. header information: 1) the general string prediction coordinate string existence mark indicates whether a coordinate string exists in the whole compression unit of the current limited general string prediction coding mode; 2) the general string prediction unpredictable element string existence flag indicates whether an unpredictable pixel string exists in the entire compression unit of the current limited general string prediction encoding mode.
However, in reality, in the entire compression unit of the limited general string prediction coding mode, the case where the two presence flags indicate that neither string is present has no practical meaning. In the prior art, the two code words with the marks are still distributed for coding under the condition without practical significance, so that the number of bits which are not consumed is wasted, and the coding efficiency is reduced.
Therefore, it is very practical to develop a method for conditionally encoding the coordinate string presence flag and the unpredictable element string presence flag of the entire compression unit of the limited general string prediction coding mode to improve the coding efficiency.
Disclosure of Invention
Because the prior art has the defects, the invention provides the coding and decoding method and the device for conditionally coding the coordinate string existence mark and the unpredictable element string existence mark of the whole compression unit of the limited universal string prediction coding mode, and overcomes the defects that the coordinate string existence mark and the unpredictable element string existence mark need to be coded in any state of the prior art, the data processing waste is caused, and the coding efficiency is greatly reduced.
In order to achieve the above object, the present invention provides the following technical solutions:
the present invention first encodes an unpredictable element string presence flag (or first encodes a coordinate string presence flag), further encodes a coordinate string presence flag (or an unpredictable element string presence flag) if the value of the unpredictable element string presence flag (or the coordinate string presence flag) indicates that an unpredictable element string (or a coordinate string) is present in the current entire compression unit, and otherwise, does not encode the coordinate string presence flag (or the unpredictable element string presence flag) and sets the value of the coordinate string presence flag (or the unpredictable element string presence flag) to a default value indicating that a coordinate string (or an unpredictable element string) is present in the current entire compression unit. Under the condition that the unpredictable element string (or the coordinate string) does not exist in the current whole compression unit, the invention reduces the existence marks written into the compressed data code stream from two to one, thereby reducing the number of bits required to be consumed by 50 percent and effectively improving the coding efficiency.
In a first aspect, the present invention provides a method for encoding a whole compression unit in a generic string prediction coding mode, comprising at least the following steps:
(1) inputting data of at least one whole compression unit;
(2) performing universal string prediction coding, and at least writing an unpredictable element string existence mark of universal string prediction into a compressed data code stream;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, writing the coordinate string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the coordinate string existence mark of the universal string prediction into the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) and at least outputting a compressed data code stream including information representing the unpredictable element string existence flag.
In a second aspect, the present invention provides a method for encoding a whole compression unit in a generic string prediction coding mode, comprising at least the following steps:
(1) inputting data of at least one whole compression unit;
(2) carrying out universal string prediction coding, and at least writing the coordinate string existence mark of the universal string prediction into a compressed data code stream;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, writing an unpredictable element string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the unpredictable element string existence mark of the universal string prediction into the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) and at least outputting a compressed data code stream including information indicating the coordinate string existence flag.
In a third aspect, the present invention provides a method for decoding a whole compression unit in a generic string prediction coding mode, comprising at least the following steps:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing a compressed data code stream, and at least obtaining an unpredictable element string existence mark of universal string prediction;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, analyzing the compressed data code stream to obtain a coordinate string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstructed elements are output.
In a fourth aspect, the present invention provides a method for decoding an entire compressed unit in a generic string prediction coding mode, comprising at least the following steps:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining a coordinate string existence mark of the universal string prediction;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, analyzing the compressed data code stream to obtain an unpredictable element string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstruction elements are output.
Preferably, the original data and the whole compression unit related to the above four aspects are as follows:
the raw data is a sequence comprising an image, a sequence of images, an array or array of two-dimensional data elements of a video;
the whole compression unit comprises one or a combination of the following coding units: macroblock, coding unit CU, sub-region of CU, sub-coding unit SubCU, prediction block, prediction unit PU, sub-region of PU, sub-prediction unit SubPU, transform block, transform unit TU, sub-region of TU, sub-transform unit SubTU.
Preferably, the non-predictable element string existence flag of the general string prediction and the coordinate string existence flag of the general string prediction are syntax elements respectively denoted as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, which are described in the following order and relationship in the syntax description definition table of the compressed data stream of the entire compression unit of the general string prediction coding mode:
the semantic description of the syntax element is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcolorstpresentflag is equal to the value of usp _ coor _ str _ present _ flag; if usp _ color _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcolorstpresentflag is a second predetermined value;
unpredictable pixel presence flag of general string prediction, usp _ unpredictable _ pixel _ str _ present _ flag
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the entire compression unit of the current generic string prediction coding mode; the value of the variable uspupnp pixelstrpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
The invention provides a coding device of a whole compression unit of a universal serial prediction coding mode, which comprises a module for realizing the coding method of the whole compression unit of the universal serial prediction coding mode.
Specifically, it has two schemes:
in the first scheme, the coding device at least comprises modules for completing the following functions and operations:
(1) inputting data of at least one whole compression unit;
(2) performing universal string prediction coding, and at least writing an unpredictable element string existence mark of universal string prediction into a compressed data code stream;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, further writing the coordinate string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the coordinate string existence mark of the universal string prediction into the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) at least a compressed data code stream including information indicating the existence of the unpredictable element string is output.
And the encoding device at least comprises modules for completing the following functions and operations:
(1) inputting data of at least one whole compression unit;
(2) carrying out universal string prediction coding, and at least writing the coordinate string existence mark of the universal string prediction into a compressed data code stream;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, further writing an unpredictable element string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the unpredictable element string existence mark of the universal string prediction into the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) and at least outputting a compressed data code stream including information indicating the coordinate string existence flag.
The invention provides a decoding device of a whole compression unit of a general string prediction coding mode, which comprises a module for realizing the decoding method of the whole compression unit of the general string prediction coding mode.
Specifically, it has two schemes:
in the first aspect, the decoding apparatus includes at least modules that perform the following functions and operations:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing a compressed data code stream, and at least obtaining an unpredictable element string existence mark of universal string prediction;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, further analyzing the compressed data code stream to obtain a coordinate string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstruction elements are output.
And the decoding device at least comprises modules for completing the following functions and operations:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining a coordinate string existence mark of the universal string prediction;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, further analyzing the compressed data code stream to obtain an unpredictable element string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstruction elements are output.
The present invention also provides an electronic device comprising a processor and a memory, the memory having stored therein at least one instruction, at least one program, set of codes, or set of instructions, the at least one instruction, the at least one program, the set of codes, or the set of instructions being loaded and executed by the processor to implement any one of the following methods:
the method for encoding or decoding the whole compression unit of the general string prediction coding mode is described above.
Furthermore, the present invention also provides a computer-readable storage medium having stored therein at least one instruction, at least one program, set of codes, or set of instructions, which is loaded by a processor and executes any one of the following methods:
the method for encoding or decoding the whole compression unit of the generic string prediction coding mode as described above.
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 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;
an image in the form of sequential pixels of a scene of continuously changing virtual reality;
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.
Detailed Description
The present invention will be further described with reference to specific examples, but the present invention is not limited thereto.
The following units and the like involved in the method and apparatus are specifically as follows:
the raw data is a sequence comprising an image, a sequence of images, an array or array of two-dimensional data elements of a video;
the whole compression unit comprises one or a combination of the following coding units: macroblock, coding unit CU, sub-region of CU, sub-coding unit SubCU, prediction block, prediction unit PU, sub-region of PU, sub-prediction unit SubPU, transform block, transform unit TU, sub-region of TU, sub-transform unit SubTU.
Example 1
A method for encoding an entire compression unit in a universal string prediction coding mode, comprising the steps of:
(1) inputting data of at least one whole compression unit;
(2) performing general string prediction coding, and at least writing an unpredictable element string existence mark of general string prediction into a compressed data code stream;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, writing the coordinate string existence mark of the universal string prediction into the compressed data code stream, otherwise, not writing the coordinate string existence mark of the universal string prediction into the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) outputting at least a compressed data code stream including information indicating that the unpredictable element string exists;
wherein, the unpredictable element string existence flag of the general string prediction and the coordinate string existence flag of the general string prediction are syntax elements respectively marked as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, and are recorded in the syntax description definition table of the compressed data code stream of the whole compression unit of the general string prediction coding mode in the following order and relationship:
the semantic description of the syntax elements is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcolorstpresentflag is equal to the value of usp _ coor _ str _ present _ flag; if usp _ color _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcolorstpresentflag is a second predetermined value;
unpredictable pixel presence flag of general string prediction, usp _ unpredictable _ pixel _ str _ present _ flag
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the variable uspupnp pixelstrpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
Example 2
A method for encoding an entire compression unit in a universal string prediction coding mode, comprising the steps of:
(1) inputting data of at least one whole compression unit;
(2) carrying out universal string prediction coding, and at least writing the coordinate string existence mark of the universal string prediction into a compressed data code stream;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, writing the unpredictable element string existence mark of the universal string prediction into the compressed data code stream, otherwise, not writing the unpredictable element string existence mark of the universal string prediction into the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) outputting at least a compressed data code stream including information indicating a coordinate string existence flag;
wherein, the unpredictable element string existence flag of the general string prediction and the coordinate string existence flag of the general string prediction are syntax elements respectively marked as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, and are recorded in the syntax description definition table of the compressed data code stream of the whole compression unit of the general string prediction coding mode in the following order and relationship:
the semantic description of the syntax elements is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcolorstpresentflag is equal to the value of usp _ coor _ str _ present _ flag; if usp _ co _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcoorstpresentflag is a second predetermined value;
unpredictable pixel presence flag of general string prediction, usp _ unpredictable _ pixel _ str _ present _ flag
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the variable uspupnp pixelstrpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
Example 3
A method for decoding an entire compression unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining an unpredictable element string existence mark of the universal string prediction;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, analyzing the compressed data code stream to obtain a coordinate string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) outputting at least a reconstruction element;
wherein, the unpredictable element string existing flag of the general string prediction and the coordinate string existing flag of the general string prediction are syntax elements respectively marked as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, and are recorded in the syntax description definition table of the compressed data code stream of the whole compression unit of the general string prediction coding mode in the following order and relation:
the semantic description of the syntax elements is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcolorstpresentflag is equal to the value of usp _ coor _ str _ present _ flag; if usp _ color _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcolorstpresentflag is a second predetermined value;
unpredictable pixel presence flag usp _ unpredictable _ pixel _ str _ present _ flag for general string prediction
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the variable uspupnp pixelstrpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
Example 4
A method for decoding an entire compression unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining a coordinate string existence mark of the universal string prediction;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, analyzing the compressed data code stream to obtain an unpredictable element string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) outputting at least a reconstruction element;
wherein, the unpredictable element string existing flag of the general string prediction and the coordinate string existing flag of the general string prediction are syntax elements respectively marked as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, and are recorded in the syntax description definition table of the compressed data code stream of the whole compression unit of the general string prediction coding mode in the following order and relation:
the semantic description of the syntax elements is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcolorstpresentflag is equal to the value of usp _ coor _ str _ present _ flag; if usp _ color _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcolorstpresentflag is a second predetermined value;
unpredictable pixel presence flag of general string prediction, usp _ unpredictable _ pixel _ str _ present _ flag
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the whole compression unit of the current general string prediction coding mode; the value of the variable uspupnp pixelstrpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
Example 5
An apparatus for encoding a global compression unit in a global string prediction coding mode, comprising means for implementing the method for encoding a global compression unit in a global string prediction coding mode according to embodiment 1.
Example 6
An apparatus for encoding a global compression unit in a global string prediction coding mode, comprising means for implementing the method for encoding a global compression unit in a global string prediction coding mode according to embodiment 2.
Example 7
An apparatus for decoding an integer compression unit of a generic string prediction coding mode, comprising means for implementing the method for decoding an integer compression unit of a generic string prediction coding mode as described in embodiment 3.
Example 8
An apparatus for decoding an integer compression unit of a generic string prediction coding mode, comprising means for implementing the method for decoding an integer compression unit of a generic string prediction coding mode as described in embodiment 4.
Example 9
An electronic device comprising a processor and a memory, the memory having at least one instruction, at least one program, code set, or set of instructions stored therein, the at least one instruction, at least one program, code set, or set of instructions being loaded and executed by the processor to implement the method of encoding a whole compressed unit of a generic string prediction encoding mode as described in embodiment 1.
Example 10
An electronic device comprising a processor and a memory, the memory having stored therein at least one instruction, at least one program, code set, or set of instructions, the at least one instruction, at least one program, code set, or set of instructions being loaded and executed by the processor to implement the method of encoding a whole compression unit for a universal string prediction encoding mode as described in embodiment 2.
Example 11
An electronic device comprising a processor and a memory, the memory having stored therein at least one instruction, at least one program, code set, or set of instructions, the at least one instruction, at least one program, code set, or set of instructions being loaded and executed by the processor to implement the method of decoding an entire compression unit for a generic string prediction encoding mode as described in embodiment 3.
Example 12
An electronic device comprising a processor and a memory, the memory having stored therein at least one instruction, at least one program, code set, or set of instructions, the at least one instruction, at least one program, code set, or set of instructions being loaded and executed by the processor to implement the method of decoding an entire compression unit for a generic string prediction coding mode as described in embodiment 4.
Example 13
A computer readable storage medium having stored therein at least one instruction, at least one program, code set, or set of instructions, which is loaded by a processor and which performs the method of encoding an entire compression unit for a generic string prediction coding mode as described in embodiment 1.
Example 14
A computer readable storage medium having stored therein at least one instruction, at least one program, code set, or set of instructions that is loaded by a processor and that performs a method for encoding an entire compression unit for a generic string prediction encoding mode as described in embodiment 2.
Example 15
A computer readable storage medium having stored therein at least one instruction, at least one program, code set, or set of instructions that is loaded by a processor and that performs a method for decoding an entire compression unit for a generic string prediction coding mode as described in embodiment 3.
Example 16
A computer readable storage medium having stored therein at least one instruction, at least one program, code set, or set of instructions that is loaded by a processor and that performs a method for decoding an entire compression unit for a generic string prediction coding mode as described in embodiment 4.
It should be understood by those skilled in the art that the above embodiments may be combined with the prior art to realize the modifications, and the detailed description is omitted here. Such variations do not affect the essence of the present invention and are not described herein.
The above description is that of the preferred embodiment of the present invention. It is to be understood that the invention is not limited to the particular embodiments described above, in that devices and structures not described in detail are understood to be implemented in a manner common in the art; those skilled in the art can make many possible variations and modifications to the disclosed embodiments, or modify equivalent embodiments to equivalent variations, without departing from the spirit of the invention, using the methods and techniques disclosed above. Therefore, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present invention are still within the scope of the protection of the technical solution of the present invention, unless the contents of the technical solution of the present invention are departed.
Claims (10)
1. A method for encoding a whole compression unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting data of at least one whole compression unit;
(2) performing universal string prediction coding, and at least writing an unpredictable element string existence mark of universal string prediction into a compressed data code stream;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, writing the coordinate string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the coordinate string existence mark of the universal string prediction into the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) and at least outputting a compressed data code stream including information representing the unpredictable element string existence flag.
2. A method for encoding a whole compression unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting data of at least one whole compression unit;
(2) carrying out universal string prediction coding, and at least writing the coordinate string existence mark of the universal string prediction into a compressed data code stream;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, writing an unpredictable element string existence mark of the universal string prediction into a compressed data code stream, otherwise, not writing the unpredictable element string existence mark of the universal string prediction into the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) and at least outputting a compressed data code stream including information indicating the coordinate string existence flag.
3. A method for decoding a whole compressed unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining an unpredictable element string existence mark of the universal string prediction;
(3) if the value of the unpredictable element string existence mark of the universal string prediction indicates that the unpredictable pixel string exists in the current whole compression unit, analyzing the compressed data code stream to obtain a coordinate string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the coordinate string existence mark of the universal string prediction as a default value, wherein the default value indicates that the coordinate string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstruction elements are output.
4. A method for decoding a whole compressed unit in a generic string prediction coding mode, comprising the steps of:
(1) inputting at least one compressed data code stream of an integral compression unit;
(2) performing universal string prediction decoding, at least analyzing the compressed data code stream, and at least obtaining a coordinate string existence mark of the universal string prediction;
(3) if the value of the coordinate string existence mark of the universal string prediction indicates that the coordinate string exists in the current whole compression unit, analyzing the compressed data code stream to obtain an unpredictable element string existence mark of the universal string prediction, otherwise, not analyzing the compressed data code stream and setting the value of the unpredictable element string existence mark of the universal string prediction as a default value, wherein the default value indicates that the unpredictable element string of the universal string prediction exists in the current whole compression unit;
(4) at least the reconstructed elements are output.
5. The decoding method according to claim 3 or 4, characterized in that the raw data is a sequence comprising an image, a sequence of images, an array or array of two-dimensional data elements of a video;
the whole compression unit comprises one or a combination of the following coding units: macroblock, coding unit CU, sub-region of CU, sub-coding unit SubCU, prediction block, prediction unit PU, sub-region of PU, sub-prediction unit SubPU, transform block, transform unit TU, sub-region of TU, sub-transform unit SubTU.
6. The decoding method according to claim 4, wherein the non-predictable element string presence flag of the general string prediction and the coordinate string presence flag of the general string prediction are syntax elements denoted as usp _ unpredictable _ pixel _ str _ present _ flag and usp _ color _ str _ present _ flag, respectively, which are described in the following order and relationship in the syntax description definition table of the compressed data stream of the entire compression unit of the general string prediction coding mode:
the semantic description of the syntax element is:
coordinate string presence flag for general string prediction, usp _ co _ str _ present _ flag
Marking; the value of the first preset value indicates that a coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no coordinate string exists in the whole compression unit of the current universal string prediction coding mode; the value of the variable uspcoorstresentflag is equal to the value of usp _ cor _ str _ present _ flag; if usp _ color _ str _ present _ flag does not exist in the bitstream, the value of the variable uspcolorstpresentflag is a second predetermined value;
unpredictable pixel presence flag of general string prediction, usp _ unpredictable _ pixel _ str _ present _ flag
Marking; the value of the first predetermined value indicates that an unpredictable pixel string exists in the whole compression unit of the current universal string prediction coding mode; the value of the second predetermined value indicates that no unpredictable pixel string exists in the entire compression unit of the current generic string prediction coding mode; the value of the variable uspupnp pixel strpresentflag is equal to the value of usp _ unpredictable _ pixel _ str _ present _ flag; the value of the variable uspupnp pixel strpresentflag is a first predetermined value if the usp _ unpredictably _ pixel _ str _ present _ flag is not present in the bitstream.
7. An apparatus for coding an integer compression unit of a generic string prediction coding mode, comprising means for implementing the method for coding an integer compression unit of a generic string prediction coding mode according to claim 1 or 2.
8. An apparatus for decoding a global compression unit of a generic prediction coding mode, comprising means for implementing a method for decoding a global compression unit of a generic prediction coding mode as claimed in any one of claims 3 to 6.
9. An electronic device, comprising a processor and a memory, wherein at least one instruction, at least one program, set of codes, or set of instructions is stored in the memory, and wherein the at least one instruction, the at least one program, the set of codes, or the set of instructions is loaded and executed by the processor to implement any one of the following methods:
the method for encoding the whole compression unit of the generic string prediction coding mode according to any one of claims 1 or 2 or the method for decoding the whole compression unit of the generic string prediction coding mode according to any one of claims 3 to 6.
10. A computer readable storage medium having stored therein at least one instruction, at least one program, set of codes, or set of instructions that is loaded by a processor and performs any one of the following methods:
the method for encoding the whole compressed unit of the generic string prediction coding mode according to any one of claims 1 or 2 or the method for decoding the whole compressed unit of the generic string prediction coding mode according to any one of claims 3 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210543875.0A CN115134605A (en) | 2022-05-19 | 2022-05-19 | Image encoding and decoding method and device using limited universal string prediction encoding mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210543875.0A CN115134605A (en) | 2022-05-19 | 2022-05-19 | Image encoding and decoding method and device using limited universal string prediction encoding mode |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115134605A true CN115134605A (en) | 2022-09-30 |
Family
ID=83375987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210543875.0A Pending CN115134605A (en) | 2022-05-19 | 2022-05-19 | Image encoding and decoding method and device using limited universal string prediction encoding mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115134605A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010258787A (en) * | 2009-04-24 | 2010-11-11 | Mitsubishi Electric Corp | Signaling compression device, signaling elongation device, and signaling compression and elongation device |
| CN104853209A (en) * | 2014-02-16 | 2015-08-19 | 同济大学 | Image coding and decoding method and device |
| CN107770540A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Merge the data compression method and device of a variety of primitives with different referring-to relations |
| CN111757117A (en) * | 2020-06-03 | 2020-10-09 | 同济大学 | Data coding and decoding method for performing serial prediction on component down-sampling format data |
| CN112565790A (en) * | 2020-11-09 | 2021-03-26 | 绍兴文理学院 | Method and device for encoding and decoding string prediction by using minimum base vector mark |
| WO2021202769A1 (en) * | 2020-04-01 | 2021-10-07 | Tencent America LLC | Method and apparatus for video coding |
-
2022
- 2022-05-19 CN CN202210543875.0A patent/CN115134605A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010258787A (en) * | 2009-04-24 | 2010-11-11 | Mitsubishi Electric Corp | Signaling compression device, signaling elongation device, and signaling compression and elongation device |
| CN104853209A (en) * | 2014-02-16 | 2015-08-19 | 同济大学 | Image coding and decoding method and device |
| CN107770540A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Merge the data compression method and device of a variety of primitives with different referring-to relations |
| WO2021202769A1 (en) * | 2020-04-01 | 2021-10-07 | Tencent America LLC | Method and apparatus for video coding |
| CN111757117A (en) * | 2020-06-03 | 2020-10-09 | 同济大学 | Data coding and decoding method for performing serial prediction on component down-sampling format data |
| CN112565790A (en) * | 2020-11-09 | 2021-03-26 | 绍兴文理学院 | Method and device for encoding and decoding string prediction by using minimum base vector mark |
Non-Patent Citations (4)
| Title |
|---|
| GOKHAN BAKLR;THOMAS HOFMANN: "A General Regression Framework for Learning String-to-String Mappings", 《PREDICTING STRUCTURED DATA》, 31 August 2007 (2007-08-31) * |
| HARSA WARA PRABAWA; ENJUN JUNAETI; YANA PERMANA: "Using capture the flag in classroom: Game-based implementation in network security learning", 《2017 3RD INTERNATIONAL CONFERENCE ON SCIENCE IN INFORMATION TECHNOLOGY (ICSITECH)》, 15 January 2018 (2018-01-15) * |
| 赵利平: "通用串预测算法及在ＡＶＳ２屏幕与 混合内容视频编码中的应用", 《计算机学报》, vol. 42, no. 9, 30 September 2019 (2019-09-30) * |
| 赵利平;林涛;郭靖;周开伦: "基于通用串预测算法的AVS2屏幕混合内容帧间编码优化", 《计算机学报》, vol. 42, no. 10, 20 March 2019 (2019-03-20) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104378644B (en) | Image compression method and device for fixed-width variable-length pixel sample string matching enhancement | |
| CN105491376B (en) | Image coding and decoding method and device | |
| US20220417535A1 (en) | Image encoding and decoding methods, image processing device, and computer storage medium | |
| CN107770540B (en) | Data compression method and device for fusing multiple primitives with different reference relations | |
| US11653019B2 (en) | Image coding and decoding methods, image processing device and computer storage medium | |
| CN110708543A (en) | Image compression apparatus combining block matching and string matching | |
| CN111757117A (en) | Data coding and decoding method for performing serial prediction on component down-sampling format data | |
| CN112565790B (en) | Method and device for encoding and decoding string prediction by using minimum base vector mark | |
| CN113365074A (en) | Encoding and decoding method and device for limiting point prediction frequent position and point vector number thereof | |
| CN113395515B (en) | Coding and decoding method and device for point prediction of component down-sampling format data | |
| CN108574845B (en) | Data compression method and device dynamically adopting multiple sampling formats | |
| CN113938683B (en) | Coding and decoding method and device for point prediction chroma reconstruction values from multiple reference positions | |
| CN108989819B (en) | Data compression method and device adopting respective corresponding color spaces for modes | |
| CN107770543B (en) | Data compression method and device for sequentially increasing cutoff values in multiple types of matching parameters | |
| CN113452995A (en) | Data coding and decoding method and device with different scanning directions of current string and reference string | |
| CN115134605A (en) | Image encoding and decoding method and device using limited universal string prediction encoding mode | |
| US11082718B2 (en) | Method and device for coding image and method and device for decoding image | |
| CN108989820B (en) | Data compression method and device adopting respective corresponding chroma sampling formats at all stages | |
| CN115174929A (en) | Method and device for decoding serial prediction by sharing one buffer area by serial vectors and pixel values | |
| CN113518222B (en) | Coding and decoding method and device for different types of strings by adopting different length binarization schemes | |
| CN115037927A (en) | Image coding and decoding method fusing full chroma and mixed chroma and application thereof | |
| CN104581186B (en) | Method for coding and decoding intra-frame motion vector in image compression | |
| CN114245130A (en) | Data coding and decoding method and device for multiplexing point vector by using historical point prediction information table | |
| CN117319665A (en) | Encoding and decoding method and device for representing unmatched element strings by aid of point vector index values | |
| CN117336491A (en) | Encoding and decoding method and device for increasing maximum value of point vector index value in point prediction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |