CN107040791B - Self-adaptive binary image compression method suitable for electronic display label - Google Patents

Self-adaptive binary image compression method suitable for electronic display label Download PDF

Info

Publication number
CN107040791B
CN107040791B CN201710222362.9A CN201710222362A CN107040791B CN 107040791 B CN107040791 B CN 107040791B CN 201710222362 A CN201710222362 A CN 201710222362A CN 107040791 B CN107040791 B CN 107040791B
Authority
CN
China
Prior art keywords
character
image
run
length
compression
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.)
Active
Application number
CN201710222362.9A
Other languages
Chinese (zh)
Other versions
CN107040791A (en
Inventor
陈丽
夏兴隆
吴振英
王莉莉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Etag Technology Corp
Original Assignee
Suzhou Vocational Institute of Industrial Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou Vocational Institute of Industrial Technology filed Critical Suzhou Vocational Institute of Industrial Technology
Priority to CN201710222362.9A priority Critical patent/CN107040791B/en
Publication of CN107040791A publication Critical patent/CN107040791A/en
Application granted granted Critical
Publication of CN107040791B publication Critical patent/CN107040791B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/93Run-length coding

Abstract

The invention provides a self-adaptive binary image compression method suitable for an electronic display label, which comprises the following steps: step 1, comparing an image to be displayed with a current display image to obtain a dot matrix coordinate of an effective refreshing area and corresponding updating information, and step 2, respectively compressing a pattern part and a character part in the updating information in two different compression modes. The invention can provide an image compression improvement method with high compression efficiency and less resource consumption under the condition of not increasing the resources of the electronic display label processor. The image compression improvement method can effectively improve the image transmission response speed of the electronic shelf label, improve the overall working efficiency of the electronic shelf label, reduce the time for image refreshing transmission, effectively save energy consumption and prolong the service life of the electronic shelf label.

Description

Self-adaptive binary image compression method suitable for electronic display label
Technical Field
The invention relates to the field of electronic display, in particular to a self-adaptive binary image compression method suitable for an electronic display label.
Background
At present, there are many methods related to lossless compression, and the most common algorithms for lossless compression of binary images include run-length coding, Huffman coding, LZ77, and the like. Based on these algorithms, many people also propose some optimization algorithms and implement them by hardware.
However, for the binary image display of the electronic shelf label in the new field, because the image content has specific features, the image content of the electronic shelf label is basically fixed in a template with a specific format in practical application, and it is only necessary to change the partial refresh in a specific area, and the full screen content is refreshed in a whole screen, but the requirement on the speed of transmission response is higher, so in this application field, the common image compression method adopts a uniform algorithm to perform uniform and non-differential compression on the whole screen image, which is not suitable in practice and has low efficiency. Robin Kuivinen once compared the compression effect of 7 image compression algorithms in electronic shelf labels. In a more preferable case, the concentration is only about 20%.
Although the compression aiming at character coding is a common image content compression method, the method can obviously improve the communication speed and has short decompression time, but the method is limited to character content and is not suitable for the content with images. And for most applications, the compression rate requirement for character encoding is very low (full screen characters even reach around 2%).
After the image is compressed, the smaller the compression ratio is, the faster the transmission is; meanwhile, in consideration of the operation processing capacity of the electronic display tag, the decoding method corresponding to the complex compression algorithm is complex, the requirement on the resource of a tag processor for decoding is high, but the higher the resource of the processor is, the more resource cost is required to be consumed, and the requirement of high transmission speed and low energy consumption cannot be met.
Thus, problems currently exist including:
1. the common compression algorithm has low compression rate and is not suitable for the image content of the electronic display label. The complex compression algorithm results in a complex decoding method and high requirements on the label processor.
2. Although the general character encoding has very high compression rate and fast decompression time, the image cannot be compressed, and the method is also not suitable for processing the contents of the electronic display label with luxuriant pictures and texts.
Therefore, how to find a solution which can adapt to the specific display content of the electronic shelf label and has higher compression rate is a problem which needs to be solved urgently at present.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide an adaptive binary image compression method suitable for an electronic display label.
The invention provides a self-adaptive binary image compression method suitable for an electronic display label, which comprises the following steps:
step 1, comparing an image to be displayed with a current display image to obtain a dot matrix coordinate of an effective refreshing area and corresponding updating information,
and 2, respectively compressing the pattern part and the character part in the updated information in two different compression modes.
Preferably, the step 2 of compressing the pattern part in the update information includes:
presetting a minimum run range and one or more continuous segmented run ranges;
run-length detection is performed on the pattern part;
when the run length of the current data is detected to be less than or equal to the minimum run range, the pattern type transmission data comprises an operation flag bit and a data content segment, and the operation flag bit is set to be not compressed;
when the fact that the run length of the current data belongs to the segmented run range is detected, the pattern class transmission data comprise an operation flag bit, a category flag bit and a data length bit, the operation flag bit is set to be compressed, the category flag bit is determined according to the binary attribute of the current data, and the data length bit is determined according to the run length of the current data.
Preferably, when it is detected that the run length of the current data belongs to the segment run range, the length of the reserved data length bits is determined according to the maximum length of the segment run range to which the current data belongs.
Preferably, the method further comprises the following steps between step 1 and step 2:
and comparing the updated information with character features in a preset character library one by one, identifying the matched character part as the character part, and identifying the unmatched character part as the pattern part.
Preferably, the step 2 compresses the character part in the update information in a manner that:
and extracting a number corresponding to the character feature matched with the character part in the character library, wherein the character class transmission data comprises the number and a dot matrix coordinate of a corresponding sequence.
Preferably, step 1 is preceded by the step of presetting a character library: and determining the character characteristics of each character according to the characteristic analysis of the character, storing the characters and the character characteristics corresponding to the characters into the character library in a one-to-one correspondence manner, and sequentially setting numbers.
Preferably, the characters include chinese, english, numeric, special characters.
Compared with the prior art, the invention has the following beneficial effects:
the invention can provide an image compression improvement method with high compression efficiency and less resource consumption under the condition of not increasing the resources of the electronic display label processor. The image compression improvement method can effectively improve the image transmission response speed of the electronic shelf label, improve the overall working efficiency of the electronic shelf label, reduce the time for image refreshing transmission, effectively save energy consumption and prolong the service life of the electronic shelf label.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. In the drawings:
FIG. 1 is a flow chart of a method for compressing an adaptive binary image for an electronic display label;
FIG. 2 is an example of an image to be displayed;
FIG. 3 is an example of a currently displayed image;
FIG. 4 is a data diagram of an uncompressed operation;
FIG. 5 is a data diagram of a short compression operation;
FIG. 6 is a data diagram of a medium compression operation;
FIG. 7 is a data diagram of a long compression operation;
fig. 8 is a schematic flow chart of an alternative method.
Detailed Description
The present invention will be described in detail below by way of specific embodiments with reference to the accompanying drawings. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It is to be understood that other embodiments may be utilized and structural and functional modifications may be made to the embodiments set forth herein without departing from the scope and spirit of the present invention.
In an embodiment of the adaptive binary image compression method suitable for the electronic display tag provided by the invention, as shown in fig. 1, the method includes
According to the invention, the method comprises the following steps:
step 1, comparing an image to be displayed with a current display image to obtain a dot matrix coordinate of an effective refreshing area and corresponding updating information,
and 2, respectively compressing the pattern part and the character part in the updated information in two different compression modes.
The run-length algorithm is implemented by replacing a data portion of a string that occurs consecutively with the current data element and the number of times the element occurs consecutively. The run length refers to a segment of data in which data elements are repeated, and the run length refers to the number of repeated occurrences of the elements in the repeated data segment. For example, the first run is 111 repeated three times in 1110, which has a run length of 3. The run range refers to 1 on the 1 st to 3 rd bit range. Specific examples of the latter part are found.
As an alternative embodiment, the step 2 of compressing the pattern part in the update information includes:
presetting a minimum run range and one or more continuous segmented run ranges;
run-length detection is performed on the pattern part;
when the run length of the current data is detected to be less than or equal to the minimum run range, the pattern type transmission data comprises an operation flag bit and a data content segment, and the operation flag bit is set to be not compressed;
when the fact that the run length of the current data belongs to the segmented run range is detected, the pattern class transmission data comprise an operation flag bit, a category flag bit and a data length bit, the operation flag bit is set to be compressed, the category flag bit is determined according to the binary attribute of the current data, and the data length bit is determined according to the run length of the current data.
As an alternative embodiment, when it is detected that the run length of the current data belongs to the segment run range, the length of the reserved data length bits is determined according to the maximum length of the segment run range to which the current data belongs.
As an alternative embodiment, the method further includes, between step 1 and step 2:
and comparing the updated information with character features in a preset character library one by one, identifying the matched character part as the character part, and identifying the unmatched character part as the pattern part.
As an alternative embodiment, the step 2 compresses the character part in the update information in a manner that:
and extracting a number corresponding to the character feature matched with the character part in the character library, wherein the character class transmission data comprises the number and a dot matrix coordinate of a corresponding sequence.
As an alternative embodiment, before step 1, the method further includes the step of presetting a character library: and determining the character characteristics of each character according to the characteristic analysis of the character, storing the characters and the character characteristics corresponding to the characters into the character library in a one-to-one correspondence manner, and sequentially setting numbers.
As an alternative embodiment, the characters include chinese, english, numeric, special characters.
The scheme can be realized through the following scheme flow, and the method comprises the following steps:
1. automatically recognizing refreshed content
And scanning a full-screen dot matrix image, comparing and converting with the current image content to obtain a changed area, and locking the coordinates of the effective refreshing area needing refreshing the content.
2. Automatic recognition of electronic display label images and characters
And comparing the contents of the effective refreshing area with the character features of the word stock one by one, and automatically identifying the character contents if the comparison is successful.
An area that cannot be matched with the character of the word stock is defined as the image content.
3. The image content and the character content are processed with different compression engines respectively:
and for image content, an optimized run length judgment compression coding algorithm with low memory occupation and low compression rate is adopted.
And for character content, image compression is carried out by adopting a character coding mode.
4. The terminal tag receives the transmission content and automatically adapts to decoding and refreshes the corresponding content of the corresponding area:
the transmission protocol adopts a mode of separately transmitting characters and images
And the terminal tag receives the data packet of the character characteristics, directly starts a pre-stored character code table, reads the coordinate information and then displays and refreshes the code reading of the character content.
And the terminal tag receives the data packet of the image characteristics, starts an image decoding engine, judges which mode is adopted to decode the image content according to the run length judgment compression coding mode determined by the protocol, and decodes, displays and refreshes the decoded image content according to the coordinate information.
Examples of specific embodiments are:
as shown in fig. 2 and 3, fig. 2 is an image to be displayed, and the right image 1 is a current display image.
Step one, automatically identifying refreshing content.
1. Image 1 and image 2 are scanned and compared using an image engine
2. Calculating the difference to obtain the contents of the character 5 part and the image 3 part, and locking the coordinates of the character 5 and the image 3 areas as follows:
character 5 start coordinates (X1, Y1), and character 5 end coordinates (X2, Y2);
image 3 start coordinates (X3, Y3), and image 3 end coordinates (X4, Y4);
step two, the method for automatically identifying the electronic display label image and the character comprises the following steps:
1. the characters in the word stock are subjected to characteristic analysis in advance, the characteristics of each character are stored,
2. and the content locked in the operation comparison step I is compared with the character characteristics in an operation manner, the character content is locked if the character 5 is successfully compared, and the image content is defined as the image content if the image 3 is not successfully compared.
3. The content code word field code of the word 5 has been determined by the comparison to be (W1.. Wn)
3. The 5-field code of the character and the coordinates of the character graph are sent to a character compression processing engine for character compression processing
4. Sending the image 3 coordinate range content to a pattern compression processing engine for data processing
Step three, a character compression processing engine: the invention adopts the compression mode of pre-storing the character code table for the character content:
the electronic display label of the invention has pre-stored character code table of the character library, and in practical use, the characters are firstly coded and stored in the flash. The word stock mainly comprises Chinese, English, numbers, special characters and the like.
After the character content is recognized and the character is compressed in the character compression engine, the compressed information only includes the character position coordinates, the character 5 start coordinate (X1, Y1), the character 5 end coordinate (X2, Y2), and the character corresponding number (w 1.. Wn).
Step three, a pattern compression processing engine: the optimized run length judgment compression coding designed by the invention is adopted for the pattern content:
when the run length is not greater than the minimum run range 7, the information is not compressed, the information content itself is determined to be small, compression is not required, and the pattern type transmission data content is as shown in fig. 4.
When the run length is larger than 256, a long compression as shown in fig. 7 is used.
When the run length is greater than 64 and less than 256, the medium compression mode as shown in fig. 6 is used.
When the run length is greater than 7 and less than 64, a short compression as shown in fig. 5 will be used.
For the no compression operation, a 1 st bit of 1 indicates no compression, and the remaining 7bits indicate image pixel information.
For short compression, the 1 st bit is 0 to represent compression, the 2 nd bit represents the specific content of the subsequent repeated pixels, and if the 1 st bit is 1, the subsequent repeated pixels are black; if 0, then all subsequent colors are white. The remaining 6bits represent the run length.
For medium compression and long compression, the first byte is information byte, bit 0 of 1 represents compression, and bit 2 represents the specific content of the subsequent repeated pixel. The last 6bits indicate long or medium compression.
For long compression, the next 2 bytes represent the run length; for medium compression, the next 1 byte represents the run length.
Suppose that image 3 pixel information is as follows, 0 for white and 1 for black:
00000001111……1111000……000111…111
sequentially comprises 8 continuous white pixels, 60 continuous black pixels, 80 continuous white pixels and 257 continuous black pixels
For image 3, after entering the pattern compression engine. The number of repeated pixels, defined as the run length, is counted from the start position.
And (3) calculating to obtain that the content of the first repeated pixel of the image 3 is 0, the run length is L-7, L is not more than the uncompressed minimum run range 7, the partial content is not compressed, and the subsequent continuous 7-bit direct transmission pixel content is selected. Then the part of the content is compressed and expressed by 8 bits:
10000000
then, the next part of the repeat pixel statistics is entered, the repeat pixel content is 1, and the run length L is obtained by statistics as 60. L exceeds the uncompressed minimum run range of 7 and is less than 64, the part of the content is subjected to short compression, and the compressed part is represented by 8bits
Greater than 64 and less than 256, for the part of content, coding in a medium compression mode:
01111100
then, the next part of the repeated pixel statistics is entered, the content of the repeated pixel is 0, and the run length L is counted to be 80. L exceeds the uncompressed minimum run range 7,
and if the content is larger than 64 and smaller than 256, encoding the part of the content by using a medium compression mode, and expressing the part of the content by using 16bits after compression:
00000000 01010000
then, the next part of the repeat pixel statistics is entered, the repeat pixel content is 1, and the run length L is calculated to be 257. L is larger than 256, for the part of content, the part of content is coded by adopting a long compression mode, and the compressed part is expressed by 24 bits:
01000001 00000001 00000001
and step four, decompressing the terminal label, and refreshing and displaying a new image 2.
The terminal tag receives information corresponding to the character 5, wherein the information comprises a character code table number (W1.. Wn), the coordinate of the character code in f1ash is searched for, (f1.. fn), the decoding is successful, and the initial coordinate of the character 5 is (X1, Y1), and the terminal coordinate of the character 5 is (X2, Y2); and (8) directly reading the region (f1.. fn), and performing local refreshing display on the word bank flash pixels with the table numbers.
And the terminal tag receives the coded content of the image 3 and decodes the coded content. From image 3 start coordinates (X3, Y3) and image 3 end coordinates (X4, Y4); after the decoding in turn is started, the following is refreshed.
First, judging the first bit as 1, judging the 8bits as non-compressed content, and the rest 7bits as pixel content, and continuously displaying 7 white pixels.
Then, the first bit of the next byte is judged to be 0, then the compressed content is followed, the second bit is 1, then the content of the subsequent repeated pixel is black pixel, then the subsequent 6bits are read, if the bit is more than 2, then only the 6bits represent the run length, if the six bits are 111100, then the run length is decoded to 60, and 60 black pixels are continuously displayed.
Then, the first bit of the next byte is judged to be 0, then the compressed content is followed, the second bit is 0, then the content of the subsequent repeated pixel is white pixel, then the subsequent 6bits are read, 000000, then 8bits after the byte is represented as run length, namely 01010000, then the run length is decoded to 80, and 80 white pixels are continuously displayed.
Then, the first bit of the next byte is judged to be 0, then the compressed content is followed, the second bit is 1, then the content of the following repeated pixel is black pixel, then the following 6bits are read, 000001, then 16bits after the byte are represented as the run length, namely 0000000100000001, then the run length is decoded into 257. 257 white pixels are displayed continuously.
The invention can provide an image compression improvement method with high compression efficiency and less resource consumption under the condition of not increasing the resources of the electronic display label processor.
The image compression improvement method can automatically identify the image content and the character content without manual intervention processing.
The image compression improvement method can effectively improve the image transmission response speed of the electronic shelf label, improve the overall working efficiency of the electronic shelf label, reduce the time for image refreshing transmission, effectively save energy consumption and prolong the service life of the electronic shelf label.
While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.

Claims (6)

1. An adaptive binary image compression method suitable for an electronic display label is characterized by comprising the following steps:
step 1, comparing an image to be displayed with a current display image to obtain a dot matrix coordinate of an effective refreshing area and corresponding updating information;
comparing the updated information with character features in a preset character library one by one, identifying the updated information as a character part if the updated information is matched with the character features, and identifying the updated information as a pattern part if the updated information is not matched with the character features;
step 2, compressing the pattern part and the character part in the updated information in two different compression modes; the pattern part adopts optimized run length judgment compression coding; the character part adopts a compression mode of a pre-stored character code table.
2. The adaptive binary image compression method for the electronic display label according to claim 1, wherein the step 2 compresses the pattern part in the update information in a manner that includes:
presetting a minimum run range and one or more continuous segmented run ranges;
run-length detection is performed on the pattern part;
when the run length of the current data is detected to be less than or equal to the minimum run range, the pattern type transmission data comprises an operation flag bit and a data content segment, and the operation flag bit is set to be not compressed;
when the fact that the run length of the current data belongs to the segmented run range is detected, the pattern class transmission data comprise an operation flag bit, a category flag bit and a data length bit, the operation flag bit is set to be compressed, the category flag bit is determined according to the binary attribute of the current data, and the data length bit is determined according to the run length of the current data.
3. The adaptive binary image compression method for electronic display tags according to claim 2, wherein when it is detected that the run length of the current data belongs to said segment run range, the length of the reserved data length bits is determined according to the maximum length of the segment run range to which the current data belongs.
4. The adaptive binary image compression method for the electronic display label according to claim 1, wherein the step 2 compresses the character part in the update information in a manner that includes:
and extracting a number corresponding to the character feature matched with the character part in the character library, wherein the character class transmission data comprises the number and a dot matrix coordinate of a corresponding sequence.
5. The adaptive binary image compression method suitable for the electronic display label according to claim 1, characterized by further comprising a step of presetting a character library before step 1: and determining the character characteristics of each character according to the characteristic analysis of the character, storing the characters and the character characteristics corresponding to the characters into the character library in a one-to-one correspondence manner, and sequentially setting numbers.
6. The adaptive binary image compression method for the electronic display label as claimed in claim 1, wherein the characters comprise Chinese, English, numeric and special characters.
CN201710222362.9A 2017-04-06 2017-04-06 Self-adaptive binary image compression method suitable for electronic display label Active CN107040791B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710222362.9A CN107040791B (en) 2017-04-06 2017-04-06 Self-adaptive binary image compression method suitable for electronic display label

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710222362.9A CN107040791B (en) 2017-04-06 2017-04-06 Self-adaptive binary image compression method suitable for electronic display label

Publications (2)

Publication Number Publication Date
CN107040791A CN107040791A (en) 2017-08-11
CN107040791B true CN107040791B (en) 2019-12-31

Family

ID=59533438

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710222362.9A Active CN107040791B (en) 2017-04-06 2017-04-06 Self-adaptive binary image compression method suitable for electronic display label

Country Status (1)

Country Link
CN (1) CN107040791B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108777800A (en) * 2018-06-25 2018-11-09 广州科政数码科技有限公司 The compression of electronic shelf label image data, decompression, processing method and system
CN108900843B (en) * 2018-07-31 2021-08-13 高创(苏州)电子有限公司 Monochrome image compression method, apparatus, medium, and electronic device
CN112051974B (en) * 2019-06-06 2023-12-15 汉朔科技股份有限公司 Electronic price tag information transmission method and system, electronic price tag and server
CN110719105B (en) * 2019-09-16 2023-03-28 上海御渡半导体科技有限公司 Lossless compression and decompression method for test vector

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006085326A2 (en) * 2005-02-10 2006-08-17 Siano Mobile Silicon Ltd. System and method for mitigating memory requirements
CN101578062A (en) * 2007-08-20 2009-11-11 株式会社石田 Electronic shelf label and electronic shelf label system
CN102034078A (en) * 2010-12-24 2011-04-27 东信和平智能卡股份有限公司 Coding method for image barcode identification
CN103794134A (en) * 2014-02-17 2014-05-14 立德高科(北京)数码科技有限责任公司 Mark formed by dot matrixes and electronic supervision code and generation and identification method of mark
CN105516540A (en) * 2015-12-14 2016-04-20 天津津芯微电子科技有限公司 Compression method and device of binary image

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006085326A2 (en) * 2005-02-10 2006-08-17 Siano Mobile Silicon Ltd. System and method for mitigating memory requirements
CN101578062A (en) * 2007-08-20 2009-11-11 株式会社石田 Electronic shelf label and electronic shelf label system
CN102034078A (en) * 2010-12-24 2011-04-27 东信和平智能卡股份有限公司 Coding method for image barcode identification
CN103794134A (en) * 2014-02-17 2014-05-14 立德高科(北京)数码科技有限责任公司 Mark formed by dot matrixes and electronic supervision code and generation and identification method of mark
CN105516540A (en) * 2015-12-14 2016-04-20 天津津芯微电子科技有限公司 Compression method and device of binary image

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于改进型游程编码的FPGA动态重构方法;邵龙;《电子器件》;20141020;第37卷(第5期);全文 *
一种基于符号的二值图像压缩算法;杨丽芳,廖宏,黄孜祺,罗维;《广西计算机学会2008年年会论文集》;20080901;全文 *

Also Published As

Publication number Publication date
CN107040791A (en) 2017-08-11

Similar Documents

Publication Publication Date Title
CN107040791B (en) Self-adaptive binary image compression method suitable for electronic display label
US5748904A (en) Method and system for segment encoded graphic data compression
US6008745A (en) Variable length decoding using lookup tables
US8902992B2 (en) Decoder for selectively decoding predetermined data units from a coded bit stream
CN101272442B (en) Digital image nondestructive compression method and device, resolution method and image encoder
US10776957B2 (en) Online image compression in hardware
JPH07327134A (en) Image processor and its method
US9807402B2 (en) Method of color palette coding applicable to electronic device and electronic device using the same
JPS6343036B2 (en)
CN102156611A (en) Method and apparatus for creating animation message
CN109660527B (en) Compression transmission method for printer data
US7986314B2 (en) Over-drive device and method thereof
CN110235176B (en) Image processing method and device, data transmission method and device and storage medium
EP4243415A1 (en) Image compression method and apparatus, and intelligent terminal and computer-readable storage medium
CN101459854B (en) Encoding/decoding apparatus for picture compression and encoding/decoding method therefor
JP4361640B2 (en) Font data bitmap apparatus and method
JP4199208B2 (en) Image compression and recovery method for mobile communication terminals
JP4406481B2 (en) Graphic data compression
CN103139566B (en) Method for the efficiently decoding of variable-length code (VLC)
US8238674B2 (en) Method for encoding and decoding images
CN110572664A (en) Novel BMP image compression method and system
KR100327924B1 (en) Compressing ideographic characters
US20040114809A1 (en) Image compression method
CN113592717A (en) Video image character superposition method and device, storage medium and electronic device
KR100471660B1 (en) A system for moving image data using wireless communication and the method of the same

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20211229

Address after: 215002 room 1506, building e, Science Park, University of nanotechnology, No. 388 Ruoshui Road, Suzhou area, China (Jiangsu) pilot Free Trade Zone, Suzhou, Jiangsu

Patentee after: SUZHOU ETAG-TECHNOLOGY Corp.

Address before: No.1 Zhineng Avenue, Suzhou International Education Park, Suzhou, Jiangsu Province

Patentee before: Suzhou Vocational Institute of Industrial Technology