CN107018414B - A method of the lossless hiding high quality graphic in low-quality image compressed data - Google Patents
A method of the lossless hiding high quality graphic in low-quality image compressed data Download PDFInfo
- Publication number
- CN107018414B CN107018414B CN201710292706.3A CN201710292706A CN107018414B CN 107018414 B CN107018414 B CN 107018414B CN 201710292706 A CN201710292706 A CN 201710292706A CN 107018414 B CN107018414 B CN 107018414B
- Authority
- CN
- China
- Prior art keywords
- image
- data
- low
- secret information
- information
- 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
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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/154—Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion
-
- 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/167—Position within a video image, e.g. region of interest [ROI]
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
A kind of method of hiding high quality graphic lossless in low-quality image compressed data of the present invention, this method passes through high efficiency Information hiding, if opposite hidden capacity is up to 16%-53%, the image (common-denominator target image or region of interest area image) of high quality is hidden in splits' positions data without distortions and is transmitted, receiving end can restore hiding high quality graphic completely, also can obtain the image with original image homogenous quantities grade by decompression.The present invention is not in the case where changing data compression technique, a kind of high performance information is provided to hide and the quality data compression method based on the method, it is equivalent to the recovery image for both having obtained 4 times of compressions by 4 times of splits' positions, also obtains area-of-interest high quality graphic；Both the compression requirements of original user had been met, have also met special user to the Lossless transport demand of high-quality target image.
Description
Technical field
The present invention relates to a kind of methods of data transmission, in particular to a kind of lossless hidden in low-quality image compressed data
The method for hiding high quality graphic, belongs to communication (such as data communication technology) field.
Background technique
Data transmission and image procossing 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
Restoring image, there are certain information losses with original image, as long as subjective evaluation index meets the requirements, in practice to application
There is no much influences.Restore image after lossless compression method compression and information loss be not present in original image, but compression ratio is especially small,
General 2 times or so, use occasion is limited, is not easy to carry out data transmission.The compression side 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, 35dB or more effect
It is just more satisfactory.
There are many current image data compression methods, representative to have JPEG and JPEG2000 compression standard.Due to pressure
Contracting canonical algorithm function is relatively more, and algorithm is related with image self character, is not all to be for the best in what situations.In many realities
Under the applicable cases of border, compression ratio is generally 4 times, and aggregate date rate is higher before compressing, such as 1200Mbps, if compression method is complicated,
Then be difficult to hardware realization, therefore JPEG2000 compression algorithm is all based on greatly external compression chip and realizes at present, development cost is high, by
It is formed on people；Alternatively, some tasks do 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 classical inexpensive compression side
Method, typical compression ratio are 4 times, and Y-PSNR PSNR is 30dB or more, under normal circumstances can be with.But for important goal
Or area-of-interest, PSNR may be unable to satisfy user demand in 30dB or so.
The occasions such as civil-military inosculation also have high quality military and the demand of the civilian image simultaneous transmission of low quality.
User also has the hidden demand for pretending transmission in low-quality image of high quality graphic.
The appearance of Information Hiding Techniques provides new approach in order to solve the above problem.
Summary of the invention
Technical problem solved by the present invention is overcoming the deficiencies of the prior art and provide a kind of in low-quality image compression number
The method of lossless hiding high quality graphic in can be used for the lossless information concealing transmission of data (especially image data).
The technical scheme is that a kind of side of hiding high quality graphic lossless in low-quality image compressed data
Method, steps are as follows:
1) original image A0 is divided into the non-overlapping block that size is K1*K2=K, every piece of pixel is X1, X2 ... XK, wherein R
=K1*K2*8/ (K1*K2+2*8)>=r, r<8, R<8；M, N is positive integer；R is desired compression ratio, and R is actual compression ratio, former
The size of beginning image A0 is M*N, 8 bit quantizations；
2) the average value T for seeking each non-overlapping block obtains set B, and the set B is made of K 1 bit value Bj, j=
1,2,…K；Each non-overlapping block obtains the set of tri- numerical value of L H B, total 16+K1*K2 bit；
3) to each non-overlapping block in original image A0, the operation of step 2) is carried out, completes compression, compression ratio R；
4) band hide secret information Q bit groupings, every group be S, P and W, S=S1, S2 ... Sd, P=P1, P2 ... Pd,
Wherein Sj, Pj and W value be 0 or 1, d value be 1,2,3,4,5,6,7,8 in any one value, every piece of secret information always than
Special number is 2d+1；
5) with low d of S substitution L, L1 is obtained, with low d of P substitution H, obtains H1；As information W=0, L1-H1 is judged
Absolute value, if the absolute value be greater than 2d- 1, then transmitting data format is L1H1B, and the format keeps information W=0 at this time；If should
Absolute value is less than or equal to 2d- 1, then transmitting data format is still L1H1B, and the format does not keep information W at this time；As information W=1,
The absolute value of L1-H1 is judged, if the absolute value is greater than 2d- 1, then it transmits data format and is changed to H1L1B, the format keeps letter at this time
Cease W=1；If the absolute value is less than or equal to 2d- 1, then transmitting data format is still L1H1B, and the format does not keep information W at this time；
6) receiving end receives data, takes out secret information and judges data format；
7) restored according to the source of secret information；Data, L1H1B is arranged in order；If Bj=0 in B, then Xj
=L1；If Bj=1, Xj=H1 in B, the recovery image of each non-overlapping block is obtained, to obtain original image A0's
Restore image A1.
The method of set B is wherein determined in step 2) are as follows: if Xj >=T, Bj=1, otherwise Bj=0；It calculates and obtains Bj=0
When corresponding all Xj average value L, calculate the average value H of corresponding all Xj when obtaining Bj=1, each non-overlapping block obtains
The set of tri- numerical value of L H B, total 16+K1*K2 bit.
The determination method of d in step 4) are as follows:
If user wishes the picture quality for preferentially guaranteeing original image BTC compression, d=1 is taken, 2,3,4；
If user wishes preferentially to guarantee the biggish area-of-interest quality of original image, d=5 is taken, 6,7,8.
The determination method of secret information S, P, W in step 4) are as follows:
The area-of-interest F of original image A0 is divided, the rectangular area that a size is K3*K4, coordinate are obtained
Point is (a1, b1) (a1, b2) (a1, b2) (a2, b2), and the pixel value in the F of region is constituted secret information S and P, four coordinate values
Totally 64 bits are as secret information W for 8 numbers, and wherein the total bit number Q1=K3*K4*8+64 of S, P, W, meet: Q1≤(2d+1) *
(M*N)/(K1*K2)；
Or original image A0 is normally compressed, compressed data byte constitutes secret information SPW, SPW's
Total bit number Q2 meets: Q2≤(2d+1) * (M*N)/(K1*K2)；
Or other images or data constitute secret information SPW if total amount of data is K5*K6*8 bit, SPW always than
Special number meets following condition: K5*K6*8≤(2d+1) * (M*N)/(K1*K2).
The detailed process that source in step 7) according to secret information is restored are as follows: if secret information comes from image,
Image is then recovered according to secret information again；If secret information comes from data after compression of images, solved again according to secret information
Compression recovers image；If secret information comes from other data sources, the original of other data is recovered again according to secret information
Beginning format.
The detailed process of step 6) are as follows: set the data that receiving end receives as U, V, B, judge the absolute value of U-V: if this is absolutely
Value is greater than 2d- 1, and U < V, then infer that data format is L1H1B, low d for taking out L1 obtain S=S1, S2 ... Sd, take out H1
Low d, obtain P=P1, P2 ... Pd, while obtaining information W=0；If the absolute value is greater than 2d- 1, and U > V, then infer number
It is H1L1B according to format, low d for taking out L1 obtain S=S1, S2 ... Sd, and low d for taking out H1 obtain P=P1, P2 ...
Pd, while obtaining information W=1；If the absolute value is less than or equal to 2d- 1, then infer that data format is L1H1B, takes out the low d of L1
Position, obtains S=S1, S2 ... Sd, low d for taking out H1 obtain P=P1, and P2 ... Pd cannot obtain information W at this time.
The beneficial effect of the present invention compared with prior art is:
The present invention using Information Hiding Techniques, transmit by the key images information in image compression data, and receiving end can be with
It is normally decompressed from carrier data, and undistorted recovery area-of-interest high quality graphic.Do not increasing the rate of information throughput
In the case where, whole image compresses 4 times and meets quality requirement, and area-of-interest is undistorted.
The present invention has these points substantive different and progress compared with current background technique:
(1) current BTC block truncation coding (BTC) compression method is not in conjunction with area-of-interest；BTC block truncation coding
(BTC) compression method due to carrier compression quality it is not high, and carrier quality will also decline after the methods of LSB Information hiding,
When especially hidden capacity is big, carrier quality is worse, therefore conventional method can not be combined with hidden methods such as LSB, and this hair
Bright then to have some reduction not influence quality with large capacity hiding information, carrier quality, as d=2, laboratory shows the present invention
It is almost unchanged to restore image PSNR, but fields of interest image lossless restores.
(2) present invention improves the capacity of BTC domain information hidden method, by carrying out BTC compression to initial carrier image
(AMBTC), for the first time in mean value hide and mean value pair hide it is ingenious combine together, available 1/32 high hiding capacity
And picture quality is basically unchanged, and is created condition for lossless hiding transmission.
Hidden capacity (bit) of the present invention: hiding secret information bit number, is (2d+1) * (M*N)/(K1*K2) bit；
Hidden capacity is calculated by compressed data, then hidden capacity value C1 is as follows:
C1=(2d+1)/(16+K1*K2).Illustrate: obtaining tri- numerical value set of LHB for every piece after compression of images, compare used in every piece
Special number 8+8+K1*K2, and every piece of reality hides bit number (2d+1), compared with data after splits' positions, the present invention, which hides, to be held
Amount is (2d+1)/(16+K1*K2).
As d=2, when K1*K2=4*4=16, hidden capacity is 5/32 to be greater than 1/8.As d=4, hidden capacity=9/
32 are greater than 1/4, and as d=8, hidden capacity=17/32 is greater than 1/2.
(3) this method takes full advantage of the priori knowledge of BTC compression image, and is passed in a manner of not increasing transmitted data amount
Defeated to arrive receiving end, receiving end can obtain high quality carrier image according to hiding information；
(4) high quality graphic or region of interest area image are carried out lossless process by this method, are hidden in the AMBTC pressure of image
In contracting code stream, hided transmission can be carried out, has the function of camouflage, avoid the peace of directly transmission or storage high quality graphic
Full problem；
(5) this method can according to need selection d value and compression ratio, adjusts picture quality and ROI size, can be obtained a variety of
The BTC of different quality compresses image: being hidden in the domain BTC after whole image can also being compressed with JPEG2000, obtains different etc.
Grade JPEG2000 compression restores image, provides convenience for the use of different brackets user；
(6) present invention realizes high quality graphic hiding in low-quality image compressed data for the first time, and it is special to meet
The privacy requirements of user are, it can be achieved that compression of images restores the hierarchical transmission and reception of image；
(7) technical solution of the present invention is unique, while having compression and hidden function, but compared with BTC compression method, complicated
Degree is highly susceptible to realizing there is no increasing.
Detailed description of the invention
Fig. 1 is image used in the present invention；
Fig. 2 is processing result of the present invention to lena image, wherein 2 (a) be lena original image, 2 (b) is extensive for the present invention
Complex pattern, 2 (c) be region of interest.
Specific embodiment
High-speed data Compression Transmission Technology has been widely used for the spacecrafts such as remote sensing satellite, space probe and all kinds of defends
Star Data transfer system will obtain broader applications from now on.But data compression method is based on JPEG2000 algorithm, compression on star
Than being mainly 4 times, it may be said that user's acceptable compression ratio be 4, implement it is at high cost, it is under one's control.
Transmission and compression integrated method, while the party are hidden using Information Hiding Techniques the present invention provides a kind of
The features such as there is method high-performance and low performance to coexist, and implementation complexity is low, practical, implementation complexity well below
JPEG2000 compression standard, using small-scale FPGA resource can realization of High Speed, thus in spacecraft engineering, low cost figure
It is more with practical value in image transmission system.
In order to verify the performance of algorithm proposed in this paper, 4 width sizes are used in emulation experiment as 512 × 512 8 bits
Greyscale image data carries out data compression and transmission.
1, a kind of method of hiding high quality graphic lossless in low-quality image compressed data, it is characterised in that step is such as
Under:
1) compression ratio of requirement is set as 4, actual compression ratio R=4, original image lena.bmp, size M*N=512*
512,8 bit quantizations；If the size of image block is K=K1*K2=4*4=16, wherein K1*K2*8/ (K1*K2+2*8)=4；It will
Original image lena.bmp is divided into the non-overlapping block that size is 4*4, and every piece has X1, X2 ... X16 pixel value, and total bit number is
K*8=128；
2) the average value T for asking each piece obtains set a B, B and is made of 16 1 bit value Bj, j=1, and 2 ... 16；Its
The method of middle determination set B are as follows: if Xj >=T, Bj=1, otherwise Bj=0；The average value L of the corresponding all Xj of Bj=0 is calculated,
The average value H, L and H of the corresponding all Xj of calculating Bj=1 is the value between 0-255, and L is less than or equal to H；Each piece obtains L
The set of tri- numerical value of H B, total 16+16=32 bit；
3) to each piece of original image A0, the operation of step 2) is carried out, completes compression, compression ratio R is K*8/32=128/
32=4；
4) secret information is grouped, every group is S, P and W, and S=S1, S2, P=P1, P2, W=W1, wherein Sj, Pj and W1 take
Value is 0 or 1, j=1, and 2, d values are 2；S is 01, P 10, W 1；
5) L1 is obtained with minimum 2 of S substitution L, obtains H1 with minimum 2 of P substitution H；As information W=1, L1- is judged
The absolute value of H1, if the absolute value is greater than 2d- 1=3 then transmits data format and is changed to H1L1B, and the format keeps information W at this time
=1；If the absolute value is less than or equal to 2d- 1=3, then transmitting data format is still L1H1B, and the format does not keep information W at this time；
6) data that receiving end receives are set as U, V, B, judge the absolute value of U-V:
If the absolute value is greater than 2d- 1=3, and U > V then infer that data format is H1L1B, and low 2 for taking out L1 obtain S
=S1, S2, low 2 for taking out H1 obtain P=P1, P2, while obtaining information W=1；
If the absolute value is less than or equal to 2d- 1=3 then infers that data format is L1H1B, and low 2 for taking out L1 obtain S=
S1, S2, low 2 for taking out H1 obtain P=P1, P2, cannot obtain information W at this time；
7) if secret information comes from other data sources, the original lattice of other data are recovered again according to secret information
Formula；
Data, L1H1B is arranged in order；If Bj=0 in B, then Xj=L1；If Bj=1, Xj=H1 in B, obtain
To the recovery image of each non-overlapping block, to obtain the recovery image A1 of original image A0；
2, the side of a kind of hiding high quality graphic lossless in low-quality image compressed data according to claim 1
Method, it is characterised in that: the determination method of secret information S, P, W and d in step 4) are as follows:
1) the determination method of d:
If user wishes the picture quality for preferentially guaranteeing original image BTC compression, d=1 is taken, 2,3,4；
If user wishes preferentially to guarantee the biggish area-of-interest quality of original image, d=5 is taken, 6,7,8.
The present embodiment takes d=2
2) secret information S, P, W determines method:
Area-of-interest (ROI region) F of original image A0 is divided, obtaining a size is k3*k4=64*
128 rectangular area, coordinate points be (a1, b1) (a1, b2) (a2, b1) (a2, b2), occurrence be (223,192), (223,
319) pixel value in the F of region is constituted secret information S and P by, (286,192), (286,319), and four coordinate values, 8 numbers are altogether
64 bits are as secret information W, and the wherein total bit number Q1=64*128*8+64=65600 bit of S, P, W meets: Q1≤
5* (512*512)/(4*4)=81920 bit.
Illustrate: when taking d=8, being equivalent to hidden capacity (relative to data after compression) and reach 17/32=53% and be greater than
50%, it can reach 17/128=13% greater than 1/8, if original image JPEG2000 relative to original image hidden capacity
8 times (PSNR 40dB or so) is compressed, then can accomplish that PSNR is improved 8dB in the case where BTC compresses system.
Fig. 1 is 4 width image used in the present invention, and table 1 is processing result of the present invention to 4 width images, and Fig. 2 is that the present invention is right
The processing result of lena image.It can be seen that performance improvement situation of the invention.
Table 1
By taking lena standard picture as an example, when 4 times of compressions of BTC, restore image PSNR up to 32.8dB,
BTC region of interest Quality of recovery PSNR=29.2dB；When 4 times of compressions of the invention, it is reachable to restore image PSNR
32.4dB, but region of interest Quality of recovery PSNR is infinity, illustrates no any information loss.
Hidden capacity (relative to compressed images) C1 calculated example:
C1=(2d+1)/(K1*K2+16)；
Such as d=2, K1*K2=4*4=16, V=5/32=16%
Such as d=4, K1*K2=4*4=16, V=9/32=28%
Such as d=6, K1*K2=4*4=16, V=13/32=41%
Such as d=7, K1*K2=4*4=16, V=15/32=47%
Such as d=8, K1*K2=4*4=16, V=17/32=53%
Hidden capacity (opposite and original image) C2 is reachable: C2=C1/R, R: compression ratio.
C2=C1/R=(2d+1)/(K1*K2*8)
Lena area-of-interest (64*128) image is hidden without distortions and is transmitted in the compressed data, receiving end energy
Restore hiding region of interest area image completely, can also be obtained and original image homogenous quantities grade, the basic phase of PSNR by decompression
Same lena carrier image (512*512).In order to observe conveniently, the area-of-interest shown in Fig. 2 is bigger than actual area.
In short, the method for the invention proposes a kind of in low-quality image compressed data lossless hiding high quality graphic,
It is characterized in that: this method is by high efficiency Information hiding, image (region of interest area image or the common-denominator target figure of high quality
Picture) it hides transmitted in the compressed data without distortions, receiving end can restore hiding high quality graphic completely, can also pass through
Decompression obtains the image with original image homogenous quantities grade.
The present invention provides a kind of efficient in the case where not changing original data compression technique (such as BTC block truncation coding)
Rate Information hiding and quality data compression method based on the method, such as opposite hidden capacity is up to 16%-53%.By 4
Times splits' positions had both obtained the recovery images of 4 times of compressions, and had also obtained area-of-interest high quality graphic；Both original use had been met
The compression requirements at family also meet special user to the Lossless transport demand of high-quality target image.
Unspecified part of the present invention belongs to common sense well known to those skilled in the art.
Claims (6)
1. a kind of method of hiding high quality graphic lossless in low-quality image compressed data, it is characterised in that steps are as follows:
1) original image A0 is divided into the non-overlapping block that size is K1*K2=K, every piece of pixel is X1, X2 ... XK, wherein R=
K1*K2*8/(K1*K2+2*8)≥r,r<8,R<8；M, N is positive integer；R is desired compression ratio, and R is actual compression ratio, original
The size of image A0 is M*N, 8 bit quantizations；
2) the average value T for seeking each non-overlapping block obtains set B, and the set B is made of K 1 bit value Bj, j=1,
2,…K；Each non-overlapping block obtains the set of tri- numerical value of LHB, total 16+K1*K2 bit；The specific method of the determination set B
If are as follows: Xj >=T, Bj=1, otherwise Bj=0；The average value L of corresponding all Xj when obtaining Bj=0 is calculated, calculates and obtains Bj
The average value H of corresponding all Xj when=1, each non-overlapping block obtain the set of tri- numerical value of L H B, total 16+K1*K2 bit；
3) to each non-overlapping block in original image A0, the operation of step 2) is carried out, completes compression, compression ratio R；
4) secret information Q bit groupings to be concealed, every group is S, P and W, S=S1, S2 ... Sd, P=P1, P2 ... Pd, wherein
Sj, Pj and W value are 0 or 1, and d value is any one value in 1,2,3,4,5,6,7,8, every piece of secret information total bit number
For 2d+1；
5) with low d of S substitution L, L1 is obtained, with low d of P substitution H, obtains H1；As information W=0, judge that L1-H1's is exhausted
To value, if the absolute value is greater than 2d- 1, then transmitting data format is L1 H1 B, and the format keeps information W=0 at this time；If this is absolutely
2 are less than or equal to valued- 1, then transmitting data format still is L1 H1 B, and the format does not keep information W at this time；As information W=1,
The absolute value of L1-H1 is judged, if the absolute value is greater than 2d- 1, then it transmits data format and is changed to H1 L1 B, the format is kept at this time
Information W=1；If the absolute value is less than or equal to 2d- 1, then transmitting data format still is L1 H1 B, and the format does not keep letter at this time
Cease W；
6) receiving end receives data, takes out secret information and judges data format；Detailed process are as follows: set the data that receiving end receives
For U, V, B, the absolute value of U-V is judged: if the absolute value is greater than 2d- 1, and U < V, then infer that data format is L1 H1 B, takes out
Low d of L1 obtain S=S1, S2 ... Sd, and low d for taking out H1 obtain P=P1, P2 ... Pd, while obtaining information W=0；
If the absolute value is greater than 2d- 1, and U > V, then inferring that data format is H1 L1 B, low d for taking out L1 obtain S=S1,
S2 ... Sd, low d for taking out H1 obtain P=P1, P2 ... Pd, while obtaining information W=1；If the absolute value is less than or equal to
2d- 1, then infer that data format is L1 H1 B, low d for taking out L1 obtain S=S1, S2 ... Sd, and low d for taking out H1 obtain
Information W cannot be obtained at this time to P=P1, P2 ... Pd；
7) restored according to the source of secret information；Data, L1 H1 B is arranged in order；If Bj=0 in B, then Xj=
L1；If Bj=1, Xj=H1 in B, the recovery image of each non-overlapping block is obtained, to obtain the extensive of original image A0
Complex pattern A1.
2. a kind of method of hiding high quality graphic lossless in low-quality image compressed data according to claim 1,
It is characterized by: in step 4) d determination method are as follows:
If user wishes the picture quality for preferentially guaranteeing original image BTC compression, d=1 is taken, 2,3,4；
If user wishes preferentially to guarantee the biggish area-of-interest quality of original image, d=5 is taken, 6,7,8.
3. a kind of method of hiding high quality graphic lossless in low-quality image compressed data according to claim 1,
It is characterized by: in step 4) secret information S, P, W determination method are as follows:
The area-of-interest F of original image A0 is divided, the rectangular area that a size is K3*K4 is obtained, coordinate points are
(a1, b1) (a1, b2) (a2, b1) (a2, b2), in the F of region pixel value constitute secret information S and P, four coordinate value 8
Totally 64 bits are as 64 secret information W for number, and wherein the total bit number Q1=K3*K4*8+64 of S, P, W, meet: Q1≤(2d+
1)*(M*N)/(K1*K2)。
4. a kind of method of hiding high quality graphic lossless in low-quality image compressed data according to claim 1,
It is characterized by: in step 4) secret information S, P, W determination method are as follows: original image A0 is normally compressed, compress
Data byte afterwards constitutes secret information SPW, and the total bit number Q2 of SPW meets: Q2≤(2d+1) * (M*N)/(K1*K2).
5. a kind of method of hiding high quality graphic lossless in low-quality image compressed data according to claim 1,
It is characterized by: in step 4) secret information S, P, W determination method are as follows: to other images or data, if total amount of data is K5*
K6*8 bit constitutes secret information SPW, and the total bit number of SPW meets following condition: K5*K6*8≤(2d+1) * (M*N)/
(K1*K2)。
6. a kind of method of hiding high quality graphic lossless in low-quality image compressed data according to claim 1,
It is characterized by: the detailed process that the source in step 7) according to secret information is restored are as follows: if secret information is from figure
Picture then recovers image according to secret information again；If secret information comes from data after compression of images, again according to secret information
Decompression recovers image；If secret information comes from other data sources, other data are recovered again according to secret information
Unprocessed form.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710292706.3A CN107018414B (en) | 2017-04-28 | 2017-04-28 | A method of the lossless hiding high quality graphic in low-quality image compressed data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710292706.3A CN107018414B (en) | 2017-04-28 | 2017-04-28 | A method of the lossless hiding high quality graphic in low-quality image compressed data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107018414A CN107018414A (en) | 2017-08-04 |
| CN107018414B true CN107018414B (en) | 2019-10-22 |
Family
ID=59447402
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710292706.3A Active CN107018414B (en) | 2017-04-28 | 2017-04-28 | A method of the lossless hiding high quality graphic in low-quality image compressed data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107018414B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108848385B (en) * | 2018-06-20 | 2021-04-13 | 西安空间无线电技术研究所 | Block data compression method suitable for micro-nano satellite |
| CN110392260B (en) * | 2019-07-12 | 2021-04-13 | 西安空间无线电技术研究所 | Low-cost joint image compression transmission method |
| CN111654707B (en) * | 2020-06-03 | 2022-03-15 | 福建师范大学福清分校 | Information hiding method and terminal based on Russian blocks |
| CN113395405B (en) * | 2021-06-17 | 2022-08-12 | 西安空间无线电技术研究所 | Method for fusing implicit information of multi-source data |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101833746A (en) * | 2010-04-23 | 2010-09-15 | 北京大学 | Method for embedding reversible watermark in digital image and method for extracting reversible watermark from digital image |
| CN103414892A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Method for hiding high-capacity compression-resisting image information |
| CN104079938A (en) * | 2014-06-27 | 2014-10-01 | 西安空间无线电技术研究所 | Image self-hidden method with controllable transmission quality |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060120558A1 (en) * | 2004-10-20 | 2006-06-08 | Yun-Qing Shi | System and method for lossless data hiding using the integer wavelet transform |
-
2017
- 2017-04-28 CN CN201710292706.3A patent/CN107018414B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101833746A (en) * | 2010-04-23 | 2010-09-15 | 北京大学 | Method for embedding reversible watermark in digital image and method for extracting reversible watermark from digital image |
| CN103414892A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Method for hiding high-capacity compression-resisting image information |
| CN104079938A (en) * | 2014-06-27 | 2014-10-01 | 西安空间无线电技术研究所 | Image self-hidden method with controllable transmission quality |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107018414A (en) | 2017-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107018414B (en) | A method of the lossless hiding high quality graphic in low-quality image compressed data | |
| Chen et al. | A secure Boolean-based multi-secret image sharing scheme | |
| CN101287093B (en) | Method for adding special effect in video communication and video customer terminal | |
| Chang et al. | A novel secret image sharing scheme in color images using small shadow images | |
| CN106530368B (en) | A kind of progressive secret image sharing of prime field multi-threshold and reconstructing method | |
| CN106683053B (en) | A kind of GF (26) the progressive secret image sharing of finite field multi-threshold and reconstructing method | |
| Yao et al. | High-fidelity dual-image reversible data hiding via prediction-error shift | |
| CN105227962B (en) | A kind of lossless information concealing method based on data difference | |
| CN108009975A (en) | Jpeg image reversible information hidden method based on two-dimensional histogram modification | |
| Chang et al. | A sudoku-based secret image sharing scheme with reversibility | |
| CN102006477A (en) | Image transmission method and system | |
| Liu et al. | CG-Cast: Scalable wireless image SoftCast using compressive gradient | |
| CN110445949A (en) | The domain AMBTC reversible information hidden method based on histogram displacement | |
| CN108521535B (en) | A kind of Information hiding transmission method based on image blend processing | |
| CN103716505A (en) | Image recognition system and method | |
| Cheng et al. | Secret sharing: using meaningful image shadows based on gray code | |
| CN113660386B (en) | Color image encryption compression and super-resolution reconstruction system and method | |
| CN102523452A (en) | Method for conversion, compression and transmission of images | |
| CN104065969A (en) | Method for hiding high-capacity compression-resisting image information | |
| CN114782563B (en) | Secret image sharing method and system for JPEG image | |
| CN107277507B (en) | Spatial domain transform domain hybrid image compression method | |
| CN112330551A (en) | Remote sensing image outsourcing noise reduction method based on secret sharing | |
| Khashman et al. | Comparison criteria for optimum image compression | |
| CN103780913A (en) | Data compression method based on error hiding | |
| CN115131253B (en) | Secret image sharing method and system for resisting JPEG recompression |
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 |