CN103795889A - Robustness information hiding and transmitting method based on column diagram - Google Patents
Robustness information hiding and transmitting method based on column diagram Download PDFInfo
- Publication number
- CN103795889A CN103795889A CN201410022840.8A CN201410022840A CN103795889A CN 103795889 A CN103795889 A CN 103795889A CN 201410022840 A CN201410022840 A CN 201410022840A CN 103795889 A CN103795889 A CN 103795889A
- Authority
- CN
- China
- Prior art keywords
- interval
- information
- gray value
- value
- histogram
- 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
Images
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a robustness information hiding and transmitting method based on a column diagram. The method is mainly used for hiding lossless information in an image. Current typical lossless information hiding algorithms are based on column diagram displacement, the problems that hidden information can not be extracted due to image compression errors or image transmission errors, and robustness is unavailable are solved. The robustness information hiding and transmitting method based on the column diagram is a novel method, the processing such as substitution of the peak point of the column diagram is conducted by searching for the peak point of the column diagram and a robustness range, displacement of the column diagram is not needed, the method based on the column diagram has obvious robustness, and compared with a JPEG 2000 method, the compression can be improved by 2 times to 8 times. The robustness information hiding and transmitting method based on the column diagram is low in complexity and easy to realize, and high-quality recovery of carrier images after information extraction is facilitated.
Description
Technical field
The present invention relates to a kind of method of Image Communication, the particularly method of a kind of Information hiding transmission, belongs to communication (as data communication technology etc.) field.
Background technology
Along with scientific and technological development, the fail safe of image data transmission efficiency and transmission becomes more and more important.Can accomplish in the situation that not changing image size by Information hiding (also claim data hide) technology, in image, embed secret information and transmit, thereby realize the transmission of secret information and image.
Can recover as much as possible for the requirements such as remote sensing images, medical image and law image carrier image after extraction secret information.Under this demand, produce reversible information hidden algorithm, also claimed lossless information concealing algorithm.Lossless information concealing algorithm not only can correctly extract secret information, the recovery carrier image that can also can't harm.
At present typical lossless information concealing algorithm is the method based on histogram displacement.But the method based on histogram displacement requires the stego-image of hiding secret information can not change in transmitting procedure, even if there is very little variation, the extraction secret information that receiving terminal can not be correct.But along with the raising of image resolution ratio, image transmitting goes to toward adopting data compression technique (the most representative JPEG2000 of being Standard of image compression) to carry out lossy compression method to image, thereby cause the change of picture characteristics, the information extraction that the method that histogram is shifted can not be correct.That is to say, the change when information concealing method meeting based on histogram displacement is because of image transmitting at present causes secret information to extract, and does not possess robustness completely.
Summary of the invention
The technical problem that the present invention solves is: overcome the deficiencies in the prior art, provide a kind of based on histogrammic robust steganography transmission method, solved conventional histogram displacement Information Hiding Algorithms and do not possess the problem of robustness.
Technical scheme of the present invention is: a kind of based on histogrammic robust steganography transmission method, step is as follows:
1) obtain the pixels statistics histogram of pending input picture, make the gray value of x representing input images, x ∈ [0,255], makes the number of samples that in the statistic histogram of h (x) representing input images, value is x; If histogrammic peak value is h (p), peak point gray value is p;
2) threshold value that d is Robust Interval, d >=1 are set; The thresholding T of histogram value is set, and T initial value is 0, finds Robust Interval A and B;
21) at [0,255] interval interior search histogram h (x), the x that wherein h (x)≤T is corresponding is put into S set 1; Element in S set 1 is arranged from small to large and obtained S set, and the element number in S set is k;
22) find maximum two continuum A and the B in S set, wherein the element in interval A and interval B increases progressively by natural number rule, and the length of interval A and interval B is respectively d1 and d2, wherein d1 >=d2; If only exist a continuum this interval to be divided into two intervals of A and B in S set: in the time that k is even number, d1=d2=k/2; In the time that k is odd number, d1=(k+1)/2, d2=(k-1)/2; If d2<d, T=T+1, returns to step 21), again find interval A and interval B; If d2 >=d, using interval A now and interval B as the Robust Interval A finding out and Robust Interval B;
3) be not that 0 gray value changes respectively y1, y2 into by the histogram in Robust Interval A, B, described y1, y2 is respectively the nearest gray value of A between distance regions, B; If gray value corresponding to 1/2 position is s1 in interval A, in interval B, gray value corresponding to 1/2 position is s2;
4) will scan through the pixel in step 3) new input picture after changing, the point that search gray value is p and the point that is p by gray value are defined as information and embed point; If information to be embedded is 1, the value that this information is embedded to point is set to s1, if information to be embedded is 0, the value that this information is embedded to point is s2; Until embedding point, all information all embeds information;
5) information receiving end receives the input picture that contains embedding information, and generates statistic histogram;
6) establishing the quantity that in the input picture that contains embedding information, embedding information is 1 is N1, R=0, and N1, R are equal positive integer; Calculate the number m that obtains pixel between gray value interval [s1-R, s1+R], if m<N1, R=R+1, the number of pixel between double counting gray value interval [s1-R, s1+R], until m >=N1; The histogram that gray value interval [s1-R, s1+R] is now 1 for embedding information; If the quantity that in the input picture that contains embedding information, embedding information is 0 is N0, L=0, N0, L are positive integer; Calculate and obtain gray value interval [s0-L, s0+L] between the number n of pixel, if n<N0, L=L+1, the number n of pixel between double counting gray value interval [s0-L, s0+L], until n >=N0, the histogram that gray value interval [s0-L, s0+L] is now 0 for embedding information;
7) input image pixels that scanning contains embedding information, if current gray level value x ∈ [s1-R, s1+R] extracts embedding information 1, and recovers former pixel x=p; If current gray level value x ∈ [s0-L, s0+L], extracts embedding information 0, and recovers former pixel x=p; Other situations x remains unchanged; Final recovery original input image also extracts embedding information.
The present invention's beneficial effect is compared with prior art:
(1) method need to all be shifted the pixel that is positioned at histogram peak point and zero point at present, and the hidden method that the present invention adopts adopts the strategy of peak point pixel replacement first, has avoided the displacement of a large amount of pixels;
(2) the single zero point that at present method has only utilized image histogram to exist, the present invention adopts replacement policy to produce the zero point that is continuum, and makes full use of this feature and improved the performance of histogramming algorithm; The present invention searches for Robust Interval in image histogram, and hiding in Robust Interval of information, makes to have possessed robustness based on histogrammic hidden method;
(3) the present invention is in the time of information extraction, and the pixel in Robust Interval is all peak point pixel, and after extraction, peak point pixel all can be recovered, and has improved the Quality of recovery of carrier image;
(4) after embedding information of the present invention, in stego-image, there is not the pixel that is positioned at histogram peak point, if be to find to still have pixel to be positioned at histogrammic peak point extracting secret information, illustrate that stego-image is changed.Therefore, the invention provides a kind of method that detected image gray value changes;
(5) after embedding information of the present invention, owing to there not being the pixel that is positioned at histogram peak point in stego-image, still have pixel to be positioned at peak point if therefore find in the time extracting secret information, the value that this pixel is described is changed and come by close gray value, this kind of situation can be utilized the local correlations of initial carrier image, in the time recovering according to the neighbor correlation of initial carrier image predict, interpolation carries out image recovery, recovers original gray value, improves carrier image Quality of recovery;
(6) the at present histogrammic displacement of method almost relates to all pixels of image, realizes complicatedly, and the present invention only changes the pixel that is positioned at peak point, and complexity is low, is easy to realize, and changes the recovery that pixel is also conducive to carrier image quality after information extraction less.
(7) after embedding information of the present invention, in stego-image, no longer existence value is the pixel of histogram peak, in the time of information extraction, can estimate peak point according to stego-image histogram, has solved the problem of peak point transmission.
Accompanying drawing explanation
Fig. 1 is flow chart of the present invention.
Embodiment
Just by reference to the accompanying drawings the present invention is described further below.
One of the present invention is based on histogrammic robust steganography transmission method, and step is as follows:
1) obtain the pixels statistics histogram of pending input picture, make the gray value of x representing input images, x ∈ [0,255], makes the number of samples that in the statistic histogram of h (x) representing input images, value is x; If histogrammic peak value is h (p), peak point gray value is p;
2) threshold value that d is Robust Interval, d >=1 are set; The thresholding T of histogram value is set, and T initial value is 0, finds Robust Interval A and B;
21) at [0,255] interval interior search histogram h (x), the x that wherein h (x)≤T is corresponding is put into S set 1; Element in S set 1 is arranged from small to large and obtained S set, and the element number in S set is k;
22) find maximum two continuum A and the B in S set, wherein the element in interval A and interval B increases progressively by natural number rule, and the length of interval A and interval B is respectively d1 and d2, wherein d1 >=d2; If only exist a continuum this interval to be divided into two intervals of A and B in S set: in the time that k is even number, d1=d2=k/2; In the time that k is odd number, d1=(k+1)/2, d2=(k-1)/2; If d2<d, T=T+1, returns to step 21), again find interval A and interval B; If d2 >=d, using interval A now and interval B as the Robust Interval A finding out and Robust Interval B;
3) be not that 0 gray value changes respectively y1, y2 into by the histogram in Robust Interval A, B, described y1, y2 is respectively the nearest gray value of A between distance regions, B; If gray value corresponding to 1/2 position is s1 in interval A, in interval B, gray value corresponding to 1/2 position is s2;
4) will scan through the pixel in step 3) new input picture after changing, the point that search gray value is p and the point that is p by gray value are defined as information and embed point; If information to be embedded is 1, the value that this information is embedded to point is set to s1, if information to be embedded is 0, the value that this information is embedded to point is s2; Until embedding point, all information all embeds information;
5) information receiving end receives the input picture that contains embedding information, and generates statistic histogram;
6) establishing the quantity that in the input picture that contains embedding information, embedding information is 1 is N1, R=0, and N1, R are equal positive integer; Calculate the number m that obtains pixel between gray value interval [s1-R, s1+R], if m<N1, R=R+1, the number of pixel between double counting gray value interval [s1-R, s1+R], until m >=N1; The histogram that gray value interval [s1-R, s1+R] is now 1 for embedding information; If the quantity that in the input picture that contains embedding information, embedding information is 0 is N0, L=0, N0, L are positive integer; Calculate and obtain gray value interval [s0-L, s0+L] between the number n of pixel, if n<N0, L=L+1, the number n of pixel between double counting gray value interval [s0-L, s0+L], until n >=N0, the histogram that gray value interval [s0-L, s0+L] is now 0 for embedding information;
7) input image pixels that scanning contains embedding information, if current gray level value x ∈ [s1-R, s1+R] extracts embedding information 1, and recovers former pixel x=p; If current gray level value x ∈ [s0-L, s0+L], extracts embedding information 0, and recovers former pixel x=p; Other situations x remains unchanged; Final recovery original input image also extracts embedding information.
In order to verify the performance of algorithm in this paper, the 8 bit gradation images that it is 512 × 512 that experiment has adopted several sizes have carried out emulation.Hide capacity take bit as unit; The measurement of picture quality adopts Y-PSNR (PSNR), and unit is dB.
Simulation result is as shown in the table:
Simulation result shows algorithm has resistance to compression, can resist the compression of 8 times of JPEG2000 methods, and Recovery image objective evaluation index PSNR is higher, more than reaching 30dB, wherein secret information is in stego-image entirely true extraction of energy after 2-4 doubly compresses, and PSNR reaches 40dB left and right.
Highspeed Data Transmission Technology has been widely used in the spacecraft such as remote sensing satellite, space probe and all kinds of satellite data transmission system, will obtain broader applications from now on.Meanwhile, also more and more extensive to the requirement of some other low-rate data transmission on star.Information hiding based on image provides a kind of method for low-rate data transmission on star.Satellite data transmission system, in order to reduce volume of transmitted data on star, adopts data compression technique to carry out lossy compression method to remote sensing images conventionally, uses at present and cannot from contain close carrier image, correctly extract secret information based on histogrammic information concealing method receiving terminal.The invention provides a kind of incompressible histogram and hide transmission method, the method has distinct incompressible feature, simultaneously the method have complexity low, realize the feature of the practicality such as resource occupation is few, thereby in spacecraft engineering, have more practical value.
The one that the present invention proposes can adopt at image delivering system based on histogrammic robust steganography transmission method.
The content not being described in detail in specification of the present invention belongs to those skilled in the art's known technology.
Claims (1)
1. based on a histogrammic robust steganography transmission method, it is characterized in that step is as follows:
1) obtain the pixels statistics histogram of pending input picture, make the gray value of x representing input images, x ∈ [0,255], makes the number of samples that in the statistic histogram of h (x) representing input images, value is x; If histogrammic peak value is h (p), peak point gray value is p;
2) threshold value that d is Robust Interval, d >=1 are set; The thresholding T of histogram value is set, and T initial value is 0, finds Robust Interval A and B;
21) at [0,255] interval interior search histogram h (x), the x that wherein h (x)≤T is corresponding is put into S set 1; Element in S set 1 is arranged from small to large and obtained S set, and the element number in S set is k;
22) find maximum two continuum A and the B in S set, wherein the element in interval A and interval B increases progressively by natural number rule, and the length of interval A and interval B is respectively d1 and d2, wherein d1 >=d2; If only exist a continuum this interval to be divided into two intervals of A and B in S set: in the time that k is even number, d1=d2=k/2; In the time that k is odd number, d1=(k+1)/2, d2=(k-1)/2; If d2<d, T=T+1, returns to step 21), again find interval A and interval B; If d2 >=d, using interval A now and interval B as the Robust Interval A finding out and Robust Interval B;
3) be not that 0 gray value changes respectively y1, y2 into by the histogram in Robust Interval A, B, described y1, y2 is respectively the nearest gray value of A between distance regions, B; If gray value corresponding to 1/2 position is s1 in interval A, in interval B, gray value corresponding to 1/2 position is s2;
4) will scan through the pixel in step 3) new input picture after changing, the point that search gray value is p and the point that is p by gray value are defined as information and embed point; If information to be embedded is 1, the value that this information is embedded to point is set to s1, if information to be embedded is 0, the value that this information is embedded to point is s2; Until embedding point, all information all embeds information;
5) information receiving end receives the input picture that contains embedding information, and generates statistic histogram;
6) establishing the quantity that in the input picture that contains embedding information, embedding information is 1 is N1, R=0, and N1, R are equal positive integer; Calculate the number m that obtains pixel between gray value interval [s1-R, s1+R], if m<N1, R=R+1, the number of pixel between double counting gray value interval [s1-R, s1+R], until m >=N1; The histogram that gray value interval [s1-R, s1+R] is now 1 for embedding information; If the quantity that in the input picture that contains embedding information, embedding information is 0 is N0, L=0, N0, L are positive integer; Calculate and obtain gray value interval [s0-L, s0+L] between the number n of pixel, if n<N0, L=L+1, the number n of pixel between double counting gray value interval [s0-L, s0+L], until n >=N0, the histogram that gray value interval [s0-L, s0+L] is now 0 for embedding information;
7) input image pixels that scanning contains embedding information, if current gray level value x ∈ [s1-R, s1+R] extracts embedding information 1, and recovers former pixel x=p; If current gray level value x ∈ [s0-L, s0+L], extracts embedding information 0, and recovers former pixel x=p; Other situations x remains unchanged; Final recovery original input image also extracts embedding information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410022840.8A CN103795889B (en) | 2014-01-17 | 2014-01-17 | A kind of based on histogrammic robust steganography transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410022840.8A CN103795889B (en) | 2014-01-17 | 2014-01-17 | A kind of based on histogrammic robust steganography transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103795889A true CN103795889A (en) | 2014-05-14 |
| CN103795889B CN103795889B (en) | 2016-06-01 |
Family
ID=50671141
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410022840.8A Active CN103795889B (en) | 2014-01-17 | 2014-01-17 | A kind of based on histogrammic robust steganography transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103795889B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104202501A (en) * | 2014-08-29 | 2014-12-10 | 西安空间无线电技术研究所 | Method for performing information carrying and transmission in image |
| CN109617682A (en) * | 2018-12-12 | 2019-04-12 | 北京邮电大学 | A kind of ciphertext domain reversible information hidden method based on histogram left and right sidesing shifting |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030081809A1 (en) * | 2001-10-15 | 2003-05-01 | Jessica Fridrich | Lossless embedding of data in digital objects |
| CN103123720A (en) * | 2013-03-13 | 2013-05-29 | 中南大学 | Lossless data hiding method based on difference image histogram cycle spinning |
| CN103414840A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Data hiding method based on image set |
-
2014
- 2014-01-17 CN CN201410022840.8A patent/CN103795889B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030081809A1 (en) * | 2001-10-15 | 2003-05-01 | Jessica Fridrich | Lossless embedding of data in digital objects |
| CN103123720A (en) * | 2013-03-13 | 2013-05-29 | 中南大学 | Lossless data hiding method based on difference image histogram cycle spinning |
| CN103414840A (en) * | 2013-07-25 | 2013-11-27 | 西安空间无线电技术研究所 | Data hiding method based on image set |
Non-Patent Citations (2)
| Title |
|---|
| 李晓博，周诠: "基于直方图修改的卫星遥感图像无损隐藏传输", 《宇航学报》 * |
| 李晓博，周诠: "统计量移位的鲁棒无损图像信息隐藏", 《中国图象图形学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104202501A (en) * | 2014-08-29 | 2014-12-10 | 西安空间无线电技术研究所 | Method for performing information carrying and transmission in image |
| CN104202501B (en) * | 2014-08-29 | 2017-12-22 | 西安空间无线电技术研究所 | A kind of method for carrying out information embarkation transmission in the picture |
| CN109617682A (en) * | 2018-12-12 | 2019-04-12 | 北京邮电大学 | A kind of ciphertext domain reversible information hidden method based on histogram left and right sidesing shifting |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103795889B (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10311757B2 (en) | Data hiding method and data hiding system | |
| An et al. | Robust lossless data hiding using clustering and statistical quantity histogram | |
| CN101833746B (en) | Method for embedding reversible watermark in digital image and method for extracting reversible watermark from digital image | |
| CN101105857B (en) | High capacity reversible water mark method based on predication and companding technology | |
| CN102547297B (en) | MPEG2 (Moving Picture Experts Group 2) video watermarking realization method based on DC (Discrete Cosine) coefficient | |
| CN102523453B (en) | Super large compression method and transmission system for images | |
| CN101452569B (en) | Processing method of image latent writing based on auxiliary pixel | |
| CN102156611A (en) | Method and apparatus for creating animation message | |
| CN103501400B (en) | Based on the reversible information hidden method of parabola interpolation image | |
| CN105426479A (en) | Method and system for rapidly searching for questions through pictures | |
| CN103414840A (en) | Data hiding method based on image set | |
| CN109785221B (en) | Digital image steganography method and secret information extraction method | |
| CN101080013A (en) | A JPEG lossless compression image hide writing method based on predictive coding | |
| Zhou et al. | Reduced-reference stereoscopic image quality assessment based on view and disparity zero-watermarks | |
| Pramanik et al. | Application of steganography in symmetric key cryptography with genetic algorithm | |
| CN106485640A (en) | A kind of reversible water mark computational methods based on multi-level IPVO | |
| Yang et al. | Efficient reversible data hiding algorithm based on gradient-based edge direction prediction | |
| CN105227962A (en) | A kind of lossless information concealing method based on data difference | |
| CN105741225A (en) | Reversible watermark method of multi-dimensional prediction error extension | |
| CN104715440A (en) | Remote-sensing image perceptual hash authentication method based on Gabor filter bank and DWT converting | |
| CN103795889B (en) | A kind of based on histogrammic robust steganography transmission method | |
| Niu et al. | Image steganography via fully exploiting modification direction | |
| CN104065969A (en) | Method for hiding high-capacity compression-resisting image information | |
| CN103780913B (en) | A kind of data compression method based on error concealment | |
| CN102194204B (en) | Method and device for embedding and extracting reversible watermarking as well as method and device for recovering image |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |