CN111352595B - Dot line compression method of thermal printer - Google Patents
Dot line compression method of thermal printer Download PDFInfo
- Publication number
- CN111352595B CN111352595B CN202010104001.6A CN202010104001A CN111352595B CN 111352595 B CN111352595 B CN 111352595B CN 202010104001 A CN202010104001 A CN 202010104001A CN 111352595 B CN111352595 B CN 111352595B
- Authority
- CN
- China
- Prior art keywords
- data
- bit
- index
- point
- row
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1202—Dedicated interfaces to print systems specifically adapted to achieve a particular effect
- G06F3/1203—Improving or facilitating administration, e.g. print management
- G06F3/1208—Improving or facilitating administration, e.g. print management resulting in improved quality of the output result, e.g. print layout, colours, workflows, print preview
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1223—Dedicated interfaces to print systems specifically adapted to use a particular technique
- G06F3/1237—Print job management
- G06F3/1242—Image or content composition onto a page
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/12—Digital output to print unit, e.g. line printer, chain printer
- G06F3/1201—Dedicated interfaces to print systems
- G06F3/1278—Dedicated interfaces to print systems specifically adapted to adopt a particular infrastructure
- G06F3/1285—Remote printer device, e.g. being remote from client or server
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- General Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Multimedia (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The invention relates to the technical field of printers, in particular to a dot line compression algorithm of a thermal printer, which comprises the following steps: s1, acquiring picture data, converting the picture data into point-row data and storing the point-row data into a list; s2, sequentially taking out the data of each point from the list; s3, counting and accumulating the point position data in the point row; s4, when the point location data count is accumulated to 6, comparing the data of the first 6 point location data, and performing corresponding processing; and S5, repeating the step S3 until the whole list is finished to obtain the dot row compression data. The point row compression method is simple and convenient to use. According to the characteristics of the thermal printer, the bitmap data features take the dot rows as compression units, so that the printer is convenient to transmit; the method can compress the picture after common compression again, has large compression ratio, greatly reduces the sending quantity of the picture data and does no damage to the data.
Description
Technical Field
The invention relates to the technical field of printers, in particular to a dot line compression algorithm of a thermal printer.
Background
After the mobile phone APP is connected with the thermal printer through the Bluetooth, the APP end sends data to the printer (as shown in figure 1), and the printer prints after receiving the data. Due to different styles of mobile phones, the Bluetooth has advantages and disadvantages, and when the Bluetooth transmission speed is low, the problems of picture blockage, picture data disorder, distortion, white line printing and the like can be occasionally encountered.
When the mobile phone interacts with the printer, when the transmission speed becomes slow (especially the maximum transmission length of a BLE single packet is smaller, about one hundred bytes), when the data of the single packet is too large, the data can be automatically split into small packets by the Bluetooth, so that the printer can receive the data slowly, delay, loss and the like, and the problems of blockage, disordered picture data (as shown in figure 2), distortion, white line printing (as shown in figure 3) and the like are caused during printing. The common compression method can not achieve good effect, for example, too much compression can cause fuzzy printing and insufficient definition
Disclosure of Invention
Aiming at the defects of the prior art, the invention discloses a dot line compression algorithm of a thermal printer, which is used for solving the problems that after a mobile phone APP is connected with the thermal printer through Bluetooth, an APP end sends data to the printer, and the printer performs printing operation after receiving the data. Due to different styles of mobile phones, the Bluetooth has advantages and disadvantages, and when the Bluetooth transmission speed is low, the problems of picture blockage, picture data disorder, distortion, white line printing and the like can be occasionally encountered.
The invention is realized by the following technical scheme:
the invention discloses a dot line compression algorithm of a thermal printer, which comprises the following steps:
s1, acquiring picture data, converting the picture data into point-row data and storing the point-row data into a list;
s2, sequentially taking out row data of each point from the list;
s3, counting and accumulating the point position data in the point row;
s4, when the point location data count is accumulated to 6, comparing the data of the first 6 point location data, and performing corresponding processing;
and S5, repeating the step S3 until the whole list is finished to obtain the point row compression data.
Furthermore, after the dot row data is taken out in S3, the left side of the dot row is the start bit, and the dot row data is taken out in sequence from the 0 th bit to compare whether the dot row data is 1 or 0, and a variable index is defined for counting, and the index is accumulated from 0.
Furthermore, in S4, when all the 6 dot bit data bits are 0, index is added with 1, and the next bit data is continuously taken and compared with the previous bit data by using the current bit.
Further, if the current bit is not the same as the previous bit, the current index value is counted, the data is processed to 0, the index and 3F are processed to perform a & bit operation, then 0x40 is added, the index value is reset to 0, the data comparison is continuously taken out from the next bit, and S4 is executed.
Further, if the current bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all 61 bits are 0, the data is processed to 0, the index and 3F are processed to perform the & bit operation, 0x40 is added, the index value should be 0x7d, the index value is reset to 0, the data comparison is continuously extracted from the next bit, and S4 is performed.
Further, in S4, when all the 6 dot bit data are 1,1 is added to index, and the next bit data is continuously taken and compared with the previous bit data by using the current bit.
Further, if the current bit is not the same as the previous bit, the current index value is counted, the data is processed to 1, the index and 3F are processed to be a & bit operation, then 0x80 is added, the index is reset to 0, the data comparison is continuously taken out from the next bit, and S4 is executed.
Further, if the current bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all the 61 bits are 1, the data is processed to be 1, the index is subjected to the & bit operation with 3F, 0x80 is added, the index value should be 0xbd, the index value is reset to 0, the data comparison is continuously extracted from the next bit, and S4 is executed.
Furthermore, in S4, when the 6 dot bit data is not all 0 or all 1, the 6 dot bit data is set as original data, and the 3F performs a bit operation; the index value is reset to 0, the data comparison continues to be taken from the next bit, and S4 is performed.
Furthermore, when the comparison of a little of the data is completed, if the number of the last byte is less than 6 bits of the original data, zero padding is performed on the low bits.
The invention has the beneficial effects that:
the point row compression method is simple and convenient to use. According to the characteristics of the thermal printer, the bitmap data features take the dot rows as compression units, so that the printer is convenient to transmit; the picture after general compression can be compressed again, the compression ratio is large, the sending quantity of picture data is greatly reduced, and the data is lossless.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic diagram of a background art APP terminal sending data to a printer;
FIG. 2 is a schematic diagram of the prior art showing the occurrence of jamming and picture data disorder during printing;
FIG. 3 is a schematic diagram of a prior art distorted printed, white line;
FIG. 4 is a functional block diagram of the present invention;
FIG. 5 is an original drawing for comparison of examples;
FIG. 6 is a diagram showing the first 10 rows of data after the comparison with the conventional compression;
FIG. 7 is a graph of the first 10 lines of data after compression with dot lines for comparison of the examples.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
Example 1
The present embodiment discloses a dot row compression algorithm as shown in fig. 4, and the principle is mainly that according to the characteristics of the thermal printer when printing, the thermal printer head sheet is one dot row per heating unit, for example, the resolution is 203dpi, the width of the thermal paper is 48mm, and one row is about 384 heating dots, so that 384/8=48 bytes of dot matrix data of the maximum number of displayed dot matrixes per row is printed. Each byte has eight heating data bits, the bit with 1 is heated and printed into black, and the bit with 0 is not heated, i.e. white. Different heating effects, namely different grey-white pictures, are finally displayed according to different heating data. The selection is compressed by using a compression unit of each point row, so that the structure of the printer is not damaged, the operation data of the printer is convenient, the compression effect is obvious, and the original data of the picture is not damaged.
The dot line compression method divides each byte of the printing bitmap data into two parts, wherein the upper two bits are attribute parts, and the lower six bits are data parts. The attribute parts are 00,01,10 and 11 respectively represent that the following data part is original data, the data part is the digit of 0, and the data part is the digit of 1, and the reservation is carried out. When the upper two bits are 00, the data part represents the original data; when the upper two bits are 01, the data portion represents the number of 0; when the data part is 10, the data part represents the number of 1; when the upper two bits are 11, there is no definition. To name a few examples.
E.g., 0x06, 00 for the two higher bits, and 000110 for decompressed data;
for example, 0x50, the upper two bits are 01, the data portion is 010000, and 16 0 s, i.e., 0x00, are obtained after decompression. If 0x7d, 61 0 s are obtained;
for example 0x8f, 10 upper two bits, 001111 data portion, 15 1 after decompression.
The specific implementation steps are described by taking the printer resolution as 300dpi, the width of the thermal paper as 48mm, and one dot row, namely 576 dots as an example:
converting picture data into point row data and storing the point row data into a list;
step two, sequentially taking out the row data of each point from the list;
step three, after the dot row data is taken out, the left side of the dot row is an initial bit, the dot row data is taken out in sequence from the 0 th bit to compare whether the bit data is 1 or 0, a variable index is defined for counting, and the index is accumulated from 0;
step four, when the index is accumulated to 6, judging the data of the front 6 point bits, and only having the following three conditions:
1. index of all 0 bits of 6 dot bit data is added with 1, and the next bit data is continuously taken and compared with the previous bit data with the current bit? If not, counting the current index value, performing 0 setting processing on the data, performing bit-and-bit operation on the index and 3F, adding 0x40 to the index value, resetting the index value to be 0, continuously taking out the data from the next bit for comparison, and executing the step four; if the index is the same, 1 is continuously added, when the index value reaches 61, all 61 bits are 0, the data is processed by 0 setting, the index and 3F are subjected to & bit operation, 0x40 is added, the index value is 0x7d, the index value is reset to 0, the data is continuously extracted from the next bit for comparison, and the step four is executed;
2. 1 is added to index when the data of 6 dots is all 1, and the next data is continuously taken and compared with the previous data by using the current bit? If not, counting down the current index value, performing 1 setting processing on the data, performing & bit operation on the index and 3F, adding 0x80, resetting the index to be 0, continuously taking out the data from the next bit for comparison, and executing the step four; if the index is the same, continuing to add 1, when the index value reaches 61, the 61 bits are all 1, the data is processed to be 1, the index and 3F are processed to be 2 bits, then 0x80 is added, the index value is 0xbd, the index value is reset to be 0, continuing to take out the data from the next bit for comparison, and executing the step four;
3. in other cases, namely when the 6 point bit data is not all 0 or all 1, the 6 point bit data is set as original data, and the 3F is subjected to bit operation; resetting the index value to 0, continuously taking out data from the next bit for comparison, and executing the step four;
and step five, after little row of data is compared, if the number of the original data bits is less than 6 bits in the final byte filling, zero padding is carried out on the low bits. For example, the last data is bit 1001, supplemented with 100100.
And step six, repeating the step three until the whole list is finished.
The point line compression method is simple and convenient to use. According to the characteristics of the thermal printer, the bitmap data features take the dot rows as compression units, so that the printer is convenient to transmit; the picture after general compression can be compressed again, the compression ratio is large, the sending quantity of picture data is greatly reduced, and the data is lossless.
Example 2
The embodiment discloses a dot line compression algorithm of a thermal printer, which is used for solving the problem that after a mobile phone APP is connected with the thermal printer through Bluetooth, the APP end sends data to the printer, and the printer prints after receiving the data. Due to different styles of mobile phones, the Bluetooth has advantages and disadvantages, and when the Bluetooth transmission speed is low, the problems of picture blockage, picture data disorder, distortion, white line printing and the like can be occasionally encountered.
The invention is realized by the following technical scheme:
the invention discloses a dot line compression algorithm of a thermal printer, which comprises the following steps:
s1, acquiring picture data, converting the picture data into point-row data and storing the point-row data into a list;
s2, sequentially taking out the data of each point from the list;
s3, counting and accumulating the point position data in the point row;
s4, when the point position data count is accumulated to 6, comparing the data of the first 6 point positions, and performing corresponding processing;
and S5, repeating the step S3 until the whole list is finished to obtain the dot row compression data.
And S3, after the dot row data is taken out, taking the left side of the dot row as a start bit, sequentially taking out the dot row data from the 0 th bit, comparing whether the dot data is 1 or 0, defining a variable index for counting, and accumulating the index from 0.
In S4, when all the 6 point bit data bits are 0, index is added with 1, the next bit data is continuously taken out, and the current bit is compared with the previous bit data.
If the current bit is not the same as the previous bit, the current index value is counted, the data is set to 0, the index and 3F are processed for & bit operation, then 0x40 is added, the index value is reset to 0, the data comparison is continuously taken out from the next bit, and S4 is executed.
If the current bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all 61 bits are 0, the data is processed to 0, the index and 3F are processed to be 0,0x 40 is added, the index value should be 0x7d, the index value is reset to 0, the data comparison is continuously taken out from the next bit, and S4 is executed.
In S4, when the 6 dot bit data is all 1,1 is added to index, and the next bit data is continuously taken and compared with the previous bit data by using the current bit.
If the current bit is not the same as the previous bit, the current index value is counted, the data is processed to be 1, the index and 3F are processed to be 2, then, 0x80 is added, the index is reset to be 0, the data is continuously taken out from the next bit for comparison, and S4 is executed.
If the current bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all the 61 bits are 1, the data is processed to be 1, the index and 3F are processed by & bit operation, 0x80 is added to the index, 0xbd is added, the index value is reset to be 0, the data comparison is continuously taken out from the next bit, and S4 is executed.
In S4, when the 6 point bit data are not all 0 or all 1, setting the 6 point bit data as original data, and carrying out bit operation with 3F; the index value is reset to 0, data comparison continues to be taken from the next bit, and S4 is performed.
And after the comparison of a little of the data, if the number of the last byte is less than 6 bits of the original data, padding zero at the lower bit.
The effect of this embodiment is as follows, fig. 5-original, fig. 6-10 lines before data after normal compression, fig. 7-10 lines before data after dot line compression, and line 1, the normal compression is as shown in fig. 6, the length of one line is 72 bytes, and after the point line compression method is used for recompression, the length is 10 bytes as shown in fig. 7, and the compression ratio reaches 7.2. The total size of the whole image in FIG. 5 after ordinary compression is 3024 bytes, the total size after dot line compression is 1743 bytes, and the compression ratio is 1.73. The dot line compression method has a large compression ratio, and can well solve the problems of slow, delayed and missing data received by a printer, and white lines during printing images by the printer due to printing jamming, disordered image data, distortion, and printing.
The above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (2)
1. A dot line compression method of a thermal printer is characterized by comprising the following steps:
s1, acquiring picture data, converting the picture data into point-row data and storing the point-row data into a list;
s2, sequentially taking out the data of each point from the list;
s3, counting and accumulating point position data in the point row;
s4, when the point location data count is accumulated to 6, comparing the data of the first 6 point location data, and performing corresponding processing;
s5, repeating the step S3 until the whole list is finished to obtain point row compression data;
after the data of one point row is taken out in S3, the left side of the point row is an initial bit, the data of each point row is taken out in sequence from the 0 th bit to compare whether the data of the point row is 1 or 0, a variable index is defined for counting, and the index is accumulated from 0;
in S4, when the data bits of the 6 point bits are all 0, adding 1 to the index, continuously taking the next bit of data, and comparing the current bit with the previous bit of data;
if the current bit is not the same as the previous bit, counting down the current index value, performing 0 setting processing on the data, performing bit & operation on the index and 3F, adding 0x40, resetting the index value to 0, continuously taking out the data from the next bit for comparison, and executing S4;
if the previous bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all the 61 bits are 0, the data is processed to be 0, the index and 3F are processed to be & ltbit & gt, 0x40 is added to the index, the index value is 0x7d, the index value is reset to be 0, the data is extracted from the next bit for comparison, and S4 is executed;
in S4, when the data of 6 points are all 1, adding 1 to index, continuously taking the next data, and comparing the current data with the previous data;
if the current bit is different from the previous bit, counting the current index value, performing 1 setting processing on the data, performing & bit operation on the index and 3F, adding 0x80 and resetting the index to be 0, continuously taking out the data from the next bit for comparison, and executing S4;
if the current bit is the same as the previous bit, 1 is added to the index, when the index value reaches 61, all the 61 bits are 1, the data is processed to be 1, the index and 3F are processed to be bit, 0x80 is added, the index value should be 0xbd, the index value is reset to be 0, the data comparison is continuously taken out from the next bit, and S4 is executed;
in S4, when the 6 dot bit data is not all 0 or not all 1, setting the 6 dot bit data as original data, and performing a bit-combining operation with 3F; the index value is reset to 0, data comparison continues to be taken from the next bit, and S4 is performed.
2. The dot line compression method for a thermal printer according to claim 1, wherein when all the dot line data are compared, and the number of bits of the original data is less than 6 when the last byte is filled, the lower bits are zero padded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010104001.6A CN111352595B (en) | 2020-02-20 | 2020-02-20 | Dot line compression method of thermal printer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010104001.6A CN111352595B (en) | 2020-02-20 | 2020-02-20 | Dot line compression method of thermal printer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111352595A CN111352595A (en) | 2020-06-30 |
| CN111352595B true CN111352595B (en) | 2022-11-08 |
Family
ID=71195717
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010104001.6A Active CN111352595B (en) | 2020-02-20 | 2020-02-20 | Dot line compression method of thermal printer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111352595B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113177880B (en) * | 2021-05-21 | 2024-08-20 | 中山市三藏电子科技有限公司 | Bitmap conversion method applied to printer and printer |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH03258567A (en) * | 1990-03-08 | 1991-11-18 | Nec Corp | Method of controlling reduced printing by dot type serial printer |
| CN1452552A (en) * | 2000-05-24 | 2003-10-29 | 西尔弗布鲁克研究有限公司 | Printed page tag encoder |
| JP2003326770A (en) * | 2002-05-09 | 2003-11-19 | Canon Inc | Printing device, printing system, data processing method, program and storage medium |
| CN101923450A (en) * | 2010-04-23 | 2010-12-22 | 中兴通讯股份有限公司 | Printing method and device of heat-sensitive printer |
| CN103507448A (en) * | 2012-06-29 | 2014-01-15 | 山东新北洋信息技术股份有限公司 | Printing control method and printer |
-
2020
- 2020-02-20 CN CN202010104001.6A patent/CN111352595B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH03258567A (en) * | 1990-03-08 | 1991-11-18 | Nec Corp | Method of controlling reduced printing by dot type serial printer |
| CN1452552A (en) * | 2000-05-24 | 2003-10-29 | 西尔弗布鲁克研究有限公司 | Printed page tag encoder |
| JP2003326770A (en) * | 2002-05-09 | 2003-11-19 | Canon Inc | Printing device, printing system, data processing method, program and storage medium |
| CN101923450A (en) * | 2010-04-23 | 2010-12-22 | 中兴通讯股份有限公司 | Printing method and device of heat-sensitive printer |
| CN103507448A (en) * | 2012-06-29 | 2014-01-15 | 山东新北洋信息技术股份有限公司 | Printing control method and printer |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111352595A (en) | 2020-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7454070B2 (en) | Image encoding apparatus and method, computer program, and computer-readable storage medium | |
| US8553301B2 (en) | Image processing apparatus, method, and program product to perform color-reduction processing for a block | |
| US20060045362A1 (en) | Image encoding apparatus and method, computer program, and computer-readable storage medium | |
| CN111726634B (en) | High-resolution video image compression transmission method and system based on FPGA | |
| CN103702133B (en) | A kind of compression of images methods of exhibiting and its device | |
| WO2011072620A1 (en) | Method for storing and processing image sequence and method for compressing, storing and processing image sequence | |
| US8035862B2 (en) | Fast method for fax encoded data conversion | |
| CN111352595B (en) | Dot line compression method of thermal printer | |
| CN105025347B (en) | A kind of method of sending and receiving of GOP images group | |
| CN114339305B (en) | Virtual desktop image processing method and related device | |
| CN103124350A (en) | Image compression method and device based on run-length encoding (RLE) | |
| WO2024098843A1 (en) | Method and system for improving compression quality of jpeg, chip and electronic device | |
| US9392294B2 (en) | Color image data compression | |
| CN116016693A (en) | Compression processing method and system for printing data of portable printer | |
| US8548233B2 (en) | Image processing apparatus and compression method therefor | |
| CN108521535B (en) | A kind of Information hiding transmission method based on image blend processing | |
| CN110619667B (en) | PNG picture compression method and system | |
| US7046387B1 (en) | Efficient coding of color images including monochrome images | |
| CN103780913A (en) | Data compression method based on error hiding | |
| CN110572664A (en) | Novel BMP image compression method and system | |
| JP2007098897A (en) | Printer | |
| JP2003186635A (en) | Image processing apparatus and program | |
| US20110228296A1 (en) | Image processing apparatus, control method, and computer-readable medium | |
| US7257260B2 (en) | Method and a device for processing digital image | |
| CN117319676B (en) | Video compression device, chip, system and method |
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 |