CN101489018A - Static image compression method and computer readable storage apparatus - Google Patents
Static image compression method and computer readable storage apparatus Download PDFInfo
- Publication number
- CN101489018A CN101489018A CNA2008100010648A CN200810001064A CN101489018A CN 101489018 A CN101489018 A CN 101489018A CN A2008100010648 A CNA2008100010648 A CN A2008100010648A CN 200810001064 A CN200810001064 A CN 200810001064A CN 101489018 A CN101489018 A CN 101489018A
- Authority
- CN
- China
- Prior art keywords
- image
- sub
- index data
- initial symbol
- address
- 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.)
- Pending
Links
Images
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to a static image compression method and computer-readable storage device, the method comprising: cutting the image into a plurality of sub-images, then compressing each sub-image in sequence into a sub-data frame with a start character to generate a compressed data with sub-data frames connected with each other based on sequence of the sub-image, and recording address of the start character to generate an index data. Therefore, the start character of special blocks can be obtained through the index data to decode in advance and display the sub-images of the special blocks.
Description
Technical field
The present invention is about a kind of image processing technique, the storage device that particularly a kind of static image compression method and computer-readable are got.
Background technology
Digitized video early stage because most image data is all comparatively huge, thereby often causes processing speed slowly or carry/transmit problem such as inconvenience.So, develop " image compress technique ".The shared memory size of image after the compression is little more a lot of than raw video file usually.And just can be reduced into raw video by suitable anti-compression method.
In order further to promote compression efficiency and to save the space, more propose to have the compression algorithm of " distortion formula (Lossy) ".The image compression of distortion formula mainly is according to the human eye characteristic, retains the lightness details in the digitized video, and converts a large amount of color datas to simplify pattern, to realize saving the purpose in space.
JPGE (Joint Photographic Experts Group; Joint image expert group) technology is a kind of distortion compression standard method of having utilized widely in computer image is handled, and it compresses image with destructiveness, can't reduce therefore how many distortions to some extent on image after the compression.Though a kind of standard progressive JPEG based on the JPEG technology (progressive JPEG) technology is arranged, it is to adopt undistorted compress mode, and this progressive JPEG (progressive JPEG) technology is not subjected to supporting widely so far.
But the JPGE technology adopts the notion of distortion compiling method, earlier image is cut into the set of 8 x, 8 sub-images (i.e. the size of 8 pixels * 8 pixels) earlier, again with digital cosine conversion (discrete cosinetransform; DCT) act on each sub-image, then more unessential color in each sub-image is partly removed, only keep the information of important lightness, to realize high compression rate.
Skip over the step of some thinner locks, the JPGE technology is mainly carried out the compression of each sub-image through the following step.At first, DCT is acted on each sub-image, quantize then and round numbers.Then, with the two dimension (two-dimension after quantizing; 2D) the DCT coefficient converts one dimension (1D) array to through oblique scanning (Zig-Zag scan) again, and the Huffman through pre-defining (Huffman) coding schedule is encoded to this one-dimensional array again.The result of oblique scanning is close to together many high frequencies null value partly, adds after Huffman encodes just can obtain better compression ratio.Last compression step then produces the file of jpeg format with the JPEG grammer.Decompression method can carry out according to the contrary direction of compression algorithm, but because quantizing process irreversible, the therefore image and original different generation distortions after the reduction.
Yet image only can present the bit data that computer-readable is got after compression.Before decompressing, be to learn the picture that image can present from the file of compressing image.Therefore, for the file of present jpeg format, just can learn the picture that image presents after all whole file must being decompressed.
With digital camera, along with the progress of science and technology, the resolution of the image that digital camera can capture is more and more higher.Developed into ten million pixel nearly gradually by 1,000,000 or two former mega pixels, more senior digital camera even can support ten million pixel.Yet pixel value is more and more higher, and the image after compression still can be kept data volume to a certain degree.With the image of ten million pixel, the file size after the compression still has 10MB (megabyte nearly; Megabit), and the needed time of image processing, be proportional to the size of image.After must decompressing fully, just can learn under the situation of presentation content, then must expend many time waiting images and decompress, to demonstrate actual image.And, when the total quantity of image more for a long time, then must spend the more time to remove to check image, just found out the image of being wanted.
Summary of the invention
In view of above problem, the storage device that provides a kind of static image compression method and computer-readable to get is provided main purpose of the present invention, need carry out the problem that whole image-decoding just can be learnt presentation content so as to solving existing in prior technology.
Static image compression method disclosed in this invention comprises: image is cut into a plurality of sub-images; In regular turn each sub-image is compressed into a subdata frame, has a packed data of interconnective subdata frame with generation according to the order of sub-image with an initial symbol; And the address of record start symbol is to produce an index data.
Wherein, can on image, define the feature block of containing at least one row sub-image earlier.After each image compression,, obtain the address of the initial symbol of the subdata frame after first in each row sub-image compresses with last sub-image in the feature block, and the address that record is obtained is to form index data then at the feature block.
Wherein, can analyze the characteristic area of image or the zone that the user is interested in by user's selection or by program software, to be defined as the feature block.
The data structure that computer-readable disclosed in this invention is got comprises: packed data block and index data block.
The packed data block comprises: a plurality of subdata frames.But subdata frame decompress(ion) is condensed to the sub-image that constitutes image.Each subdata frame has an initial symbol, and the subdata frame comes the starting solution compression by its initial symbol.
The index data block comprises: a plurality of addresses.Each address is corresponding to one in the initial symbol, and the corresponding position of initial symbol in the packed data block of expression.
Wherein, can have a feature block of containing at least one row sub-image in the image, and the position of subdata frame in the packed data block after first in each row sub-image compresses with last sub-image in the difference representation feature block of the address in the index data block.
Wherein, the packed data block forms two different files with the index data block.In other words, packed data forms two different files respectively with index data.Moreover packed data block and index data block also can form single file.
The storage device that computer-readable disclosed in this invention is got, the packed data that it stores an index data and is condensed to an image in order to decompress(ion), wherein packed data comprises a plurality of subdata frames, be condensed to a plurality of sub-images that constitute this image in order to decompress(ion), each this subdata frame comprises an initial symbol, in order to the decompression of initial this subdata frame; And wherein this index data comprises a plurality of addresses, corresponding to one in this initial symbol, in order to represent this corresponding initial symbol position in this packed data.
Thus, when decompressing, can be by the address of the initial symbol that write down in the index data, find the initial symbol of the subdata frame that desire decompresses, and then cause the subdata frame to decompress, to obtain a few sub-images in the image by the initial symbol that finds.Can understand the content of whole image earlier by the sub-image that obtains, to judge whether to be required image.In addition, on some special applications, also can quicken the speed of image-decoding and broadcast.Be shown as example with transparency, use the present invention, can obtain initial symbol arbitrarily by the address of writing down in the index data, and by the initial symbol decoding that obtains and demonstrate its pairing image, same then obtains other initial symbols to decode and to show, realize the decoding of complete image at last, so can obtain the effect that the transparency animation switches.In simple terms, can obtain the initial symbol of particular block, to decode and to show the sub-image of this particular block in advance by index data.
Describe the present invention below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
Description of drawings
Fig. 1 is the flow chart of static image compression method according to an embodiment of the invention;
Fig. 2 is in the data structure that computer-readable according to the present invention is got, the schematic diagram of the packed data block of an embodiment;
Fig. 3 is in the data structure that computer-readable according to the present invention is got, the schematic diagram of the index data block of an embodiment;
Fig. 4 is in the data structure that computer-readable according to the present invention is got, the schematic diagram of the subdata frame of an embodiment;
Fig. 5 is the schematic diagram of the data structure of getting at computer-readable according to another embodiment of the present invention;
Fig. 6 is in static image compression method according to the present invention, the schematic diagram of the feature block of an embodiment;
Fig. 7 is the flow chart of static image compression method according to another embodiment of the present invention; And
Fig. 8 is in static image compression method according to the present invention, the schematic diagram of the sub-image of an embodiment.
Wherein, Reference numeral
210 packed data blocks
220 data frame
222 subdata frames
230 index data blocks
310 images
312 feature blocks
314 sub-images
The 314a sub-image
The 314b sub-image
SOI shelves head
The EOI1 end mark
ADD1～ADDm～ADDn address
ECS entropy coding sequence
The initial symbol of RST
EOI2 file full stop
Embodiment
With reference to Fig. 1, be shown as static image compression method according to an embodiment of the invention.This static image compression method is in order to compress an image.
At first, image is cut into a plurality of sub-images (step 110).In regular turn each sub-image is compressed into subdata frame (frame) then to produce a packed data (step 130).Have an initial symbol in each subdata frame, this initial symbol can be in order to the decompression of initial its subdata frame.The subdata frame can interconnect according to the order of sub-image, to form a packed data.The address of last record start symbol is to produce an index data (step 150).
Therefore, when decompressing, can directly packed data be decompressed, to obtain whole image.Can also be by the address of the initial symbol that write down in the index data, find the initial symbol of the subdata frame that desire decompresses, and then cause the subdata frame to decompress, to obtain a few sub-images in the image by the initial symbol that finds.Can understand the content of whole image earlier by the sub-image that obtains, to judge whether to be required image.In addition, on some special applications, also can quicken the speed of image-decoding and broadcast.Be shown as example with transparency, use the present invention, can obtain initial symbol arbitrarily by the address of writing down in the index data, and by the initial symbol decoding that obtains and demonstrate its pairing image, same then obtains other initial symbols to decode and to show, realize the decoding of complete image at last, so can obtain the effect that the transparency animation switches.In simple terms, can obtain the initial symbol of particular block, to decode and to show the sub-image of this particular block in advance by index data.
Wherein, the compression of sub-image can be passed through JPEG (Joint Photographic Experts Group; Joint image expert group) technology is reached.
Image with one 1024 * 1024 (position) is an example, and the size of 8 * 8 (pixel * pixels) is carried out image and cut apart, to obtain 64 * 64 sub-images.In other words, the size of each sub-image is 16 * 16 (positions).Then, carry out the compression of each 16 * 16 sub-image more in regular turn.
With reference to Fig. 2 and Fig. 3, image is after compression, and packed data can be positioned at packed data block 210, and index data then is positioned at index data block 230.
Packed data has data frame 220 and the end mark EOI1 after a shelves SOI, the image compression.Index data then has a plurality of address AD D1～ADDm～ADDn.
With reference to Fig. 3 and Fig. 4, have a plurality of subdata frames 222 in the data frame 220, but each subdata frame 222 decompress(ion) is condensed to a sub-image.In other words, this image is divided into several sub-images, and just has several subdata frames 222 after the image compression (coding).Subdata frame 222 mainly has entropy coding sequence (entropy-codedseqment) ECS and initial symbol RST.Entropy coding sequence ECS is the data after the sub-image compression.In other words, entropy coding sequence ECS can decompress (decoding) for sub-image.Initial symbol RST is corresponding to the entropy coding sequence ECS that is positioned at same subdata frame 222, and the decompression that it can initial entropy coding sequence ECS is to obtain sub-image.In other words, subdata frame 222 is by the decompression of the next initial subdata frame 222 of its initial symbol RST.
Address AD D1 in the index data～ADDm～ADDn corresponds respectively among the initial symbol RST, and in order to represent the corresponding position of initial symbol RST in packed data block 210.Promptly can obtain the pairing initial symbol RST of address AD D1～ADDm～ADDn in the packed data block 210, and then can carry out the decompression of subdata frame 222 by the initial symbol RST that obtains by the address AD D1 in the index data～ADDm～ADDn.
Wherein, packed data block 210 forms two different files with index data block 230.In other words, packed data forms two different files respectively with index data.
Moreover packed data block 210 and index data block 230 also can form single file.In other words, packed data block 210 is connected with index data block 230, so that packed data and index data are combined into a file.Hereof, after index data block 230 can be connected packed data block 210, after promptly index data is connected packed data; But, after also can be packed data block 210 and being connected in index data block 230, after promptly packed data is connected in index data.
With reference to Fig. 5, after index data is connected in packed data in, behind index data block 230, can insert a file full stop EOI2.After this file full stop EOI2 is connected in index data, in order to sign as this file termination.
Wherein, formed file all can be stored in the storage device that a computer-readable is got, for example: but be not limited to this, storage card, hard disk, carry-on dish, CD or disk etc., lining.
With reference to Fig. 6, can before compressing, image 310 analyze the characteristic area of image 310 or the zone that the user is interested in by user's selection or by program software earlier, to be defined as feature block 312 (step 102), as shown in Figure 7.Image 310 is cut into a plurality of sub-images 314 (step 110), and feature block 312 is contained at least one row sub-image 314 at this moment, as shown in Figure 8.In regular turn each sub-image 314 is compressed into subdata frame (frame) then to produce a packed data (step 130).The subdata frame can interconnect according to the order of sub-image 314, to form a packed data.And, obtain the address (step 152) of the initial symbol of the subdata frame 222 after first sub-image 314a in each row sub-image 314 in the feature block 312 and last the sub-image 314b compression, the address obtained of record is to form index data (step 154) then.
Under the situation of the image that do not decompress fully, as long as obtain initial symbol by the address that index data write down earlier, and in pairs in regular turn with initial symbol, by a beginning in every pair of initial symbol, decompression is to another initial symbol, to decode every row sub-image of feature block in regular turn, to obtain the image of full feature block.Why can learn this image by this feature block.Thus, can quicken the time of image preview and search, and then obtain needed image fast.In addition, on some special applications, also can quicken the speed of image-decoding and broadcast.Be shown as example with transparency, use the present invention, can earlier the feature block be decoded and show, and then, can obtain the effect that the transparency animation switches other partial decoding of h and demonstration.
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.
Claims (9)
1. a static image compression method in order to compress an image, is characterized in that, comprising:
This image is cut into a plurality of sub-images;
In regular turn each this sub-image is compressed into the subdata frame with an initial symbol has interconnective this subdata frame according to the order of this sub-image with generation a packed data; And
The address of writing down this initial symbol is to produce an index data.
2. static image compression method according to claim 1 is characterized in that, more comprises:
Definition one feature block on this image, this feature block is contained at least one this sub-image that is listed as; And
Wherein the address of this this initial symbol of record comprises with the step that produces this index data:
Obtain in this feature block the address that each is listed as this initial symbol of this subdata frame after this sub-image compression of first and last in this sub-image; And
This address that record is obtained is to form this index data.
3. static image compression method according to claim 1 is characterized in that, more comprises:
After this index data is connected in this packed data; And
One file full stop is set to form this image file behind this index data.
4. static image compression method according to claim 1 is characterized in that, more comprises:
Analyze this image with definition one feature block on this image, this feature block has at least one this sub-image that is listed as; And
Wherein the address of this this initial symbol of record comprises with the step that produces this index data:
Obtain in this feature block the address that each is listed as this initial symbol of this subdata frame after this sub-image compression of first and last in this sub-image; And
This address that record is obtained is to form this index data.
5. storage device that computer-readable is got, it is characterized in that, store an index data and be condensed to a packed data of an image in order to decompress(ion), wherein this packed data comprises: a plurality of subdata frames, be condensed to a plurality of sub-images that constitute this image in order to decompress(ion), each this subdata frame comprises: an initial symbol, in order to the decompression of initial this subdata frame; And wherein this index data comprises: a plurality of addresses, and corresponding to one in this initial symbol, in order to represent this corresponding initial symbol position in this packed data.
6. the storage device that computer-readable according to claim 5 is got, it is characterized in that, have in this image and contain an at least one feature block that is listed as this sub-image, and this address is represented in this feature block each this subdata frame position in this packed data after being listed as this sub-image compression of first and last in this sub-image respectively.
7. the storage device that computer-readable according to claim 5 is got is characterized in that, more stores a file full stop, after wherein this index data is connected in this packed data in this document, and after this document full stop is connected in this index data.
8. the storage device that computer-readable according to claim 5 is got is characterized in that, after this packed data is connected in this index data in this document.
9. the storage device that computer-readable according to claim 5 is got is characterized in that, this packed data forms two different files respectively with this index data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100010648A CN101489018A (en) | 2008-01-18 | 2008-01-18 | Static image compression method and computer readable storage apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100010648A CN101489018A (en) | 2008-01-18 | 2008-01-18 | Static image compression method and computer readable storage apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101489018A true CN101489018A (en) | 2009-07-22 |
Family
ID=40891682
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008100010648A Pending CN101489018A (en) | 2008-01-18 | 2008-01-18 | Static image compression method and computer readable storage apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101489018A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102769743A (en) * | 2011-05-06 | 2012-11-07 | 华晶科技股份有限公司 | Method for processing image files |
| WO2017161631A1 (en) * | 2016-03-25 | 2017-09-28 | 深圳市华星光电技术有限公司 | Method of storing compensation data of oled display panel |
| CN114339255A (en) * | 2020-09-30 | 2022-04-12 | 瑞昱半导体股份有限公司 | Method for storing image frame in memory and related image processor |
-
2008
- 2008-01-18 CN CNA2008100010648A patent/CN101489018A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102769743A (en) * | 2011-05-06 | 2012-11-07 | 华晶科技股份有限公司 | Method for processing image files |
| WO2017161631A1 (en) * | 2016-03-25 | 2017-09-28 | 深圳市华星光电技术有限公司 | Method of storing compensation data of oled display panel |
| CN114339255A (en) * | 2020-09-30 | 2022-04-12 | 瑞昱半导体股份有限公司 | Method for storing image frame in memory and related image processor |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10075711B2 (en) | Flexible data organization for images | |
| US6298166B1 (en) | Image transformations in the compressed domain | |
| US8902992B2 (en) | Decoder for selectively decoding predetermined data units from a coded bit stream | |
| CN100524452C (en) | Digital image storage, displaying method and device | |
| US8600183B2 (en) | Optimized method and system for entropy coding | |
| JP4919743B2 (en) | Method and apparatus for generating thumbnails with digital images | |
| US9894371B2 (en) | Video decoder memory bandwidth compression | |
| EP1244999A1 (en) | Picture and video storage management system and method | |
| CN102263950A (en) | Encoding device, encoding method, decoding device, and decoding method | |
| JP2016226001A (en) | Decoder and decoding method | |
| JP2000278685A (en) | Method for processing variable length encoded binary bit stream | |
| US11818397B2 (en) | Sparse matrix representation using a boundary of non-zero coefficients | |
| US8306346B2 (en) | Static image compression method and non-transitory computer readable medium having a file with a data structure | |
| US9106925B2 (en) | WEAV video compression system | |
| CN104429066A (en) | Method for encoding a digital video image | |
| CN103997651A (en) | Data compression method and device for composite images | |
| CN101489018A (en) | Static image compression method and computer readable storage apparatus | |
| US7123656B1 (en) | Systems and methods for video compression | |
| KR100834669B1 (en) | Image encoder and decoder based on wavelet transform for creating thumbnail image and method thereof | |
| CN111246249A (en) | Image encoding method, encoding device, decoding method, decoding device and storage medium | |
| CN102724471A (en) | Picture and video converting method and device | |
| US8094951B2 (en) | Coding system and method for a bit-plane | |
| CN108184113B (en) | Image compression coding method and system based on inter-image reference | |
| US8116580B2 (en) | Embedded high frequency image details | |
| JP4739443B2 (en) | Method and apparatus for processing digital images |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20090722 |