CN107146191A - A kind of efficient information hidden method for introducing auxiliary pixel - Google Patents

A kind of efficient information hidden method for introducing auxiliary pixel Download PDF

Info

Publication number
CN107146191A
CN107146191A CN201710292276.5A CN201710292276A CN107146191A CN 107146191 A CN107146191 A CN 107146191A CN 201710292276 A CN201710292276 A CN 201710292276A CN 107146191 A CN107146191 A CN 107146191A
Authority
CN
China
Prior art keywords
pixel
hidden
secret information
information
mrow
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
Application number
CN201710292276.5A
Other languages
Chinese (zh)
Other versions
CN107146191B (en
Inventor
周诠
刘娟妮
张释如
呼延烺
魏佳圆
尚社
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Institute of Space Radio Technology
Original Assignee
Xian Institute of Space Radio Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xian Institute of Space Radio Technology filed Critical Xian Institute of Space Radio Technology
Priority to CN201710292276.5A priority Critical patent/CN107146191B/en
Publication of CN107146191A publication Critical patent/CN107146191A/en
Application granted granted Critical
Publication of CN107146191B publication Critical patent/CN107146191B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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 present invention proposes a kind of efficient information hidden method for introducing auxiliary pixel, and hidden capacity is unrelated with the type of initial data, can be view data, can also be other data, hiding amount is fixed all the time, with big hidden capacity and Information Security, and is easy to software and hardware realization.This method realizes the Combined Treatment of secret information and key by the introducing of auxiliary pixel and data-optimized, and receiving terminal can Restore Secret information and high quality resume initial data completely.This method can carry out Information hiding in each pixel of raw image data, improve hiding efficiency, breach the limitation that current method is hidden in a pixel is to (two pixels), 1/2 hidden capacity can be met or exceeded to arbitrary image, recover carrier image PSNR during 1/2 hidden capacity more than 41dB, better than typical hidden method such as LSB and FEMD hidden methods.

Description

A kind of efficient information hidden method for introducing auxiliary pixel
Technical field
The present invention relates to a kind of method of data transfer, more particularly to a kind of efficient information for introducing auxiliary pixel hides side Method, belongs to communication (such as data communication technology) field.
Background technology
Data transfer 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.In the case where not influenceing image regular traffic, if Some secret datas can be hidden wherein to be transmitted, then equivalent to having carried out certain data compression.
Information hiding, alternatively referred to as steganography, can be divided into spatial information (si) is hidden and transform domain information is hidden etc., hidden as satellite The new tool of communication is covered, can be by some significant datas (secret terrestrial object information, the satellite itself obtained such as remote sensing satellite is produced Data that data, ground are uploaded etc.) it is hidden in satellite remote sensing date and is transmitted by disclosed satellite channel, do not increasing transmission Covert communications are reached on the premise of speed or the purpose of efficiency of transmission is improved, a kind of safe information transfer is provided for satellite communication Approach.
Spatial domain steganography method hides secret information by changing carrier pixel value.Wherein, most representational algorithm is Least significant bit LSB methods of substitution, this method directly replace carrier image pixel minimum r carry out embedding information, can obtain compared with High embedding capacity, but it is obvious with the increase stego-image Quality Down of capacity.In order to improve the visual quality of image, someone The improved method based on LSB is proposed, in the case where keeping equal embedded quantity, the quality containing secret image is improved.This kind of method All it is to hide multidigit secret information using a pixel.Another kind of spatial domain steganography method is using a pixel to (two pixels) To complete Information hiding, such as LSB matchings revisit method (LSB matching revisited, LSBMR), based on direction adjustment EMD (exploiting modification direction) hidden methods and Fully EMD (FEMD) hidden method. FEMD methods can hide a n in a carrier pixel is to (x, y)2System (n ∈ N, n >=2) secret information, but it is maximum Embedding capacity can not be further added by.
Can FEMD hidden methods need the hiding information in the pixel pair of two pixel compositions, hide in one pixel Same information, and be not easy to crack, hidden capacity performance is better than LSB hidden methods and FEMD hidden methods or hides appearance Amount is better than classical hidden method, and answer is yes.
The content of the invention
Present invention solves the technical problem that being：The deficiencies in the prior art are overcome to introduce the efficient of auxiliary pixel there is provided a kind of Information concealing method, it is not necessary to the hiding information in a pixel is to (two pixels), can just hide same in one pixel Information more than sample, and Information Security is good, is efficiently believed available in Various types of data (particularly view data) carrier Breath hides transmission.
The technical scheme is that：A kind of efficient information hidden method for introducing auxiliary pixel, step is as follows：
1) implicit binary system secret information is converted into n2The secret information of system, each secret information is s, s values category In set 0,1,2 ... n2-1},n≥2；
2) it is [y to produce auxiliary pixel value y, y0,255-y0] in positive integer, wherein y0=n/2 is rounded；By carrier image A In each pixel x and auxiliary pixel y constitute pixel to (x, y), calculate and obtain functional value f=[(n-1) * x+n*y] mod n2；
3) f and secret information s are compared, obtained containing close pixel to (x ', y ')；
If 4) overflowed containing close pixel to (x ', y '), then adjustment obtain it is new containing close pixel to (x, y), be then embedded in again Secret information s；
5) step 3 is repeated) to step 4), until all secret information s insertions are finished；
6) all Δ y composition set is carried out obtaining compressed data set C0 after Lossless Compression；
7) [y is produced in order0,255-y0] interior positive integer y=y0+ 1 as auxiliary pixel y, continues repeat step 2) to 6) P times, compressed data set C1, C2 ... Cp is obtained, from C0, C1~Cp selects data length most short C, write down corresponding preferably auxiliary Help pixel value y；Wherein p is integer, and p=0 represents not repeat；
8) all x ' stego-image A ', preferably auxiliary pixel y and compressed data set C constituted is sent to receiving terminal；
9) receiving compressed data set C, decompression obtains Δ y set, and auxiliary pixel y ' set, i.e. y ' are obtained using y =y+ Δs y；
10) pixel is constituted to (x ', y ') by the x ' in stego-image A ' and containing close auxiliary pixel y '；
11) to each pixel to (x ', y '), according to s=[(n-1) * x '+n*y '] modn2Extract each n2System secret letter Breath；Repeat, until n2System secret information is extracted and finished；
12) by the n of extraction2System secret information switchs to binary system secret information.
N=2 or 4 or 8 or 16.
Step 3) detailed process be：
3.1) f and secret information s are compared, if f=s, do not change pixel to (x, y), otherwise by 3.2) rule Then change pixel pair；
3.2) search meets f (x+ Δs x, y+ Δ y)=s pixel is to (x+ Δs x, y+ Δ y), selection wherein modification amount (Δ X, Δ y) minimum pixel to as containing close pixel to (x ', y ').
Step 4) detailed process be：Adjustment is obtained：
The beneficial effect of the present invention compared with prior art is：
There is provided the efficient letter of one kind in the case where not increasing actual pixels and not changing carrier data amount by the present invention Hidden method is ceased, key is introduced, adds the security of hiding secret data.
It is of the invention to have these points substantive different and progressive compared with current background technology：
(1) this method introduces auxiliary pixel y to each pixel in image first, so as to accomplish to enter in each pixel Row information is hidden, and overcomes the problem of needing to carry out Information hiding in two data originally, improves hiding efficiency.
(2) this method takes full advantage of the minimum correction of assistance data, the Lossless Compression length based on amendment value set Optimize, improve auxiliary pixel to the efficiency being hidden, achieve the concealment effect for being difficult to expect.
(3) this method has key y compared with EMD class hidden methods while hiding, adds the recipient of unauthorized The difficulty of existing secret information is cracked, the effect with secrecy while hiding.
(4) if this method only introduces auxiliary pixel y to a pixel in 2 pixels of image, because to original image Modification amount it is small and improve carrier image quality, can such as improve PSNR values 3dB.
Brief description of the drawings
Fig. 1 (a)-Fig. 1 (f) is emulation normal grayscale image.
Embodiment
While high speed data transfer, toward the other low speed datas of contact simultaneous transmission or part high-speed data.Except passing Defeated image, it is also possible to transmit other sensing datas.Carried out data transmission the invention provides one kind using Information Hiding Techniques Method, the characteristics of with big hidden capacity, high-performance and low complex degree, in spacecraft engineering, terrestrial information carry transmission There is practical value in system, all kinds of image delivering systems.
Experiment uses MATLAB2013a platforms, and carrier data uses the normal grayscale image of 6 512 × 512, such as Fig. 1 institutes Show, secret information is produced with pseudorandom number generator.There is higher security if necessary to algorithm, chaos sequence can be used Or some AESs are pre-processed to carrier.
A kind of efficient information hidden method for introducing auxiliary pixel of the present invention, step is as follows：
1) binary system secret information is converted to n2The secret information of system, each secret information is s, and s values belong to collection Close 0,1,2 ... n2- 1 }, n >=2；N desirable one of 2,4,8,16
2) it is [y to produce auxiliary pixel value y, y0,255-y0] in positive integer, wherein y0=n/2 is rounded；
By each pixel x and auxiliary pixel y compositions pixel in carrier image A (size is 512*512, per the bit of pixel 8) To (x, y), functional value f=[(n-1) * x+n*y] mod n are calculated2；
3) f and secret information s are compared：
If 3.1) f=s, pixel is not changed to (x, y), otherwise by 3.2) rules modification pixel pair；
3.2) search meets f (x+ Δs x, y+ Δ y)=s pixel is to (x+ Δs x, y+ Δ y), selection wherein modification amount (Δ X, Δ y) minimum pixel to as containing close pixel to (x ', y ')；
If 4) overflowed containing close pixel to (x ', y '), then new (x, y) is obtained by formula (1) adjustment, it is then again embedded secret Information s；
5) step 3 is repeated) to step 4), until all secret information s insertions are finished；
6) all Δ y composition set is carried out obtaining compressed data set C0 after Lossless Compression；
7) [y is produced in order0,255-y0] interior positive integer y=y0+ 1 as auxiliary pixel y, continues repeat step 2) to 6) P times, compressed data set C1, C2 ... Cp is obtained, from C0, C1~Cp selects data length most short C, write down corresponding preferably auxiliary Help pixel value y；P=0 represents not repeat；
P=0 in this example；
8) all x ' stego-image A ', preferably auxiliary pixel y and compressed data set C constituted is sent to receiving terminal；
9) receiving compressed data set C, decompression obtains Δ y set, and auxiliary pixel y ' set, i.e. y ' are obtained using y =y+ Δs y；
10) pixel is constituted to (x ', y ') by the x ' in stego-image A ' and containing close auxiliary pixel y '；
11) to each pixel to (x ', y '), according to formula s=[(n-1) * x '+n*y '] modn2Extract each n2System is secret Information；Repeat, until n2System secret information is extracted and finished；
12) by the n of extraction2System secret information switchs to binary system secret information.n2Take one of 4,16,64,256.
Performance simulation of the present invention
Use Y-PSNR (Peak Signal to Noise Ratio, PSNR), hidden capacity C and embedded rate E etc. Index weighs the performance of hidden algorithm.For the 8bit digital pictures that a width size is H × W, H, W are positive integer；PSNR determines Justice is as follows：
In formula, MSE is the mean square deviation between original image and stego-image, and calculation formula is
Here xij,Respectively represent original image and containing secret image (i, j) place pixel value.
Hidden capacity, embedded rate improve percentage
T=(V2-V1)/V1*100%=(U2-U1)/U1*100% (2)
In formula, V1 represents the insertion rate of control methods, and V2 represents the insertion rate of the present invention；U1 represents hiding for control methods Capacity, U2 represents the hidden capacity of the present invention.
Hidden capacity U：Per the hiding bit number (bpp) of pixel (8 bit), Q bits are hidden such as in Z bit, then are hidden Capacity U=8*Q/Z bpp.
Embedded rate V：With respect to hidden capacity or hidden capacity relative value V, hiding bit number and the ratio of carrier bit number, Q bits are hidden such as in Z bit, then are V=Q/Z with respect to hidden capacity.
1) embedded rate and hidden capacity compare
In FEMD methods, parameter n influence Information Hiding Capacities and embedded rate, the present invention is by adding auxiliary pixel and excellent Change, can further improve embedded rate.
A n is hidden in average 2 pixels (each using 8 bits, totally 16 bit) of FEMD methods2System number, bit number is K =log2(n2)；Hidden capacity U1=8K/16=K/2bpp, embedded rate V1=K/16；
A n is hidden in average 1 pixel (8 bit) of the present invention and 1 auxiliary pixel modification amount d bit2System number, than Special number is K=log2(n2)；Hidden capacity U2=8K/ (8+d) bpp, embedded rate
V2=K/ (8+d), d<8；
Table 1 is given in the case of different n values, two methods hidden capacity and embedded rate comparing result, it can be seen that two kinds The hidden capacity U of method and embedded rate V increase with n increase, when n values increase to 16 from 2, FEMD methods it is hidden Hide capacity increases to 4bpp from 1bpp, and hidden capacity of the invention increases to 4.9bpp from 1.6bpp；The insertion rate of FEMD methods Increase to 1/2 from 1/8, and the embedded rate of the minimum of the inventive method increases to 8/13 from 1/5, more than 1/2.
The minimum hidden capacity of this method compares FEMD with embedded rate and improves 23%-60%.Because being carried to same width Body, auxiliary pixel value y is identical, and the coding digit of the auxiliary pixel after embedded secret information is only determined by its modification amount, can be with With (1+log2N) bit is represented, bit number is significantly less than 8 bits.
The two methods of the hidden capacity U of difference n value situation of table 1 and embedded rate V
Note：Hidden capacity U and embedded rate V do not account for optimization compression when calculating, it is considered to embedded secret letter after optimization compression The coding digit of auxiliary pixel after breath only determines by its modification amount, no at all (1+log2N) bit is represented, average number of bits The far smaller than bit of carrier 8, total bit number is likely to reduced several times to 100 times after compression, even up to thousands of times, if auxiliary If modification amount=0 for helping pixel y, assistance data amount of compressed data very little, equivalent to d=0.Hidden capacity can even reach Originally 2 times.
2) PSNR compares
In order to weigh improvement degree of the present invention in terms of picture quality, table 2 is given in the case of different embedded rate V, this The picture quality that invention and FEMD methods are obtained respectively.On the whole, in the case of identical or higher embedded rate or hidden capacity, this The PSNR of invention is above FEMD methods, such as at identical embedded rate (1/2), and average PSNR is brought up to from 34.84dB 41.97dB, averagely improves 7.13dB.
In addition, the PSNR of the present invention is still up to 35.71dB, table when embedded 8/13 (being more than 1/2) secret information Bright this method is a kind of efficient Information Hiding Algorithms, and auxiliary pixel value can ensure the safety of secret information as key Property.
Two methods PSNR (dB) during the difference insertion rate of table 2
3) contrasted with other congenic methods
In order to which this algorithm and other congenic methods are contrasted, compared with Lena image concealing effects, the present invention can To realize the Information hiding of more different embedded rates, and the PSNR of the present invention is superior to LSB methods, and during such as n=2, PSNR is extremely Reduce plus 2.0dB.
The reason for image quality improvement, is that the present invention can greatly improve information insertion rate by adding auxiliary pixel, Compared to FEMD methods, in embedded secret information in proportion, the pixel comparison example reduction that the present invention is needed to use, thus to carrier Modification rate reduce.
In a word, the present invention proposes a kind of efficient information hidden method for introducing auxiliary pixel, hidden capacity and original number According to type it is unrelated, can be view data or other data, hiding amount is fixed all the time, with big hidden capacity and Information Security, and it is easy to software and hardware realization.Its feature is：This method by the introducing of auxiliary pixel and data-optimized, The Combined Treatment of secret information and key is realized, receiving terminal can complete Restore Secret information and high quality resume initial data.
This method can carry out Information hiding in each pixel of raw image data, improve hiding efficiency, break through The limitation that current method is hidden in a pixel is to (two pixels), 1/2 can be met or exceeded to arbitrary image and is hidden Capacity, recovers carrier image PSNR more than 41dB, performance is better than typical hidden method such as LSB and FEMD when hidden capacity is 1/2 Hidden method.
Unspecified part of the present invention belongs to general knowledge as well known to those skilled in the art.

Claims (4)

1. a kind of efficient information hidden method for introducing auxiliary pixel, it is characterised in that step is as follows：
1) implicit binary system secret information is converted into n2The secret information of system, each secret information is s, and s values belong to set {0,1,2,…n2-1},n≥2；
2) it is [y to produce auxiliary pixel value y, y0,255-y0] in positive integer, wherein y0=n/2 is rounded；Will be every in carrier image A Individual pixel x and auxiliary pixel y constitutes pixel to (x, y), calculates and obtains functional value f=[(n-1) * x+n*y] mod n2；
3) f and secret information s are compared, obtained containing close pixel to (x ', y ')；
If 4) overflowed containing close pixel to (x ', y '), then adjustment obtain it is new containing close pixel to (x, y), it is then again embedded secret Information s；
5) step 3 is repeated) to step 4), until all secret information s insertions are finished；
6) all Δ y composition set is carried out obtaining compressed data set C0 after Lossless Compression；
7) [y is produced in order0,255-y0] interior positive integer y=y0+ 1 as auxiliary pixel y, continues repeat step 2) to 6) p times, Compressed data set C1, C2 ... Cp is obtained, from C0, C1~Cp selects data length most short C, writes down corresponding preferred auxiliary picture Plain value y；Wherein p is integer, and p=0 represents not repeat；
8) all x ' stego-image A ', preferably auxiliary pixel y and compressed data set C constituted is sent to receiving terminal；
9) receiving compressed data set C, decompression obtains Δ y set, and auxiliary pixel y ' set, i.e. y '=y+ are obtained using y Δy；
10) pixel is constituted to (x ', y ') by the x ' in stego-image A ' and containing close auxiliary pixel y '；
11) to each pixel to (x ', y '), according to s=[(n-1) * x '+n*y '] modn2Extract each n2System secret information； Repeat, until n2System secret information is extracted and finished；
12) by the n of extraction2System secret information switchs to binary system secret information.
2. a kind of efficient information hidden method for introducing auxiliary pixel according to claim 1, it is characterised in that：N=2 or 4 or 8 or 16.
3. a kind of efficient information hidden method for introducing auxiliary pixel according to claim 1 or 2, it is characterised in that：Step Rapid detailed process 3) is：
3.1) f and secret information s are compared, if f=s, do not change pixel to (x, y), otherwise repaiied by 3.2) rule Change pixel pair；
3.2) search meet f (x+ Δs x, y+ Δ y)=s pixel to (x+ Δs x, y+ Δ y), select wherein modification amount (Δ x, Δ Y) minimum pixel to as containing close pixel to (x ', y ').
4. a kind of efficient information hidden method for introducing auxiliary pixel according to claim 3, it is characterised in that：Step 4) Detailed process be：Adjustment is obtained：
<mrow> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mi>x</mi> <mo>=</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <msup> <mi>x</mi> <mo>&amp;prime;</mo> </msup> <mo>&lt;</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>y</mi> <mo>=</mo> <mi>y</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <msup> <mi>y</mi> <mo>&amp;prime;</mo> </msup> <mo>&lt;</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>x</mi> <mo>=</mo> <mi>x</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msup> <mi>x</mi> <mo>&amp;prime;</mo> </msup> <mo>&gt;</mo> <mn>255</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>y</mi> <mo>=</mo> <mi>y</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msup> <mi>y</mi> <mo>&amp;prime;</mo> </msup> <mo>&gt;</mo> <mn>255</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow> 1
CN201710292276.5A 2017-04-28 2017-04-28 Efficient information hiding method introducing auxiliary pixels Active CN107146191B (en)

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 true CN107146191A (en) 2017-09-08
CN107146191B 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)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107911574A (en) * 2017-11-20 2018-04-13 西南大学 A kind of dual image information concealing method
CN108629749A (en) * 2018-04-26 2018-10-09 西安空间无线电技术研究所 A kind of compression of images and the hiding method being combined
CN115396676A (en) * 2022-07-28 2022-11-25 西安空间无线电技术研究所 Encryption domain satellite image information hiding method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101452569A (en) * 2008-12-05 2009-06-10 江南大学 Processing method of image latent writing based on auxiliary pixel
CN103413269A (en) * 2013-08-20 2013-11-27 宁波大学 Image steganography method and secret information extraction method
CN103442156A (en) * 2013-08-20 2013-12-11 宁波大学 Image steganography and secret information extraction method based on intelligent mobile terminal
CN103780913A (en) * 2014-01-24 2014-05-07 西安空间无线电技术研究所 Data compression method based on error hiding
WO2014075467A1 (en) * 2012-11-15 2014-05-22 中兴通讯股份有限公司 Method and device for information hiding and extraction
CN105956990A (en) * 2016-04-27 2016-09-21 广西财经学院 General type non-destructive information hiding algorithm for a large capacity image

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101452569A (en) * 2008-12-05 2009-06-10 江南大学 Processing method of image latent writing based on auxiliary pixel
WO2014075467A1 (en) * 2012-11-15 2014-05-22 中兴通讯股份有限公司 Method and device for information hiding and extraction
CN103413269A (en) * 2013-08-20 2013-11-27 宁波大学 Image steganography method and secret information extraction method
CN103442156A (en) * 2013-08-20 2013-12-11 宁波大学 Image steganography and secret information extraction method based on intelligent mobile terminal
CN103780913A (en) * 2014-01-24 2014-05-07 西安空间无线电技术研究所 Data compression method based on error hiding
CN105956990A (en) * 2016-04-27 2016-09-21 广西财经学院 General type non-destructive information hiding algorithm for a large capacity image

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
刘娟妮，周诠: "基于像素对匹配的大容量SAR数据信息隐藏算法", 《空军工程大学学报》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107911574A (en) * 2017-11-20 2018-04-13 西南大学 A kind of dual image information concealing method
CN108629749A (en) * 2018-04-26 2018-10-09 西安空间无线电技术研究所 A kind of compression of images and the hiding method being combined
CN108629749B (en) * 2018-04-26 2021-10-01 西安空间无线电技术研究所 Method for combining image compression and hiding
CN115396676A (en) * 2022-07-28 2022-11-25 西安空间无线电技术研究所 Encryption domain satellite image information hiding method
CN115396676B (en) * 2022-07-28 2024-03-26 西安空间无线电技术研究所 Encryption domain satellite image information hiding method

Also Published As

Publication number Publication date
CN107146191B (en) 2020-05-08

Similar Documents

Publication Publication Date Title
CN106791872B (en) Information concealing method based on SVD
CN103414892B (en) The Image Hiding that a kind of Large Copacity is incompressible
CN103037223B (en) Secret image share method based on block compressed sensing
CN109462714A (en) The small encrypted image Processing of Multi-Bit-Planes reversible data concealing method of cloud storage expense
CN104284190B (en) Compressed image steganography encoding method based on AMBTC high-low mean value optimization
CN103413269A (en) Image steganography method and secret information extraction method
CN105791854B (en) A kind of combination improves the singular value modification video steganographic algorithm of matrix coder
CN103414840B (en) A kind of data-hiding method based on image set
CN102938841B (en) Method for hiding information in bearing image, image quality evaluation method and information transmission method
CN107146191A (en) A kind of efficient information hidden method for introducing auxiliary pixel
CN104065976B (en) A kind of compression of images and security transmission method based on video
CN105227962B (en) A kind of lossless information concealing method based on data difference
CN111179144B (en) Efficient information hiding method for multi-embedding of multi-system secret information
Pan et al. Low bit-rate information hiding method based on search-order-coding technique
CN114745475A (en) Robust reversible information hiding method for encrypted image
CN108521535B (en) A kind of Information hiding transmission method based on image blend processing
CN107358568B (en) Noise-disguised image information hiding transmission method
CN105827632A (en) Cloud computing CCS fine-grained data control method
CN106254891A (en) A kind of vector quantization compression method based on Information hiding
Yang Robust Watermarking Scheme Based on Radius Weight Mean and Feature‐Embedding Technique
CN107277507B (en) Spatial domain transform domain hybrid image compression method
CN105141960B (en) A kind of method that information transfer is carried out based on JPEG2000 compressed bit streams
CN105046633B (en) A kind of image lossless transform method
CN107135391A (en) A kind of video-aware hash algorithm for H.264 compression domain
CN106131575A (en) The method for compressing image combined with Chinese remainder theorem based on wavelet transformation

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