CN107146191B - Efficient information hiding method introducing auxiliary pixels - Google Patents
Efficient information hiding method introducing auxiliary pixels Download PDFInfo
- Publication number
- CN107146191B CN107146191B CN201710292276.5A CN201710292276A CN107146191B CN 107146191 B CN107146191 B CN 107146191B CN 201710292276 A CN201710292276 A CN 201710292276A CN 107146191 B CN107146191 B CN 107146191B
- Authority
- CN
- China
- Prior art keywords
- pixel
- hiding
- secret information
- auxiliary
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
The invention provides an efficient information hiding method introducing auxiliary pixels, the hiding capacity is irrelevant to the type of original data, the hiding capacity can be image data or other data, the hiding amount is always fixed, the method has large hiding capacity and information safety, and software and hardware are easy to realize. The method realizes the combined processing of the secret information and the secret key through the introduction of the auxiliary pixel and the data optimization, and the receiving end can completely recover the secret information and recover the original data with high quality. The method can hide information in each pixel of original image data, improves hiding efficiency, breaks through the limitation of hiding in one pixel pair (two pixels) of the current method, can reach or exceed 1/2 hiding capacity for any image, recovers carrier image PSNR exceeding 41dB when the carrier image PSNR is hidden in 1/2 capacity, and is superior to typical hiding methods such as LSB and FEMD hiding methods.
Description
Technical Field
The invention relates to a data transmission method, in particular to an efficient information hiding method introducing auxiliary pixels, and belongs to the field of communication (such as data communication technology and the like).
Background
Data transmission and image processing are currently important research topics in the field of communications. With the development of science and technology, people have greater and greater requirements on high-resolution images, and data compression is imperative. Under the condition of not influencing the normal business of the image, if some secret data can be hidden in the image for transmission, certain data compression is equivalently carried out.
Information hiding, also called steganography, can be divided into airspace information hiding, transform domain information hiding and the like, as a new means of satellite covert communication, some important data (such as confidential ground object information obtained by a remote sensing satellite, data generated by the satellite, data uploaded on the ground and the like) can be hidden in satellite remote sensing data and transmitted through a public satellite channel, the purpose of covert communication or transmission efficiency improvement is achieved on the premise of not increasing the transmission rate, and a safe information transmission way is provided for satellite communication.
The spatial steganography method conceals secret information by modifying carrier pixel values. Wherein, the most representative algorithm is the least significant bitThe LSB substitution method directly replaces the lowest r bit of the carrier image pixel to embed information, can obtain higher embedding capacity, but obviously reduces the quality of a dense image along with the increase of the capacity. In order to improve the visual quality of the image, an improved method based on the LSB has been proposed to improve the quality of the secret image while maintaining the same embedding amount. This type of approach uses one pixel to hide the multi-bit secret information. Another class of spatial steganography methods uses one pixel pair (two pixels) to complete information hiding, such as the LSB matching revisited (LSBMR) method, the EMD (exploiting modification direction) hiding method based on direction adjustment, and the Full EMD (FEMD) hiding method. The FEMD method can hide one bit n in one carrier pixel pair (x, y)2The secret information is carried in a system (N belongs to N, N is more than or equal to 2), but the maximum embedding capacity cannot be increased any more.
The FEMD concealment method needs to conceal information in a pixel pair consisting of two pixels, whether the same information can be concealed in one pixel or not is not easy to crack, the concealment capacity performance is superior to that of the LSB concealment method and the FEMD concealment method or the concealment capacity is superior to that of the classical concealment method, and the answer is positive.
Disclosure of Invention
The technical problem solved by the invention is as follows: the defects of the prior art are overcome, and the high-efficiency information hiding method with the introduced auxiliary pixels is provided, so that the same amount of information can be hidden in one pixel without hiding information in one pixel pair (two pixels), the information safety is good, and the method can be used for carrying out high-efficiency information hiding transmission in various data (particularly image data) carriers.
The technical scheme of the invention is as follows: an efficient information hiding method introducing auxiliary pixels comprises the following steps:
1) converting implicit binary secret information to n2Binary secret information, each secret information is s, and the value of s belongs to the set {0,1,2, … n2-1},n≥2；
2) Generating an auxiliary pixel value y, y being [ y0,255-y0]A positive integer of (a), wherein y0Rounding off n/2; each pixel x in the carrier image A is compared withThe auxiliary pixels y form a pixel pair (x, y), and a function value f [ (n-1) × x + n × y ] is obtained through calculation]mod n2；
3) Comparing f with the secret information s to obtain a secret pixel pair (x ', y');
4) if the dense pixel pair (x ', y') overflows, adjusting to obtain a new dense pixel pair (x, y), and then embedding the secret information s again;
5) repeatedly executing the step 3) to the step 4) until all the secret information s is embedded;
6) carrying out lossless compression on all the delta y composition sets to obtain a compressed data set C0;
7) in sequence to produce [ y0,255-y0]Y being an internal positive integer0+1 as auxiliary pixel y, repeating the steps 2) to 6) p times to obtain compressed data sets C1 and C2 … Cp, selecting C with the shortest data length from C0 and C1-Cp, and recording the corresponding optimal auxiliary pixel value y; wherein p is an integer, and p ═ 0 represents no repetition;
8) sending a dense image A 'consisting of all x', a preferred auxiliary pixel y and a compressed data set C to a receiving end;
9) receiving a compressed data set C, decompressing to obtain a delta y set, and obtaining a set of auxiliary pixels y 'by using y, namely y' ═ y + delta y;
10) combining x ' in the dense image A ' and the dense auxiliary pixel y ' into a pixel pair (x ', y ');
11) for each pixel pair (x ', y '), according to s ═ [ (n-1) × + n ═ y ']modn2Extracting each n2Carrying out binary secret information; repeatedly executing until n2The extraction of the binary secret information is finished;
12) n to be extracted2The binary secret information is converted into binary secret information.
n is 2 or 4 or 8 or 16.
The specific process of the step 3) is as follows:
3.1) comparing f with secret information s, if f ═ s, then not changing the pixel pair (x, y), otherwise modifying the pixel pair according to 3.2) rules;
3.2) searching for a pixel pair (x + Δ x, y + Δ y) satisfying f (x + Δ x, y + Δ y) ═ s, and selecting a pixel pair in which the modifier (Δ x, Δ y) is smallest as a dense pixel pair (x ', y').
The specific process of the step 4) is as follows: the specific method for adjusting to obtain the new dense pixel pair (x, y) comprises the following steps:
compared with the prior art, the invention has the beneficial effects that:
the invention provides a high-efficiency information hiding method under the condition of not increasing actual pixels and not changing the data volume of a carrier, introduces a secret key and increases the safety of hidden secret data.
Compared with the prior art, the invention has the following substantive differences and progresses:
(1) according to the method, the auxiliary pixel y is introduced into each pixel in the image, so that information hiding can be performed in each pixel, the problem that information hiding needs to be performed in two data originally is solved, and hiding efficiency is improved.
(2) The method fully utilizes the minimum correction amount of the auxiliary data, optimizes the lossless compression length based on the correction value set, improves the efficiency of hiding the auxiliary pixel pair, and obtains an unexpected hiding effect.
(3) Compared with the EMD hiding method, the method has the advantages that the secret key y is provided while hiding, the difficulty of an unauthorized receiver for cracking the existing secret information is increased, and the hiding effect is kept secret while hiding.
(4) If the auxiliary pixel y is introduced into only one pixel of 2 pixels of the image, the method improves the quality of the carrier image because the modification amount of the original image is small, such as the PSNR value can be improved by 3 dB.
Drawings
Fig. 1(a) to 1(f) are standard grayscale images for simulation.
Detailed Description
At the same time of high-speed data transmission, other low-speed data or part of high-speed data is often transmitted at the same time. In addition to transmitting images, it is also possible to transmit other sensor data. The invention provides a method for data transmission by using an information hiding technology, which has the characteristics of large hiding capacity, high performance and low complexity and has practical value in the aerospace engineering, ground information carrying and transmitting systems and various image transmitting systems.
Experiments using the MATLAB2013a platform, carrier data were taken in 6 standard grayscale images 512 × 512, as shown in fig. 1, and secret information was generated with a pseudo-random number generator. If the algorithm is required to have higher safety, the carrier can be preprocessed by adopting a chaotic sequence or some encryption algorithms.
The invention discloses a high-efficiency information hiding method introducing auxiliary pixels, which comprises the following steps:
1) converting binary secret information into n2Binary secret information, each secret information is s, and the value of s belongs to the set {0,1,2, … n2-1}, n is more than or equal to 2; n may be one of 2,4,8 and 16
2) Generating an auxiliary pixel value y, y being [ y0,255-y0]A positive integer of (a), wherein y0Rounding off n/2;
forming each pixel x and auxiliary pixel y in the carrier image a (with the size of 512 × 512, 8 bits per pixel) into a pixel pair (x, y), and calculating a function value f [ [ (n-1) × x + n × y [ ]]mod n2；
3) Comparing f with the secret information s:
3.1) if f ═ s, then do not change pixel pair (x, y), otherwise modify pixel pair by 3.2) rule;
3.2) searching for a pixel pair (x + Δ x, y + Δ y) satisfying f (x + Δ x, y + Δ y) ═ s, selecting a pixel pair in which the modifier (Δ x, Δ y) is smallest as a dense pixel pair (x ', y');
4) if the dense pixel pair (x ', y') overflows, adjusting according to the formula (1) to obtain new (x, y), and then embedding the secret information s again;
5) repeatedly executing the step 3) to the step 4) until all the secret information s is embedded;
6) carrying out lossless compression on all the delta y composition sets to obtain a compressed data set C0;
7) in sequence to produce [ y0,255-y0]Y being an internal positive integer0+1 as auxiliary pixel y, repeating the steps 2) to 6) p times to obtain compressed data sets C1 and C2 … Cp, selecting C with the shortest data length from C0 and C1-Cp, and recording the corresponding optimal auxiliary pixel value y; p ═ 0 denotes no repetition;
in this example, p is 0;
8) sending a dense image A 'consisting of all x', a preferred auxiliary pixel y and a compressed data set C to a receiving end;
9) receiving a compressed data set C, decompressing to obtain a delta y set, and obtaining a set of auxiliary pixels y 'by using y, namely y' ═ y + delta y;
10) combining x ' in the dense image A ' and the dense auxiliary pixel y ' into a pixel pair (x ', y ');
11) for each pixel pair (x ', y'), according to the formula s ═ n-1 ═ x '+ n ═ y']modn2Extracting each n2Carrying out binary secret information; repeatedly executing until n2The extraction of the binary secret information is finished;
12) n to be extracted2The binary secret information is converted into binary secret information. n is2One of 4,16,64 and 256 is taken.
Performance simulation of the invention
The performance of the concealment algorithm is measured by using the Peak Signal to Noise Ratio (PSNR), the concealment capacity C, the embedding rate E, and other indexes. H, W is a positive integer for an 8bit digital image of size H W; PSNR is defined as follows:
in the formula, MSE is the mean square error between the original image and the dense image, and the calculation formula is
Where x isij,
Respectively, the pixel values at (i, j) of the original image and the secret image.
Hidden capacity, embedding rate improvement percentage
T＝(V2-V1)/V1*100％＝(U2-U1)/U1*100％ (2)
In the formula, V1 represents the embedding rate of the comparative method, and V2 represents the embedding rate of the present invention; u1 denotes hiding capacity for the comparative method and U2 denotes hiding capacity for the present invention.
Hidden capacity U: the number of hidden bits per pixel (8 bits) (bpp), i.e. Q bits are hidden in Z bits, the hidden capacity U is 8 × Q/Z bpp.
Embedding rate V: relative hidden capacity or relative hidden capacity value V, the ratio of the number of hidden bits to the number of carrier bits, e.g. if Q bits are hidden in Z bits, then the relative hidden capacity is V ═ Q/Z.
1) Embedding rate and hidden capacity comparison
In the FEMD method, the parameter n influences the information hiding capacity and the embedding rate, and the embedding rate can be further improved by adding auxiliary pixels and optimizing.
The FEMD method hides one n in 2 pixels (8 bits each and 16 bits in total)2Carry number, bit number K log2(n2) (ii) a Hidden capacity U1 is 8K/16 is K/2bpp, and embedding rate V1 is K/16;
the invention hides one n in 1 pixel (8 bit) and 1 auxiliary pixel modifier d bit on average2Carry number, bit number K log2(n2) (ii) a Hidden capacity U2 ═ 8K/(8+ d) bpp, embedding rate
V2＝K/(8+d)，d<8；
Table 1 shows the comparison results of the hidden capacity and the embedding rate of the two methods under different n values, and it can be seen that the hidden capacity U and the embedding rate V of the two methods both increase with the increase of n, when the value of n increases from 2 to 16, the hidden capacity of the FEMD method increases from 1bpp to 4bpp, and the hidden capacity of the present invention increases from 1.6bpp to 4.9 bpp; the embedding rate of the FEMD method increased from 1/8 to 1/2, while the minimum embedding rate of the inventive method increased from 1/5 to 8/13, which was greater than 1/2.
Compared with FEMD, the minimum hiding capacity and the embedding rate of the method are improved by 23-60%. This is because the value y of the auxiliary pixel is the same for the same carrier, and the number of bits of the auxiliary pixel after embedding the secret information is determined only by its modifier and can be (1+ log)2n) bits, the number of bits is significantly less than 8 bits.
TABLE 1 hidden capacity U and embedding rate V of two methods for different n-value conditions
Note: the optimal compression is not considered when the hidden capacity U and the embedding rate V are calculated, and the coding bit number of the auxiliary pixel after embedding the secret information after considering the optimal compression is only determined by the modification quantity of the auxiliary pixel and does not use (1+ log) at all2n) bits indicate that the average bit number is much smaller than 8 bits of the carrier, and the total bit number after compression may be reduced by several times to 100 times, even thousands of times, if the modifier of the auxiliary pixel y is 0, the amount of compressed auxiliary data is small, which is equivalent to d being 0. The hidden capacity can even be up to 2 times the original capacity.
2) PSNR comparison
In order to measure the improvement degree of the present invention in terms of image quality, table 2 shows the image quality obtained by the present invention and the FEMD method respectively under different embedding rates V. Overall, the PSNR of the present invention is higher than that of FEMD method for the same or higher embedding rate or hidden capacity, e.g. the average PSNR is improved from 34.84dB to 41.97dB, and the average PSNR is improved by 7.13dB for the same embedding rate (1/2).
In addition, the PSNR of the present invention is as high as 35.71dB even when 8/13 (greater than 1/2) secret information is embedded, indicating that the method is an efficient information hiding algorithm, and that the security of the secret information can be guaranteed by using the auxiliary pixel value as a key.
TABLE 2 two methods PSNR (dB) for different embedding rates
3) Compared with other similar methods
In order to compare the algorithm with other similar methods and compare the Lena image hiding effect, the invention can realize more information hiding with different embedding rates, and the PSNR of the invention is superior to the LSB method, for example, when n is 2, the PSNR is increased by at least 2.0 dB.
The reason for the improvement of image quality is that the present invention can greatly improve the information embedding rate by adding the auxiliary pixel, and compared to the FEMD method, when embedding the secret information of the same proportion, the present invention needs to use the pixel with a lower proportion, and thus the modification rate of the carrier is reduced.
In summary, the invention provides an efficient information hiding method introducing auxiliary pixels, the hiding capacity is independent of the type of original data, can be image data or other data, the hiding amount is always fixed, and the method has large hiding capacity and information security and is easy to realize by software and hardware. It is characterized in that: the method realizes the combined processing of the secret information and the secret key through the introduction of the auxiliary pixel and the data optimization, and the receiving end can completely recover the secret information and recover the original data with high quality.
The method can hide information in each pixel of original image data, improves hiding efficiency, breaks through the limitation of hiding in one pixel pair (two pixels) of the existing method, can reach or exceed 1/2 hiding capacity for any image, recovers carrier image PSNR exceeding 41dB when the hiding capacity is 1/2, and has performance superior to typical hiding methods such as LSB and FEMD hiding methods.
The invention is not described in detail and is within the knowledge of a person skilled in the art.
Claims (3)
1. An efficient information hiding method introducing auxiliary pixels is characterized by comprising the following steps:
1) converting implicit binary secret information to n2The secret information of the system, each secret information is s, the value of s belongs to the set of 0,1,2,…n2-1},n≥2；
2) generating an auxiliary pixel value y, y being [ y0,255-y0]A positive integer of (a), wherein y0Rounding off n/2; forming each pixel x and the auxiliary pixel y in the carrier image A into a pixel pair (x, y), and calculating to obtain a function value f [ [ (n-1) × x + n × y)]mod n2；
3) Comparing f with the secret information s to obtain a secret pixel pair (x ', y'), which comprises the following specific processes:
3.1) comparing f with secret information s, if f ═ s, then not changing the pixel pair (x, y), otherwise modifying the pixel pair according to 3.2) rules;
3.2) searching for a pixel pair (x + Δ x, y + Δ y) satisfying f (x + Δ x, y + Δ y) ═ s, selecting a pixel pair in which the modifier (Δ x, Δ y) is smallest as a dense pixel pair (x ', y');
4) if the dense pixel pair (x ', y') overflows, adjusting to obtain a new dense pixel pair (x, y), and then embedding the secret information s again;
5) repeatedly executing the step 3) to the step 4) until all the secret information s is embedded;
6) carrying out lossless compression on all the delta y composition sets to obtain a compressed data set C0;
7) in sequence to produce [ y0,255-y0]Y being an internal positive integer0+1 as auxiliary pixel y, repeating the steps 2) to 6) p times to obtain compressed data sets C1 and C2 … Cp, selecting C with the shortest data length from C0 and C1-Cp, and recording the corresponding optimal auxiliary pixel value y; wherein p is an integer, and p ═ 0 represents no repetition;
8) sending a dense image A 'consisting of all x', a preferred auxiliary pixel y and a compressed data set C to a receiving end;
9) receiving a compressed data set C, decompressing to obtain a delta y set, and obtaining a set of auxiliary pixels y 'by using y, namely y' ═ y + delta y;
10) combining x ' in the dense image A ' and the dense auxiliary pixel y ' into a pixel pair (x ', y ');
11) for each pixel pair (x ', y '), according to s ═ [ (n-1) × + n ═ y ']modn2Extracting each n2Carrying out binary secret information; repeating receiptLine up to n2The extraction of the binary secret information is finished;
12) n to be extracted2The binary secret information is converted into binary secret information.
2. A method for efficient information hiding with the introduction of auxiliary pixels as claimed in claim 1, characterized by: n is 2 or 4 or 8 or 16.
3. A method for efficient information hiding with the introduction of auxiliary pixels as claimed in claim 2, characterized by: the specific process of the step 4) is as follows: the specific method for adjusting to obtain the new dense pixel pair (x, y) comprises the following steps:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710292276.5A CN107146191B (en) | 2017-04-28 | 2017-04-28 | Efficient information hiding method introducing auxiliary pixels |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710292276.5A CN107146191B (en) | 2017-04-28 | 2017-04-28 | Efficient information hiding method introducing auxiliary pixels |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107146191A CN107146191A (en) | 2017-09-08 |
| CN107146191B true CN107146191B (en) | 2020-05-08 |
Family
ID=59774549
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710292276.5A Active CN107146191B (en) | 2017-04-28 | 2017-04-28 | Efficient information hiding method introducing auxiliary pixels |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107146191B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107911574A (en) * | 2017-11-20 | 2018-04-13 | 西南大学 | A kind of dual image information concealing method |
| CN108629749B (en) * | 2018-04-26 | 2021-10-01 | 西安空间无线电技术研究所 | Method for combining image compression and hiding |
| CN115396676B (en) * | 2022-07-28 | 2024-03-26 | 西安空间无线电技术研究所 | Encryption domain satellite image information hiding method |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101452569B (en) * | 2008-12-05 | 2010-08-25 | 江南大学 | Processing method of image latent writing based on auxiliary pixel |
| CN103810665A (en) * | 2012-11-15 | 2014-05-21 | 中兴通讯股份有限公司 | Information hiding and extracting method and device |
| CN103442156A (en) * | 2013-08-20 | 2013-12-11 | 宁波大学 | Image steganography and secret information extraction method based on intelligent mobile terminal |
| CN103413269A (en) * | 2013-08-20 | 2013-11-27 | 宁波大学 | Image steganography method and secret information extraction method |
| CN103780913B (en) * | 2014-01-24 | 2017-01-04 | 西安空间无线电技术研究所 | A kind of data compression method based on error concealment |
| CN105956990B (en) * | 2016-04-27 | 2019-10-15 | 广西财经学院 | A kind of universal large capacity image lossless Information Hiding Algorithms |
-
2017
- 2017-04-28 CN CN201710292276.5A patent/CN107146191B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107146191A (en) | 2017-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lee et al. | High-payload image hiding with quality recovery using tri-way pixel-value differencing | |
| Chang et al. | A reversible data hiding scheme for VQ indices using locally adaptive coding | |
| CN103426141B (en) | A kind of image content authentication method and system | |
| Darbani et al. | A new steganography method for embedding message in JPEG images | |
| CN107146191B (en) | Efficient information hiding method introducing auxiliary pixels | |
| CN105791854B (en) | A kind of combination improves the singular value modification video steganographic algorithm of matrix coder | |
| CN108648761B (en) | Method for embedding blockchain account book in audio digital watermark | |
| CN109447885B (en) | Robust image steganography method based on DCT coefficient difference | |
| Pramanik et al. | Application of steganography in symmetric key cryptography with genetic algorithm | |
| Wang et al. | A survey on digital image steganography | |
| CN103414840A (en) | Data hiding method based on image set | |
| Xuan et al. | High capacity lossless data hiding based on integer wavelet transform | |
| Kumar et al. | A reversible high capacity data hiding scheme using combinatorial strategy | |
| CN107622469B (en) | Quaternion wavelet transform-based image carrier-free information hiding method | |
| Jain et al. | Efficient data hiding scheme using lossless data compression and image steganography | |
| CN108521535B (en) | A kind of Information hiding transmission method based on image blend processing | |
| CN107358568B (en) | Noise-disguised image information hiding transmission method | |
| CN113923312A (en) | Digital image coding layer robust reversible watermarking method based on wireless communication | |
| Singh et al. | A recent survey on data hiding techniques | |
| US20020051559A1 (en) | Application of bit-plane decomposition steganography to progressively compressed data | |
| Yang | Robust Watermarking Scheme Based on Radius Weight Mean and Feature‐Embedding Technique | |
| Malik et al. | A high capacity data hiding scheme using modified AMBTC compression technique. | |
| Lee et al. | A data hiding scheme based on turtle-shell for AMBTC compressed images | |
| Mazumder et al. | A high capacity and secured color image steganographic technique using discrete wavelet transformation | |
| CN107135391A (en) | A kind of video-aware hash algorithm for H.264 compression domain |
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 |