CN110392260A - A kind of joint image compression transmitting method of low cost - Google Patents
A kind of joint image compression transmitting method of low cost Download PDFInfo
- Publication number
- CN110392260A CN110392260A CN201910630136.3A CN201910630136A CN110392260A CN 110392260 A CN110392260 A CN 110392260A CN 201910630136 A CN201910630136 A CN 201910630136A CN 110392260 A CN110392260 A CN 110392260A
- Authority
- CN
- China
- Prior art keywords
- block
- image
- compression
- gray value
- minimum
- 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.)
- Granted
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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- 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/46—Embedding additional information in the video signal during the compression process
- H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention proposes a kind of joint image compression transmitting method of low cost, by pre-processing to original image, then is compressed to pretreated image, information insertion, and combine area-of-interest image and further compressed.By piecemeal being truncated the Combined Treatment of compressed data, compression ratio is improved；It is embedded in by region of interest data, ensure that the picture quality of key area.The present invention can reach 16 times of compression ratio by pretreatment and Compression and Hiding method, and image PSNR > 30dB.The present invention also can reach 16 times or more of compression ratio, even up to 200 times still keep certain picture quality by pre-processing and combining compression method.This method complexity keeps preferable compression quality well below standard data compression method, and the application for low cost, big Compressed Image Transmission provides technical support.
Description
Technical field
The present invention relates to a kind of method of data transmission, in particular to a kind of joint image compression transmission sides of low cost
Method belongs to communication (such as data communication technology) field.
Background technique
Image procossing and data transmission are the important subjects of the current communications field.With the development of science and technology, people couple
The demand of high-definition picture is increasing, and data compression is imperative.
Data compression is divided into lossy compression and lossless compression method, and compression method compression ratio is bigger, but after compression
Restore image and original image there are certain information losses to correspond in practice but as long as subjective evaluation index meets the requirements
With no much influences.Restore image after lossless compression method compression and information loss is not present in original image, but compression ratio is special
Small, general 2 times or so, use occasion is limited, is not easy to carry out data transmission.The compression that general high speed data transmission system uses
Method is mostly to have damage method, and for image, general Y-PSNR (PSNR) should reach 30dB or more, and 35dB or more is imitated
Fruit is just more satisfactory.
There are many current image data compression methods, representative to have JPEG and JPEG2000.Compression method is complicated, then
It is difficult to hardware realization, JPEG2000 compression algorithm is all based on greatly external compression chip and realizes at present, and development cost is high, is limited by
People；Or the satellite task having does not need monitoring outside so high picture quality, such as satellite capsule, earth observation generaI investigation, little Wei
Star, micro-nano satellite image transmitting, technological experiment satellite image transmitting, space station internal control, ground monitoring system etc., must not
To use foreign countries' JPEG class compression chip.
BTC block truncation coding (BTC) compression method is exactly a kind of inexpensive compression method of classics, and typical compression ratio is 4
Times, Y-PSNR PSNR is 30dB or more, some inexpensive satellite application occasions are very suitably, if compression can be improved
More even higher or when compression ratio is constant improves compression performance than to 16 times, then the micro-nano satellite etc. that is more suitable requires software and hardware real
Occasion now simple, compression ratio is high, performance is met the requirements.
Summary of the invention
Technical problem solved by the present invention is overcome the deficiencies in the prior art, proposes a kind of image joint of low complex degree
Compression method hides compression by image precommpression and subsequent further compression, area-of-interest, improves the pressure of block encoding
Contracting ratio.The low complex degree that the present invention is encoded in splits' positions passes through image preprocessing and the further compressed encoding of splits' positions
Method improves compression ratio.
The technical scheme is that a kind of joint image compression transmitting method of low cost, steps are as follows:
(1) original image A0 size is set as M*N, and 8 bit quantizations are first smoothed original image A0, are put down
Sliding treated image A1；
(2) image A1 is subjected to the scaling processing that compression ratio is R0, forms subgraph A2；Subgraph A2, which is divided into size, is
The non-overlapping block of K1*K2, every piece obtains X1, X2 ... Xk gray value, k=K1*K2；
(3) AMBTC compression is carried out to subgraph A2, to three groups of number L of non-overlapping block each after compression, H, B continue
Compression, obtains compressed data, then decompress to obtain the recovery image A3 of subgraph A2, and amplifies to image A3 is restored
Processing；Wherein L is the average gray for being less than the block average gray value in every piece, and H is to be more than or equal to the average ash of the block in every piece
The average gray of angle value, B are 0 or 1, total K1*K2 bit value, and 0 corresponding gray scale is less than the block average gray value, and 1 is corresponding
The gray scale is more than or equal to the block average gray value.
(4) the original image A4 being restored.
The method that the step (3) continues variable compression ratio transmission to compressed three groups of numbers L, H, B is as follows:
31) B of three groups of numbers of each piecemeal is decomposed, becomes C1, C2, wherein C1 is the 1,3,5,7,9,11 of B,
13,15 ... total q bits, C2 are the 2,4,6,8,10,12,14,16 of B ... the total q bit of, q=K1*K2/2；
32) compare L and H, C1 and C2, d1, d2 are threshold value
As H-L≤d1, if same bits number≤d2, minimum 2 position L are not 00, L reservation by C1 and C2；H is not transmitted；
As H-L≤d1, if same bits number > d2, minimum 2 position L are not 01 by C1 and C2,
L retains；H is not transmitted；
As H-L > d1, if same bits number≤d2, minimum 2 position L are not 10 by C1 and C2,
L retains, and H retains, and C1 retains；C2 is not transmitted；
As H-L > d1, if same bits number > d2, minimum 2 position L are not 11 by C1 and C2；
L retains, and H retains, and C1 retains, and C2 retains；
The data retained after compression are transmitted；
33) numerical value of the reservation obtained to step 32), which unzips it, restores image A3
If the data that every piece of non-overlapping block receives be X, Y, Z1, Z2, then
When being 00 for X minimum 2 or when 01,
The gray value for restoring the non-overlapping block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
L, H, B are obtained, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block pair
The gray value answered is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block pair
The gray value answered is H；
According to the recovery gray value of each non-overlapping block, restore image A3, and is amplified to A1 size.
The method that compression ratio transmission is fixed to compressed three groups of numbers L, H, B in the step (3) is as follows:
31) three groups of number L of each piecemeal, H, B are decomposed, becomes L, H, C1, C2, wherein C1 is the 1,3,5,7 of B,
9,11,13,15 ... total q bits, C2 are the 2,4,6,8,10,12,14,16 of B ... the total q bit of, q=K1*K2/2；
The region of interest area image F1 of original image is passed through data processing, the location information and processing data of F1 are merged into
The byte stream of data S, S are S1, S2, S3 ... ..., Sn；
32) it hides compressed data byte stream: comparing L and H, C1 and C2, d1, d2 are threshold value
First compare the L and H, C1 and C2 of first piecemeal, d1, d2 are threshold value；
As H-L≤d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 00, L reservation；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L≤d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 01,
L retains；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L > d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 10,
L retains, and H is constant, and C1 is constant, replaces C2 with S1；
As H-L > d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 11,
L retains, and H is constant, and C1 is constant, and C2 is constant；
Successively compare the L and H, C1 and C2 of following blocks again, d1, d2 are threshold value；It successively hides after the same method
The byte stream that do not hidden in data S.
The data retained after compression are transmitted；
33) numerical value of reservation is unziped it and restores image A3
If the data that every piece of K1*K2 is received be X, Y, Z1, Z2, then
When minimum 2 position X is 00, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2,
The gray value for restoring the block is all X；
When minimum 2 position X is 01, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2
The gray value for restoring the block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
Restore byte stream S1=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
Some bit is 0 in certain block B, then the corresponding gray value of the block is L, some bit is 1 in certain block B, then the block pair
The gray value answered is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
Without recovery byte stream；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
Some bit is 0 in certain block B, then the corresponding gray value of the block is L, some bit is 1 in certain block B, then the block pair
The gray value answered is H；
According to every piece of recovery value, restore image A3, and is amplified to A1 size；
Restore region of interest area image F1 further according to byte stream S, the corresponding region image of amplified image is replaced with F1.
The beneficial effect of the present invention compared with prior art is:
(1) present invention initial carrier image is smoothly pre-processed first, every piece of information content is relatively uniform, be convenient for pair
Image carries out subsequent hiding processing.
(2) new method further compressed to AMBTC splits' positions data is proposed, to 4 kinds of ingenious codings of different conditions,
It is arranged by the joint of thresholding d1 and d2, reduces data volume, improve compression ratio.Meanwhile information extraction ensure that by coding
Uniqueness, provide foundation for compression method quality of the invention.
After compressing by AMBTC, obtain three class values (L, H, B), when L and H relatively when, L and H can only pass 1
Value；Two values C1, C2 that 16 bit B are formed after compression parameters can also compare, and when C1 and C2 data are close, C1 and C2 only pass 1
A value.
(3) it proposes and realizes the hiding new method of area-of-interest in AMBTC compression domain, it is ingenious for 4 kinds of different conditions
Information hiding insertion is carried out, does not increase data volume, ensure that the uniqueness of information extraction, it is interested for compression method of the invention
Area image increased quality provides foundation.
After compressing by AMBTC, obtain three class values (L, H, B), when L and H relatively when, L and H can only pass 1
Value；Two values C1, C2 that 16 bit B are formed after compression parameters are compared, and as C1 and C2 close, C1 and C2 can be passed only
1 value.
As long as L and H relatively when, L and H can only pass 1 value, and C1 and C2 can not be passed；
When in order to only pass a value such as L, receiving end is uniquely decoded, and the present invention is provided with 4 kinds of different conditions, and most based on L
Latter two low order is encoded, and ensure that the unique of information extraction.
Each image block after 4 times of tile compression of 4*4 is had 2 average values (each 8 bit) and 16 ratios by former BTC method
Special binary number, totally 32 bit.16 bits are by processing two 8 bit values of formation after by the present invention, and 16 bits rear in this way are with before
16 bit data Combined Treatments, can further compress.
As 126,128,95,180,126 binary system be " 11111110 ", minimum 2 10 become 00, then at
For " 11111100 ", become the decimal system 124.
" 126 and 128 relatively in 126,128,95,180 ", can be indicated with a number 124,128,95 and 180 3
Number is without transmission, and in the case where variable compression ratio of the present invention, four several transmission, one number, compression ratio is greatly improved.
In the case where the present invention fixed compression ratio, four numbers still transmit four numbers, but first number is 124, behind
Three numbers can become 124, S1, S2, S3 such as the byte stream of data S with the number for any three bytes, secure compression ratio, mention
High hiding amount.
(4) present invention takes full advantage of the distinctive property of AMBTC splits' positions parameter, obtains compression image, and sense
Interest area image is hidden, and improves recovery picture quality by correction.
(5) this method is simpler in order to realize, it is convenient to omit, can also be with using original image as A1 the step of smoothing processing
Using original image as subgraph A2, the real-time of compression is increased.
(6) any Information hiding in the case of fixed compression ratio may be implemented in the present invention.As long as any information is become word
Throttle S, and the hidden method of byte stream S is copied to be hidden.
Detailed description of the invention
Fig. 1 is the method for the present invention flow chart.Fig. 1 (a) is the transmission plan of variable compression ratio of the invention, and Fig. 1 (b) is this
The transmission plan of the fixation compression ratio of invention.
Specific embodiment
By taking typical piecemeal (4*4 piecemeal) as an example, conventional AMBTC compression ratio is 4 times, and compression PSNR=30dB or so can not
Reach 4 times or more, it is even more impossible to reach 8 times or more.
The present invention first original image smoothing processing, scaling certain multiple, 2-4 times, then to after scaling image progress routinely
AMBTC compressed encoding, such as 4 times of compressed encodings, obtain 8-16 times of compression ratio.It is wanted although zoomed image PSNR itself can meet
It asks, but original image quality is deteriorated.Under normal circumstances, picture quality is poor, may if PSNR is lower than 30dB or 25dB or so
It is unable to satisfy user's requirement.
But it is proposed in the present invention in AMBTC image compression data, hides the compressed data of region of interest area image, In
Regions of interest data is extracted to the corrected joint compression method of original image in receiving end, passes through the ingenious volume of compression parameters
Code, ensure that the Quality of recovery of whole image, also improves the quality of area-of-interest.
The present invention provides a kind of joint compression method being simple and efficient in the case where keeping certain PSNR performance, Gu
Determine general up to 4-32 in the case of compression ratio；In the case of compression ratio is up to 8-64 or even 64-200 times in the case of variable compression ratio
PSNR is up to 25dB or so (Lena.bmp).
Steps are as follows for a kind of joint image compression transmitting method of low cost of the present invention:
(1) original image is set as A0, and size M*N, 8 bit quantizations are first smoothed image, after obtaining smoothly
Image be set as A1；Original image A0 is lena.bmp, M*N=512*512.
(2) image A1 is scaled, forms a subgraph A2, compression ratio R0, being divided into size is not being overlapped for K1*K2
Block；Every piece obtains X1, X2 ... Xk gray value, K=K1*K2；
R0=4, K1*K2=4*4=16
(3) to subgraph A2, when R0=4, A2 size is 256*256, AMBTC compression is carried out, to compressed three groups of numbers
L, H, B continue compression transmission, obtain compressed data, compression ratio R2=4, then decompress to obtain the recovery image A3 of A2,
A3 size is 256*256, and amplifies R0 times to A3.
(4) original image A4, the A4 size being restored is 512*512
The method that step (3) continues variable compression ratio transmission to compressed three groups of numbers L, H, B is as follows:
1) three groups of number L of each piecemeal, H, B are decomposed, becomes L, H, C1, C2, wherein C1 is 1~q bit of B,
C2 is 1~q bit of B, q=B/2；
B=K1*K2=16, C1=8, C2=8, q=8, C1 take 1,3,5,7,9,11,13,15, C2 in 16 bits of B
It takes 2,4,6,8,10,12,14,16 in B
(following the example of in addition: C2 takes 1 in 16 bits of B, and 3,5,7,9,11,13,15, C1 take 2 in B, and 4,6,8,10,12,
14,16)
2) compare L and H, C1 and C2 and encode, (d1, d2 are threshold value)
General setting d1=0~64, d2 are 0~4
Representative value is d1=4, d2=1
As H-L≤d1, if same bits number≤d2, minimum 2 position L are not 00, L reservation by C1 and C2；H is not transmitted；
As H-L≤d1, if same bits number > d2, minimum 2 position L are not 01 by C1 and C2,
L retains；H is not transmitted；
As H-L > d1, if same bits number≤d2, minimum 2 position L are not 10 by C1 and C2,
L retains, and H retains, and C1 retains；C2 is not transmitted；
As H-L > d1, if same bits number > d2, minimum 2 position L are not 11 by C1 and C2；
L retains, and H retains, and C1 retains, and C2 retains；
The data retained after compression are transmitted；
3) numerical value of the reservation obtained to step 2), which unzips it, restores image A3
If the data that every piece of non-overlapping block receives be X, Y, Z1, Z2, then
When being 00 for X minimum 2 or when 01,
The gray value for restoring the non-overlapping block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
L, H, B are obtained, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block pair
The gray value answered is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block pair
The gray value answered is H；
According to the recovery gray value of each non-overlapping block, restore image A3, and is amplified to A1 size.
The method that compression ratio transmission is fixed to compressed three groups of numbers L, H, B in step (3) is as follows:
1) three groups of number L of each piecemeal, H, B are decomposed, becomes L, H, C1, C2, wherein C1 is 1~q bit of B,
C2 is 1~q bit of B, q=B/2；
B=K1*K2=16, C1=8, C2=8, q=8, C1 take 1,3,5,7,9,11,13,15, C2 in 16 bits of B
It takes 2,4,6,8,10,12,14,16 in B
(following the example of in addition: C2 takes 1 in 16 bits of B, and 3,5,7,9,11,13,15, C1 take 2 in B, and 4,6,8,10,12,
14,16)
The region of interest area image F1 of original image, size is rectangular area, by AMBTC compression processing, is handled
The byte stream of data S afterwards, data S are S1, S2, S3, S4 ..., Sn
2) compressed data byte stream is hiding:
Compare L and H, C1 and C2 and encodes, (d1, d2 are threshold value)
General setting d1=0~64, d2 are 0~4,
Representative value is d1=4, d2=1
First compare the L and H, C1 and C2 of first piecemeal, d1, d2 are threshold value；
As H-L≤d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 00, L reservation；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L≤d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 01,
L retains；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L > d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 10,
L retains, and H is constant, and C1 is constant, replaces C2 with S1；
As H-L > d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 11,
L retains, and H is constant, and C1 is constant, and C2 is constant；
Successively compare the L and H, C1 and C2 of following blocks again, d1, d2 are threshold value；It successively hides after the same method
The byte stream that do not hidden in data S.
The data retained after compression are transmitted；
3) numerical value of reservation is unziped it and restores image A3
If the data that every piece of K1*K2 is received be X, Y, Z1, Z2, then
When minimum 2 position X is 00, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2,
The gray value for restoring the block is all X；
When minimum 2 position X is 01, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2
The gray value for restoring the block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
Restore byte stream S1=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
Some bit is 0 in certain block B, then the corresponding gray value of the block is L, some bit is 1 in certain block B, then the block pair
The gray value answered is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
Without recovery byte stream；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
Some bit is 0 in certain block B, then the corresponding gray value of the block is L, some bit is 1 in certain block B, then the block pair
The gray value answered is H；
According to every piece of recovery value, restore image A3, and is amplified to A1 size.
Restore region of interest area image F1 further according to byte stream S, the corresponding region image of amplified image is replaced with F1.
A kind of joint image compression transmitting method compression method analysis of low cost of the present invention:
Variable compression ratio situation:
R0=1 (without pretreatment)
K1*K2=4*4
R1=4
R>4
R0=2 (is pre-processed)
K1*K2=4*4
R1>4
R>8
R0=4 (is pre-processed)
K1*K2=4*4
R1>4
R>16
R0=8 (is pre-processed)
K1*K2=4*4
R1>4
R>32
R0=16 (is pre-processed)
K1*K2=4*4
R1>4
R>64
R0=32 (is pre-processed)
K1*K2=4*4
R1>4
R>128
Fixed compression ratio situation:
R0=1 (without pretreatment)
K1*K2=4*4
R1=4
R=4
R0=2 (is pre-processed)
K1*K2=4*4
R1=4
R=8
R0=4 (is pre-processed)
K1*K2=4*4
R1=4
R=16
R0=8 (is pre-processed)
K1*K2=4*4
R1=4
R=32
R0=16 (is pre-processed)
K1*K2=4*4
R1=4
R=64
R0=32 (is pre-processed)
K1*K2=4*4
R1>4
R=128
In order to verify the performance of algorithm proposed in this paper, experiment uses size as 512 × 512 8 bit grayscale images
It is emulated.The change degree of image is indicated with Y-PSNR (PSNR).
By taking lena.bmp as an example, K1*K2=4*4.
Using AMBTC conventional compression method to 4 times of compression of images, PSNR is calculated.
Image A1 and recovery A4: compression restores PSNR=33dB；
4 times of compression is carried out to image using compression method of the present invention, calculates PSNR, then compresses and restores PSNR up to 36dB,
Better than 33dB.
8 times of compression is carried out to image using compression method of the present invention, calculates PSNR, then image A3 and recovery A4 compression restore
PSNR≈32dB；
16 times of compression is carried out to image using compression method of the present invention, calculates PSNR, then image A3 and image A3 and recovery
Image A4: compression restores PSNR ≈ 31dB.
The present invention provides a kind of Image Data Compression new methods of low cost, breach original splits' positions method compression
Than low defect, reaching 4-16 times of compression, there is the compression ratio between preferable picture quality or even 16 times to 200 times to keep one
Fixed picture quality has the characteristics that implementation complexity is low, practical, and implementation complexity is well below JPEG class compression side
Method, thus more with practical value in inexpensive image delivering system.
Unspecified part of the present invention belongs to common sense well known to those skilled in the art.
Claims (10)
1. a kind of joint image compression transmitting method of low cost, it is characterised in that steps are as follows:
(1) original image A0 size is set as M*N, and 8 bit quantizations are first smoothed original image A0, are smoothly located
Image A1 after reason；
(2) image A1 is subjected to the scaling processing that compression ratio is R0, forms subgraph A2；It is K1* that subgraph A2, which is divided into size,
The non-overlapping block of K2, every piece obtains X1, X2 ... Xk gray value, k=K1*K2；
(3) AMBTC compression is carried out to subgraph A2, to three groups of number L of non-overlapping block each after compression, H, B continue to compress,
Compressed data are obtained, then decompress to obtain the recovery image A3 of subgraph A2, and amplify processing to image A3 is restored；
Wherein L is the average gray for being less than the block average gray value in every piece, and H is to be more than or equal to the block average gray value in every piece
Average gray, B are 0 or 1, total K1*K2 bit value, and 0 corresponding gray scale is less than the block average gray value, 1 corresponding gray scale
More than or equal to the block average gray value；
(4) the original image A4 being restored.
2. a kind of joint image compression transmitting method of low cost according to claim 1, it is characterised in that: the step
(3) to compressed three groups of numbers L, H, B continue variable compression ratio transmission method it is as follows:
131) B of three groups of numbers of each piecemeal is decomposed, becomes C1, C2；
132) d1, d2 are set as threshold value, according to the value of L, H and C1, C2, is carried out data transmission；
133) numerical value of the reservation obtained to step 132) unzips it, and restores image A3.
3. a kind of joint image compression transmitting method of low cost according to claim 2, it is characterised in that: the step
131) in, C1 is the total q bit in the 1,3,5,7,9,11,13,15 of B ..., and C2 is the 2,4,6,8,10,12,14,16 of B ... the total q ratio of
Spy, q=K1*K2/2.
4. a kind of joint image compression transmitting method of low cost according to claim 3, it is characterised in that: the step
132) detailed process are as follows:
As H-L≤d1, if same bits number≤d2, minimum 2 position L are not 00, L reservation by C1 and C2；H is not transmitted；
As H-L≤d1, if same bits number > d2, minimum 2 position L are not 01, L reservation by C1 and C2；H is not transmitted；
As H-L > d1, if same bits number≤d2, minimum 2 position L are not 10, L reservation by C1 and C2, H retains, and C1 retains；
C2 is not transmitted；
As H-L > d1, if same bits number > d2, minimum 2 position L are not 11 by C1 and C2；L retains, and H retains, and C1 retains, C2
Retain；
The data retained after compression are transmitted.
5. a kind of joint image compression transmitting method of low cost according to claim 4, it is characterised in that: the step
133) detailed process are as follows:
If the data that every piece of non-overlapping block receives be X, Y, Z1, Z2, then
When being 00 for X minimum 2 or when 01,
The gray value for restoring the non-overlapping block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
L, H, B are obtained, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block is corresponding
Gray value is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
If some bit is 0 in block B, the corresponding gray value of the block is L, if some bit is 1 in block B, the block is corresponding
Gray value is H；
According to the recovery gray value of each non-overlapping block, restore image A3, and is amplified to A1 size.
6. a kind of joint image compression transmitting method of low cost according to claim 1, it is characterised in that: the step
(3) to compressed three groups of numbers L, H, B be fixed compression ratio transmission method it is as follows:
231) three groups of number L of each piecemeal, H, B are decomposed, becomes L, H, C1, C2；The area-of-interest figure of original image
As F1 passes through data processing, the location information of F1 and processing data are merged into data S, the byte stream of S is S1, S2,
S3 ... ..., Sn；
232) it hides compressed data byte stream: setting d1, d2 as threshold value, according to the value of L, H and C1, C2, hide compressed data
Byte stream simultaneously transmits data；
233) numerical value of reservation is unziped it, restores image A3.
7. a kind of joint image compression transmitting method of low cost according to claim 1, it is characterised in that: the step
231) in, C1 is the total q bit in the 1,3,5,7,9,11,13,15 of B ..., and C2 is the 2,4,6,8,10,12,14,16 of B ... the total q ratio of
Spy, q=K1*K2/2.
8. a kind of joint image compression transmitting method of low cost according to claim 7, it is characterised in that: the step
232) method particularly includes:
First compare the L and H, C1 and C2 of first piecemeal, d1, d2 are threshold value；
As H-L≤d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 00, L reservation；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L≤d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 01,
L retains；H is replaced with S1, replaces C1 with S2, replaces C2 with S3；
As H-L > d1, if C1 and C2 not same bits number≤d2,
Minimum 2 position L is 10,
L retains, and H is constant, and C1 is constant, replaces C2 with S1；
As H-L > d1, if C1 and C2 not same bits number > d2,
Minimum 2 position L is 11,
L retains, and H is constant, and C1 is constant, and C2 is constant；
Successively compare the L and H, C1 and C2 of following blocks again, d1, d2 are threshold value；Successively hiding data S after the same method
In the byte stream do not hidden；
The data retained after compression are transmitted.
9. a kind of joint image compression transmitting method of low cost according to claim 8, it is characterised in that: the step
233) method particularly includes:
If the data that every piece of K1*K2 is received be X, Y, Z1, Z2, then
When minimum 2 position X is 00, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2,
The gray value for restoring the block is all X；
When minimum 2 position X is 01, L=X, H=X, A3=X；
Restore byte stream S1=Y, S2=Z1, S3=Z2
The gray value for restoring the block is all X；
When minimum 2 position X is 10, L=X, H=Y, C1=Z1, C2=Z1；
Restore byte stream S1=Z2；
B is obtained according to C1, C2, according to L, H, B, restores the gray value of the non-overlapping block by decoding:
According to every piece of recovery value, restore image A3, and is amplified to A1 size；
Restore region of interest area image F1 further according to byte stream S, the corresponding region image of amplified image is replaced with F1.
10. a kind of joint image compression transmitting method of low cost according to claim 9, it is characterised in that: the step
It is rapid 233) in, restore the gray value of the non-overlapping block by decoding method particularly includes:
Some bit is 0 in certain block B, then the corresponding gray value of the block is L, some bit is 1 in certain block B, then the block is corresponding
Gray value is H；
When minimum 2 position L is 11, L=X, H=Y, C1=Z1, C2=Z2；
Without recovery byte stream.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910630136.3A CN110392260B (en) | 2019-07-12 | 2019-07-12 | Low-cost joint image compression transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910630136.3A CN110392260B (en) | 2019-07-12 | 2019-07-12 | Low-cost joint image compression transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110392260A true CN110392260A (en) | 2019-10-29 |
| CN110392260B CN110392260B (en) | 2021-04-13 |
Family
ID=68286569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910630136.3A Active CN110392260B (en) | 2019-07-12 | 2019-07-12 | Low-cost joint image compression transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110392260B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115396670A (en) * | 2022-07-28 | 2022-11-25 | 西安空间无线电技术研究所 | Image data compression method for local area processing |
| US11513732B2 (en) | 2020-08-13 | 2022-11-29 | Raytheon Company | Fast data compression for systems with large dynamic ranges or other systems |
| CN116033033A (en) * | 2022-12-31 | 2023-04-28 | 西安电子科技大学 | Spatial histology data compression and transmission method combining microscopic image and RNA |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6567559B1 (en) * | 1998-09-16 | 2003-05-20 | Texas Instruments Incorporated | Hybrid image compression with compression ratio control |
| CN101656889A (en) * | 2009-06-22 | 2010-02-24 | 南京大学 | High definition video real time compressing as well as coding and decoding method |
| CN102523452A (en) * | 2011-12-29 | 2012-06-27 | 西安空间无线电技术研究所 | Method for conversion, compression and transmission of images |
| CN105812816A (en) * | 2016-03-17 | 2016-07-27 | 安徽大学 | Compression, encryption and authentication joint coding method |
| CN107018414A (en) * | 2017-04-28 | 2017-08-04 | 西安空间无线电技术研究所 | A kind of method of hiding high quality graphic lossless in low-quality image compressed data |
| CN108848385A (en) * | 2018-06-20 | 2018-11-20 | 西安空间无线电技术研究所 | A kind of block data compression method suitable for micro-nano satellite |
-
2019
- 2019-07-12 CN CN201910630136.3A patent/CN110392260B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6567559B1 (en) * | 1998-09-16 | 2003-05-20 | Texas Instruments Incorporated | Hybrid image compression with compression ratio control |
| CN101656889A (en) * | 2009-06-22 | 2010-02-24 | 南京大学 | High definition video real time compressing as well as coding and decoding method |
| CN102523452A (en) * | 2011-12-29 | 2012-06-27 | 西安空间无线电技术研究所 | Method for conversion, compression and transmission of images |
| CN105812816A (en) * | 2016-03-17 | 2016-07-27 | 安徽大学 | Compression, encryption and authentication joint coding method |
| CN107018414A (en) * | 2017-04-28 | 2017-08-04 | 西安空间无线电技术研究所 | A kind of method of hiding high quality graphic lossless in low-quality image compressed data |
| CN108848385A (en) * | 2018-06-20 | 2018-11-20 | 西安空间无线电技术研究所 | A kind of block data compression method suitable for micro-nano satellite |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11513732B2 (en) | 2020-08-13 | 2022-11-29 | Raytheon Company | Fast data compression for systems with large dynamic ranges or other systems |
| CN115396670A (en) * | 2022-07-28 | 2022-11-25 | 西安空间无线电技术研究所 | Image data compression method for local area processing |
| CN115396670B (en) * | 2022-07-28 | 2024-05-03 | 西安空间无线电技术研究所 | Image data compression method for local processing |
| CN116033033A (en) * | 2022-12-31 | 2023-04-28 | 西安电子科技大学 | Spatial histology data compression and transmission method combining microscopic image and RNA |
| CN116033033B (en) * | 2022-12-31 | 2024-05-17 | 西安电子科技大学 | Spatial histology data compression and transmission method combining microscopic image and RNA |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110392260B (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110392260A (en) | A kind of joint image compression transmitting method of low cost | |
| CN103414892B (en) | The Image Hiding that a kind of Large Copacity is incompressible | |
| CN1266843C (en) | Coding method and system and decoding method and system | |
| CN101420614B (en) | Image compression method and device integrating hybrid coding and wordbook coding | |
| Yang et al. | Fractal curves to improve the reversible data embedding for VQ-indexes based on locally adaptive coding | |
| CN101304522A (en) | Considerable information hide method using JPEG2000 compression image as carrier | |
| CN102938841B (en) | Method for hiding information in bearing image, image quality evaluation method and information transmission method | |
| CN104065976B (en) | A kind of compression of images and security transmission method based on video | |
| CN110445949A (en) | The domain AMBTC reversible information hidden method based on histogram displacement | |
| CN111787335A (en) | Reversible information hiding method based on AMBTC compression technology and Huffman coding | |
| CN107018414A (en) | A kind of method of hiding high quality graphic lossless in low-quality image compressed data | |
| CN108521535B (en) | A kind of Information hiding transmission method based on image blend processing | |
| CN109636707A (en) | A kind of blind Detecting Information hiding and extracting method based on image texture characteristic | |
| Fleig et al. | Edge-aware autoencoder design for real-time mixture-of-experts image compression | |
| CN111885384B (en) | Picture processing and transmission method based on generation countermeasure network under bandwidth limitation | |
| CN105163122A (en) | Image compression and decompression method based on similarity of image blocks | |
| CN111479286A (en) | Data processing method for reducing communication flow of edge computing system | |
| CN109819259A (en) | A kind of image recompression processing method based on Huffman coding | |
| CN105141960B (en) | A kind of method that information transfer is carried out based on JPEG2000 compressed bit streams | |
| Lee et al. | A new steganographic scheme based on vector quantisation and search-order coding | |
| CN108848385B (en) | Block data compression method suitable for micro-nano satellite | |
| CN111915473B (en) | Reversible information hiding method based on AMBTC compression technology and Hamming distance | |
| CN112614196A (en) | Image robustness Hash authentication method based on quaternion convolution neural network | |
| RU2327301C2 (en) | Method of transmission of additional data in combined use of vector quantisation and fractal conding of images allowing for classifications of domains and units from code book | |
| CN115396670B (en) | Image data compression method for local processing |
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 |