A method for compressing and decompression digital image data. When compressing, the method begins by choosing a reference row. The relative data between the reference row and the current row is compared to search for the differential data set. The largest matching data set of the differential data set is searched starting from the starting position of the last differential data set. According to the matching conditions, the data type of the to-be-compressed data is first verified, then the to-be-compressed data set type and its relative referencing value are verified. Finally, the relative coding process is started. This process has a higher compression ratio and decompression speed, and increases the compression speed dramatically.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method of digital image data compression, the method comprising the following steps: choosing the reference row; comparing the non-coded portion of the relative data between the reference row and the current row to find the first differentia data segment of the non-coded section; looking for the largest match data segment between the data before the starting position of the current differentia data segment and the data after the starting position of the current differentia data segment; verifying the to-be-compressed data type base on the matching condition; verifying the to-be-compressed data segment type and its related parameters based on the to-be-compressed data type; and executing the related coding process based on the to-be-compressed data segment type and its related parameters.
2. The method of claim 1 wherein said method further comprises: starting from the next position after the last end of coding position to continue searching the next differentia data segment between the current row and the reference row, and restarting the execution of the matching and coding procedures, until the all the data in the current row has been processed; reposition the next row as the current row; and restarting the execution of the described steps starting from selecting the reference row until the whole image has been processed.
3. The method of claim 1 wherein said step of choosing the reference row, if the compressing row is the first row of the image, the system provides a row of all zeros for the reference row.
4. The method of claim 1 wherein said step of finding the first differentia data segment further comprises the following steps: comparing the non-coded portion of the data in the relative positions of the current row and the reference row one-by-one; recording the position of the first differential data as the starting position of the differentia data segment; continuing the comparison process until the relative positions of the current row and the reference row matches or end of the row is reached; and recording such position as the ending position of the differentia data segment.
5. The method of claim 1 wherein said step of verifying the to-be-compressed data type if the largest match data segment has a length of zero further comprises the following steps: skipping the starting data of the differentia data segment and restarting the described matching process at the starting position of the next differentia data segment; and analyzing the skipped data, then setting it as the first data type if it cannot be condense coded, or as the second data type if it can be condense coded.
6. The method of claim 1 wherein said step of verifying the to-be-compressed data type if the largest match data segment has a length of non-zero further comprises the following steps: searching and analyzing the skipped data, then setting it as the first data type if it cannot be condense coded, or as the second data type if it can be condense coded; and setting the matching portion of the differentia data segment starting from the current starting position as the third data type.
7. The method of claim 6 wherein said matching data section when the largest matching data section has a length of non-zero and less than the length of the current differentia data segment further comprises the following steps: moving the starting position of the current differentia data segment to the data position after the ending position of the matching portion and using the new current differentia data segment to restart the matching process.
8. The method of claim 1 wherein said verification step of the to-be-compressed data type further comprises the steps of verifying the non-coded data prior to the first differentia data segment as the forth data type.
9. The method of claim 1 wherein said verification step of the to-be-compressed data segment type sets the consecutive to-be-compressed data of the same type as one to-be-compressed data segment of such type.
10. A method of digital image decompression, the method comprising the following steps: verifying the current row's reference row and data; setting the writing point at the beginning of the current row; reading in a code; retrieving the data type and relative parameters of the code; and decoding the data according to the data type and relative parameters.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
June 18, 2003
December 5, 2006
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.