CN111757117B - Data encoding and decoding method for performing string prediction on component downsampled format data - Google Patents
Data encoding and decoding method for performing string prediction on component downsampled format data Download PDFInfo
- Publication number
- CN111757117B CN111757117B CN202010493939.1A CN202010493939A CN111757117B CN 111757117 B CN111757117 B CN 111757117B CN 202010493939 A CN202010493939 A CN 202010493939A CN 111757117 B CN111757117 B CN 111757117B
- Authority
- CN
- China
- Prior art keywords
- component
- string
- data
- main component
- 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.)
- Active
Links
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 application relates to a data coding and decoding method for carrying out string prediction on component downsampling format data, which designates a main component positive element in a plurality of main component elements corresponding to a secondary component element as a unique and normal main component element corresponding to the secondary component element in advance, thereby establishing a one-to-one correspondence between a designated positive subset composed of the main component positive elements of a main component data set and the secondary component data set. When the string prediction encoding and the string prediction decoding are carried out on the component downsampling format data, the current string of the secondary component is derived from the positive element of the current string of the main component according to the one-to-one correspondence, the reference string of the current string of the secondary component is composed of secondary component elements corresponding to the reference element of the positive element of the current string of the main component, and the position relation parameters and the length parameters of the additional secondary component are not needed, so that the string prediction encoding efficiency of the component downsampling format data is improved.
Description
Technical Field
The present application relates to a coding and decoding system for lossy or lossless compression of data, and more particularly to a coding method and decoding method for compressing multicomponent data in a partial component downsampling format.
Background
As human society enters 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, ultra-high compression ratio and ultra-high quality data compression are indispensable for 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 (simply referred to as "encoding/decoding"), data elements are typically ordered according to a predetermined rule, i.e., a predetermined order, and are encoded/decoded in the order. Data sets (e.g., a one-dimensional data queue, a two-dimensional data file, a frame of image, a video sequence, a transform domain, a transform block, a plurality of transform blocks, a three-dimensional scene, a sequence of continuously changing three-dimensional scenes) arranged in a spatial (one-dimensional, two-dimensional, or multi-dimensional) shape are sometimes also divided into subsets of predetermined shape and/or size (i.e., number of elements) when encoded (and correspondingly decoded) in particular two-dimensional or more data sets.
The whole compression units are used as units, and the encoding or decoding is performed in a predetermined order one by one. At any one time, the whole compression unit being encoded or decoded is referred to as the current whole compression unit; the data element being encoded or decoded (sometimes also simply referred to as an element) is referred to as a current encoded data element or a current decoded data element, collectively referred to as a current data element, simply referred to as a current element; the element is composed of N components (typically 1. Ltoreq.N.ltoreq.5), so the data set and the whole compression unit are also composed of N components. The components of an element are also referred to as component elements.
The relation between the multi-component data set as the encoding object and the sampling rate of each component of the whole 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 order the whole compression units first, and then order the elements within each whole compression unit; an 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 element strings of variable length, and obtains a reference element string having the same or similar value as a current element string, referred to as a reference string of the current string or a predicted string or a matching string, among a set of elements or a subset thereof called a reference set, which have been encoded and decoded to a predetermined extent. 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 all elements of the current string and the values thereof can be completely represented without recording the values of each element in the current string one by one, so that the aim of data compression is achieved.
In string prediction, unpredictable elements may also occur where no reference element is found within the reference set. The component, the primary component, and the secondary component of the unpredictable element are referred to as the unpredictable component, the unpredictable primary component, and the unpredictable secondary component, respectively; in the existing string prediction technology, for a data set in a 444 sampling format, 3 component strings have identical shapes, position relations and lengths because 3 components are in one-to-one correspondence with each other, so that one position relation parameter and one string length parameter can be used for uniformly representing the position relations and the string lengths of the 3 component strings. For the data sets of the 420 sampling format and the 422 sampling format, since there is not a one-to-one correspondence between the primary component and the secondary component, but a plurality of primary component elements corresponding to the same secondary component element may respectively belong to different primary component strings, resulting in that the primary component strings and the secondary component strings have different shapes, positional relationships and lengths, more bits are required to be consumed to respectively represent the shapes, the positional relationships and the lengths of the primary component strings and the secondary component strings, which seriously affects the coding efficiency of the string prediction of the 420 sampling format and the 422 sampling format.
Disclosure of Invention
In order to solve the problem encountered when performing string prediction encoding and string prediction decoding on component downsampling format data, namely data in which a plurality of main component elements and a plurality of sub component elements exist in a downsampling relation corresponding to one sub component element, the application provides a data encoding and decoding method for performing string prediction on the component downsampling format data.
The purpose of the application is realized in the following way: a data coding and decoding method for carrying out string prediction on component downsampling format data, the decoding method at least comprises the following steps:
b1, designating a main component positive element as a unique and regular main component element corresponding to a minor component element in a plurality of main component elements corresponding to the minor component element, thereby establishing a one-to-one correspondence between a designated main subset of the main component data set and the minor component data set, wherein the designated main subset consists of the main component positive elements;
b2, analyzing the compressed data code stream, at least acquiring partial or whole information of the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string, 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;
b3, when the unpredictable main component is a main component positive element, analyzing a compressed data code stream, at least acquiring partial or whole information representing an unpredictable secondary component corresponding to the unpredictable main component and further at least generating the unpredictable secondary component;
b4, performing partial string prediction decoding and generating a current main component string at least from the reference main component string by using the position relation parameter and/or the string length parameter of the main component string according to a preset rule including a scanning mode;
b5, according to the one-to-one correspondence between the primary component positive elements and the secondary component elements, the current secondary component string is derived from the positive elements of the current primary component string; for each current principal component positive element on the current principal component string, current minor component elements are generated at least from reference minor component elements corresponding to reference principal component elements of the current principal component positive element (note: the reference principal component elements are not necessarily principal component positive elements), and all current minor component elements on the current minor component string corresponding to the current principal component string and their values are generated one by one.
Further, the encoding method at least comprises the following steps:
a1, designating a main component positive element as a unique and regular main component element corresponding to a minor component element in a plurality of main component elements corresponding to the minor component element, thereby establishing a one-to-one correspondence between a designated positive subset of the main component data set and the minor component data set, wherein the designated positive subset consists of the main component positive elements;
a2, performing string prediction coding according to a preset rule including a scanning mode, and generating at least a position relation parameter and/or a string length parameter of a main component string and/or an unpredictable main component;
a3, writing at least partial or whole information representing the position relation parameter and/or string length parameter of the main component string and/or unpredictable main component into the compressed data code stream;
a4, when the unpredictable main component is a main component positive element, writing at least part or all of information representing an unpredictable secondary component corresponding to the unpredictable main component into a compressed data code stream.
The application has the beneficial effects that: the method solves the problem encountered when carrying out string prediction coding and string prediction decoding on the component downsampling format data, namely the data with a downsampling relation of a plurality of main component elements corresponding to one secondary component element between the main component and the secondary component; the application is suitable for encoding and decoding the data in a lossy compression way, is also suitable for encoding and decoding the data in a lossless compression way, is also suitable for encoding and decoding one-dimensional data such as character string data or byte string data or one-dimensional graph or split-dimensional graph, and is also suitable for encoding and decoding two-dimensional or more data such as image or video data.
Drawings
Fig. 1 is a flow chart of the decoding method of the present application.
Fig. 2 is a flow chart of the encoding method of the present application.
Fig. 3 is a principal component positive element diagram.
Detailed Description
The application will be further described with reference to figures 1-3 and the specific examples.
A data encoding and decoding method for performing string prediction on component downsampled format data, as shown in fig. 1, the decoding method at least includes the steps of:
201. designating a primary component positive element among a plurality of primary component elements corresponding to a secondary component element as a unique regular primary component element corresponding to the secondary component element, thereby establishing a one-to-one correspondence between a designated primary subset of the primary component data set consisting of the primary component positive elements and the secondary component data set;
202. analyzing the compressed data code stream, at least acquiring partial or complete information representing the position relation parameter and/or the string length parameter and/or the unpredictable main component of the main component string, 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 acquiring partial or complete information representing an unpredictable secondary component corresponding to the unpredictable main component and further generating at least the unpredictable secondary component;
204. performing partial string predictive decoding and generating a current main component string from at least a reference main component string using a positional relationship parameter and/or a string length parameter of the main component string and according to a predetermined rule including a scan manner;
205. according to the one-to-one correspondence between the primary component positive elements and the secondary component elements, a current secondary component string is derived from the positive elements of the current primary component string; for each current principal component positive element on the current principal component string, current minor component elements are generated at least from reference minor component elements corresponding to reference principal component elements of the current principal component positive element (note: the reference principal component elements are not necessarily principal component positive elements), and all current minor component elements on the current minor component string corresponding to the current principal component string and their values are generated one by one.
As shown in fig. 2, the encoding method at least includes the following steps:
101. designating a primary component positive element among a plurality of primary component elements corresponding to a secondary component element as a unique regular primary component element corresponding to the secondary component element, thereby establishing a one-to-one correspondence 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 preset rule including a scanning mode, and generating at least a position relation parameter and/or a string length parameter of a main component string and/or an unpredictable main component;
103. writing at least part or all of the information representing the positional relationship parameter and/or string length parameter of the string of principal components and/or unpredictable principal components into the compressed data stream;
104. when the unpredictable main component is a main component positive element, at least part or all of information representing an unpredictable secondary component corresponding to the unpredictable main component is written into a compressed data 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 pattern; a split dimension graph; an image; a sequence of images; video; audio frequency; a file; bytes; bits; a pixel; a three-dimensional scene; a sequence of continuously varying three-dimensional scenes; a virtual reality scene; a sequence of continuously changing virtual reality scenes; an image in the form of pixels; transform domain data of the image; a set of two or more bytes; a set of two or more bits; 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 comprises a macroblock, a coding unit CU, a sub-region of the CU, a sub-coding unit sub-CU, a prediction block, a prediction unit PU, a sub-region of the PU, a sub-prediction unit sub-PU, a transformation block, a transformation unit TU, a sub-region of the TU and a sub-transformation unit sub-TU.
In the encoding method or the decoding method, the scanning manner may include any one of the following:
1) Horizontal raster scan: the elements in one whole compression unit are arranged next to each other along the horizontal direction, one row is arranged, 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 scan: the elements in one whole compression unit are arranged next to each other along the horizontal direction, one row is arranged next to the next row, one row in any two adjacent rows is arranged from left to right, and the other row is arranged from right to left;
3) Vertical raster scan: the elements in one whole compression unit are arranged next to each other along the vertical direction, the next column is arranged after one column is arranged, and all columns are arranged from top to bottom or all rows are arranged from bottom to top;
4) Scanning vertically back and forth: the elements in one whole compression unit are arranged next to each other in the vertical direction, one row is arranged next to the next row, and any two adjacent rows are arranged one from top to bottom and the other row is arranged from bottom to top.
In the encoding method or decoding method, the data is an array or sequence of arrays of two-dimensional data elements in 420-sample format, having one primary component F and two secondary components D and E;
the sampling rate and size of the secondary components D and E are each one quarter of the primary component F, i.e. there is a 4:1 downsampling relationship between the primary and secondary components;
one D component element D [ i ] [ j ] and one E component element E [ i ] [ j ] correspond to 2×2 4F component elements F [2i ] [2j ], F [2i+1] [2j ], F [2i ] [2j+1], F [2i+1] [2j+1] arranged up and down and left and right;
the resolution of the F component elements is 2M x 2N, i.e., the F component elements make up the array f= { F [ M ] [ N ]: m=0 to 2M-1, n=0 to 2N-1}; the resolution of the D component elements is m×n, i.e., the D component elements make up an array d= { D [ M ] [ N ]: m=0 to M-1, n=0 to N-1}; the resolution of the E component elements is also mxn, i.e., the E component elements make up an array e= { E [ M ] [ N ]: m=0 to M-1, n=0 to N-1.
As an embodiment of the present application, in the above encoding method or decoding method, the principal component positive element specified in advance is F [2i ] [2j ].
As an embodiment of the present application, in the above encoding method or decoding method, the principal component positive element specified in advance is F [2i+1] [2j ].
As an embodiment of the present application, in the above encoding method or decoding method, the principal component positive element specified in advance is F [2i ] [2j+1].
As an embodiment of the present application, in the above-described encoding method or decoding method, the principal component positive element F [2i+1] [2j+1] is specified in advance; as shown in fig. 3, different numbers represent different current strings, u represents an unpredictable element, and a current secondary component string is derived from the current primary component string according to the primary component positive element under vertical back and forth scanning; FIG. 3 is one example of deriving a current secondary component string from a current primary component string based on 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 one embodiment of the present application, the positional relationship parameter of the principal component string is a displacement vector (offsetX, offsetY); (offsetX, offsetY) 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., (offsetX, offsetY) is the coordinates (m, n) of the current principal component element F [ m ] [ n ] minus the coordinates of its reference principal component element: the principal component positive element specified in advance is F [2i ] [2j ]. The current principal component element is generated from the reference principal component element and the current minor component element is generated from the reference minor component element using the following calculation:
F[m][n]＝F[m-offsetX][n-offsetY]；
if m and n are both even, i.e. m=2i, n=2j, then:
D[i][j]＝D[(m-offsetX)/2][(n-offsetY)/2]；
E[i][j]＝E[(m-offsetX)/2][(n-offsetY)/2]；
where "/" is integer division, e.g. 3/2=1.
The foregoing is a preferred embodiment of the present application, and various changes and modifications may be made therein by those skilled in the art without departing from the general inventive concept, and such changes and modifications should be considered as falling within the scope of the present application as defined in the appended claims.
Claims (9)
1. A data encoding and decoding method for performing string prediction on component downsampled format data, the decoding method comprising the steps of:
b1, designating a main component positive element as a unique and regular main component element corresponding to a minor component element in a plurality of main component elements corresponding to the minor component element, thereby establishing a one-to-one correspondence between a designated main subset of the main component data set and the minor component data set, wherein the designated main subset consists of the main component positive elements;
b2, analyzing the compressed data code stream, obtaining partial or all information of the position relation parameter, the string length parameter and the unpredictable main component of the main component string, and further generating the position relation parameter, the string length parameter and the unpredictable main component of the main component string;
b3, when the unpredictable main component is a main component positive element, analyzing a compressed data code stream, acquiring partial or whole information representing an unpredictable secondary component corresponding to the unpredictable main component, and further generating the unpredictable secondary component;
b4, performing partial string prediction decoding and generating a current main component string from the reference main component string by using the position relation parameter and the string length parameter of the main component string according to a preset rule including a scanning mode;
b5, according to the one-to-one correspondence between the primary component positive elements and the secondary component elements, the current secondary component string is derived from the positive elements of the current primary component string; generating, for each current primary component positive element on a current primary component string, a current secondary component element from a reference secondary component element corresponding to a reference primary component element of the current primary component positive element, generating, one by one, all current secondary component elements on the current secondary component string corresponding to the current primary component string and values thereof;
the coding method comprises the following steps:
a1, designating a main component positive element as a unique and regular main component element corresponding to a minor component element in a plurality of main component elements corresponding to the minor component element, thereby establishing a one-to-one correspondence between a designated positive subset of the main component data set and the minor component data set, wherein the designated positive subset consists of the main component positive elements;
a2, performing string prediction coding according to a preset rule including a scanning mode, and generating a position relation parameter, a string length parameter and an unpredictable main component of a main component string;
a3, writing partial or all information representing the position relation parameter, the string length parameter and the unpredictable main component of the main component string into the compressed data code stream;
a4, when the unpredictable main component is a main component positive element, part or all of information representing an unpredictable secondary component corresponding to the unpredictable main component is written into a compressed data code stream.
2. The method for encoding and decoding data for string prediction of component downsampled format data according to claim 1, wherein the original data related to data compression in the encoding method or decoding method comprises one or a combination of the following types of data: one-dimensional data; two-dimensional data; multidimensional data; a pattern; a split dimension graph; an image; a sequence of images; video; audio frequency; a file; bytes; bits; a pixel; a three-dimensional scene; a sequence of continuously varying three-dimensional scenes; a virtual reality scene; a sequence of continuously changing virtual reality scenes; an image in the form of pixels; transform domain data of the image; a set of two or more bytes; a set of two or more bits; 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).
3. The method of claim 1, wherein the scanning mode includes any one of horizontal raster scan, vertical raster scan, and vertical raster scan.
4. A method of encoding and decoding data for string prediction of component downsampled format data according to claim 3, wherein said horizontal raster scan is: the elements in one whole compression unit are arranged next to each other along the horizontal direction, one row is arranged next to the next row, and all the rows are arranged from left to right or from right to left.
5. A method of encoding and decoding data for string prediction of component downsampled format data according to claim 3, wherein said horizontal back and forth scan is: the elements in one whole compression unit are arranged next to each other along the horizontal direction, one row is arranged next to the next row, and the arrangement directions of any two adjacent rows are opposite.
6. A method of encoding and decoding data for string prediction of component downsampled format data according to claim 3, wherein said vertical raster scan is: the elements in one whole compression unit are arranged next to each other in the vertical direction, and the next column is arranged after one column is arranged, and all columns are arranged from top to bottom or from bottom to top.
7. A method of encoding and decoding data for string prediction of component downsampled format data according to claim 3, wherein said vertical back-and-forth scan is: the elements in one whole compression unit are arranged next to each other 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.
8. A method of encoding and decoding data in a string prediction for data in a sub-sampling format according to claim 1, wherein the data is an array or sequence of arrays of two-dimensional data elements in a 420-sample format, having a primary component F and two secondary components D and E, the sampling rate and size of the secondary components D and E being respectively one quarter of the primary component F.
9. The data encoding and decoding method for performing string prediction on the component downsampled format data according to claim 8, wherein one D component element di [ j ] and one E component element ei [ j ] correspond to 2 x 2 four F component elements F [2i ] [2j ], F [2i+1] [2j ], F [2i ] [2j+1], F [2i+1] [2j+1] arranged up, down, left, right; the resolution of the F component elements is 2mx2n, the F component elements making up the array f= { F [ M ] [ n ]: m=0 to 2M-1, n=0 to 2N-1}; the resolution of the D component elements is mxn, the D component elements making up the array d= { D [ M ] [ N ]: m=0 to M-1, n=0 to N-1}; the resolution of the E component elements is mxn, the E component elements make up an array e= { E [ M ] [ N ]: m=0 to M-1, n=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 CN111757117A (en) | 2020-10-09 |
| CN111757117B true 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) |
Families Citing this family (4)
| 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 |
| CN113395515B (en) * | 2021-04-08 | 2022-06-14 | 同济大学 | Coding and decoding method and device for point prediction of component down-sampling format data |
| CN113938683B (en) * | 2021-10-13 | 2024-09-03 | 同济大学 | Coding and decoding method and device for point prediction chroma reconstruction values from multiple reference positions |
| CN115134605B (en) * | 2022-05-19 | 2024-10-01 | 同济大学 | Image encoding and decoding method and device using limited universal string prediction encoding mode |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101783940A (en) * | 2009-05-11 | 2010-07-21 | 北京航空航天大学 | Joint source-channel coding method based on wavelet frame transform |
| CN107770553A (en) * | 2016-08-21 | 2018-03-06 | 上海天荷电子信息有限公司 | Using the data compression method and device of multiclass match parameter and parameter storage address |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8606019B2 (en) * | 2007-04-23 | 2013-12-10 | Nec Corporation | Matching method for two-dimensional pattern, feature extracting method, apparatus used for the methods, and programs |
| CN112383780B (en) * | 2013-08-16 | 2023-05-02 | 上海天荷电子信息有限公司 | Encoding and decoding method and device for point matching reference set and index back and forth scanning string matching |
-
2020
- 2020-06-03 CN CN202010493939.1A patent/CN111757117B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101783940A (en) * | 2009-05-11 | 2010-07-21 | 北京航空航天大学 | Joint source-channel coding method based on wavelet frame transform |
| 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)》.2015,全文. * |
| 赵利平;周开伦;郭靖;蔡文婷;林涛;朱蓉.融合像素串匹配的AVS2全色度屏幕与混合内容视频编码算法.计算机学报.2017,(第11期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111757117A (en) | 2020-10-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111757117B (en) | Data encoding and decoding method for performing string prediction on component downsampled format data | |
| CN112383780B (en) | Encoding and decoding method and device for point matching reference set and index back and forth scanning string matching | |
| CN107071450B (en) | Coding and decoding method and device for data compression | |
| CN105491376B (en) | Image coding and decoding method and device | |
| CN107770540B (en) | Data compression method and device for fusing multiple primitives with different reference relations | |
| CN111614359B (en) | Data encoding method and decoding method using point prediction and frequent occurrence position array | |
| CN104754362B (en) | Image compression method using fine-divided block matching | |
| CN104581177B (en) | Image compression method and device combining block matching and string matching | |
| CN110087090B (en) | Data coding and decoding method adopting mixed string matching and intra-frame prediction | |
| CN105100814B (en) | Image coding and decoding method and device | |
| US10575022B2 (en) | Image encoding and decoding method, image processing device and computer storage medium | |
| 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 | |
| CN107770553B (en) | Data compression method and device adopting multiple types of matching parameters and parameter storage addresses | |
| CN110505488B (en) | Image coding or decoding method for expanding prediction pixel array | |
| CN113365074B (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 | |
| CN107770543B (en) | Data compression method and device for sequentially increasing cutoff values in multiple types of matching parameters | |
| CN113473139A (en) | Image processing method and image processing device | |
| CN113938683B (en) | Coding and decoding method and device for point prediction chroma reconstruction values from multiple reference positions | |
| 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 | |
| CN117354376A (en) | Coding and decoding method and device adopting unified sequence numbers of matching strings and unmatched elements | |
| CN117336491A (en) | Encoding and decoding method and device for increasing maximum value of point vector index value in 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 |