CN115086684A - Image compression method, system and medium based on CRC - Google Patents
Image compression method, system and medium based on CRC Download PDFInfo
- Publication number
- CN115086684A CN115086684A CN202211003384.3A CN202211003384A CN115086684A CN 115086684 A CN115086684 A CN 115086684A CN 202211003384 A CN202211003384 A CN 202211003384A CN 115086684 A CN115086684 A CN 115086684A
- Authority
- CN
- China
- Prior art keywords
- polynomial
- elements
- power
- crc
- data
- 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/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- 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/65—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of image processing, in particular to an image compression method, system and medium based on CRC. The method comprises the following steps: binary conversion is carried out on the pixel value of each pixel point in the image to be compressed, a plurality of streaming data are obtained through segmentation, a first polynomial and a third polynomial corresponding to each streaming data are obtained, and the third polynomial is a polynomial of a CRC (cyclic redundancy check) code corresponding to the streaming data; constructing a power matrix based on the first polynomial and the third polynomial corresponding to all streaming data; dividing the power matrix into a plurality of zero sequences and normal sequences; carrying out coding compression of different methods on elements in the normal sequence and elements in the zero sequence, and obtaining compressed data corresponding to the image to be compressed after coding compression of all the zero sequence and the normal sequence; the compression ratio of the data to be compressed is increased, the data volume in data transmission is reduced, and the efficiency in the compression transmission process is improved.
Description
Technical Field
The invention relates to the technical field of image processing, in particular to an image compression method, system and medium based on CRC.
Background
With the explosive increase of communication data volume, data loss often occurs in the processes of data compression, transmission and storage, so that the transmitted data is often verified in a CRC check code manner to judge whether the data is damaged or lost, and if an error occurs in the obtained data verification process, the data is damaged or lost.
The existing method for verifying data by adopting CRC (cyclic redundancy check) codes is usually to add CRC codes to data compressed by original data, and to judge whether data damage and loss occur in the data transmission process by performing operation between the compressed data and the CRC codes during decompression, but more CRC codes often exist when the image is compressed more or longer, and the CRC codes are not compressed, so that the data transmission amount is increased in the data transmission process, and the efficiency in the compression transmission process is reduced.
Disclosure of Invention
In order to solve the above technical problems, an object of the present invention is to provide an image compression method, system and medium based on CRC, wherein the adopted technical solution is as follows:
in a first aspect, an embodiment of the present invention provides a CRC-based image compression method, including the following steps:
performing binary conversion on a pixel value of each pixel point in an image to be compressed, setting a preset length, segmenting the converted binary data to obtain a plurality of stream data, and constructing a first polynomial corresponding to each stream data;
randomly constructing a second polynomial, and acquiring the highest power of the second polynomial, wherein the highest power of the second polynomial is smaller than that of the first polynomial; updating the streaming data to the highest power of the second polynomial; taking binary data corresponding to the second polynomial as a divisor, taking the updated streaming data as a dividend to obtain a remainder, wherein the remainder is a CRC (cyclic redundancy check) code, and constructing a third polynomial of the CRC code;
constructing a power matrix based on the first polynomial and the third polynomial corresponding to all the streaming data, wherein each row of elements in the power matrix are power exponents of the first polynomial and the third polynomial of the streaming data; dividing each row of elements of the power matrix into a plurality of subsequences based on zero elements in the power matrix, wherein the subsequences comprise a zero sequence and a normal sequence;
obtaining a plurality of groups of continuous power-down elements according to element changes in each normal sequence, obtaining a starting point and an end point of each group of continuous power-down elements, and calculating a difference value between the starting point and the end point; coding and compressing each group of continuous power-down elements according to the difference value and the starting point; and counting the number of zero elements in the zero sequence, performing coding compression on the zero sequence based on the number of the zero elements, and obtaining compressed data corresponding to the image to be compressed after coding compression of all the zero sequence and the normal sequence.
Preferably, the step of updating the streaming data to the highest power of the second polynomial includes:
and obtaining a numerical value corresponding to the highest power of the second polynomial, subtracting 1 from the numerical value to obtain a complementary bit value, and supplementing 0 after the streaming data according to the complementary bit value, wherein the number of the 0 is consistent with the complementary bit value.
Preferably, the zero sequence is a subsequence with all zero elements, and the normal sequence is a subsequence with non-zero elements.
Preferably, the step of obtaining a plurality of groups of continuous power-down elements according to element changes in each normal sequence and obtaining a starting point and an ending point of each group of continuous power-down elements includes:
when the elements in the normal sequence decrease progressively by taking 1 as a difference value, the elements are continuous power-decreasing elements, and the elements which decrease progressively by 1 each time form a group of continuous power-decreasing elements;
the first element in each group of successive power-down elements is a starting point and the last element is an ending point.
Preferably, the step of performing encoding compression on each group of consecutive power down elements according to the difference and the starting point includes:
and adding one to the numerical value of the difference value to be used as the statistical frequency, and using the statistical frequency and the numerical value corresponding to the starting point as the code corresponding to a group of continuous power-lowering elements.
Preferably, the coding of the zero sequence is obtained by the number of zero elements in the zero sequence and zero.
In a second aspect, an embodiment of the present invention provides a CRC-based image compression system, including: a memory, a processor and a computer program stored in said memory and executable on said processor, said processor implementing the steps as described above for a CRC based image compression method when executing the computer program.
In another aspect, an embodiment of the present invention provides a readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the above-mentioned CRC-based image compression method.
The invention has the following beneficial effects: in the embodiment of the invention, the streaming data and the corresponding CRC check code construct a power matrix, and the coding compression is carried out according to the value of each element in the power matrix and the relevance of continuous power reduction among the elements, so that the compression ratio of the data is improved, the data compression speed is higher, and the method of compressing the CRC check codes together is adopted, so that the data volume during the subsequent transmission of the compressed data can be reduced, and the data transmission speed is improved; meanwhile, the image to be compressed is divided into a plurality of streaming data for analysis, the CRC check code of each streaming data is calculated conveniently, and the overall efficiency of data compression is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions and advantages of the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of an image compression method based on CRC according to an embodiment of the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention adopted to achieve the predetermined objects, the following detailed description will be given of embodiments, structures, features and effects of a CRC-based image compression method, system and medium according to the present invention with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The present invention provides a CRC-based image compression method, system and medium, which are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, a flowchart of a CRC-based image compression method according to an embodiment of the present invention is shown, where the method includes the following steps:
step S100, binary conversion is carried out on the pixel value of each pixel point in the image to be compressed, the converted binary data is segmented by setting a preset length to obtain a plurality of stream data, and a first polynomial corresponding to each stream data is constructed.
Specifically, an image to be compressed is recorded as an image to be compressed, and the image to be compressed is subjected to digital processing, that is, the pixel value of each pixel point in the image to be compressed is converted into eight-bit binary data; after image compression, whether data loss exists in the transmission process is judged by a common CRC check method, and the common CRC check method comprises the following steps: CRC-8, CRC-16, and CRC-32; in order to facilitate calculation, a CRC check method with a preset length is adopted in the embodiment of the invention, and subsequent processing is carried out by using CRC-k, wherein k is a positive integer and is set by an implementer according to the actual situation.
Firstly, an image to be compressed is segmented by a preset length k, namely, binary data of each k bit length is segmented, the segmented k bit binary data is recorded as streaming data, and the binary data of all pixel points in the image to be compressed can be segmented into a plurality of streaming data.
Then each stream data is converted into a corresponding polynomial to be recorded as a first polynomial, and since the stream data is composed of binary data of 0 and 1, the conversion method between the binary data and the polynomial is an existing means, such as a polynomial
The corresponding binary data is: 100101; polynomial equation
The corresponding binary data is: 111010001, respectively; therefore, the corresponding first polynomial can be obtained based on the obtained streaming data as follows:
wherein,
represents the length of the streaming data, which is also the highest power of the streaming data;
polynomial coefficients respectively representing different powers;
representing constant terms in the polynomial.
Step S200, randomly constructing a second polynomial, and acquiring the highest power of the second polynomial, wherein the highest power of the second polynomial is smaller than that of the first polynomial; updating the flow data with the highest power of the second polynomial; and taking the binary data corresponding to the second polynomial as a divisor, taking the updated streaming data as a dividend to obtain a remainder, taking the remainder as a CRC check code, and constructing a third polynomial of the CRC check code.
Obtaining a first polynomial corresponding to each streaming data of the image to be compressed in step S100, and obtaining a CRC check code of each streaming data since the compressed data needs to verify whether the data is lost or tampered with by using the CRC check code; randomly constructing a polynomial and recording the polynomial as a second polynomial, obtaining a numerical value corresponding to the highest power of the second polynomial, subtracting 1 from the numerical value to obtain a bit-complementing value, and complementing 0 after streaming data according to the bit-complementing value, wherein the number of the complemented 0 is consistent with the bit-complementing value.
As an example, the method for acquiring the CRC check code of any streaming data includes: randomly constructing a polynomial and recording the polynomial as a second polynomial, wherein the highest power of the second polynomial is less than that of the first polynomial corresponding to the streaming data, namely the highest power of the second polynomial is less than k; assume that the second polynomial constructed in the embodiment of the present invention is
Then the binary data corresponding to the second polynomial is 100001; and taking the binary data corresponding to the second polynomial as a divisor, supplementing 4 bits of 0 after the original streaming data to obtain new streaming data because the highest power of the binary data corresponding to the second polynomial is 5, taking the new streaming data as a dividend, and operating the dividend and the divisor according to a modulo-2 division method to obtain a quotient and a remainder, wherein the remainder is the CRC (cyclic redundancy check) code of the original streaming data.
It should be noted that, since the dividend and the divisor are both binary data, the obtained remainder is also binary data, that is, a corresponding polynomial can be obtained according to the remainder, and the polynomial corresponding to the remainder is denoted as a third polynomial, which is a polynomial of the CRC check code.
And by analogy, the CRC check code corresponding to each streaming data can be obtained by using the second polynomial, that is, the third polynomial corresponding to each streaming data.
Step S300, constructing a power matrix based on the first polynomial and the third polynomial corresponding to all the streaming data, wherein each row of elements in the power matrix are power exponents of the first polynomial and the third polynomial of the streaming data; each row of elements of the power matrix is divided into a plurality of subsequences based on zero elements in the power matrix, and the subsequences comprise a zero sequence and a normal sequence.
Obtaining a first polynomial and a third polynomial corresponding to each streaming data in each image to be compressed through step S100 and step S200, and constructing a power matrix based on power exponents in the first polynomial and the third polynomial corresponding to each streaming data, wherein each element in the power matrix is the power exponent of the first polynomial and the third polynomial.
In the construction of the power matrix, the redundancy in the original binary data is removed, the construction is carried out only by the power exponent corresponding to the position 1 in the binary data, and the original streaming data and the CRC (cyclic redundancy check) code data are simultaneously compressed and transmitted, so that the transmission quantity of the data is reduced.
As an example, please refer to table 1, which is a table of elements in a power matrix, each row of the power matrix is a concatenation of a power exponent of a first polynomial and a power exponent of a third polynomial corresponding to streaming data, and a length of a polynomial including 1 in a maximum number in binary data corresponding to the concatenated polynomial is a length of the power matrix.
TABLE 1
In the embodiment of the present invention, the first 14 bits of each row of the power matrix are formed by power exponents of the first polynomial, and then the highest power of the first polynomial of the streaming data shown in table 1 is 16, that is, the power matrix sequentially arranges the power exponents included in the first polynomial to obtain a row of elements; the first row element in the power matrix represents that binary data of the highest power in the first polynomial corresponding to the streaming data is 0, so that 15 is taken as the initial power exponent to the power of 0, and in order to keep the consistency of the length of the power matrix, the last bit of the first polynomial in the first row is complemented with 0; the last 9 bits of each row in the power matrix are a third polynomial, the highest power in the third polynomial is 8, the highest powers in the third polynomial are sequentially arranged backwards, and 0 is complemented at the position where the power exponent is insufficient.
The normal CRC process is to compress the streaming data first, calculate the CRC code of the compressed data in the transmission process, and then add the CRC code to the rear of the streaming data for transmission, so that the data transmission efficiency is low and the calculated amount is large due to repeated calculation of the data; in order to increase the compression transmission speed of an image to be compressed, elements of each row in the power matrix are segmented to obtain a plurality of subsequences, and different compression methods are adopted for different subsequences.
In the method for dividing the power matrix in the embodiment of the present invention, the position of 0 element in each row in the power matrix is used as the dividing position, and as an example, if it is required to divide the first row element of the power matrix at this time, the position of 0 element in the first row is used as the dividing position, and the first subsequence is used as the dividing position
The second subsequence is
The third subsequence is
The fourth subsequence is
。
By analogy, dividing elements in each row in the power matrix to obtain a plurality of corresponding subsequences; and recording the subsequences with all 0 elements as zero sequences, and recording the subsequences with non-zero elements as normal sequences.
Step S400, obtaining a plurality of groups of continuous power-down elements according to element changes in each normal sequence, obtaining a starting point and an end point of each group of continuous power-down elements, and calculating a difference value between the starting point and the end point; coding and compressing each group of continuous power-down elements according to the difference and the starting point; and counting the number of zero elements in the zero sequence, performing coding compression on the zero sequence based on the number of the zero elements, and obtaining compressed data corresponding to the image to be compressed after coding compression of all the zero sequences and the normal sequence.
Dividing each row of elements in the power matrix into a plurality of subsequences by step S300, wherein the subsequences comprise a zero sequence and a normal sequence; given that elements in the power matrix are mainly composed of power exponents of streaming data, when normal run-length coding is used, the numerical value of the power is related to position information of 1 in binary data, so that the obtained normal sequence composed of the power exponents does not have continuity.
In the process of coding and compressing, the power exponent corresponding to the position 1 in the binary data represents the continuity of the power exponents in the power matrix and the continuity of the power exponents corresponding to the CRC check code, so that the coding mode of run-length coding is changed according to the correlation between the power exponents; firstly, each group of continuous power-lowering elements in each normal sequence is identified, the continuous power-lowering in the embodiment of the invention means that power exponentiation is sequentially lowered by taking the difference value as 1, the first element in each group of continuous power-lowering elements in the normal sequence is taken as a starting point, the last element in each group of continuous power-lowering elements is taken as an end point, and multiple groups of continuous power-lowering elements may exist in one normal sequence.
Then, the difference between the start point and the end point of each group of successive power reductions in the normal sequence is calculated:
wherein,
representing the difference between the starting point and the ending point;
representing the power exponent corresponding to the starting point of the continuous power-lowering element;
indicating the power exponent corresponding to the end point of the successive power down elements.
Furthermore, when the group of continuous power-lowering elements are coded and compressed, the numerical value of the difference is added with one to be used as the statistical frequency, the 'statistical frequency, the starting point' is used as the coding of the group of continuous power-lowering elements, namely the coding structure is 'N + 1',
". As an example, assume a subsequence of the first row in a power matrix
Performing coding compression by firstly obtaining a group of continuous power-lowering elements in the subsequence as
Then 15 is the starting point and 13 is the ending point, the difference between the starting point and the ending point is calculated
A value of 2 then encodes the set of successively powered down elements as 3, 15.
It should be noted that, for a single element in which there is no continuous power reduction in the subsequence, when the single element is compressed and encoded, the number of statistics is 1, and the starting point is the value of the element itself.
For the zero sequence, all elements of the zero sequence are zero, so a normal run-length coding mode is adopted for the zero sequence, namely, the number of zero elements in the zero sequence is counted, and the zero sequence is coded according to a coding structure of 'zero element number, 0'; since fewer elements of 1 in the binary data corresponding to each row of the power matrix indicate more corresponding 0, the compression ratio is larger when the normal run-length coding is adopted to code and compress the zero sequence.
Coding and compressing elements of each row in the power matrix by using a coding method of a normal sequence and a zero sequence to obtain final compressed data; as an example, suppose that the first row of elements in the power matrix needs to be encoded and compressed at this time, the first row of elements of the power matrix is: 15, 14, 13, 11, 10, 9, 8, 7, 5, 4, 3, 1, 0, 0, 8, 5, 4, 3, 2, 0, 0, 0, 0; then, the sub-sequence and the zero sequence in the first row are respectively encoded to obtain compressed codes as follows: 3, 15, 5, 11, 3, 5, 1, 1, 2, 0,1, 8, 4, 5, 4, 0; wherein 3, 15 is obtained by compression coding a first group of continuous power-down elements 15, 14, 13 in the first row element; 5, 11 is obtained by compression coding a second group of continuous power-down elements 11, 10, 9, 8, 7 in the first row of elements; 3, 5 is obtained by compression coding a third group of continuous power-down elements 5, 4, 3 in the first row element; 1, 1 is obtained by compression coding of a single element 1; 2, 0 is obtained by compression coding of a first zero sequence 0, 0 in a first row element; 1, 8 are obtained by single element 8 compression coding; 4, 5 is derived from a fourth set of successive power-down elements 5, 4, 3, 2 in the first row of elements; 4, 0 is obtained by compression encoding the second zero sequence 0, 0, 0, 0 in the first row element.
By analogy, encoding compression of the same method is carried out on elements of each row in the power matrix; for image data needing CRC, the image data is compressed by combining continuous power-down coding with traditional run-length coding, so that the compression ratio is larger, and the CRC codes are compressed at the same time, so that the transmission quantity of subsequent data is reduced, and efficient compression and transmission are realized.
Furthermore, compressed data of an image to be compressed is obtained after encoding and compressing is carried out according to each row of elements in the power matrix, when a receiving end receives the compressed data, decompression can be carried out according to the data of each row, the decompression method is still carried out based on the continuous power-lowering elements and is based on the statistical times N +1 in the compressed data and the starting point
Performing decompression, i.e. from the starting point
Starting to continuously lower the power for N times; e.g. when N +1=5, starting point
Then, starting from the starting point 20, the power is reduced for 4 times continuously, and the decompressed data are 20,19,18,17 and 16; and obvious 0 appears in the data after zero sequence coding compression, so that the original data to be compressed can be obtained by decompressing the compressed data comprising the zero element number and the 0 element based on the zero element number and the 0 element.
Whether data loss and tampering occur in the transmission process is judged according to the data obtained by decompressing the compressed data by the receiving end, the judging method is carried out based on a CRC (cyclic redundancy check) code, and the CRC method is the prior known technology and is not repeated.
In summary, in the embodiment of the present invention, an image to be compressed is digitized, that is, a pixel value of each pixel point in the image to be compressed is converted into binary data, the converted binary data is segmented to obtain a plurality of streaming data of the image to be compressed, and a polynomial corresponding to each streaming data is constructed and recorded as a first polynomial; then randomly constructing a second polynomial, wherein the highest power of the second polynomial is less than that of the first polynomial, updating the binary data corresponding to the first polynomial, calculating the quotient and remainder of the new binary data and the binary data corresponding to the second polynomial, wherein the remainder is the CRC check code of the streaming data corresponding to the first polynomial, and constructing the polynomial of the CRC check code and marking as a third polynomial; furthermore, a power matrix is constructed according to the first polynomial and the third polynomial corresponding to all streaming data, elements of each row in the power matrix are segmented to obtain a plurality of subsequences, each subsequence comprises a zero sequence and a normal sequence, the zero sequence is coded and compressed by adopting the traditional run length coding, the normal sequence is coded and compressed according to the continuous power reduction condition, namely, each group of continuous power reduction elements in each normal sequence and a starting point and an ending point of continuous power reduction are obtained, each group of continuous power reduction elements are coded and compressed according to the starting point and the ending point, finally, the coded and compressed sub-sequences in the power matrix are compressed to obtain compressed data of an image to be compressed, the compression ratio is increased, the data amount in transmission is reduced by simultaneously compressing CRC check codes, and the efficiency in the compression transmission process is improved.
Based on the same inventive concept as the method embodiment, the embodiment of the present invention further provides an image compression system based on CRC, the system comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor. The processor, when executing the computer program, implements the steps in one embodiment of the CRC-based image compression method described above, such as the steps shown in fig. 1. The image compression method based on CRC is described in detail in the above embodiments, and is not described again.
An embodiment of the present invention further provides a readable storage medium, where a computer program is stored, and when being executed by a processor, the computer program implements the steps in the above-mentioned embodiment of the CRC-based image compression method.
It should be noted that: the precedence order of the above embodiments of the present invention is only for description, and does not represent the merits of the embodiments. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that are within the spirit of the present invention are intended to be included therein.
Claims (8)
1. A CRC-based image compression method, comprising the steps of:
binary conversion is carried out on the pixel value of each pixel point in an image to be compressed, a preset length is set, the converted binary data are segmented to obtain a plurality of streaming data, and a first polynomial corresponding to each streaming data is constructed;
randomly constructing a second polynomial, and acquiring the highest power of the second polynomial, wherein the highest power of the second polynomial is smaller than that of the first polynomial; updating the streaming data to the highest power of the second polynomial; taking binary data corresponding to the second polynomial as a divisor, taking the updated streaming data as a dividend to obtain a remainder, wherein the remainder is a CRC (cyclic redundancy check) code, and constructing a third polynomial of the CRC code;
constructing a power matrix based on the first polynomial and the third polynomial corresponding to all the streaming data, wherein each row of elements in the power matrix are power exponents of the first polynomial and the third polynomial of the streaming data; dividing each row of elements of the power matrix into a plurality of subsequences based on zero elements in the power matrix, wherein the subsequences comprise a zero sequence and a normal sequence;
obtaining a plurality of groups of continuous power-down elements according to element changes in each normal sequence, obtaining a starting point and an end point of each group of continuous power-down elements, and calculating a difference value between the starting point and the end point; coding and compressing each group of continuous power-down elements according to the difference value and the starting point; and counting the number of zero elements in the zero sequence, performing coding compression on the zero sequence based on the number of the zero elements, and obtaining compressed data corresponding to the image to be compressed after coding compression of all the zero sequence and the normal sequence.
2. A CRC-based image compression method as claimed in claim 1, wherein said step of updating said streaming data with the highest power of said second polynomial comprises:
and obtaining a numerical value corresponding to the highest power of the second polynomial, subtracting 1 from the numerical value to obtain a complementary bit value, and supplementing 0 after the streaming data according to the complementary bit value, wherein the number of the 0 is consistent with the complementary bit value.
3. A CRC-based image compression method as claimed in claim 1, wherein said zero sequence is a sub-sequence with all elements being zero, and said normal sequence is a sub-sequence with non-zero elements.
4. The image compression method based on CRC as claimed in claim 1, wherein the step of obtaining a plurality of groups of successive power-down elements according to the element variation in each normal sequence, and obtaining the start point and the end point of each group of successive power-down elements, comprises:
when the elements in the normal sequence decrease progressively by taking 1 as a difference value, the elements are continuous power-down elements, and a group of continuous power-down elements is formed by the decreasing elements of 1 each time;
the first element in each group of successive power-down elements is a starting point and the last element is an ending point.
5. The image compression method based on CRC according to claim 1, wherein the step of performing coding compression for each group of successive power-down elements according to the difference and the starting point comprises:
and adding one to the numerical value of the difference value to be used as the statistical frequency, and using the numerical value corresponding to the statistical frequency and the starting point as the code corresponding to a group of continuous power-lowering elements.
6. A CRC-based image compression method as claimed in claim 1, wherein said coding of the zero sequence is derived from the number of zero elements in the zero sequence and zero.
7. A CRC-based image compression system comprising a memory, a processor and a computer program stored in said memory and executable on said processor, characterized in that said processor, when executing said computer program, performs the steps of the method of any of the preceding claims 1 to 6.
8. A readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the method of any of the preceding claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211003384.3A CN115086684B (en) | 2022-08-22 | 2022-08-22 | Image compression method, system and medium based on CRC |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211003384.3A CN115086684B (en) | 2022-08-22 | 2022-08-22 | Image compression method, system and medium based on CRC |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115086684A true CN115086684A (en) | 2022-09-20 |
| CN115086684B CN115086684B (en) | 2022-11-18 |
Family
ID=83245465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211003384.3A Active CN115086684B (en) | 2022-08-22 | 2022-08-22 | Image compression method, system and medium based on CRC |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115086684B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4929946A (en) * | 1989-02-09 | 1990-05-29 | Storage Technology Corporation | Adaptive data compression apparatus including run length encoding for a tape drive system |
| US5367544A (en) * | 1989-05-04 | 1994-11-22 | Northern Telecom Limited | Data stream frame synchronisation |
| US5570202A (en) * | 1993-12-27 | 1996-10-29 | Fuji Xerox Co., Ltd. | Image transmission apparatus in which pixel data are rearranged using sequence numbers for respective frames |
| US6119263A (en) * | 1997-04-30 | 2000-09-12 | Hewlett-Packard Company | System and method for transmitting data |
| US20040194001A1 (en) * | 2002-12-31 | 2004-09-30 | Yao Ting | CRC checking and error tagging system and method for audio data |
| US20070234134A1 (en) * | 2006-03-29 | 2007-10-04 | Samsung Electronics Co., Ltd. | Method and system for enhancing transmission reliability of video information over wireless channels |
| US20070296822A1 (en) * | 2006-06-09 | 2007-12-27 | Yin-Chun Blue Lan | Method and device for wireless video communication |
| GB201007798D0 (en) * | 2010-05-10 | 2010-06-23 | Etsem Ltd | A method of compressing and apparatus configured to compress a data sequence |
| US20100205518A1 (en) * | 2007-08-17 | 2010-08-12 | Panasonic Corporation | Running cyclic redundancy check over coding segments |
| CN106658017A (en) * | 2016-10-26 | 2017-05-10 | 北京集创北方科技股份有限公司 | Image compression and decompression methods, image processing method and related devices |
| WO2019214265A1 (en) * | 2018-05-08 | 2019-11-14 | 华为技术有限公司 | Method and apparatus for calculating cyclic redundancy check (crc) code |
| US20200221437A1 (en) * | 2016-12-16 | 2020-07-09 | Zte Corporation | Data transmission method, transmitter, receiver and storage medium |
| WO2021147463A1 (en) * | 2020-01-22 | 2021-07-29 | 北京字节跳动网络技术有限公司 | Video processing method and device, and electronic apparatus |
| US20210273658A1 (en) * | 2019-01-17 | 2021-09-02 | Huawei Technologies Co., Ltd. | Method and Apparatus for Encoding Polar Code Concatenated with CRC Code |
| US20210391945A1 (en) * | 2018-10-10 | 2021-12-16 | Nec Corporation | Method and apparatus for construction of polar codes |
| US20220020340A1 (en) * | 2020-07-14 | 2022-01-20 | Qualcomm Incorporated | Methods and apparatus for data content integrity |
-
2022
- 2022-08-22 CN CN202211003384.3A patent/CN115086684B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4929946A (en) * | 1989-02-09 | 1990-05-29 | Storage Technology Corporation | Adaptive data compression apparatus including run length encoding for a tape drive system |
| US5367544A (en) * | 1989-05-04 | 1994-11-22 | Northern Telecom Limited | Data stream frame synchronisation |
| US5570202A (en) * | 1993-12-27 | 1996-10-29 | Fuji Xerox Co., Ltd. | Image transmission apparatus in which pixel data are rearranged using sequence numbers for respective frames |
| US6119263A (en) * | 1997-04-30 | 2000-09-12 | Hewlett-Packard Company | System and method for transmitting data |
| US20040194001A1 (en) * | 2002-12-31 | 2004-09-30 | Yao Ting | CRC checking and error tagging system and method for audio data |
| US20070234134A1 (en) * | 2006-03-29 | 2007-10-04 | Samsung Electronics Co., Ltd. | Method and system for enhancing transmission reliability of video information over wireless channels |
| US20070296822A1 (en) * | 2006-06-09 | 2007-12-27 | Yin-Chun Blue Lan | Method and device for wireless video communication |
| US20100205518A1 (en) * | 2007-08-17 | 2010-08-12 | Panasonic Corporation | Running cyclic redundancy check over coding segments |
| GB201007798D0 (en) * | 2010-05-10 | 2010-06-23 | Etsem Ltd | A method of compressing and apparatus configured to compress a data sequence |
| CN106658017A (en) * | 2016-10-26 | 2017-05-10 | 北京集创北方科技股份有限公司 | Image compression and decompression methods, image processing method and related devices |
| US20200221437A1 (en) * | 2016-12-16 | 2020-07-09 | Zte Corporation | Data transmission method, transmitter, receiver and storage medium |
| WO2019214265A1 (en) * | 2018-05-08 | 2019-11-14 | 华为技术有限公司 | Method and apparatus for calculating cyclic redundancy check (crc) code |
| US20210391945A1 (en) * | 2018-10-10 | 2021-12-16 | Nec Corporation | Method and apparatus for construction of polar codes |
| US20210273658A1 (en) * | 2019-01-17 | 2021-09-02 | Huawei Technologies Co., Ltd. | Method and Apparatus for Encoding Polar Code Concatenated with CRC Code |
| WO2021147463A1 (en) * | 2020-01-22 | 2021-07-29 | 北京字节跳动网络技术有限公司 | Video processing method and device, and electronic apparatus |
| US20220020340A1 (en) * | 2020-07-14 | 2022-01-20 | Qualcomm Incorporated | Methods and apparatus for data content integrity |
Non-Patent Citations (2)
| Title |
|---|
| 吴建斌等: "基于图像编码及拼接的无载体信息隐藏", 《华南理工大学学报(自然科学版)》 * |
| 欧阳任耕.: "基于系统Raptor编码的深空图像传输方案研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115086684B (en) | 2022-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106888026B (en) | Segmented polarization code coding and decoding method and system based on LSC-CRC (least significant likelihood-Cyclic redundancy check) decoding | |
| US7843367B2 (en) | Data coding buffer for electrical computers and digital data processing systems | |
| CN108768403A (en) | Lossless data compression, decompressing method based on LZW and LZW encoders, decoder | |
| US20140218220A1 (en) | Data compression systems and methods | |
| US7602316B2 (en) | Data coding/decoding for electrical computers and digital data processing systems | |
| US7671767B2 (en) | LIFO radix coder for electrical computers and digital data processing systems | |
| US7907068B2 (en) | FIFO radix coder for electrical computers and digital data processing systems | |
| WO2010044100A1 (en) | Lossless compression | |
| US12010352B2 (en) | Coding method and related device | |
| CN107565970B (en) | Hybrid lossless compression method and device based on feature recognition | |
| CN110021369B (en) | Gene sequencing data compression and decompression method, system and computer readable medium | |
| US20220005229A1 (en) | Point cloud attribute encoding method and device, and point cloud attribute decoding method and devcie | |
| CN116016606B (en) | Sewage treatment operation and maintenance data efficient management system based on intelligent cloud | |
| CN114520659A (en) | Method for lossless compression and decoding of data by combining rANS and LZ4 encoding | |
| US20100321218A1 (en) | Lossless content encoding | |
| CN110739974B (en) | Data compression method and device and computer readable storage medium | |
| CN115086684B (en) | Image compression method, system and medium based on CRC | |
| WO2002039591A1 (en) | Content independent data compression method and system | |
| CN102651795B (en) | Binary Sequence Compression Coding Method with Run Length Reduction | |
| US10931303B1 (en) | Data processing system | |
| CN115913248A (en) | Live broadcast software development data intelligent management system | |
| CN113346913A (en) | Data compression using reduced number of occurrences | |
| JP3673222B2 (en) | Variable length encoding method and apparatus, and variable length decoding method and apparatus | |
| CN117082154B (en) | Big data-based double-path server data storage system | |
| CN111263155B (en) | Compression method and system for equal-resolution CR image |
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 |