Method for compressing image data and image data compressing system
Granted 16 Apr 2019 · 1 office action
Current assignee: Mstar Semiconductor, Inc. · originally MediaTek
Law firm: Law firm · Log in to unlock
Attorney: Attorney · Log in to unlock
Inventors: Yi-Chin Huang, Yi-Shin Tung · Examiner: Ming Y Hon · AU 2666 · TC 2600
Life of the application
11 dated eventsAbstract
A method for compressing image data is provided. The image data includes a file to be compressed, which includes N blocks to be compressed. The method includes: setting a target data increment of each of the N blocks of the file according to a 0 th accumulated target data size and an N th accumulated target data size; before compressing an n th block, calculating an (n−1) th accumulated target data size of an (n−1) th block according to the 0 th accumulated target data size and the target data increment; when a difference between an (n−1) th accumulated compressed data size and the (n−1) th accumulated target data size is smaller than a predetermined threshold, removing X least significant bit(s) of a plurality of sets of data in the n th block to generate an updated n th block; and compressing the updated n th block to generate a compressed n th block.
Description
10 parts›This application claims the benefit of Taiwan application…
This application claims the benefit of Taiwan application Serial No. 105117731, filed Jun. 4, 2016, the subject matter of which is incorporated herein by reference.
›Field of the Invention
The invention relates in general to a method for compressing image data, and more particularly to an image data compressing method capable of controlling a compression rate.
›Description of the Related Art
In the prior art, in order to efficiently utilize hardware resources when image data is compressed, an image is usually divided into a plurality of blocks and then compressed in a unit of image blocks. FIG. 1 shows a schematic diagram of image data IMG 0 of the prior art. In FIG. 1 , the image data IMG 0 may be divided into a plurality of image blocks B 1 to B N , which are then sequentially compressed by a raster scan method when the image data IMG 0 is compressed. The compression method may be lossless compression or lossy compression.
Compared to lossless compression, lossy compression may yield a higher compression rate. However, even having been decompressed, a file compressed by lossy compression may not be successfully restored to an original file, hence frequently leading to degraded image quality.
To maintain image quality, the image blocks B 1 to B N may be compressed by lossless compression. Thus, distortion-free image blocks B 1 to B N can be obtained after decompressing the compressed image blocks B 1 to B N . However, lossless compression does not guarantee the compression rate. In other words, due to possible differences in image characteristics of the image blocks B 1 to B N , compressed data sizes of the compressed image blocks B 1 to B N processed by lossless compression may also differ, in a way that the compressed data sizes cannot be predicted.
Without a guaranteed compression rate, lossless compression is unsuitable for some applications with limited memory resources. On the other hand, if compression is conducted using lossy compression, the issue of poor image quality may be resulted. Therefore, there is a need for a solution that attends to both the compression rate and image quality.
›SUMMARY OF THE INVENTION
A method for compressing image data is provided according to an embodiment of the present invention. The method, applied to a file to be compressed including N blocks to be compressed, includes: setting a target data increment of each of the N blocks of the file according to a 0 th accumulated target data size and an N th accumulated target data size; before compressing an n th block among the N blocks, calculating an (n−1) th accumulated compressed data size of an (n−1) th block among the N blocks; calculating an (n−1) th accumulated target data size of the (n−1) th block according to the 0 th accumulated target data size and the target data increment; when a difference between the (n−1) th accumulated compressed data size and the (n−1) th accumulated target data size is smaller than a first predetermined threshold, removing X least significant bit(s) (LSB) of a plurality of sets of data of the n th block to generate an updated n th block; and compressing the updated n th block to generate a compressed n th block. Wherein, N and X are finite positive integers, and n is a finite positive integer not greater than N.
An image data compressing system is provided according to another embodiment of the present invention. The image data compressing system includes a compression module and a compression rate control circuit. The compressing module compresses data of a file to be compressed that includes N blocks to be compressed according to a compression algorithm. The compression rate control circuit, coupled to the compressing module, includes a compressed data accumulating module, a target data accumulating module and a comparing module. Before an n th block among the N th blocks is compressed, the compressed data accumulating module calculates an (n−1) th accumulated compressed data size of an (n−1) th block among the N blocks according to a block compressed data size that the compressing module generates after compressing the (n−1) th block. The target data size accumulating module calculates an (n−1) th accumulated target data size of the (n−1) th block according to a 0 th accumulated target data size and a target data increment of each of the N blocks. When a difference between the (n−1) th accumulated compressed data size and the (n−1) th accumulated target data size is smaller than a first predetermined threshold, the comparing module outputs a first compression control signal to the compressing module. When the first compression control module is received, the compressing module removes X least significant bit(s) (LSB) of a plurality of sets of data of the n th block to generate an updated n th block, and compresses the updated n th block to generate a compressed n th block. Wherein, N and X are finite positive integers, and n is a finite positive integer not greater than N.
The above and other aspects of the invention will become better understood with regard to the following detailed description of the preferred but non-limiting embodiments. The following description is made with reference to the accompanying drawings.
›BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic diagram of image data of the prior art;
FIG. 2 is a schematic diagram of an image data compressing system according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a compression rate control curve of an image data compressing system according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a compression rate control curve according to another embodiment of the present invention;
FIG. 5 is a schematic diagram of a compression rate control curve according to another embodiment of the present invention; and
FIG. 6 is a flowchart of a method for compressing image data according to an embodiment of the present invention.
›DETAILED DESCRIPTION OF THE INVENTION · 1 of 4
FIG. 2 is a schematic diagram of an image data compressing system 100 according to an embodiment of the present invention. The image data compressing system 100 includes a compressing module 110 and a compression rate control circuit 120 .
The compressing module 110 compresses image data according to a predetermined compression algorithm. In one preferred embodiment of the present invention, the compressing module 110 may select a lossless compression algorithm to compress image data. However, the present invention does not limit the compressing module 110 to compressing image data by a lossless compression algorithm, and image data may also be compressed by a lossy compression algorithm that possibly causes distortion.
The compression rate control circuit 120 , coupled to the compressing module 110 , includes a compressed data accumulating module 122 , a target data size accumulating module 124 , and a comparing module 126 . In some embodiments of the present invention, the image data compressing system 100 may be applied to compress image data IMG 0 in FIG. 1 . When the image data IMG 0 serves as an image to be compressed by the image data compressing system 100 , the compression rate control circuit 120 may dynamically adjust a compression rate of each of the image blocks B 1 to B N according to a user-defined or system-predetermined compression rate, so as to prevent a final accumulated compressed data size of the N image blocks B 1 to B N from exceeding a final target data size.
FIG. 3 shows a schematic diagram of a compression rate control curve RCC 1 of the image data compressing system 100 according to an embodiment of the present invention. In FIG. 3 , the horizontal axis represents the number of compressed image blocks, and the vertical axis represents the data size, which may be in a unit of bytes. When the compressed image block is the 0 th one, it means there is not yet any image block that has been compressed, and the data size corresponding to the compression rate control curve RCC 1 at this point is a 0 th accumulated target data size T 0 . When the compressed image block is N, it means that the image blocks B 1 to B N in the image data IMG 0 have all been compressed, and the data size corresponding to the compression rate control curve RCC 1 at this point is an N th accumulated target data size T N , i.e., the final target data size.
In some embodiments of the present invention, assuming that the compression rate is a ratio of a total data size before compression to a total data size after compression, the N th accumulated target data size T N may be a total data size of the file to be compressed divided by the target compression rate. For example, assuming that the total data size of the image data IMG 0 is 1 MB and the target compression rate is 1.25, the N th accumulated target data size T N is 1 MB divided by 1.25, i.e., 0.8 MB. The target compression rate may be user-defined or system-predetermined.
To ensure that a final N th accumulated compressed data size C N of the N image blocks B 1 to B N compressed by the compressing module 110 does not exceed the N th accumulated target data size T N , before an n th block among the N blocks is compressed, e.g., before the image block B n (where n is a finite positive integer not greater than N) is compressed, the compressed data accumulating module 122 may calculate an (n−1) th accumulated compressed data size C n−1 of an (n−1) th block, i.e., the actual compressed data size after the image blocks B 1 to B n−1 have been compressed. The comparing module 126 may further compare the (n−1) th accumulated compressed data size C n−1 with an (n−1) th accumulated target data size T n−1 corresponding to the (n−1) th block in the compression rate control curve RCC 1 , and determine a difference between the two.
The (n−1) th accumulated target data size T n−1 may be obtained through calculating the N blocks of the image data IMG 0 , i.e., a target data increment ΔT of each of the image blocks B 1 to B N , and the 0 th accumulated target data size T 0 , by the target data accumulating module 124 . Wherein, the target data increment ΔT is a slope
T N - T 0 N
of the compression rate control curve RCC 1 . In the above situation, the (n−1) th accumulated target data size T n−1 may be represented by equation (1):
In some embodiments of the present invention, the target data accumulating module 124 is limited to directly obtaining the (n−1) th accumulated target data size T n−1 by equation (1). Alternatively, the target data accumulating module 124 may also calculate the (n−1) th accumulated target data size T n−1 through adding up the target data increment ΔT, so as to reduce the computation amount of multiplication and to simplify hardware. In FIG. 3 , as the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 is smaller than a predetermined threshold TH 1 , it means that the current accumulated compressed data size C n−1 approximates the current (n−1) th accumulated target data size T n−1 . Thus, if the n th block, i.e., the image block B n , is compressed in continuation using the current compression method, it is likely that the final N th accumulated compressed data size C N become greater than the N th accumulated target data size T N .
In the above situation, the comparing module 124 may output a first compression control signal SIG 1 to the compressing module 110 . When the first compression control signal SIG 1 is received, the compressing module 110 removes X least significant bit(s) (LSB) of a plurality of sets of data in the n th block, i.e., the image block B n , to generate an updated n th block, compresses the updated n th block to generate a compressed n th block, and stores the compressed n th block to a memory. Wherein, X may be a user-defined or system-predetermined positive integer. In some embodiments of the present invention, X may be 1 or 2. Because the LSB less affects the overall value of data, no significant influence is produced on the image quality.
›DETAILED DESCRIPTION OF THE INVENTION · 2 of 4
As such, the bit count of each set of data in the updated n th block is smaller than the bit count of each set of data in the original n th block, and the compressed data size after compressing the updated n th block is also smaller than the compressed data size of directly compressing the original n th block. Thus, the N th accumulated compressed data size C N is prevented from becoming greater than the N th accumulated target data size T N , and the effect of controlling the compression rate is achieved.
In some applications of image compression, it is possible that the LSB of each set of data in an image block be used as reserved reference bits, which influence the final image quality only in certain special circumstances. Values of such type of reserved reference bits are usually difficult to predict, and frequently cause compression complications and thus a reduced compression rate. In the above situation, by removing the X LSB of a plurality of sets of data in the image block B n , not only the data size of data that needs to be compressed is decreased, but also correlation levels among the plurality of sets of data in the image block B n are increased, which helps the compressing module 110 perform the compression, hence further enhancing the compression rate.
In other embodiments of the present invention, when the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 is greater than the predetermined threshold TH 1 , it means that the current accumulated compressed data size is not close to the current accumulated target data size, and so maintaining image quality may still be prioritized. At this point, the comparing module 126 does not output the first control signal SIG 1 to the compressing module or it outputs other control signals different from the first control signal SIG 1 , such that the compressing module 110 may directly compress the n th block without removing any data bits.
Further, to prevent the compressing module 110 from removing a part of the LSB of each of a plurality of sets of data in the image block B 1 at the beginning and from unnecessarily compromising the image quality, the image data compressing system 100 may set the 0 th accumulated target data amount T 0 to be greater than the first threshold TH 1 .
As described, the image data compressing system 100 is capable of adjusting the compression rate of the image block B n according to the difference between the (n−1) th accumulated compressed data size C n−1 of the (n−1) th image block B n−1 and the (n−1) th accumulated target data size T n−1 of the (n−1) th image block B n−1 corresponding to the compression rate control curve RCC 1 , and first removes a part of the LSB of each set of data in the image block B n in a situation where the compression rates of the previous (n−1) number of image blocks B 1 to B n−1 are rather low. Therefore, the image data compressing system 100 is capable of adaptively adjusting the compression rate while maintaining image quality at the same time.
Further, in some embodiments of the present invention, the compression rate control circuit 120 may adjust the number of LSB that the compressing module 110 removes from each set of data in the image blocks. For example, in FIG. 3 , before the m th block is compressed, e.g., before the image block B m is compressed (where m is a finite positive integer not greater than N), the compression data accumulating module 122 may first calculate the (m−1) th accumulated compressed data size C m−1 of the (m−1) th block, i.e., the actual accumulated compressed data size of the image blocks B 1 to B m−1 having been compressed. The target data accumulating module 124 may calculate the accumulated target data size T m−1 of the (m−1) th block corresponding to the compression rate control curve RCC 1 according to the 0 th accumulated target data size T 0 and the target data increment ΔT. Next, the comparing module 126 may compare the (m−1) th accumulated compressed data size C m−1 and the (m−1) th accumulated target data size T m−1 , and determine the difference between the two.
In the embodiment in FIG. 3 , the difference between the (m−1) th accumulated compressed data size C m−1 and the (m−1) th accumulated target data size T m−1 is greater than the first predetermined threshold TH 1 but smaller than the second predetermined threshold TH 2 , wherein the second predetermined threshold TH 2 is greater than the first predetermined threshold TH 1 . That is to say, although the current (m−1) th accumulated compressed data size is close to the (m−1) th accumulated target data size T m−1 and possibly cause the N th accumulated compressed data size C N to be greater than the N th accumulated target data size T N , such occurrence is not severe. Thus, the comparing module 126 may output a second compression control signal SIG 2 to the compressing module. When the compressing module 110 receives the second compression control signal SIG 2 , the compressing module 110 may remove Y LSB of a plurality of sets of data in the m th block, i.e., the image block B m , to generate the updated m th block that needs to be compressed. The updated m th block is then compressed to generate a compressed m th block that is stored to a memory.
For example, X may be 2 and Y may be 1. Thus, when the comparing module 126 determines that the difference between the current accumulated compressed data size and the current accumulated target data size is greater than the first predetermined threshold TH 1 but smaller than the second predetermined threshold TH 2 , the comparing module 126 outputs the second compression control signal SIG 2 to cause the compressing module 1120 to first remove the 1 LSB of each set of data in the image block before the image block is compressed. In contrast, when the difference between the current accumulated compressed data size and the current accumulated target data size is smaller than the first predetermined threshold, the comparing module 126 may output the first compression control signal SIG 1 to cause the compressing module 110 to first remove 2 LSBs of each set of data in the image block before the image block is compressed.
›DETAILED DESCRIPTION OF THE INVENTION · 3 of 4
As such, the image data compressing system 100 may adaptively determine whether to remove the LSB of each set of data in an image block that needs to be compressed, and the number of LSB to be removed if so, thereby more accurately controlling the compression rate and image quality. In some embodiments of the present invention, the image data compressing system 100 may set more predetermined thresholds based on system requirements to allow the image data compressing system 100 to be better in fine-tuning the compression rate. One person skilled in the art may implement the foregoing embodiments in form of digital circuits in the compression rate control circuit 120 , and associated details are omitted herein.
FIG. 4 and FIG. 5 show schematic diagrams of compression control curves RCC 2 and RCC 3 according to different embodiments of the present invention. The N th accumulated target data sizes T N in FIG. 4 and FIG. 5 are the same, with however a 0 th accumulated target data size T′ 0 in FIG. 4 being smaller than a 0 th accumulated target data size T″ 0 in FIG. 5 . Thus, when the N image blocks B 1 to B N of the image data IMG 0 are compressed, taking the compression rate control curve RCC 2 in FIG. 4 for instance, starting from the image block B 3 , a difference between a 3 rd accumulated compressed data size C′ 3 and a 3 rd accumulated target data size T′ 3 is already smaller than the first threshold TH 1 . Therefore, the compression rate control circuit 120 removes the X LSB from each set of data in the image block B 4 and continues removing the X LSB from each set of data in the subsequent image blocks. It is possible that, the compression rate control circuit 120 only stops removing a part of the LSB from each set of data in the image blocks when the image block B 50 is compressed.
In comparison, taking the compression rate control curve RCC 3 in FIG. 5 for instance, the 0 th accumulated target data size T″ 0 is larger, and so a difference between a 3 rd accumulated compressed data size C″ 3 and a 3 rd accumulated target data size T″ 3 may be maintained to be greater than the first threshold TH 1 . As such, the image data compressing system 100 , without removing any LSB of any block data, may provide a final N th accumulated compressed data size C″ N that is smaller than the N th accumulated target data size T N .
That is to say, the selection of the 0 th accumulated target data size may affect the timing at which the compression rate control circuit 120 removes the LSB of block data that needs to be compressed. In the image data IMG 0 , only a part of the image blocks that are first compressed and cannot be easily compressed may lead to a low compression rate, whereas a part of the image blocks that are later compressed may still maintain a high compression rate. In the above situation, if a smaller 0 th accumulated target data size T 0 is selected, the compression rate control circuit 120 may be caused to inappropriately remove LSB of block data that needs to be compressed and unnecessarily reduce image quality.
Due to different characteristics of data of different images, in some embodiments of the present invention, the compression rate control circuit 120 may also update the 0 th accumulated target data size according to compression archives or compression trends of compressed blocks of previously compressed files. Thus, the image data compressing system 100 may be prevented from inappropriately removing the LSB of a part of the block data and hence from unnecessarily lowering the image quality. One person skilled in the art can implement the foregoing embodiments by digital circuits in the compression rate control circuit 120 , and associated details are omitted herein.
FIG. 6 shows a flowchart of a method 600 for compressing image data according to an embodiment of the present invention. The method 600 may apply the compression rate control curve RCC 1 in FIG. 3 to compress a file that needs to be compressed. For example but not limited to, the method 600 includes following steps.
In step S 610 , a target data increment ΔT of each of N blocks that need to be compressed in a file to be compressed is calculated according to a 0 th accumulated target data size T 0 and an N th accumulated target data size T N .
In step S 620 , before an n th block among the N blocks is compressed, an (n−1) th accumulated compressed data size C n−1 is calculated.
In step S 630 , an accumulated target data size T n−1 of an (n−1) th block among the N blocks is calculated according to the 0 th accumulated target data size T 0 and the target data increment ΔT.
In step S 640 , it is determined whether a difference between the (n−1) th accumulated compressed data size C n−1 and the accumulated target data size T n−1 is smaller than a first predetermined threshold TH 1 . Step S 650 is performed if so, otherwise step S 660 is performed if not.
In step S 650 , X least significant bit(s) of a plurality of sets of data of the n th block that needs to be compressed is/are removed to generate an updated n th block.
In step S 652 , the updated n th block is compressed to generate a compressed n th block, followed by performing step S 690 .
In step S 660 , it is determined whether the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 is greater than the first predetermined threshold TH 1 but smaller than a second predetermined threshold TH 2 . Step S 670 is performed if so, otherwise step S 680 is performed if not.
In step S 670 , Y least significant bit(s) of a plurality of sets of data of the n th block that needs to be compressed is/are removed to generate an updated n th block.
In step S 672 , the updated n th block is compressed to generate a compressed n th block, followed by performing step S 690 .
In step 680 , the original n th block is compressed to generate a compressed n th block.
In step S 690 , the compressed n th block is stored in a memory.
›DETAILED DESCRIPTION OF THE INVENTION · 4 of 4
The method 600 is applicable to compress the image data IMG 0 . In step S 610 , the file that needs to be compressed at this point is the image data IMG 0 , and the N blocks that need to be compressed in the file are N image blocks B 1 to B N of the image data IMG 0 . It should be noted that, the method for compressing image data and the image data compressing system of the present invention are not limited to compressing image data. In other embodiments, the method for compressing image data and the image data compressing system of the present invention may be applied to compress data of other types of files.
In some embodiments of the present invention, instead of comparing the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 only with the first predetermined threshold TH 1 and the second predetermined threshold TH 2 , the method 600 may also compare the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 with other predetermined thresholds, and accordingly determine the number of LSB to be removed, so that the method 600 can more accurately control the compression rate and image quality.
In some embodiments, step S 660 to S 672 of the method 600 may be omitted. In step S 640 , when the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 is greater than the first predetermined threshold TH 1 , step S 680 is directly performed instead of comparing the difference between the (n−1) th accumulated compressed data size C n−1 and the (n−1) th accumulated target data size T n−1 with the second predetermined threshold TH 2 , thus simplifying the process of the method 600 .
The method 600 is capable of adaptively determining whether to remove the LSB of each set of data in a block that needs to be compressed, and the number of LSB to be removed if so, and is therefore capable of accurately controlling the compression rate and image quality.
In conclusion, the method for compressing image data and the image data compressing system of the present invention are capable of dynamically determining whether to remove the LSB of each set of data in a block that needs to be compressed, and the number of LSB to be removed if so, and are therefore capable of more accurately controlling the compression rate compared to the prior art while also maintaining image quality.
While the invention has been described by way of example and in terms of the preferred embodiments, it is to be understood that the invention is not limited thereto. On the contrary, it is intended to cover various modifications and similar arrangements and procedures, and the scope of the appended claims therefore should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements and procedures.
Claims as granted
12 claimsLog in to read the claims of this application.
Log in to unlockClassifications
5 codes- H04N19/176
- H04N19/146
- H04N19/184
- H04N19/132
- H04N19/15
Claim changes
SoonSee which claims were amended, added or cancelled during examination, with every added and removed word marked.
The published claims of this application are not paired with the granted ones in what we hold.
File wrapper
See the full prosecution history — every USPTO and applicant action on this file, in order.
Log in to unlockDocuments
Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.
Log in to unlockChain of title
See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.
Log in to unlock