CN104050624B - A kind of digital picture steganography method - Google Patents
A kind of digital picture steganography method Download PDFInfo
- Publication number
- CN104050624B CN104050624B CN201410277228.5A CN201410277228A CN104050624B CN 104050624 B CN104050624 B CN 104050624B CN 201410277228 A CN201410277228 A CN 201410277228A CN 104050624 B CN104050624 B CN 104050624B
- Authority
- CN
- China
- Prior art keywords
- image
- secret information
- pixel value
- histogram
- carrier image
- 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
Landscapes
- Image Processing (AREA)
Abstract
The present invention relates to a kind of digital picture steganography method, for inserting secret information in the carrier image C that size is M × N, the method that the present invention is provided can all change to the histogram of hidden image to be compensated, finally make the histogram and initial carrier image histogram of hidden image very nearly the same, Chi-square statistic, RS analyses, the analysis detection of hidden image first-order statistics can be resisted, keep less relative entropy, i.e. Steganography system that there is higher security simultaneously.
Description
Technical field
The present invention relates to a kind of digital picture steganography method for changing profit and loss compensation.
Background technology
Steganography is using the redundancy and human sensory's redundancy in the multimedias such as text, sound, image and video, letter
Breath is hidden in multimedia, the covert communications for being sent out and being realized by public network.Steganography not only conceals communication
Content, while the fact that conceal communication.Due to a large amount of presence of network epigraph and the redundancy of view data it is big, can be embedding
Enter secret information capacity it is also big the features such as, the Steganography of current main flow is using image as carrier.Sentience is not steganography
The important characteristic of art, is also transparent or anti-detection performance.It sentience or does not count not sentience comprising vision,
By improving Steganography implementation method, either select suitable steganography carrier or improve between carrier image and secret information
Matching relationship, the not sentience of Steganography can be improved.
Steganography is different from conventional encryption technique, and encryption technology is, using cryptography as theoretical foundation, plaintext to be encrypted
Change brings Communication hiding content, it is difficult to cover the fact that communication occurs, and ciphertext transmission easily causes the suspection of enemy, and then may
It is trapped, attack or decodes.Steganography compensate for the concealed deficiency of cryptographic technique, and it is by the way that Content of Communication is hidden in confidence
Ensconce and transmitted in open carrier media, to cover the fact that really communication objective and communication occurs.Steganography and password
Be not competitive relation, and the two can be complementary to one another, and be further ensured that the security of covert communications.
It is LSB methods and LSB Matching methods that more two methods are applied in existing image latent writing method.
LSB (Least Significant Bit) method is simplest image latent writing method in Space domain, by Trikel et al.
Proposed in 1993.The pixel value (by taking the gray level image of 8 as an example) of image is divided into 8 planes, each plane by this method
Influence to picture quality is different, plane represented from highest order to lowest order, respectively the binary pixel values of 8 from height to
It is low；Influence successively to picture quality declines successively from high to low, and the minimum several changes to overall picture quality act on very little.
Therefore replace the pixel value of the unessential position of these in image with secret information, this is the core telescopiny of LSB methods.Embedding
During entering, can sequentially it be embedded in or random interval insertion.Due to the characteristic of the single parity value conversion of LSB algorithms, make
Its security is reduced, it is impossible to resist the analysis method such as Chi-square statistic and RS attacks, and its robustness is very poor, while but this side
Sentience is not good for the close image of load that method is obtained, and embedded information content is larger, but detected and found by histogram, this method
Anti-attack ability is weak.
In order to resist the methods such as Chi-square Test, it is thus proposed that LSB matching methods, LSB matching methods are basic
It is upper similar to LSB methods, last processing mode is only changed, if the pixel value of the bit of secret information and embedded point is minimum
Position is identical, then original pixel value is constant, if it is different, then Jia one at random by the pixel value of embedded point or subtracting one.LSB matching sides
Although method efficiently avoid the odd even asymmetry of LSB methods, but this algorithm existing defects on histogram retention performance,
Steganography is carried out to image with the algorithm, histogrammic change can be made clearly, easily by the parser for property of the histogram
Attack.In order to keep histogrammic change, Zhang Xinpeng etc. proposes the methods such as nonlinear optimization, but the algorithm of these methods is multiple
Miscellaneous degree is higher.
The content of the invention
The technical problems to be solved by the invention are to provide one kind for above-mentioned prior art property of the histogram can be made basic
Keep constant digital picture steganography method.
The present invention solve the technical scheme that is used of above-mentioned technical problem for：A kind of digital picture steganography method, for
Size is inserts secret information in M × N carrier image C, and the secret information of insertion is designated as mI, jIn ∈ [0,1], carrier image C
Pixel value be cI, j∈ [0,255], lI, j∈ [0,1] is cI, jLowest order, insertion secret information after image be referred to as hidden image
S is designated as, wherein, i=0,1 ..., M-1, j=0,1 ..., N-1, it is characterised in that：
Before secret information insertion vector image, first a histogram is set to change tracker h [n], n ∈ [0,255],
Histogram changes tracker h [n] and causes carrier image histogram to change profit and loss after secret information insertion vector image for recording
Situation, for all n, h [n] initial value is 0 before no progress secret information insertion；
During secret information insertion vector image C, point following three kinds of situations are handled respectively：
(1), when the pixel value for being inserted into carrier image C midpoints is 255, i.e. cI, j=255, now, cI, jLowest order
lI, j=1；As the secret information m of insertionI, jFor 0 when, the pixel value of the point subtracts 1 processing, i.e. sI, j=cI, j- 1, obtain 254 conducts
The pixel value of the hidden image S points, with season h [254]=h [254]+1, makes h [255]=h [255] -1；When the secret of insertion
When information is 1, pixel values of the carrier image C at this does not make any changes；
(2), when the pixel value for being inserted into carrier image C midpoints is 0, i.e. cI, j=0, now, cI, jLowest order lI, j=
0；As the secret information m of insertionI, jFor 0 when, the pixel value of the carrier image C points does not make any changes, when the secret information of insertion
mI, jFor 1 when, the pixel value of the point adds 1 processing, i.e. sI, j=cI, j+ 1, obtain 1 as the hidden image S points pixel value, simultaneously
H [0]=h [0] -1 is made, h [1]=h [1]+1 is made；
(3), when being inserted into carrier image C midpoint cI, jPixel value be 0 or 255 other values when, compare cI, jMost
Low level lI, jWith the secret information m of insertionI, j；
Work as lI, j=mI, jWhen, the pixel value of the carrier image C points does not make any changes；
Work as lI, j≠mI, j, judge h [cI, j+ 1] with h [cI, j- 1] size：
If h [cI, j+ 1] ＞ h [cI, j- 1], i.e. histogram changes tracker and records secret information and be embedded into current picture
With following profit and loss situation during vegetarian refreshments：Pixel value is cI, jIt is c that+1 histogram, which changes than pixel value,I, j- 1 histogram changes
There are more surpluses, either less loss or cI, j+ 1 histogram, which changes, surplus, and cI, jAt -1 histogram change
In lossing state, then make then sI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, such pixel value is cI, j- 1
Histogrammic loss situation is compensated or should not cause c in timeI, jIt is excessive that+1 histogram changes surplus；Refresh c simultaneouslyI, j
Change situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1] ＜ h [cI, j- 1], then profit and loss situation is just in contrast with the above, then make sI, j=cI, j+ 1, simultaneously
Make h [cI, j+ 1]=h [cI, j+ 1]+1, such cI, j+ 1 histogrammic loss situation is compensated or should not caused in time
cI, j- 1 histogram change surplus is excessive, while refreshing cI, jChange situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1]=h [cI, j- 1], at random using following a processing modes or b processing modes：
A processing modes：sI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, then refresh cI, jChange feelings
Condition：h[cI, j]=h [cI, j] -1,
B processing modes：sI, j=cI, j+ 1, with season h [cI, j+ 1]=h [cI, j+ 1]+1, then refresh cI, jChange feelings
Condition：h[cI, j]=h [cI, j]-1。
Compared with prior art, the advantage of the invention is that：In insertion secret information every time, the method that the present invention is provided
The histogram of hidden image will be changed and compensated, finally make the histogram and initial carrier image histogram of hidden image
It is very nearly the same, Chi-square statistic, RS analyses, the analysis detection of hidden image first-order statistics can be resisted, while less relative entropy is kept,
I.e. Steganography system has higher security.
Embodiment
The present invention is described in further detail below in conjunction with accompanying drawing embodiment.
The invention provides a kind of digital picture steganography method, for inserting secret in the carrier image C that size is M × N
Confidential information, the secret information of insertion is designated as mI, jPixel value in ∈ [0,1], carrier image C is cI, j∈ [0,255], lI, j∈
[0,1] it is cI, jLowest order, image is referred to as hidden image and is designated as S after insertion secret information, wherein, i=0,1 ..., M-1, j
=0,1 ..., N-1, before secret information insertion vector image, first sets a histogram to change tracker h [n], n ∈
[0,255], histogram, which changes tracker h [n], to be used to cause carrier image histogram after recording secret information insertion vector image
Change the situation of profit and loss, for all n, h [n] initial value is 0 before no progress secret information insertion；
During the information insertion vector image C of secret number image, point following three kinds of situations are handled respectively：
During secret information insertion vector image C, point following three kinds of situations are handled respectively：
(1), when the pixel value for being inserted into carrier image C midpoints is 255, i.e. cI, j=255, now, cI, jLowest order
lI, j=1；As the secret information m of insertionI, jFor 0 when, the pixel value of the point subtracts 1 processing, i.e. sI, j=cI, j- 1, obtain 254 conducts
The pixel value of the hidden image S points, with season h [254]=h [254]+1, makes h [255]=h [255] -1；When the secret of insertion
When information is 1, pixel values of the carrier image C at this does not make any changes；
(2), when the pixel value for being inserted into carrier image C midpoints is 0, i.e. cI, j=0, now, cI, jLowest order lI, j=
0；As the secret information m of insertionI, jFor 0 when, the pixel value of the carrier image C points does not make any changes, when the secret information of insertion
mI, jFor 1 when, the pixel value of the point adds 1 processing, i.e. sI, j=cI, j+ 1, obtain 1 as the hidden image S points pixel value, simultaneously
H [0]=h [0] -1 is made, h [1]=h [1]+1 is made；
(3), when being inserted into carrier image C midpoint cI, jPixel value be 0 or 255 other values when, compare cI, jMost
Low level lI, jWith the secret information m of insertionI, j；
Work as lI, j=mI, jWhen, the pixel value of the carrier image C points does not make any changes；
Work as lI, j≠mI, j, judge h [cI, j+ 1] with h [cI, j- 1] size：
If h [cI, j+ 1] ＞ h [cI, j- 1], i.e. histogram changes tracker and records secret information and be embedded into current picture
With following profit and loss situation during vegetarian refreshments：Pixel value is cI, jIt is c that+1 histogram, which changes than pixel value,I, j- 1 histogram changes
There are more surpluses, either less loss or cI, j+ 1 histogram, which changes, surplus, and cI, jAt -1 histogram change
In lossing state, then make then sI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, such pixel value is cI, j- 1
Histogrammic loss situation is compensated or should not cause c in timeI, jIt is excessive that+1 histogram changes surplus；Refresh c simultaneouslyI, j
Change situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1] ＜ h [cI, j- 1], then profit and loss situation is just in contrast with the above, then make sI, j=cI, j+ 1, simultaneously
Make h [cI, j+ 1]=h [cI, j+ 1]+1, such cI, j+ 1 histogrammic loss situation is compensated or should not caused in time
cI, j- 1 histogram change surplus is excessive, while refreshing cI, jChange situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1]=h [cI, j- 1], at random using following a processing modes or b processing modes：
A processing modes：sI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, then refresh cI, jChange feelings
Condition：h[cI, j]=h [cI, j] -1,
B processing modes：sI, j=cI, j+ 1, with season h [cI, j+ 1]=h [cI, j+ 1]+1, then refresh cI, jChange feelings
Condition：h[cI, j]=h [cI, j]-1。。
Claims (1)
1. a kind of digital picture steganography method, in size for M × N carrier image C in insert secret information, insertion it is secret
Confidential information is designated as mI, jPixel value in ∈ [0,1], carrier image C is cI, j∈ [0,255], lI, j∈ [0,1] is cI, jIt is minimum
Image is referred to as hidden image and is designated as S after position, insertion secret information, wherein, i=0,1,2 ... M-1, j=0,1,2 ... N-1, its
It is characterised by：
Before secret information insertion vector image, first a histogram is set to change tracker h [n], n ∈ [0,255], Nogata
Figure, which changes tracker h [n], is used to record the shape for causing carrier image histogram to change profit and loss after secret information insertion vector image
Condition, for all n, h [n] initial value is 0 before no progress secret information insertion；
During secret information insertion vector image C, point following three kinds of situations are handled respectively：
(1), when the pixel value for being inserted into carrier image C midpoints is 255, i.e. cI, j=255, now, cI, jLowest order lI, j=
1；As the secret information m of insertionI, jFor 0 when, the pixel value of the point subtracts 1 processing, i.e. sI, j=cI, j- 1,254 are obtained as steganography figure
As the pixel value of the S points, with season h [254]=h [254]+1, h [255]=h [255] -1 is made；When the secret information of insertion is 1
When, pixel values of the carrier image C at this does not make any changes；
(2), when the pixel value for being inserted into carrier image C midpoints is 0, i.e. cI, j=0, now, cI, jLowest order lI, j=0；When
The secret information m of insertionI, jFor 0 when, the pixel value of the carrier image C points does not make any changes, as the secret information m of insertionI, j
For 1 when, the pixel value of the point adds 1 processing, i.e. sI, j=cI, j+ 1, obtain 1 as the hidden image S points pixel value, with season h
[0]=h [0] -1, makes h [1]=h [1]+1；
(3), when being inserted into carrier image C midpoint cI, jPixel value be 0 or 255 other values when, compare cI, jLowest order
lI, jWith the secret information m of insertionI, j；
Work as lI, j=mI, jWhen, the pixel value of the carrier image C points does not make any changes；
Work as lI, j≠mI, j, judge h [cI, j+ 1] with h [cI, j- 1] size：
If h [cI, j+ 1] ＞ h [cI, j- 1], s is madeI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, refresh simultaneously
cI, jChange situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1] ＜ h [cI, j- 1], s is madeI, j=cI, j+ 1, with season h [cI, j+ 1]=h [cI, j+ 1]+1, refresh simultaneously
cI, jChange situation：h[cI, j]=h [cI, j]-1；
If h [cI, j+ 1]=h [cI, j- 1], at random using following a processing modes or b processing modes：
A processing modes：sI, j=cI, j- 1, with season h [cI, j- 1]=h [cI, j- 1]+1, then refresh cI, jChange situation：h
[cI, j]=h [cI, j] -1,
B processing modes：sI, j=cI, j+ 1, with season h [cI, j+ 1]=h [cI, j+ 1]+1, then refresh cI, jChange situation：h
[cI, j]=h [cI, j]-1。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410277228.5A CN104050624B (en) | 2014-06-20 | 2014-06-20 | A kind of digital picture steganography method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410277228.5A CN104050624B (en) | 2014-06-20 | 2014-06-20 | A kind of digital picture steganography method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104050624A CN104050624A (en) | 2014-09-17 |
| CN104050624B true CN104050624B (en) | 2017-10-24 |
Family
ID=51503416
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410277228.5A Active CN104050624B (en) | 2014-06-20 | 2014-06-20 | A kind of digital picture steganography method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104050624B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108898537B (en) * | 2018-04-03 | 2019-07-16 | 宁波大学 | A kind of digital picture steganography method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1920877A (en) * | 2006-09-19 | 2007-02-28 | 北京邮电大学 | Statistic supervision and structure supervision based hidden messages analysis system |
| CN1936956A (en) * | 2006-09-19 | 2007-03-28 | 北京邮电大学 | Recessive writing detection method in the light of DCT zone LSB recessive writing |
| CN101022332A (en) * | 2006-02-16 | 2007-08-22 | 刘粉林 | Antistatistical analysis image LSB information hiding method based on chaos system |
| CN102147913A (en) * | 2011-04-11 | 2011-08-10 | 北京航空航天大学 | Steganalysis method based on image smoothness variation characteristics |
| CN103413269A (en) * | 2013-08-20 | 2013-11-27 | 宁波大学 | Image steganography method and secret information extraction method |
-
2014
- 2014-06-20 CN CN201410277228.5A patent/CN104050624B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101022332A (en) * | 2006-02-16 | 2007-08-22 | 刘粉林 | Antistatistical analysis image LSB information hiding method based on chaos system |
| CN1920877A (en) * | 2006-09-19 | 2007-02-28 | 北京邮电大学 | Statistic supervision and structure supervision based hidden messages analysis system |
| CN1936956A (en) * | 2006-09-19 | 2007-03-28 | 北京邮电大学 | Recessive writing detection method in the light of DCT zone LSB recessive writing |
| CN102147913A (en) * | 2011-04-11 | 2011-08-10 | 北京航空航天大学 | Steganalysis method based on image smoothness variation characteristics |
| CN103413269A (en) * | 2013-08-20 | 2013-11-27 | 宁波大学 | Image steganography method and secret information extraction method |
Non-Patent Citations (5)
| Title |
|---|
| Histogram-Preserving Steganography Using Maximum Flow Algorithms;Wanqi Li等;《2011 Second International Conference on Digital Manufacturing & Automation》;20111231;第590-593页 * |
| The Image Steganography Method Based on the Nonlinear Optimization;Yu Chen等;《Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering》;20131231;第539-542页 * |
| 基于图像特征的隐写术载体图像的选择;杨任尔;《光电子激光》;20140430;第25卷(第4期);正文第2节 * |
| 抗统计分析的LSB密写方案;张新鹏等;《中国图象图形学报》;20030930;第8卷(第9期);第1055-1060页 * |
| 最小直方图失真（LHA）密写设计;谢晓天;《中国优秀硕士学位论文全文数据库 信息科技辑》;20080715;正文第3.1节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104050624A (en) | 2014-09-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Swain | High capacity image steganography using modified LSB substitution and PVD against pixel difference histogram analysis | |
| Tseng et al. | A secure data hiding scheme for binary images | |
| Al-Shaarani et al. | Securing matrix counting-based secret-sharing involving crypto steganography | |
| Rawat et al. | A steganography technique for hiding image in an image using lsb method for 24 bit color image | |
| Balasubramanian et al. | High payload image steganography with reduced distortion using octonary pixel pairing scheme | |
| Sajasi et al. | An adaptive image steganographic scheme based on noise visibility function and an optimal chaotic based encryption method | |
| Lee et al. | A novel data hiding scheme based on modulus function | |
| Zhang et al. | A novel encryption frame for medical image with watermark based on hyperchaotic system | |
| Li et al. | A modified reversible data hiding in encrypted images using random diffusion and accurate prediction | |
| Pradhan et al. | Adaptive PVD steganography using horizontal, vertical, and diagonal edges in six‐pixel blocks | |
| Arun et al. | Design of image steganography using LSB XOR substitution method | |
| Chang et al. | A sudoku-based secret image sharing scheme with reversibility | |
| Xu et al. | Separable reversible data hiding in encrypted images based on two‐dimensional histogram modification | |
| US20230005094A1 (en) | Digital watermarking | |
| Li et al. | Reversible data hiding in block compressed sensing images | |
| KR20090104349A (en) | Wartermark insertion/detection apparatus and method thereof | |
| CN107169911A (en) | A kind of image encryption method converted based on Arnold transformation | |
| CN104050624B (en) | A kind of digital picture steganography method | |
| Liu et al. | Blockchain privacy data protection method based on HEVC video steganography | |
| CN114826730B (en) | Blockchain covert communication model capable of hiding sensitive document and sender identity | |
| Khan et al. | Advancements in reversible data hiding in encrypted images using public key cryptography | |
| Sirsikar et al. | Analysis of data hiding using digital image signal processing | |
| Swain | Advanced Digital Image Steganography Using LSB, PVD, and EMD: Emerging Research and Opportunities: Emerging Research and Opportunities | |
| Tsai et al. | A Steganographic Method by Pixel–Value Differencing and Exploiting Modification Direction | |
| Hong | Human visual system based data embedding method using quadtree partitioning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201204 Address after: Room 1,020, Nanxun Science and Technology Pioneering Park, No. 666 Chaoyang Road, Nanxun District, Huzhou City, Zhejiang Province, 313000 Patentee after: Huzhou You Yan Intellectual Property Service Co.,Ltd. Address before: 315211 Zhejiang Province, Ningbo Jiangbei District Fenghua Road No. 818 Patentee before: Ningbo University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211110 Address after: 276800 Room 302, floor 3, plant A6, electronic information industrial park, Gaoxin seventh Road, high tech Zone, Rizhao City, Shandong Province Patentee after: Chuangkebang (Shandong) Technology Service Co.,Ltd. Address before: 313000 room 1020, first floor, Nanxun science and technology entrepreneurship Park, No. 666, Chaoyang Road, Nanxun Town, Nanxun District, Huzhou City, Zhejiang Province Patentee before: Huzhou You Yan Intellectual Property Service Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221125 Address after: 276800 No. 511, Shandong Road, hi tech Zone, Rizhao City, Shandong Province (first floor and second floor of municipal entrepreneurship and Innovation Incubation Service Center) Patentee after: Shandong Guanghui Human Resource Technology Co.,Ltd. Address before: Room 302, 3 / F, building A6, electronic information industrial park, Gaoxin 7th Road, high tech Zone, Rizhao City, Shandong Province Patentee before: Chuangkebang (Shandong) Technology Service Co.,Ltd. |
|
| TR01 | Transfer of patent right |