Unlock instant, AI-driven research and patent intelligence for your innovation.
Image lossless compression method and system
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A lossless compression and image technology, applied in the field of image processing, can solve the problems of reduced compression rate, slow decoding speed, low compression rate, etc., to achieve the effect of guaranteed compression rate and convenient transplantation
Active Publication Date: 2020-05-01
HEFEI I TEK OPTOELECTRONICS CO LTD
View PDF7 Cites 11 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0002] Image lossless compression means that after data compression, the information is not lost and can be completely restored to the original state before compression. The current image lossless compression schemes generally include arithmetic coding-based schemes and general-purpose text-based schemes, both of which have their own advantages and disadvantages , the arithmetic coding scheme has a good compression ratio, but the decoding speed is relatively slow, and the universal text scheme has a fast decoding speed, but the compression ratio is low
[0003] If the image lossless compression algorithm is transplanted to the FPGA, when compressing the image, it can only be compressed line by line; if the general text method is used, the compression rate will be reduced to between 1.0 and 1.2 due to too little compressed data line by line
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
example 1
[0094] Example 1: Use Huffman to encode the following text symbols:
[0095] {0,0,0,0,0,0,0,0,0,0,0,0,
[0096] 2,2,2,2,2,2,2,2,2,
[0097] 4,4,4,4,4,4,
[0098] 8,8,8,8,
[0099] 16,32,33,34}
[0100] It consists of 12 0s, 8 2s, 6 4s, 4 8s and 16, 32, 33, 34 respectively. First, any two of the symbols with the smallest probability form a node, such as Figure 6 shown. The new node A formed, the number of times P=1+1=2 of its symbol occurrence; This node is regarded as a new symbol and added in the text symbol table again; Select 33,34 in the text symbol table again to form a new Node B.
[0101] The text symbol table at this time becomes 12 8s, 8 2s, 6 4s, 4 8s and 2 A and B respectively. Select A and B with the smallest number of occurrences of symbols again to form a new node C, and C consists of A and B to form its cotyledons, such as Figure 7 shown.
[0102] Select the smallest symbol in turn, and so on, until all symbols are allocated, forming a Huffman tree s...
example 2
[0118] Example 2: Using the above method, re-solve the Huffman encoding of the text symbol in Example 1 as follows:
[0119] Let the top node be the 0th layer, then count the number of leaf nodes, which are 3 leaf nodes in the second layer, 1 leaf node in the third layer, and 4 leaf nodes in the fifth layer. Therefore perRankNum={0,0,3,1,0,4}. The obtained perRankVal={0,2,1,1,2,0}. Since the layer where the symbols 0, 2, and 4 are located is the second layer, their self-increment value is 1, that is, 0 corresponds to 01, 2 corresponds to 10, and 4 corresponds to 11. The layer where 8 is located is the third layer, so 8 corresponds to 01. 16, 32, 33, and 34 correspond to the fifth layer, and their codes are 00, 01, 10, and 11 respectively.
[0120] Use decimal instead of binary representation, and its encoding symbols are shown in Table 3 below:
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses an image lossless compression method and system, and belongs to the technical field of image processing. The method comprises: obtaining an original image; calculating the residual error of the original image by adopting an arithmetic coding method, counting the occurrence frequency of each symbol in the residual error, and storing the occurrence frequency into an array counts []; circularly establishing a Huffman tree according to the array counts [], and encoding each leaf node of the Huffman tree by using a length limiting method to obtain a Huffman encoding table; and compressing the residual error of the original image by using the Huffman coding table to obtain coded data for decoding processing. According to the lossless compression method integrating arithmetic coding and the general text compression method, the decoding speed of the general text method is achieved while the compression rate is guaranteed.
Description
technical field [0001] The invention relates to the technical field of image processing, in particular to an image lossless compression method and system. Background technique [0002] Image lossless compression means that after data compression, the information is not lost and can be completely restored to the original state before compression. The current image lossless compression schemes generally include arithmetic coding-based schemes and general-purpose text-based schemes, both of which have their own advantages and disadvantages , the arithmetic coding scheme has a good compression rate, but the decoding speed is relatively slow, and the universal text scheme has a fast decoding speed, but a low compression rate. [0003] If the image lossless compression algorithm is transplanted to the FPGA, when compressing the image, it can only be compressed line by line; if the general text method is used, the compression rate will be reduced to between 1.0 and 1.2 due to too l...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More 
