CN108810548A - A kind of compression and decompression method of bianry image - Google Patents
A kind of compression and decompression method of bianry image Download PDFInfo
- Publication number
- CN108810548A CN108810548A CN201710305452.4A CN201710305452A CN108810548A CN 108810548 A CN108810548 A CN 108810548A CN 201710305452 A CN201710305452 A CN 201710305452A CN 108810548 A CN108810548 A CN 108810548A
- Authority
- CN
- China
- Prior art keywords
- bianry image
- logic
- register
- transposition
- uint8x8
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
- H04N19/88—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving rearrangement of data among different coding units, e.g. shuffling, interleaving, scrambling or permutation of pixel data or permutation of transform coefficient data among different blocks
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of compression and decompression method of bianry image, for this method by the way that 8 pixel values of bianry image are loaded into register, register includes 8 byte D0-D7；Then logical operation, Laden Balance and transposition etc. are carried out by 8 byte D0-D7, bianry image is compressed.The compression and decompression method of bianry image disclosed by the invention, the data after compressing act not only as transmission and preservation is used, and also act as the input data of binary Images Processing (corrosion expansion, refinement are smooth etc.)；Both memory headroom can be saved, the faithful representation data of pixel can be also efficiently used, compression ratio can reach 5.333-8.
Description
Technical field
The present invention relates to image encoding and decoding technique field more particularly to a kind of compression and decompression methods of bianry image.
Background technology
Bianry image (Binary Image) is that only there are two probable values (being expressed as " 0 " and " 1 ") for each pixel
Digital picture.People can also be used to indicate that each pixel only has one through commonly using black and white, monochrome image expression bianry image
Any image of a sampled value, such as gray level image, coloration image etc..Common text document and scanned document is exactly typical
Bianry image.
In the implementation of the present invention, the inventor finds that the existing technology has at least the following problems：Many times need
Bianry image is handled, such as smooth, expansion, burn into refinement, edge detection, contour detecting, if directly to two-value
Image pixel value is operated, and has not only been wasted memory but also has not been made full use of register；In addition, transmitting and preserving in bianry image
In, if directly transmission preserves former bianry image, data redundancy, inefficiency can be caused.
Invention content
It is a primary object of the present invention to propose a kind of compression and decompression method of bianry image, it is intended to solve existing skill
Art there are the problem of.
To achieve the above object, first aspect of the embodiment of the present invention provides a kind of compression method of bianry image, the side
Method includes step：
S1,8 pixel values of bianry image are loaded into register, the register includes 8 byte D0-D7；
0 or the 1 of the corresponding position of the register D0-D7 is remained, remaining bit is all set to 0；
The D0 of the register is interleaved storage respectively with D1, D2 and D3, D4 and D5, D6 and D7；
16 transposition are carried out to D0-D3, D4-D7 after Laden Balance；
Logic is carried out to the D0-D3 after 16 transposition or operation obtains D0, and logic is carried out to the D4-D7 after 16 transposition
Or operation obtains D4；
32 transposition are carried out respectively to D0 ' and D4 '；
D0 ' after 32 transposition is obtained into 8 pixels that D0 ", D0 " are bianry image with D4 ' carry out logics or operation
It is worth compressed pixel value；
S2, step S1 is repeated, until all pixels value of bianry image is all loaded into register and is compressed.
Further, the step is remained 0 or the 1 of the corresponding position of the register D0-D7, and remaining bit is complete
Portion set to 0 including：
If the resolution ratio of the bianry image is n*m, and the multiple that m is 64, then by 8 byte D0- of the register
D7 carries out logical AND operation with preset value { 0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01 }；
If the resolution ratio of the bianry image is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u are positive integer),
Then by 8 byte D0-D7 of the register and preset value { 0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01 }
Carry out logical AND operation；And it when setting to 0 and being loaded into register to (k+1) * 64 pixel value by kth * 64+u+1, is posted described
8 byte D0-D7 of storage carry out logical AND operation with preset value 0xfffffc0000000000.
Further, the D0-D3 after 16 transposition of the step pair carries out logic or operation obtains D0, and to 16 transposition
D4-D7 progress logics or operation afterwards obtains D4 and includes：
Logic or operation are carried out to [D0, the D1] and [D2, D3] after 16 transposition, after obtaining logic or operating [D0,
D1]；Logic or operation are carried out to [D4, the D5] and [D6, D7] after 16 transposition, obtain [D4, the D5] after logic or operation；
Logic or operation are carried out to the D0 and D1 after logic or operation, obtain D0；To D4 and the D5 after logic or operation into
Row logic or operation, obtain D4.
Further, the method further includes step：
S3, coded treatment is carried out to compressed bianry image.
Further, the bianry image includes text document, scanned document or fax documents.
In addition, to achieve the above object, second aspect of the embodiment of the present invention provides a kind of decompression method of bianry image,
The method includes the steps：
S10,8 pixel values of bianry image after compression are loaded into the vectorial uint8x8_t with 8 channels；
S11, the value in first channel of the vector uint8x8_t is copied in other 7 channels；
The vector uint8x8_t and preset value mask is subjected to logical AND operation, wherein preset value mask1=0x80,
0x40,0x20,0x10,0x08,0x04,0x02,0x01}；
Calculating logic with operation after vectorial uint8x8_t in each channel 1 number and insert corresponding channel
In；
The vector uint8x8_t is multiplied with preset value 0xff, obtains first channel of the vector uint8x8_t
Decompression after pixel value；
It is S12, similar with step S11, obtain the solution in second channel to the 8th channel of the vector uint8x8_t
Compressed pixel value；
S13, step S10-S12 is repeated, until the pixel of all compressions of bianry image is worth to decompression.
Further, further include step before the step S10：
Processing is decoded to compressed bianry image.
Further, the bianry image includes text document, scanned document or fax documents.
Further, if the resolution ratio of the bianry image is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u
For positive integer), it deletes per the kth * 64+u+1 in a line to (k+1) * 64 pixel value.
The compression and decompression method of bianry image provided in an embodiment of the present invention, the data after compressing can not only be made
To transmit and preservation is used, the input data of binary Images Processing (corrosion expansion, refinement are smooth etc.) is also acted as；It both can be with
Memory headroom is saved, can also efficiently use the faithful representation data of pixel, compression ratio can reach 5.333-8.
Description of the drawings
Fig. 1 is the compression method flow diagram of bianry image provided in an embodiment of the present invention；
Fig. 2 is the decompression method flow diagram of bianry image provided in an embodiment of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific implementation mode
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
The each embodiment of the present invention is realized in description with reference to the drawings.In subsequent description, using for indicating
The suffix of such as " module ", " component " or " unit " of element is only for being conducive to the explanation of the present invention, and there is no special for itself
Fixed meaning.
It will be further appreciated that the term "and/or" used in description of the invention and the appended claims is
Refer to any combinations and all possible combinations of one or more of associated item listed, and includes these combinations.
The description for being related to " first ", " second " etc. in the present invention is used for description purposes only, and should not be understood as instruction or
It implies its relative importance or implicitly indicates the quantity of indicated technical characteristic." first ", " second " are defined as a result,
Feature can explicitly or implicitly include at least one of the features.In addition, the technical solution between each embodiment can phase
It mutually combines, but must can be implemented as basis with those of ordinary skill in the art, when the combination of technical solution occurs mutually
Contradiction or cannot achieve when, will be understood that the combination of this technical solution is not present, also not the present invention claims protection domain it
It is interior.
As shown in Figure 1, a kind of compression method for bianry image that first embodiment of the invention provides, this method includes step
Suddenly：
S1,8 pixel values of bianry image are loaded into register, the register includes 8 byte D0-D7；
The 0 of the corresponding position of register D0-D7 or 1 are remained, remaining bit is all set to 0；
The D0 of register is interleaved storage respectively with D1, D2 and D3, D4 and D5, D6 and D7；
16 transposition are carried out to D0-D3, D4-D7 after Laden Balance；
Logic is carried out to the D0-D3 after 16 transposition or operation obtains D0, and logic is carried out to the D4-D7 after 16 transposition
Or operation obtains D4；
32 transposition are carried out respectively to D0 ' and D4 '；
D0 ' after 32 transposition is obtained into 8 pixels that D0 ", D0 " are bianry image with D4 ' carry out logics or operation
It is worth compressed pixel value.
Specifically, the data that bianry image can be obtained by the mat of opencv, are then converted to the mat of opencv
The data of uint8_t are handled using row as cycling element.
If the resolution ratio of bianry image is n*m, and the multiple that m is 64, the pixel value of 8 uint8_t can be loaded successively
To the register of a 64bit of NEON, be stored in D0-D7 in order, D0-D3 can shown in following table (D4-D7 with it is such
Like)：
Each grid of table above stores the number of a uint8_t, and wherein 0-31 indicates the subscript of data, by
It is 255 or 0 in each pixel value of bianry image, corresponds to binary one 1111111 and 00000000,64 bit registers
D0-D7 respectively with mask [8]={ 0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01 } carry out with operate (&)
The 0 of corresponding position or 1 can be remained, remaining bit is all set to 0.Such as：Continuous 8 pixel values 255,0,255,
255,255,0,0,255 } become with mask phase participants：
| 255 | 0 | 255 | 255 | 255 | 0 | 0 | 255 |
| 11111111 | 00000000 | 11111111 | 11111111 | 11111111 | 00000000 | 00000000 | 11111111 |
The D0 of register and D1, D2 and D3, D4 and D5, D6 and D7 are interleaved storage respectively；D0- after Laden Balance
Shown in the following tables of D3 (D4-D7 is similar)：
16 transposition are carried out to D0-D3, D4-D7 after Laden Balance；Shown in the following tables of D0-D3 after 16 transposition
(D4-D7 is similar)：
Logic or operation are carried out to [D0, the D1] and [D2, D3] after 16 transposition, after obtaining logic or operating [D0,
D1]；Logic or operation are carried out to [D4, the D5] and [D6, D7] after 16 transposition, obtain [D4, the D5] after logic or operation；It patrols
Shown in [D0, D1] following table after collecting or operating ([D4, D5] is similar)：
Logic or operation are carried out to the D0 and D1 after logic or operation, obtain D0；To D4 and the D5 after logic or operation into
Row logic or operation, obtain D4.Shown in the following tables of D0 (D4 is similar)：
32 transposition are carried out respectively to D0 ' and D4 '；
D0 ' after 32 transposition is obtained into 8 pixels that D0 ", D0 " are bianry image with D4 ' carry out logics or operation
It is worth compressed pixel value.Shown in the following tables of D0 "
If the resolution ratio of bianry image is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u are positive integer), and upper
Unlike, by 8 byte D0-D7 of register and preset value 0x80,0x40,0x20,0x10,0x08,0x04,0x02,
0x01 } carry out logical AND operation；It, will and when setting to 0 and being loaded into register to (k+1) * 64 pixel value by kth * 64+u+1
8 byte D0-D7 of register carry out logical AND operation with preset value 0xfffffc0000000000.
S2, step S1 is repeated, until all pixels value of bianry image is all loaded into register and is compressed.
Further, this method further includes step (not shown)：
S3, coded treatment is carried out to compressed bianry image.
In the present embodiment, coded treatment can be huffman coding or Run- Length Coding.Compression ratio after coded treatment will
Higher.
In the present embodiment, bianry image may include text document, scanned document or fax documents.
With reference to Fig. 2, second embodiment of the invention corresponding with compression provides a kind of decompression method of bianry image, the party
Method includes step：
S10,8 pixel values of bianry image after compression are loaded into the vectorial uint8x8_t with 8 channels；
S11, the value in first channel of vectorial uint8x8_t is copied in other 7 channels；
Vectorial uint8x8_t and preset value mask is subjected to logical AND operation, wherein preset value mask1=0x80,
0x40,0x20,0x10,0x08,0x04,0x02,0x01}；
Calculating logic with operation after vectorial uint8x8_t in each channel 1 number and insert corresponding channel
In；
Vectorial uint8x8_t is multiplied with preset value 0xff, obtains the decompression in first channel of vectorial uint8x8_t
Pixel value afterwards.
As exemplary, 8 pixel values of bianry image after compression are loaded into the vectorial uint8x8_ with 8 channels
It can be as follows shown in table in t：
The value in first channel of vectorial uint8x8_t is copied in other 7 channels；Shown in following table：
Vectorial uint8x8_t and preset value mask is subjected to logical AND operation, wherein preset value mask1=0x80,
0x40,0x20,0x10,0x08,0x04,0x02,0x01}；Shown in following table：
Calculating logic with operation after vectorial uint8x8_t in each channel 1 number and insert corresponding channel
In；Shown in following table：
Vectorial uint8x8_t is multiplied with preset value 0xff, obtains the decompression in first channel of vectorial uint8x8_t
Pixel value afterwards, shown in following table：
It is S12, similar with step S11, second channel of vectorial uint8x8_t is obtained to the decompression in the 8th channel
Pixel value afterwards；
S13, step S10-S12 is repeated, until the pixel of all compressions of bianry image is worth to decompression.
In the present embodiment, if the resolution ratio of bianry image is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u
For positive integer), kth * 64+u+1 in every a line can be deleted to (k+1) * 64 pixel value.
Further, it may also include step before step S10：(not shown)：
Processing is decoded to compressed bianry image.
In the present embodiment, bianry image may include text document, scanned document or fax documents.
The compression and decompression method of bianry image provided in an embodiment of the present invention, the data after compressing can not only be made
To transmit and preservation is used, the input data of binary Images Processing (corrosion expansion, refinement are smooth etc.) is also acted as；It both can be with
Memory headroom is saved, can also efficiently use the faithful representation data of pixel, compression ratio can reach 5.333-8.
It should be noted that herein, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that process, method, article or device including a series of elements include not only those elements, and
And further include other elements that are not explicitly listed, or further include for this process, method, article or device institute it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including this
There is also other identical elements in the process of element, method, article or device.
It these are only the preferred embodiment of the present invention, be not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (9)
1. a kind of compression method of bianry image, which is characterized in that the method includes the steps：
S1,8 pixel values of bianry image are loaded into register, the register includes 8 byte D0-D7；
0 or the 1 of the corresponding position of the register D0-D7 is remained, remaining bit is all set to 0；
The D0 of the register is interleaved storage respectively with D1, D2 and D3, D4 and D5, D6 and D7；
16 transposition are carried out to D0-D3, D4-D7 after Laden Balance；
Logic is carried out to the D0-D3 after 16 transposition or operation obtains D0, and logic or behaviour are carried out to the D4-D7 after 16 transposition
Obtain D4；
Carry out 32 transposition respectively to D0 and D4；
D0 ' after 32 transposition is obtained into 8 pixel value pressures that D0 ", D0 " are bianry image with D4 ' carry out logics or operation
Pixel value after contracting；
S2, step S1 is repeated, until all pixels value of bianry image is all loaded into register and is compressed.
2. a kind of compression method of bianry image according to claim 1, which is characterized in that the step is by the deposit
The 0 of the corresponding position of device D0-D7 or 1 remains, remaining bit is all set to 0 including：
If the resolution ratio of the bianry image be n*m, and m be 64 multiple, then by 8 byte D0-D7 of the register with
Preset value { 0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01 } carries out logical AND operation；
If the resolution ratio of the bianry image is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u are positive integer), then will
8 byte D0-D7 of the register are carried out with preset value { 0x80,0x40,0x20,0x10,0x08,0x04,0x02,0x01 }
Logical AND operates；And when setting to 0 and being loaded into register to (k+1) * 64 pixel value by kth * 64+u+1, by the register
8 byte D0-D7 and preset value 0xfffffc0000000000 carry out logical AND operation.
3. a kind of compression method of bianry image according to claim 1, which is characterized in that 16 transposition of the step pair
Rear D0-D3 carries out logic or operation obtains D0, and carries out logic to the D4-D7 after 16 transposition or operation obtains D4 and includes：
Logic or operation are carried out to [D0, the D1] and [D2, D3] after 16 transposition, obtain [D0, the D1] after logic or operation；It is right
[D4, D5] and [D6, D7] after 16 transposition carries out logic or operation, obtains [D4, the D5] after logic or operation；
Logic or operation are carried out to the D0 and D1 after logic or operation, obtain D0；D4 and D5 after logic or operation is patrolled
It collects or operates, obtain D4.
4. according to a kind of compression method of any bianry images of claim 1-3, which is characterized in that the method is also wrapped
Include step：
S3, coded treatment is carried out to compressed bianry image.
5. according to a kind of compression method of any bianry images of claim 1-3, which is characterized in that the bianry image
Including text document, scanned document or fax documents.
6. a kind of decompression method of bianry image, which is characterized in that the method includes the steps：
S10,8 pixel values of bianry image after compression are loaded into the vectorial uint8x8_t with 8 channels；
S11, the value in first channel of the vector uint8x8_t is copied in other 7 channels；
The vector uint8x8_t and preset value mask is subjected to logical AND operation, wherein preset value mask1=0x80,
0x40,0x20,0x10,0x08,0x04,0x02,0x01}；
Calculating logic with operation after vectorial uint8x8_t in each channel 1 number and insert in corresponding channel；
The vector uint8x8_t is multiplied with preset value 0xff, obtains the solution in first channel of the vector uint8x8_t
Compressed pixel value；
It is S12, similar with step S11, obtain the decompression in second channel to the 8th channel of the vector uint8x8_t
Pixel value afterwards；
S13, step S10-S12 is repeated, until the pixel of all compressions of bianry image is worth to decompression.
7. a kind of decompression method of bianry image according to claim 6, which is characterized in that before the step S10
It further include step：
Processing is decoded to compressed bianry image.
8. a kind of decompression method of bianry image according to claim 6, which is characterized in that the bianry image includes
Text document, scanned document or fax documents.
9. a kind of decompression method of bianry image according to claim 6, which is characterized in that if the bianry image
Resolution ratio is n*m, and m is not 64 multiple (i.e. m=k*64+u, k, u are positive integer), the kth * 64+u+1 in deleting per a line
To (k+1) * 64 pixel value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710305452.4A CN108810548A (en) | 2017-05-03 | 2017-05-03 | A kind of compression and decompression method of bianry image |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710305452.4A CN108810548A (en) | 2017-05-03 | 2017-05-03 | A kind of compression and decompression method of bianry image |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108810548A true CN108810548A (en) | 2018-11-13 |
Family
ID=64054252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710305452.4A Pending CN108810548A (en) | 2017-05-03 | 2017-05-03 | A kind of compression and decompression method of bianry image |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108810548A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS61238126A (en) * | 1985-04-15 | 1986-10-23 | Mitsubishi Electric Corp | Coding and decoding system for binary-coded data |
| CN1070500A (en) * | 1992-09-24 | 1993-03-31 | 清华大学 | Two-valued image processing technique |
| JPH05274435A (en) * | 1992-03-27 | 1993-10-22 | Fujitsu Denso Ltd | Image processor |
| CN103576679A (en) * | 2012-07-24 | 2014-02-12 | 赛音 | Visual signal high-speed acquisition system based on hardware binaryzation |
| CN103795894A (en) * | 2014-01-27 | 2014-05-14 | 西安电子科技大学 | Binary image lossless compression and decompression IP core based on FPGA and application |
| US8977663B2 (en) * | 2012-03-13 | 2015-03-10 | Oracle International Corporation | Converting binary values into binary-coded-centimal values |
| CN204270324U (en) * | 2014-12-22 | 2015-04-15 | 程世华 | Graphics hardware binarization circuit |
| CN105046261A (en) * | 2015-07-30 | 2015-11-11 | 万辽辽 | Hardware binarization image processing circuit structure and image processing module using circuit structure |
| CN106056119A (en) * | 2016-05-24 | 2016-10-26 | 深圳市至高通信技术发展有限公司 | Fingerprint photograph compression transmission method and system |
| US20160378498A1 (en) * | 2015-06-27 | 2016-12-29 | Paul Caprioli | Systems, Methods, and Apparatuses for Last Branch Record Support |
-
2017
- 2017-05-03 CN CN201710305452.4A patent/CN108810548A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS61238126A (en) * | 1985-04-15 | 1986-10-23 | Mitsubishi Electric Corp | Coding and decoding system for binary-coded data |
| JPH05274435A (en) * | 1992-03-27 | 1993-10-22 | Fujitsu Denso Ltd | Image processor |
| CN1070500A (en) * | 1992-09-24 | 1993-03-31 | 清华大学 | Two-valued image processing technique |
| US8977663B2 (en) * | 2012-03-13 | 2015-03-10 | Oracle International Corporation | Converting binary values into binary-coded-centimal values |
| CN103576679A (en) * | 2012-07-24 | 2014-02-12 | 赛音 | Visual signal high-speed acquisition system based on hardware binaryzation |
| CN103795894A (en) * | 2014-01-27 | 2014-05-14 | 西安电子科技大学 | Binary image lossless compression and decompression IP core based on FPGA and application |
| CN204270324U (en) * | 2014-12-22 | 2015-04-15 | 程世华 | Graphics hardware binarization circuit |
| US20160378498A1 (en) * | 2015-06-27 | 2016-12-29 | Paul Caprioli | Systems, Methods, and Apparatuses for Last Branch Record Support |
| CN105046261A (en) * | 2015-07-30 | 2015-11-11 | 万辽辽 | Hardware binarization image processing circuit structure and image processing module using circuit structure |
| CN106056119A (en) * | 2016-05-24 | 2016-10-26 | 深圳市至高通信技术发展有限公司 | Fingerprint photograph compression transmission method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1285399B1 (en) | Enhanced compression of gray-level images | |
| CN100476858C (en) | Method, device and system for achieving coding ganis in wavelet-based image coding-decoding device | |
| Alarabeyyat et al. | Lossless image compression technique using combination methods | |
| CN101039374B (en) | Image lossless compression method | |
| CN103702133B (en) | A kind of compression of images methods of exhibiting and its device | |
| CN108009975A (en) | Jpeg image reversible information hidden method based on two-dimensional histogram modification | |
| CN102164366A (en) | Message-hidden mobile phone information safety communication method based on JPEG (joint photographic experts group) image | |
| CN102271251B (en) | Lossless image compression method | |
| CN108521535B (en) | A kind of Information hiding transmission method based on image blend processing | |
| CN105488822B (en) | Reversible image hidden algorithm based on AMBTC algorithm | |
| CN107018414A (en) | A kind of method of hiding high quality graphic lossless in low-quality image compressed data | |
| US8457427B2 (en) | Digital information extraction | |
| CN108810548A (en) | A kind of compression and decompression method of bianry image | |
| CN108182712A (en) | Image processing method, apparatus and system | |
| CN111445378A (en) | Neural network-based image blind watermark embedding and detecting method and system | |
| CN102118616A (en) | Picture decoding method and picture decoder | |
| Fathahillah et al. | Homogeneous Image Compression Techniques with the Shannon-Fano Algorithm | |
| CN110009703B (en) | Image encryption and decryption method and device based on chaotic system | |
| De Luca et al. | A study for Image compression using Re-Pair algorithm | |
| Tanaka et al. | Embedding the attribute information into a dithered image | |
| CN113065406B (en) | Account-reporting intelligent platform for identifying invoice text based on coding and decoding structure | |
| CN113158776B (en) | Invoice text recognition method and device based on coding and decoding structure | |
| Shankar | Image compression techniques | |
| Wang et al. | Senary Huffman Compression–A Reversible Data Hiding Scheme for Binary Images | |
| Moufid et al. | Improving Steganography using Image Compression JPEG |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181113 |
|
| RJ01 | Rejection of invention patent application after publication |