CN111757117A - Data coding and decoding method for performing serial prediction on component down-sampling format data - Google Patents
Data coding and decoding method for performing serial prediction on component down-sampling format data Download PDFInfo
- Publication number
- CN111757117A CN111757117A CN202010493939.1A CN202010493939A CN111757117A CN 111757117 A CN111757117 A CN 111757117A CN 202010493939 A CN202010493939 A CN 202010493939A CN 111757117 A CN111757117 A CN 111757117A
- Authority
- CN
- China
- Prior art keywords
- component
- string
- data
- primary
- elements
- 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.)
- Granted
Links
Images
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/20—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using video object coding
-
- 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 Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to a data coding and decoding method for performing serial prediction on component downsampling format data, which is characterized in that a primary component positive element is appointed in a plurality of primary component elements corresponding to a secondary component element in advance to serve as a unique normal primary component element corresponding to the secondary component element, so that a one-to-one corresponding relation between an appointed positive subset consisting of the primary component positive elements and a secondary component data set of a primary component data set is established. When the component down-sampling format data is subjected to string prediction coding and string prediction decoding, the current string of the secondary component is derived from the positive element of the current string of the primary component according to the one-to-one correspondence relation, the reference string of the current string of the secondary component is composed of secondary component elements corresponding to the reference elements of the positive element of the current string of the primary component, and extra position relation parameters and length parameters of the secondary component are not needed, so that the coding efficiency of the string prediction of the component down-sampling format data is improved.
Description
Technical Field
The present invention relates to an encoding and decoding system for lossy or lossless compression of data, and more particularly to an encoding method and a decoding method for compressing multi-component data in a partial component down-sampling format.
Background
With the human society entering the era of artificial intelligence, big data, virtual reality, augmented reality, mixed reality, cloud computing, mobile computing, cloud-mobile computing, ultra-high definition (4K) and ultra-high definition (8K) video image resolution, 4G/5G communication, it becomes an indispensable technology to perform ultra-high compression ratio and extremely high quality data compression on various data including big data, image data, video data, and various new forms of data.
A data set is a set of data elements (e.g., bytes, bits, pixels, pixel components, spatial sampling points, transform domain coefficients). When encoding or decoding a data set (abbreviated as "codec"), data elements are usually ordered according to a predetermined rule, that is, in a predetermined order, and then encoded and decoded in the order. When encoding (and corresponding decoding) data compression of a data set (e.g. a one-dimensional data queue, a two-dimensional data file, a frame of image, a video sequence, a transform domain, a transform block, a plurality of transform blocks, a three-dimensional scene, a sequence of continuously changing three-dimensional scenes) arranged in a certain spatial (one-dimensional, two-dimensional, or multi-dimensional) shape, in particular a two-dimensional or more data sets, the data set is sometimes divided into subsets of predetermined shapes and/or sizes (i.e. number of elements), called whole compression units.
The encoding or decoding is performed in units of integer compression units, one integer compression unit by one integer compression unit in a predetermined order. At any moment, the whole compression unit in encoding or decoding is called as the current whole compression unit; a data element (sometimes also referred to simply 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.
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.
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 the purpose of data compression is achieved.
In 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 elements are respectively called unpredictable components, unpredictable principal components and unpredictable secondary components; in the conventional string prediction technology, for a data set in a 444 sampling format, since 3 components correspond to each other one to one, and 3 component strings have the same shape, position relationship and length, the position relationship and the string length of the 3 component strings can be represented by one position relationship parameter and one string length parameter. For the data sets of the 420 sample format and the 422 sample format, because there is no one-to-one correspondence between the primary component and the secondary component, but there is a many-to-one correspondence, and a plurality of primary component elements corresponding to the same secondary component element may belong to different primary component strings respectively, the primary component strings and the secondary component strings have different shapes, positional relationships, and lengths, and therefore more bits need to be consumed to represent the shapes, positional relationships, and lengths of the primary component strings and the secondary component strings respectively, which seriously affects the encoding efficiency of the string prediction of the 420 sample format and the 422 sample format.
Disclosure of Invention
In order to solve the problem of performing serial prediction encoding and serial prediction decoding on component down-sampling format data, namely data with a down-sampling relationship that a plurality of primary component elements correspond to one secondary component element between a primary component and a secondary component, the invention provides a data encoding and decoding method for performing serial prediction on the component down-sampling format data.
The purpose of the invention is realized as follows: a data encoding and decoding method for performing a string prediction on component down-sampled format data, the decoding method comprising at least the steps of:
b1, designating a primary component positive element as the only regular primary component element corresponding to a secondary component element in a plurality of primary component elements corresponding to a secondary component element, thereby establishing a one-to-one correspondence between a designated primary subset of primary component data set composed of the primary component positive element and a secondary component data set;
b2, analyzing the compressed data code stream, at least obtaining the position relation parameter and/or the string length parameter of the main component string and/or part or all information of the unpredictable main component, and further generating at least the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string;
b3, when the unpredictable main component is a main component positive element, analyzing the compressed data code stream, at least acquiring part or all information of the unpredictable secondary component corresponding to the unpredictable main component, and further generating the unpredictable secondary component;
b4, using the position relation parameter and/or string length parameter of the main component string and according to the preset rule including the scanning mode, performing the partial string prediction decoding and generating the current main component string at least from the reference main component string;
b5, deriving a current secondary component string from the positive element of the current primary component string according to the one-to-one correspondence between the positive element and the secondary component element of the primary component; for each current primary component positive element on the current primary component string, generating a current secondary component element at least from a reference secondary component element corresponding to a reference primary component element of the current primary component positive element (note: the reference primary component element is not necessarily a primary component positive element), and generating all current secondary component elements and their values on the current secondary component string corresponding to the current primary component string one by one.
Further, the encoding method comprises at least the following steps:
a1, designating a primary component positive element as the only regular primary component element corresponding to a secondary component element in a plurality of primary component elements corresponding to the secondary component element, thereby establishing a one-to-one correspondence relationship between a designated positive subset of the primary component data set composed of the primary component positive elements and the secondary component data set;
a2, performing string prediction coding according to a predetermined rule including a scanning mode, and generating at least a position relation parameter and/or a string length parameter and/or an unpredictable main component of a main component string;
a3, writing partial or all information of the position relation parameter and/or the string length parameter and/or the unpredictable main component representing the main component string into the compressed data code stream;
a4, when the unpredictable main component is a main component positive element, at least partial or all information of the unpredictable secondary component corresponding to the unpredictable main component is written into the compressed data code stream.
The invention has the beneficial effects that: the problem of performing string prediction coding and string prediction decoding on component down-sampling format data, namely data with a down-sampling relation that a plurality of primary component elements correspond to one secondary component element between a primary component and a secondary component is solved; the present invention is applicable to encoding and decoding for lossy compression of data, also to encoding and decoding for lossless compression of data, also to encoding and decoding of one-dimensional data such as character string data or byte string data or one-dimensional graphics or fractal graphics, and also to encoding and decoding of two-dimensional or higher data such as image or video data.
Drawings
Fig. 1 is a flow chart of a decoding method of the present invention.
Fig. 2 is a flow chart of the encoding method of the present invention.
Fig. 3 is a principal component positive element diagram.
Detailed Description
The invention will be further described with reference to the accompanying figures 1-3 and specific examples.
A data encoding and decoding method for performing a serial prediction on component down-sampled format data, as shown in fig. 1, the decoding method at least comprises the following steps:
201. designating a primary component positive element as a unique regular primary component element corresponding to a secondary component element among a plurality of primary component elements corresponding to the secondary component element, thereby establishing a one-to-one correspondence relationship between a designated primary subset of primary component data sets composed of the primary component positive elements and secondary component data sets;
202. analyzing the compressed data code stream, at least obtaining the position relation parameter and/or the string length parameter of the main component string and/or part or all information of the unpredictable main component, and further at least generating the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string;
203. when the unpredictable main component is a main component positive element, analyzing a compressed data code stream, at least obtaining part or all information of the unpredictable secondary component corresponding to the unpredictable main component, and further at least generating the unpredictable secondary component;
204. performing partial string prediction decoding and generating a current principal component string from at least a reference principal component string using a positional relationship parameter and/or a string length parameter of the principal component string and according to a predetermined rule including a scanning manner;
205. deriving a current secondary component string from the positive element of the current primary component string according to the one-to-one correspondence between the primary component positive element and the secondary component element; for each current primary component positive element on the current primary component string, generating a current secondary component element at least from a reference secondary component element corresponding to a reference primary component element of the current primary component positive element (note: the reference primary component element is not necessarily a primary component positive element), and generating all current secondary component elements and their values on the current secondary component string corresponding to the current primary component string one by one.
As shown in fig. 2, the encoding method at least includes the following steps:
101. designating a primary component positive element as a unique regular primary component element corresponding to a secondary component element among a plurality of primary component elements corresponding to the secondary component element, thereby establishing a one-to-one correspondence relationship between a designated positive subset of primary component data sets composed of the primary component positive elements and secondary component data sets;
102. performing string prediction coding according to a predetermined rule including a scanning mode, and generating at least a position relation parameter and/or a string length parameter and/or an unpredictable main component of a main component string;
103. writing at least part or all information representing the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string into a compressed data code stream;
104. when the unpredictable primary component is a primary component positive element, writing at least part or all of information representing an unpredictable secondary component corresponding to the unpredictable primary component into a compressed data code stream.
The raw 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; a 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 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, a sub transform unit SubTU.
In the encoding method or the decoding method, the scanning method may include any one of:
1) horizontal raster scanning: a plurality of elements in the whole compression unit are arranged one by one along the horizontal direction, the next row is arranged after one row is arranged, and all the rows are arranged from left to right or all the rows are arranged from right to left;
2) horizontal back and forth scanning: a plurality of elements in one whole compression unit are arranged one by one along the horizontal direction, the next row is arranged after one row is arranged, and one row in any two adjacent rows is arranged from left to right while the other row is arranged from right to left;
3) vertical raster scanning: the elements in the whole compression unit are arranged one by one in the vertical direction, the next column is arranged after one column is arranged, and all the columns are arranged from top to bottom or all the rows are arranged from bottom to top;
4) scanning back and forth vertically: the elements in a whole compression unit are arranged one by one in the vertical direction, and then arranged in the next column after one column is arranged, and one column in any two adjacent columns is arranged from top to bottom and the other column is arranged from bottom to top.
In the encoding method or the decoding method, 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;
the sampling rate and the size of the secondary components D and E are respectively one fourth of that of the primary component F, namely the primary component and the secondary component have a downsampling relation of 4: 1;
one D component element D [ i ] [ j ] and one E component element E [ i ] [ j ] correspond to 4F component elements F [2i ] [2j ], F [2i +1] [2j ], F [2i ] [2j +1], F [2i +1] [2j +1] which are arranged up, down, left and right;
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-2M-1, N is 0-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.
In an embodiment of the present application, in the encoding method or the decoding method, the pre-specified positive element of the principal component is F [2i ] [2j ].
As an embodiment of the present application, in the above encoding method or decoding method, the pre-specified positive element of the principal component is F [2i +1] [2j ].
As an embodiment of the present application, in the above encoding method or decoding method, the pre-specified positive element of the principal component is F [2i ] [2j +1 ].
As an embodiment of the present application, in the above encoding method or decoding method, the pre-specified main component positive element F [2i +1] [2j +1 ]; as shown in fig. 3, different numbers represent different current strings, u represents an unpredictable element, and the current secondary component string is derived from the current primary component string according to the primary component positive element under the vertical back-and-forth scanning; fig. 3 is an example of deriving a current secondary component string from a current primary component string according to a primary component positive element. When different primary component positive elements are specified, different current secondary component strings will be derived from the same current primary component string.
As an embodiment of the present application, the position relation parameter of the principal component string is a displacement vector (offset x, offset y); (offset x, offset y) represents the difference between the coordinates (m, n) of the current principal component element F [ m ] [ n ] and the coordinates of its reference principal component element, i.e. (offset x, offset) is the coordinates (m, n) of the current principal component element F [ m ] [ n ] minus the coordinates of its reference principal component element: the pre-specified positive element of the principal component is F [2i ] [2j ]. Generating a current primary component element from the reference primary component element and a current secondary component element from the reference secondary component element using the following calculation:
F[m][n]＝F[m-offsetX][n-offsetY]；
if m and n are both even numbers, i.e., m is 2i and n is 2 j:
D[i][j]＝D[(m-offsetX)/2][(n-offsetY)/2]；
E[i][j]＝E[(m-offsetX)/2][(n-offsetY)/2]；
where "/" is an integer division, such as 3/2 ═ 1.
While the preferred embodiments of the present invention have been described, those skilled in the art will appreciate that various changes and modifications can be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A data encoding and decoding method for performing a string prediction on component down-sampled format data, the decoding method comprising at least the steps of:
b1, designating a primary component positive element as the only regular primary component element corresponding to a secondary component element in a plurality of primary component elements corresponding to a secondary component element, thereby establishing a one-to-one correspondence between a designated primary subset of primary component data set composed of the primary component positive element and a secondary component data set;
b2, analyzing the compressed data code stream, at least obtaining the position relation parameter and/or the string length parameter of the main component string and/or part or all information of the unpredictable main component, and further generating at least the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string;
b3, when the unpredictable main component is a main component positive element, analyzing the compressed data code stream, at least acquiring part or all information of the unpredictable secondary component corresponding to the unpredictable main component, and further generating the unpredictable secondary component;
b4, using the position relation parameter and/or string length parameter of the main component string and according to the preset rule including the scanning mode, performing the partial string prediction decoding and generating the current main component string at least from the reference main component string;
b5, deriving a current secondary component string from the positive element of the current primary component string according to the one-to-one correspondence between the positive element and the secondary component element of the primary component; for each current primary component positive element on the current primary component string, generating a current secondary component element at least from a reference secondary component element corresponding to a reference primary component element of the current primary component positive element (note: the reference primary component element is not necessarily a primary component positive element), and generating all current secondary component elements and their values on the current secondary component string corresponding to the current primary component string one by one.
2. The method of claim 1, wherein the encoding method comprises at least the steps of:
a1, designating a primary component positive element as the only regular primary component element corresponding to a secondary component element in a plurality of primary component elements corresponding to the secondary component element, thereby establishing a one-to-one correspondence relationship between a designated positive subset of the primary component data set composed of the primary component positive elements and the secondary component data set;
a2, performing string prediction coding according to a predetermined rule including a scanning mode, and generating at least a position relation parameter and/or a string length parameter and/or an unpredictable main component of a main component string;
a3, writing partial or all information of the position relation parameter and/or the string length parameter and/or the unpredictable main component representing the main component string into the compressed data code stream;
a4, when the unpredictable main component is a main component positive element, at least partial or all information of the unpredictable secondary component corresponding to the unpredictable main component is written into the compressed data code stream.
3. The method of claim 2, wherein the original data involved in data compression in the encoding or decoding method comprises 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; a 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).
4. The method of claim 2, wherein the scanning comprises any one of horizontal raster scanning, horizontal back-and-forth scanning, vertical raster scanning, and vertical back-and-forth scanning.
5. The data encoding and decoding method for performing serial prediction on component down-sampled formatted data according to claim 4, wherein said horizontal raster scan is: the elements in the whole compression unit are arranged one by one along the horizontal direction, the next row is arranged after one row is arranged, and all the rows are arranged from left to right or from right to left.
6. The method of claim 4, wherein the horizontal back and forth scanning is: 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 the arrangement directions of any two adjacent rows are opposite.
7. The data encoding and decoding method for performing serial prediction on component down-sampled formatted data according to claim 4, wherein said vertical raster scan is: the elements in the whole compression unit are arranged one by one in the vertical direction, and after one row is arranged, the next row is arranged, and all the rows are arranged from top to bottom or from bottom to top.
8. The method of claim 4, wherein the vertical back and forth scanning is: a plurality of 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 the arrangement directions of any two adjacent columns are opposite.
9. A method of encoding and decoding data for string prediction of component down-sampled formatted data according to claim 2, wherein the data is an array or sequence of arrays of two-dimensional data elements of 420 sample format having a primary component F and two secondary components D and E each having a sampling rate and size one quarter of the primary component F.
10. The method of claim 9, wherein one D component element D [ i ] [ j ] and one E component element E [ i ] [ j ] correspond to 2 × 2F 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, and the F component elements form an array F ═ F [ M ] [ N ]: m is 0-2M-1, N is 0-2N-1 }; the resolution of the D component elements is M × N, and 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 M × N, and the E component elements constitute an array E ═ E [ M ] [ N ]: m is 0 to M-1, and N is 0 to N-1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010493939.1A CN111757117B (en) | 2020-06-03 | 2020-06-03 | Data encoding and decoding method for performing string prediction on component downsampled format data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010493939.1A CN111757117B (en) | 2020-06-03 | 2020-06-03 | Data encoding and decoding method for performing string prediction on component downsampled format data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111757117A true CN111757117A (en) | 2020-10-09 |
| CN111757117B CN111757117B (en) | 2023-10-03 |
Family
ID=72674180
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010493939.1A Active CN111757117B (en) | 2020-06-03 | 2020-06-03 | Data encoding and decoding method for performing string prediction on component downsampled format data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111757117B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113395515A (en) * | 2021-04-08 | 2021-09-14 | 同济大学 | Coding and decoding method and device for point prediction of component down-sampling format data |
| CN113452995A (en) * | 2021-03-31 | 2021-09-28 | 同济大学 | Data coding and decoding method and device with different scanning directions of current string and reference string |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100150452A1 (en) * | 2007-04-23 | 2010-06-17 | Nec Corporation | Matching method for two-dimensional pattern, feature extracting method, appartus used for the methods, and programs |
| CN101783940A (en) * | 2009-05-11 | 2010-07-21 | 北京航空航天大学 | Joint source-channel coding method based on wavelet frame transform |
| US20160330455A1 (en) * | 2013-08-16 | 2016-11-10 | Tongji University | Method device for image compression, having enhanced matching of fixed-width variable-length pixel samples strings |
| CN107770553A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Using the data compression method and device of multiclass match parameter and parameter storage address |
-
2020
- 2020-06-03 CN CN202010493939.1A patent/CN111757117B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100150452A1 (en) * | 2007-04-23 | 2010-06-17 | Nec Corporation | Matching method for two-dimensional pattern, feature extracting method, appartus used for the methods, and programs |
| CN101783940A (en) * | 2009-05-11 | 2010-07-21 | 北京航空航天大学 | Joint source-channel coding method based on wavelet frame transform |
| US20160330455A1 (en) * | 2013-08-16 | 2016-11-10 | Tongji University | Method device for image compression, having enhanced matching of fixed-width variable-length pixel samples strings |
| CN107770553A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Using the data compression method and device of multiclass match parameter and parameter storage address |
Non-Patent Citations (2)
| Title |
|---|
| FENG ZOU: "Hash based intra string copy for HEVC based screen content coding", 《2015 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA & EXPO WORKSHOPS (ICMEW)》 * |
| 赵利平;周开伦;郭靖;蔡文婷;林涛;朱蓉;: "融合像素串匹配的AVS2全色度屏幕与混合内容视频编码算法", 计算机学报, no. 11 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113452995A (en) * | 2021-03-31 | 2021-09-28 | 同济大学 | Data coding and decoding method and device with different scanning directions of current string and reference string |
| CN113395515A (en) * | 2021-04-08 | 2021-09-14 | 同济大学 | Coding and decoding method and device for point prediction of component down-sampling format data |
| CN113395515B (en) * | 2021-04-08 | 2022-06-14 | 同济大学 | Coding and decoding method and device for point prediction of component down-sampling format data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111757117B (en) | 2023-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104378644B (en) | Image compression method and device for fixed-width variable-length pixel sample string matching enhancement | |
| CN107071450B (en) | Coding and decoding method and device for data compression | |
| CN111614359B (en) | Data encoding method and decoding method using point prediction and frequent occurrence position array | |
| CN110087090B (en) | Data coding and decoding method adopting mixed string matching and intra-frame prediction | |
| CN104754362B (en) | Image compression method using fine-divided block matching | |
| US10575022B2 (en) | Image encoding and decoding method, image processing device and computer storage medium | |
| CN107770540B (en) | Data compression method and device for fusing multiple primitives with different reference relations | |
| KR102532391B1 (en) | Video encoding method and apparatus and video decoding method and apparatus | |
| CN111757117B (en) | Data encoding and decoding method for performing string prediction on component downsampled format data | |
| CN110505488B (en) | Image coding or decoding method for expanding prediction pixel array | |
| CN107770553B (en) | Data compression method and device adopting multiple types of matching parameters and parameter storage addresses | |
| CN113365074B (en) | Encoding and decoding method and device for limiting point prediction frequent position and point vector number thereof | |
| CN112565790B (en) | Method and device for encoding and decoding string prediction by using minimum base vector mark | |
| CN112637600B (en) | Method and device for encoding and decoding data in a lossy or lossless compression mode | |
| CN113395515B (en) | Coding and decoding method and device for point prediction of component down-sampling format data | |
| 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 | |
| CN107770544B (en) | Data compression method and device adopting multiple types of matching parameters and pre-parameter buffer areas | |
| CN117319665A (en) | Encoding and decoding method and device for representing unmatched element strings by aid of point vector index values | |
| CN115134605A (en) | Image encoding and decoding method and device using limited universal string prediction encoding mode | |
| CN117336491A (en) | Encoding and decoding method and device for increasing maximum value of point vector index value in point prediction | |
| CN113518222B (en) | Coding and decoding method and device for different types of strings by adopting different length binarization schemes | |
| CN113938683A (en) | Coding and decoding method and device for point prediction chroma reconstruction value from multiple reference positions | |
| CN117319663A (en) | Encoding and decoding method and device for multiplexing normal-present position with main component coming from point prediction | |
| CN117459735A (en) | Encoding and decoding method and device for narrowing value range of point vector index 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |