CN110197513B - String matching data compression method based on adjustment threshold matching error - Google Patents
String matching data compression method based on adjustment threshold matching error Download PDFInfo
- Publication number
- CN110197513B CN110197513B CN201910393318.3A CN201910393318A CN110197513B CN 110197513 B CN110197513 B CN 110197513B CN 201910393318 A CN201910393318 A CN 201910393318A CN 110197513 B CN110197513 B CN 110197513B
- Authority
- CN
- China
- Prior art keywords
- value
- threshold
- string
- primitive
- fixed
- 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
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000013144 data compression Methods 0.000 title claims abstract description 18
- 238000005457 optimization Methods 0.000 abstract description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000007906 compression Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/3059—Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Multimedia (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to a string matching data compression method based on adjustment of threshold matching errors, which comprises a coding string, a reference string, a set threshold and preset matching conditions, wherein the minimum matching unit of the coding string is a coding primitive, and the minimum matching unit of the reference string is a reference primitive; setting an initial threshold value and corresponding matching conditions, comparing whether the current coding primitive (or coding string) and the reference primitive (or reference string) meet the set matching conditions, adjusting the current threshold value after the current matching judgment is completed, and using the new adjusted threshold value to carry out matching judgment when the next coding primitive or coding string is matched. The invention considers the influence of the current matching error on the global error, and the global optimization processing is carried out for the matching of the subsequent primitives by adjusting the current threshold value, thereby obviously improving the coding efficiency.
Description
Technical field:
the invention relates to a method for lossy compression of data, in particular to a string matching data compression method based on adjustment of threshold matching errors.
The background technology is as follows:
in the 5G era, the internet data generated in various emerging applications are diversified and diverse in all things. Therefore, how to develop an efficient data encoding technology aiming at the characteristics of novel internet data with diversity and variability becomes an urgent need today. In order to further improve the coding efficiency of various new types of data with diversity and variability, the latest data coding techniques mainly include a multi-tree based, symmetrical or asymmetrical based, more flexible based traditional coding framework with "blocks" as codec units, and a string matching algorithm based on "strings" as codec units.
The minimum matching unit in the string matching algorithm is called a primitive, and the coding primitive represents the minimum matching unit of the coding string; the reference primitive represents the smallest matching unit of the reference string. In the lossy string matching algorithm, how to determine whether the current coding primitive matches the reference primitive is a key issue in the string matching algorithm. In the prior art, the lossy string matching algorithm mainly sets a threshold, the threshold is a fixed value, and whether the absolute value of the difference between the current coding primitive and the reference primitive is smaller than the preset single fixed threshold or not is compared, namely, a single fixed threshold method is adopted to judge whether the current coding primitive and the reference primitive are matched or not. For example: if the absolute value of the difference between the current coding primitive and the reference primitive is less than a preset single fixed threshold, then the current coding primitive is indicated to match the reference primitive.
The method adopting a single fixed threshold in the prior art mainly has the following defects:
(1) The use of a "single threshold" has the disadvantage of: when the threshold value is set smaller, the error between the reference string and the code string is smaller, the distortion is smaller, but the matching string length is shorter, so that the number of bits required to represent the current code string and the code information of the reference string is increased, and the coding efficiency is reduced; on the contrary, when the threshold value is set larger, the distortion of the reference string and the code string becomes larger, the matching string length becomes longer, and the reconstruction quality of the image is hardly ensured.
(2) The use of a "fixed threshold" has the disadvantage that: the fixed value of the threshold value is adopted because only partial error values of the coding primitive and the reference primitive are considered, and the whole error values of the coding string and the reference string and the error value information of the optimal reference string and the optimal mode before are not considered. In fact, whether the reference string can be the final best reference string is generally measured according to an average rate distortion minimization rule, i.e., in relation to the overall error value, etc. Therefore, only local error values cannot be considered, otherwise the coding efficiency is also affected.
To clearly illustrate the problems with the prior art using a single and fixed threshold, one embodiment is given below: when there are only a few large number of errors (the other errors are very small) in the code string and the reference string, the current code string is first divided into multiple code strings for processing by using a single fixed threshold method. Such as: the current code string has values of 177, 23, 177, 23, 40, 177, 165, 165, 165, and the reference string has values of 177, 23, 177, 23, 45, 177, 165, 165, and the single fixed threshold is set to 4, and the 5 th value of the current code string and the reference string exceeds the set threshold range, i.e., is a non-matching value. Therefore, when this situation is met, the single fixed threshold method needs to split the code string into a plurality of code strings, and then perform the matching confirmation one by one, which results in low efficiency of matching and coding of the lossy strings.
In view of this, the present invention has been developed.
The invention comprises the following steps:
in view of the problem of low efficiency of the string matching coding method in the prior art, the invention achieves the aim of improving the coding efficiency by a threshold adjustment mode, and specifically adopts the following technical scheme:
a string matching data compression method based on adjustment of threshold matching errors comprises a coding string, a reference string, a set threshold and preset matching conditions, wherein the minimum matching unit of the coding string is a coding primitive, and the minimum matching unit of the reference string is a reference primitive; setting an initial threshold value and a matching condition corresponding to the initial threshold value, and judging whether the current coding primitive is matched with the reference primitive or whether the current coding string is matched with the reference string or not by utilizing the initial threshold value and the matching condition corresponding to the initial threshold value; and after the comparison is completed, the current threshold value is adjusted, and when the next coding primitive or the coding string is matched, the new adjusted threshold value is used for matching judgment.
The current threshold value is further adjusted by adding/subtracting/multiplying/dividing the threshold value by a value, wherein the value adopts a fixed value or adopts a non-fixed value, and one of the modes of adding, subtracting, multiplying and dividing can be adopted or a plurality of mixed modes of operation can be adopted in the threshold value adjustment.
Further, one threshold is set, and the threshold is set by adopting a threshold corresponding to different components, or adopting a constant fixed value or adopting a non-fixed value.
Further, when the threshold is set to a fixed value, the preset matching condition is: the absolute value of the difference between the current encoded primitive and the reference primitive is less than the fixed threshold, or: the absolute value of the average error value of the current code string and the reference string is less than the fixed threshold, or is: the maximum error value of the current coding string and the reference string is smaller than the fixed threshold value; when the threshold is set to be a non-fixed value, the preset matching condition is as follows: the absolute value of the difference between the current encoded primitive and the reference primitive is less than the non-fixed threshold.
Further, a plurality of thresholds are set, wherein the thresholds are one of thresholds, constant fixed values and non-fixed values corresponding to different components, or the thresholds are combined.
Further, when the threshold is set to a fixed value a and a fixed value B, the preset matching condition is: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B, or the preset matching condition is that: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B; when the threshold is set to be a fixed value A and a non-fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a non-fixed value B; when the threshold is set to be a non-fixed value A and a fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B, or the preset matching condition is: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B; when the threshold is set to be a fixed value A of one component and a fixed value B of other components, the preset matching condition is as follows: the absolute value of the difference between one component of the current coding primitive and one component of the reference primitive is less than a fixed value a, and the absolute value of the difference between the other components of the current coding primitive and the other components of the reference primitive is less than a fixed value B.
Further, when the threshold value adopts a non-fixed value, the non-fixed value is an average value of absolute values of current best reference string error values, or is a maximum value of absolute values of current best reference string error values, or is a minimum value of absolute values of current best reference string error values, or is an average value of absolute values of error values obtained in a current best mode.
Further, the string matching data in the data compression method includes one of the following types, or several combinations of the following types, and the data types include: one-dimensional data; two-dimensional data; multidimensional data; a pattern; an image; a sequence of images; video; 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 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 three-component pixels (R, G, B); 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).
Further, the primitives in the coded primitive and the primitives in the reference primitive include a single component, or a single pixel, or a string of multiple components, or a string of multiple pixels.
The method comprises the steps of setting a plurality of threshold values, and adjusting only part of threshold values or all threshold values when the current threshold value is adjusted; the adjustment of the current threshold is achieved by adding/subtracting/multiplying/dividing the threshold by a value or by selecting a minimum/maximum value.
The invention improves the string matching algorithm realized by a single fixed threshold value adopted in the prior art, considers the influence of the current matching error on the global error, carries out global optimization processing on the matching of the subsequent primitives by adjusting the threshold value, and obviously improves the efficiency of string matching data coding.
The specific embodiment is as follows:
the invention discloses a string matching data compression method based on adjusting threshold matching error, aiming at improving data compression processing by adopting a string matching algorithm, aiming at improving coding efficiency, comprising the following steps: setting an initial threshold value and a matching condition corresponding to the initial threshold value, and judging whether the current coding primitive is matched with the reference primitive or whether the current coding string is matched with the reference string or not by utilizing the initial threshold value and the matching condition corresponding to the initial threshold value; and after the comparison is completed, the current threshold value is adjusted, and when the next coding primitive or the coding string is matched, the new adjusted threshold value is used for matching judgment.
When the data compression processing is performed in a string matching manner, a coding string, a reference string, a set threshold value and preset matching conditions are generally involved, wherein the minimum matching unit of the coding string is a coding primitive, and the minimum matching unit of the reference string is a reference primitive. The invention is mainly suitable for coding the lossy string matching data, wherein the data refers to any one of the following listed data, or can be any combination of the following data, and the data comprises:
1) One-dimensional data;
2) Two-dimensional data;
3) Multidimensional data;
4) A pattern;
5) An image;
6) A sequence of images;
7) Video;
8) A three-dimensional scene;
9) A sequence of continuously varying three-dimensional scenes;
10 A virtual reality scene;
11 A sequence of continuously changing virtual reality scenes;
12 An image in the form of pixels;
13 Transform domain data of the image;
14 A set of bytes of two or more dimensions;
15 A set of bits that are two or more dimensions;
16 A set of pixels;
17 A set of three-component pixels (Y, U, V);
18 A set of three-component pixels (Y, cb, cr);
19 A set of three-component pixels (Y, cg, co);
20 A set of three-component pixels (R, G, B);
21 A set of four-component pixels (C, M, Y, K);
22 A set of four-component pixels (R, G, B, a);
23 A set of four-component pixels (Y, U, V, a);
24 A set of four-component pixels (Y, cb, cr, a);
25 Four-component pixels (Y, cg, co, a).
The primitives in the above-given coded primitive or reference primitive mainly refer to the following: a single component, or a single pixel, or a string of multiple components, or a string of multiple pixels.
The threshold refers to the threshold corresponding to different components, or a constant fixed value with a value between 0 and 100, or a non-fixed value. The non-fixed values here include the following list of several: average value of absolute value of current best reference string error value; or is the maximum value of the absolute value of the current best reference string error value; or the minimum value of the absolute value of the current best reference string error value; or an average of the absolute values of the error values obtained for the current best mode.
The setting of the threshold value may be set to only one, and when the threshold value is set to a fixed value, the corresponding preset matching condition is one or a combination of the following:
1) The absolute value of the difference between the current coding primitive and the reference primitive is less than the fixed threshold;
2) The absolute value of the average error value of the current coding string and the reference string is smaller than the fixed threshold;
3) The maximum error value of the current code string and the reference string is less than the fixed threshold.
When the threshold is set to one and a non-fixed value is adopted, the preset matching condition is: the absolute value of the difference between the current encoded primitive and the reference primitive is less than the non-fixed threshold.
The setting of the threshold value can be multiple, and multiple matching conditions corresponding to the multiple threshold values can be met, or can be met simultaneously. The number of the multiple thresholds may be at least two, or may be two or more, and the multiple thresholds may be set as follows: (1) setting a fixed threshold A and a fixed threshold B; (2) setting a fixed threshold A and a non-fixed threshold B; (3) setting a non-fixed threshold A and a non-fixed threshold B; (4) Setting a threshold A corresponding to one component and a threshold B corresponding to other components; (5) Setting a threshold A corresponding to one component, a threshold B corresponding to other components and a fixed threshold C; (6) Setting a threshold A corresponding to one component, a threshold B corresponding to the other components and an unfixed threshold C, and specifically setting the threshold A, the threshold B and the unfixed threshold C according to the needs.
When the threshold value is set to be plural, the preset matching condition is one or a combination of the following, such as:
(1) When the threshold is set to a fixed value A and a fixed value B, the preset matching conditions are as follows:
(1a) The absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B;
(1b) The absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B.
(2) When the threshold is set to be a fixed value A and a non-fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is less than a fixed value a or/and the absolute value of the average error value of the current coding string and the reference string is less than a non-fixed value B.
(3) When the threshold is set to be a non-fixed value A and a fixed value B, the preset matching conditions are as follows:
(3a) The absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B;
(3b) The absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B.
(4) When the threshold is set to be a fixed value A of one component and a fixed value B of other components, the preset matching condition is as follows: the absolute value of the difference between one component of the current coding primitive and one component of the reference primitive is less than a fixed value a, and the absolute value of the difference between the other components of the current coding primitive and the other components of the reference primitive is less than a fixed value B.
The adjustment of the threshold value is realized by adding/subtracting/multiplying/dividing the threshold value by a numerical value, the numerical value adopts a fixed numerical value or adopts a non-fixed numerical value, one operation mode of adding, subtracting, multiplying and dividing can be adopted during the adjustment of the threshold value, and a plurality of mixed operation modes can also be adopted for setting according to actual needs. When the scheme of setting multiple thresholds is adopted, the method can only adjust a part of set thresholds, can also adjust all thresholds, and can select according to specific needs; when multiple thresholds are to be adjusted, the adjustment of the current threshold can be achieved by adding/subtracting/multiplying/dividing the threshold by a value, or selecting a minimum/maximum value, and selecting according to the needs.
A detailed description of several specific embodiments is given below:
example 1:
1.1 setting a threshold: a single non-fixed threshold A, wherein the initial value of the threshold is the average error value obtained by the current optimal reference string;
setting matching conditions: the absolute value of the difference between the current coding primitive and the reference primitive is less than the threshold A;
1.2, judging matching: if the absolute value of the difference between the current coding primitive and the reference primitive is smaller than the threshold A, the current coding primitive is matched with the reference primitive, and if the matching condition is not met, the current coding primitive is not matched with the reference primitive;
1.3, adjusting the current threshold A, wherein the adjusted threshold A' is adjusted as follows:
a' = (total error of best reference string-total error of current coding string)/(length of best reference string-length of current coding string);
and 1.4, continuously searching the next coding primitive, adopting the adjusted threshold value and the adjusted corresponding matching condition in the step 1.3 to carry out matching judgment on the next coding primitive, and then circularly operating according to the steps.
Example 2:
2.1 setting a threshold: setting an unfixed threshold A and an unfixed threshold B, wherein the initial value of the unfixed threshold A is an average error value obtained by a current optimal reference string, and the unfixed threshold B is an average error value obtained by a current optimal mode;
setting matching conditions:
condition 1: the absolute value of the difference between the current coding primitive and the reference primitive is less than the threshold A;
condition 2: the absolute value of the average error value of the current code string is smaller than a threshold B;
2.2, judging matching: if the condition 1 is met or the condition 2 is met, the current coding primitive is matched with the reference primitive, and if neither the condition 1 nor the condition 2 is met, the current coding primitive is not matched with the reference primitive;
2.3, adjusting the current threshold A, wherein the adjusted threshold is A', and the adjustment is as follows:
a' = (total error of best reference string-total error of current coding string)/(length of best reference string-length of current coding string);
and 2.4, continuously searching the next coding primitive, adopting the adjusted threshold A' and the adjusted corresponding matching condition 1 in the step 2.3, and adopting the original threshold B and the original condition 2 to continuously carry out matching judgment on the next coding primitive, and then carrying out cyclic operation according to the steps.
Example 3:
3.1 setting a threshold: setting an unfixed threshold A and an unfixed threshold B, wherein the unfixed threshold A is an average error value obtained by a current optimal reference string minus a set value, and the unfixed threshold B is an average error value obtained by the current optimal reference string plus a set value, and the A is smaller than the B;
setting matching conditions:
condition 1: the absolute value of the difference between the current coding primitive and the reference primitive is less than the threshold A or less than the threshold B;
condition 2: the average error value of the optimal reference string A1 obtained by the current coding string through the threshold A is smaller than the average error value of the optimal reference string B1 obtained by the threshold B;
3.2, judging matching: if the condition 1 is satisfied, the coding primitive is matched with the reference primitive, and the optimal reference string A1 and the optimal reference string B1 are obtained at the same time; if the condition 1 is not satisfied, judging whether the condition 2 is satisfied, if the condition 2 is satisfied, indicating that the current coding string is matched with the optimal reference string A1, and adjusting the threshold A according to the step 3.3; otherwise, the current coding string is matched with the optimal reference string B1, and the threshold B is adjusted according to the step 3.4;
3.3, adjusting the current threshold A, wherein the adjusted threshold is A', and the adjustment is as follows:
a' =min (a+preset, B);
3.4, adjusting the current threshold B, wherein the adjusted threshold is B', and the adjustment is as follows:
b' =max (B-preset value, a);
and 3.5, continuously searching the next coding primitive, adopting the adjusted threshold A 'or B' in 3.3 or 3.4 and the adjusted corresponding matching condition 1 and matching condition 2 to continuously carry out matching judgment on the next coding primitive, and then carrying out cyclic operation according to the steps.
The above embodiments are only for illustrating the technical solution of the present invention, but not for limiting, and other modifications and equivalents thereof by those skilled in the art should be included in the scope of the claims of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (8)
1. A string matching data compression method based on adjustment of threshold matching errors is characterized in that: the method comprises a coding string, a reference string, a set threshold value and preset matching conditions, wherein the minimum matching unit of the coding string is a coding primitive, and the minimum matching unit of the reference string is a reference primitive; setting an initial threshold value and a matching condition corresponding to the initial threshold value, and judging whether the current coding primitive is matched with the reference primitive or whether the current coding string is matched with the reference string or not by utilizing the initial threshold value and the matching condition corresponding to the initial threshold value; when the comparison is completed, the current threshold value is adjusted, and when the next coding primitive or coding string is matched, the new adjusted threshold value is used for matching judgment; setting one threshold value, wherein the threshold value is a threshold value corresponding to different components, or a constant fixed value or a non-fixed value; when the threshold is set to be a fixed value, the preset matching conditions are as follows: the absolute value of the difference between the current encoded primitive and the reference primitive is less than the fixed threshold, or: the absolute value of the average error value of the current code string and the reference string is less than the fixed threshold, or is: the maximum error value of the current coding string and the reference string is smaller than the fixed threshold value; when the threshold is set to be a non-fixed value, the preset matching condition is as follows: the absolute value of the difference between the current encoded primitive and the reference primitive is less than the non-fixed threshold.
2. The string match data compression method based on the adjustment threshold match error of claim 1, wherein: the adjustment of the current threshold value is realized by adding/subtracting/multiplying/dividing the threshold value by a numerical value, wherein the numerical value adopts a fixed numerical value or adopts a non-fixed numerical value, and one operation mode of adding, subtracting, multiplying and dividing can be adopted in the adjustment of the threshold value, and a plurality of mixed operation modes can also be adopted.
3. The string match data compression method based on the adjustment threshold match error of claim 1, wherein: the threshold value is set to be a plurality of, the threshold value corresponding to different components, the constant fixed value or the non-fixed value is adopted by the plurality of threshold values, or the plurality of threshold values are combined by the plurality of threshold values.
4. A string match data compression method based on an adjusted threshold match error as claimed in claim 3, wherein: when the threshold is set to be a fixed value A and a fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B, or the preset matching condition is that: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B; when the threshold is set to be a fixed value A and a non-fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a non-fixed value B; when the threshold is set to be a non-fixed value A and a fixed value B, the preset matching conditions are as follows: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the absolute value of the average error value of the current coding string and the reference string is smaller than a fixed value B, or the preset matching condition is: the absolute value of the difference between the current coding primitive and the reference primitive is smaller than a non-fixed value A or/and the maximum error value of the current coding string and the reference string is smaller than a fixed value B; when the threshold is set to be a fixed value A of one component and a fixed value B of other components, the preset matching condition is as follows: the absolute value of the difference between one component of the current coding primitive and one component of the reference primitive is less than a fixed value a, and the absolute value of the difference between the other components of the current coding primitive and the other components of the reference primitive is less than a fixed value B.
5. A string match data compression method based on an adjusted threshold match error as claimed in claim 1 or 3, characterized by: when the threshold value adopts a non-fixed value, the non-fixed value is the average value of the absolute values of the current best reference string error values, or is the maximum value of the absolute values of the current best reference string error values, or is the minimum value of the absolute values of the current best reference string error values, or is the average value of the absolute values of the error values obtained in the current best mode.
6. The string match data compression method based on the adjustment threshold match error of claim 1, wherein: the string matching data in the data compression method comprises one of the following types or a combination of the following types, wherein the data types comprise: one-dimensional data; two-dimensional data; multidimensional data; a pattern; an image; a sequence of images; video; 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 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 three-component pixels (R, G, B); 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).
7. The string match data compression method based on the adjustment threshold match error of claim 1, wherein: the primitives in the coded primitive and the primitives in the reference primitive comprise single components, single pixels, strings of multiple components, or strings of multiple pixels.
8. A string match data compression method based on an adjusted threshold match error as claimed in claim 3, wherein: the number of the thresholds is set to be multiple, and when the current threshold is adjusted, only part of the thresholds are adjusted, or all the thresholds are adjusted; the adjustment of the current threshold is achieved by adding/subtracting/multiplying/dividing the threshold by a value or by selecting a minimum/maximum value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910393318.3A CN110197513B (en) | 2019-05-13 | 2019-05-13 | String matching data compression method based on adjustment threshold matching error |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910393318.3A CN110197513B (en) | 2019-05-13 | 2019-05-13 | String matching data compression method based on adjustment threshold matching error |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110197513A CN110197513A (en) | 2019-09-03 |
| CN110197513B true CN110197513B (en) | 2023-04-28 |
Family
ID=67752628
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910393318.3A Active CN110197513B (en) | 2019-05-13 | 2019-05-13 | String matching data compression method based on adjustment threshold matching error |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110197513B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112987616B (en) * | 2021-03-15 | 2022-03-25 | 沈阳智谷科技有限公司 | Ultrahigh-speed electronic package acquisition system and method based on magnetic variable signals |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB0018259D0 (en) * | 2000-07-25 | 2000-09-13 | Sony Uk Ltd | Data compression |
| CN1619538A (en) * | 2004-12-03 | 2005-05-25 | 北京北方烽火科技有限公司 | Linear parameter fuzzy matching algorithm of short massage contents |
| CN1870440A (en) * | 2005-05-23 | 2006-11-29 | 奥林巴斯映像株式会社 | Data encoding apparatus, data decoding apparatus, data encoding method, data decoding method |
| CN102710940A (en) * | 2012-06-04 | 2012-10-03 | 公安部第三研究所 | Digital signal processor (DSP) platform-based method for realizing optimization of video coding by utilizing motion estimation algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10089353B2 (en) * | 2015-10-29 | 2018-10-02 | International Business Machines Corporation | Approximate string matching optimization for a database |
-
2019
- 2019-05-13 CN CN201910393318.3A patent/CN110197513B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB0018259D0 (en) * | 2000-07-25 | 2000-09-13 | Sony Uk Ltd | Data compression |
| CN1619538A (en) * | 2004-12-03 | 2005-05-25 | 北京北方烽火科技有限公司 | Linear parameter fuzzy matching algorithm of short massage contents |
| CN1870440A (en) * | 2005-05-23 | 2006-11-29 | 奥林巴斯映像株式会社 | Data encoding apparatus, data decoding apparatus, data encoding method, data decoding method |
| CN102710940A (en) * | 2012-06-04 | 2012-10-03 | 公安部第三研究所 | Digital signal processor (DSP) platform-based method for realizing optimization of video coding by utilizing motion estimation algorithm |
Non-Patent Citations (5)
| Title |
|---|
| A flexible and uniform string matching technique for general screen content coding;Kailun Zhou，etc.;《Multimed Tools Appl》;20180201;第1-25页 * |
| Plagiarism Detection in Homework Based on Image Hashing;Ying Chen，etc.;《Springer Nature Singapore Pte Ltd.》;20171231;第424-432页 * |
| 一种优化黑洞覆盖的阴性选择算法;傅龙天等;《哈尔滨师范大学自然科学学报》;20150215(第01期);第41-44页 * |
| 字符串匹配算法比较与分析;严大治;《计算机光盘软件与应用》;20131231;第138,140页 * |
| 融合像素串匹配的ＡＶＳ２全色度屏幕与混合内容视频编码算法;赵利平,等;《计算机学报》;20181130;第2482-2495页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110197513A (en) | 2019-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113382254B (en) | Encoding and decoding method, device, equipment and storage medium | |
| US7483584B2 (en) | Extended hybrid variable length coding of transform coefficients for video compression | |
| US20060017592A1 (en) | Method of context adaptive binary arithmetic coding and apparatus using the same | |
| CN109379598B (en) | Image lossless compression method based on FPGA | |
| CN102668560B (en) | Embedded graphics coding: reordered bitstream for parallel decoding | |
| CN105898300B (en) | A kind of improvement transformation coefficient sign bit hidden method based on recovery transformation coefficient | |
| CN113422966B (en) | Multi-model CNN loop filtering method | |
| US7471840B2 (en) | Two-dimensional variable length coding of runs of zero and non-zero transform coefficients for image compression | |
| CN110197513B (en) | String matching data compression method based on adjustment threshold matching error | |
| Chen et al. | Pixel-level texture segmentation based AV1 video compression | |
| TWI533670B (en) | Method for decoding picture in form of bit-stream | |
| CN107770527B (en) | Data compression method and apparatus using neighboring encoding parameters and nearest encoding parameters | |
| CN110113605A (en) | A kind of video error coverage method hiding based on histogram translation reversible information | |
| CN104902281A (en) | Hamming code plus one-based information hiding method of HEVC video | |
| CN112954318A (en) | Data coding method and device | |
| CN114071140B (en) | Decoding method, encoding method, device, equipment and machine readable storage medium | |
| CN108024114B (en) | High-capacity lossless HEVC information hiding method based on flag bit parameter modification | |
| EP1573677B1 (en) | Color image compression with adaptive prediction | |
| CN110087073B (en) | Multi-threshold string matching data compression method | |
| CN110287149A (en) | A kind of matching coding method using Hash Search | |
| CN107770543B (en) | Data compression method and device for sequentially increasing cutoff values in multiple types of matching parameters | |
| CN118450131A (en) | Method and device for decoding data with fixed-length code unit containing multiple coding parameter variable-length codes | |
| CN112449186B (en) | Encoding method, decoding method, corresponding devices, electronic equipment and storage medium | |
| CN112449201B (en) | Decoding method, encoding method, corresponding devices, electronic equipment and storage medium | |
| Wu et al. | Improved angle freeman chain code using improved adaptive arithmetic coding |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240821 Address after: Room 401-17A, No. 45 Fuhua East Street, Tangdong, Tianhe District, Guangzhou City, Guangdong Province, 510000 (office only) Patentee after: Guangzhou onchi Intellectual Property Consulting Co.,Ltd. Country or region after: China Address before: 312000 No. 508 West Ring Road, Zhejiang, Shaoxing Patentee before: SHAOXING University Country or region before: China |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20241008 Address after: No.555, Qianmo Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: Hangzhou Hikvision Digital Technology Co.,Ltd. Country or region after: China Address before: Room 401-17A, No. 45 Fuhua East Street, Tangdong, Tianhe District, Guangzhou City, Guangdong Province, 510000 (office only) Patentee before: Guangzhou onchi Intellectual Property Consulting Co.,Ltd. Country or region before: China |