CN100568274C - The watermark jump method of digital watermarking - Google Patents
The watermark jump method of digital watermarking Download PDFInfo
- Publication number
- CN100568274C CN100568274C CNB2006100974413A CN200610097441A CN100568274C CN 100568274 C CN100568274 C CN 100568274C CN B2006100974413 A CNB2006100974413 A CN B2006100974413A CN 200610097441 A CN200610097441 A CN 200610097441A CN 100568274 C CN100568274 C CN 100568274C
- Authority
- CN
- China
- Prior art keywords
- watermark
- carrier
- ciphertext
- coefficient
- 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.)
- Expired - Fee Related
Links
Images
Abstract
A kind of watermark jump method of digital watermarking at first produces the chaos matrix according to secret key, and the chaos matrix is mapped to orderly matrix, obtains chaos-sorting operator simultaneously, utilizes chaos-sorting operator that watermarking images is mapped to the ciphertext watermarking images; Ciphertext watermarking images sequence is turned to ciphertext watermark value sequence, again ciphertext watermark value sequence is extended to some watermark subchannels, use positive and negative expanding method alternately to expand watermark to eliminate the monkey chatter of watermark subchannel; When embed watermark, carrier image is transformed to frequency field and choose the carrier coefficient of carrier frequency domain coefficient as embed watermark, select watermark expansion value to replace the carrier coefficient, reconstructed image obtains containing the watermark carrier image; When extracting watermark, transform to frequency field, find out the carrier coefficient of embed watermark, separate to expand to contain watermark carrier coefficient and decipher and obtain watermarking images containing the watermark carrier image.The inventive method can effectively be utilized the visual redundancy of carrier, realizes the blind extraction of watermark, embeds gray level image as watermark information, and robustness is strong, is particularly suitable for the copyright authentication of digital picture or video.
Description
Technical field
The present invention relates to a kind of digital watermarking embedding and extracting method, refer more particularly to the watermark jump method of digital watermarking, specifically be applicable to the robustness blind watermark method of digital picture and video copyright authentication, it belongs to the Information hiding field.
Background technology
Digital watermarking is a kind of by embed the technology of secret information to protect the intellectual property in Digital Media.According to the intention that watermark embeds, digital watermarking can be divided into robustness watermark, fragile watermarking and half fragile watermarking.The robustness watermark can be resisted the malicious attack of infringement as diminishing compression, attacked by noise, geometric attack and various enhancement process etc., usually as copyright authentication.
(reference: Cox I such as Cox, Killian J, Leighton T, et al.Secure spread spectrumwatermarking for multimedia, Audio and Video[J] .IEEE International Conference onImage Processing, 1996,3:243-246.) " spread-spectrum " digital watermarking algorithm proposed, watermark information is hidden in the DCT territory of image, this method has the advantages that invisibility is good and robustness is strong, become a classical scheme in digital watermarking field, but there are some defectives in it, wherein the most important is exactly the participation that the leaching process of watermark must have original image, and promptly it is not blind watermarking project, can not resist IBM and attack.
(reference: Barni M such as Barni, Bartolini F, Cappellini V, et al.DCT-domain system forrobust image watermarking[J] .Signal Processing, 1998,66 (3): 357-372) propose watermark information is hidden in the fixing Mid Frequency in DCT territory, so that when not having original image, still can determine the position that watermark is hidden, thereby classic algorithm development cecutiency watermarking algorithm with Cox, the detection of watermark is undertaken by linear correlative method, testing process does not need the participation of original image, but needs the participation of original watermark.This algorithm except will being provided, key also will provide original watermark because detect watermark, so can only provide the answer of " yes " (watermark is arranged) and " no " (no watermark).In other words, need in the algorithm of original watermark when detecting, the secret information of putting image into only is that 1bit (reference: follow the footsteps of by Huang, Elmasry G, Cheng Weidong. based on the meaningful image watermark algorithm [J] of matched filtering. electronic letters, vol, 2001,29 (4): 447-451).Embed particularly gray scale watermark of significant watermark, and do not need the participation of initial carrier and original watermark, it is more important more convincing in some application scenarios only just to extract the blind watermark method of watermark according to key.
The embedding gray level image is that the watermark data amount is big as the characteristics of watermark in carrier, common gray scale watermarking algorithm normally is divided into different bit-plane images with the gray scale watermark, (the reference: the shake of recording of gray scale watermark the question resolves itself into binary watermarking problem, Li Huihui, Xiao Weiwei etc. based on the digital watermark signal research [J] of chaos sequence. electronic letters, vol, 2004,32 (7): 1131-1134).Document (reference: Su Fulin, Malaysian is strong, Li Mingjiang. a kind of new gradation of image digital watermarking embeds algorithm [J]. systems engineering and electronic technology, 2001,23 (8): 88-91) method that proposes to utilize Bit Plane Decomposition detects the method for watermark to the gray level image pre-service with symbol coherent detection algorithm.Document (reference: Zhong Hua, Jiao Licheng. Adaptive Gray-Level Digital Watermarking Technique [J]. Chinese journal of computers, 2002,25 (12): 1364-1370) propose a kind of method that reduces gray scale watermark data amount, the method that this method utilization combines to gray scale watermarking images Bit Plane Decomposition, wavelet transformation, affined transformation and image lossy compression method coding techniques reduces watermark and embeds data volume, this algorithm has utilized original image when detecting watermark, this has just limited the application of this algorithm.Because the watermark data amount that the gray level image Bit Plane Decomposition is produced is big, the picture size of embedding is less relatively.
Summary of the invention
The objective of the invention is to deficiency at existing digital watermark, the blind watermark embedding and the extracting method of a kind of high robustness, high watermark capacity, self-adaptation adjusting watermark embedding depth are proposed, it wants to make full use of the human eye vision redundancy of carrier image, can embed significant gray level image as watermark, intuitively convincing.
For achieving the above object, the present invention proposes a kind of new method---the watermark jump method of digital watermarking.
This method is extended to ciphertext watermark value sequence in some watermark subchannels, use positive and negative expanding method alternately to expand watermark to eliminate the monkey chatter of watermark subchannel, carrier image is transformed to frequency field, choose and the carrier frequencies domain coefficient of watermark capacity equivalent carrier coefficient as embed watermark, select watermark expansion value to replace the carrier coefficient, reconstructed image obtains containing the watermark carrier image; When extracting watermark, transform to frequency field, separate to expand to contain watermark carrier coefficient and decipher and obtain watermarking images containing the watermark carrier image.The telescopiny of watermark is exactly beating of ciphertext watermark expansion value and the process that changes the carrier frequencies domain coefficient; The leaching process of watermark is exactly to separate the process that contains watermark carrier coefficient and deciphering of expanding.
Technical scheme concrete steps of the present invention comprise:
(1) watermarking images is encrypted
The present invention at first produces the chaos matrix according to key, and the chaos matrix is mapped to orderly matrix, obtains chaos-sorting operator simultaneously, utilizes chaos-sorting operator that watermarking images is mapped to the ciphertext watermarking images.
Suppose that watermark is to be of a size of m
1* m
2Gray level image W, chaos-sorting operator is f:M → M
LR, M is the chaos matrix, M
LRBe again by being listed as the result that ascending order is by size arranged after ascending order is arranged by size line by line to the element of M.F is defined as M
LR=M (K) that is: reads M by the subscript matrix K and obtains M
LRThe step that produces the subscript matrix K is as follows:
Step1: producing a size according to key is m
1* m
2The chaos matrix M;
Step2: to the element of M line by line by size ascending order arrange matrix M
L, M
LThe row subscript of element in M constitute matrix K
2
Step3: to M
LElement by be listed as by size ascending order arrange matrix M
LR, M
LRElement at M
LIn capable subscript constitute matrix K
1
Step4: the subscript matrix is K:
K(l，r)＝(K
1(l，r)，K
2(l，r))
L=0 wherein, 1,2 ... m
1-1, r=0,1,2 ... m
2-1
If the ciphertext watermarking images is W ', generate K by above step, cryptographic calculation is:
W’＝W(K)
(2) expansion of ciphertext watermark
The serializing of ciphertext watermarking images, that is: reading encrypted watermark gradation of image value becomes a sequence W ' (i) in proper order, use positive and negative expanding method alternately to expand watermark, ciphertext watermark value sequence is extended to some watermark subchannel C to eliminate the monkey chatter of watermark subchannel
j:
C
j(i)＝(-1)
j*A(j)*W’(i)+B(j)
I=0 wherein, 1,2 ... m
1* m
2-1, j=0,1 ,-1,2 ,-2 ..., A (j)＞0, the width of A (j) decision watermark subchannel, B (j) guarantees that the watermark subchannel is adjacent.
(3) embedding of watermark
Carrier image is transformed to frequency field, choose the carrier coefficient of carrier frequency domain coefficient as embed watermark, select watermark expansion value to replace the carrier coefficient, reconstructed image obtains containing the watermark carrier image.Concrete steps:
Step1: carrier image is transformed to frequency field, select m
1* m
2Individual frequency domain carrier coefficient V (i) is as the carrier coefficient of embed watermark;
Step2:, select watermark expansion value C with reference to Fig. 2
n(i) carrier coefficient V ' was (i) after replacement carrier coefficient V (i) obtained watermark:
V’(i)＝C
n(i)
Wherein: i=0,1,2 ... m
1* m
2-1, n round numbers, C
nExpression covers the watermark subchannel of carrier frequencies domain coefficient V (i);
Step3: obtain containing the watermark carrier image according to amended carrier coefficient reconstruction image.
(4) extraction of watermark
Transform to frequency field containing the watermark carrier image, find out the carrier coefficient of embed watermark, separate to expand and contain watermark carrier coefficient and deciphering obtains watermarking images.Concrete steps:
Step1: transform to frequency field containing the watermark carrier image, extract the carrier coefficient V ' of embed watermark
Step2: (i) determine to separate the expansion mode according to V ', determine promptly V ' is (i) from which watermark subchannel C
n(i), the expansion mode of separating of n decision watermark.V ' (i) is separated expansion obtains ciphertext watermark value sequence W ' (i):
W’(i)＝(-1)
n*A(n)
-1*(V’(i)-B(n))
I=0 wherein, 1,2 ... m
1* m
2-1;
Step3: according to key to ciphertext watermark value sequence W ' (i) decipher obtain extracting watermarking images W ", corresponding watermarking images cryptographic calculation, ciphertext watermark decrypt operation is:
W”(K)＝W’
The present invention proposes positive and negative expanding method and alternately expands watermark to eliminate the monkey chatter of watermark subchannel.With reference to Fig. 2, can cause the slight disturbance of carrier frequencies domain coefficient to the signal Processing attack of carrier after the watermark.If replace the watermark expansion value of carrier coefficient to be positioned at the edge of watermark subchannel, through attacking disturbance, to cross the subchannel border and enter adjacent subchannel, the watermark expansion value of catching when extracting watermark is located in the adjacent subchannel.Suppose that adjacent subchannel is to obtain according to identical expanding method, when extracting watermark, separate expansion, will cause the big distortion of extracting watermark according to unique expanding method of separating; If the method for taking positive and negative expansion to hocket when watermark is expanded, adjacent subchannel uses different expansion modes, and so, the subchannel border has been crossed in the disturbance of carrier coefficient after the watermark, not only can not cause bigger distortion, and is more favourable to watermark extracting on the contrary.Alternately expand the robustness that watermark improves watermark greatly with positive and negative expanding method.
Watermark will be satisfied invisibility, just requires carrier coefficient change amount that embed watermark causes less than threshold value.The change amount of carrier coefficient is relevant with watermark subchannel width, and the present invention regulates watermark embedding depth by the method for regulating watermark subchannel width.According to document (reference: Cox.I.J, Kilian.J, Leighton.F.T, et al.Secure spread spectrumwatermarking for multimedia[J] .IEEE Transactions on Image Procession.1997,6 (12): 1673 ~ 1687.) analyze, the carrier coefficient is big more, and receptible watermark strength is strong more, therefore, distance center subchannel C
0Subchannel width far away more is wide more, and the watermark jump method just can be regulated watermark strength to make full use of the information redundancy of carrier according to carrier frequencies domain coefficient size adaptation like this, improves the robustness of watermark.
The present invention embeds gray level image as watermark, is summed up as the method for binary watermarking problem after the gray level image Bit Plane Decomposition of employing classics, directly gray scale watermarking images gray-scale value is encrypted and is expanded back embedding carrier image, significantly improves watermark capacity.
The present invention utilizes chaos system that watermark information is encrypted, again ciphertext watermark value sequence period is extended to some watermark subchannels, select watermark expansion value to replace the carrier coefficient, give the multiple meaning of carrier coefficient after the watermark: from the angle of carrier, it is the carrier frequencies domain coefficient that is subjected to a certain degree disturbance; From the angle of watermark, it is the value of watermark expansion accurately, separates to expand these watermark expansion values and decipher just can obtain watermarking images; From separating the process of expansion, it is again a foundation of judging watermark expansion mode, and it has indicated watermark expansion value is from which subchannel.The extraction of watermark does not need the participation of initial carrier and watermark, has realized the blind extraction of watermark.
The watermark jump method that the present invention proposes can effectively utilize the visual redundancy of carrier, realizes the blind extraction of watermark, embeds gray level image as watermark information, and robustness is strong, is particularly suitable for the copyright authentication of digital picture or video.
Description of drawings
Fig. 1 is a watermaking system FB(flow block) of the present invention.
Fig. 2 is a method proposed by the invention---watermark jump method synoptic diagram.
Symbol description is as follows among the figure:
Watermark (expansion) value
■ carrier frequencies domain coefficient
-watermark subchannel border
Fig. 3 is carrier and an original watermark image after initial carrier and the watermark:
(a) initial carrier Lena image
(b) carrier Lena image after the watermark
(c) original watermark Flower image
Fig. 4 is that carrier Lena image extracts watermark effect figure through attacking the back after the watermark, contains the suffered attack pattern of watermark carrier and extract watermark PSNR value as follows:
(a) do not attack 60.7030dB
(b)JPEG(75) 25.5823dB
(c)JPEG(50) 21.6797dB
(d)JPEG(30) 17.3427dB
(e) noise 15.0047dB
(f) filtering 18.9013dB
(g) shear 25% 27.6194dB
Fig. 5 is the anti-robustness curve of attacking of watermark:
(a) the anti-JPEG compression attack of watermark robustness curve
(b) the anti-Gaussian noise of watermark is attacked the robustness curve
Embodiment
Below in conjunction with the nearly step explanation of drawings and Examples technical scheme of the present invention.The carrier of the embodiment of the invention is that (512 * 512 * 8bit) images such as Fig. 3 (a), watermarking images are that (64 * 64 * 8bit) images such as Fig. 3 (c), watermarking images encrypt and use Logistic mapping Chaos dynamic system: x Flower to standard Lena
N+1=μ x
n(1-x
n), 0＜x wherein
n＜1,3.6≤μ≤4, the chaos matrix be according to chaos sequence line by line assignment form, formation speed is fast.Embed the carrier image cause with the watermark of Y-PSNR PSNR quantitative description and degrade and extract the quality of watermark, PSNR is defined as:
Wherein I ' is an original image, and I is target image (the back image degrades), M
1, M
2Be picture size.Concrete evaluation can be passed judgment in conjunction with the subjectivity of human eye.By process flow diagram shown in Figure 1, at first utilize chaos-sorting operator that watermarking images is mapped to the ciphertext watermarking images, the ciphertext watermark is extended to several watermark subchannels, carrier image is divided into the image block of non-overlapping copies, each image block is transformed to frequency field respectively, utilize the watermark jump method that the ciphertext watermark value is embedded in the carrier frequencies domain coefficient.When extracting watermark, carrier image after the watermark is transformed to frequency field, extract and contain watermark carrier coefficient and separate expansions, obtain watermarking images after deciphering.Concrete steps are as follows:
(1) watermarking images is encrypted
Step1: producing a size according to secret key is 64 * 64 chaos matrix M;
Step2: to the element of M line by line by size ascending order arrange matrix M
L, M
LThe row subscript of element in M constitute matrix K
2
Step3: to M
LElement by be listed as by size ascending order arrange matrix M
LR, M
LRElement at M
LIn capable subscript constitute matrix K
1
Step4: the subscript matrix is K:
K(l，r)＝(K
1(l，r)，K
2(l，r))
L=1 wherein, 2 ... 64, r=1,2 ... 64
The ciphertext watermarking images is W ':
W’＝W(K)
(2) expansion of ciphertext watermark
Order reads ciphertext watermarking images gray-scale value and becomes a sequence W ' (i).With reference to figure 2, the method for using positive and negative expansion to hocket is extended to some watermark subchannel C to ciphertext watermark value sequence
j:
C
j(i)＝(-1)
j*A(j)*W’(i)+B(j)
Wherein: i=0,1,2 ... 64 * 64-1, j=0,1 ,-1,2 ,-2 ..., A (j)＞0, the width of A (j) decision watermark subchannel, B (j) guarantees that the watermark subchannel is adjacent.
(3) embedding of watermark
Step1: carrier image is transformed to frequency field, select the carrier frequencies domain coefficient of 64 * 64 frequency domain carrier coefficient V (i) as embed watermark;
Step2:, select watermark expansion value C with reference to Fig. 2
n(i) carrier coefficient V ' was (i) after replacement carrier coefficient V (i) obtained watermark:
V’(i)＝C
n(i)
Wherein: i=0,1,2 ... 64 * 64-1, C
nExpression covers the watermark subchannel of carrier frequencies domain coefficient V (i);
Step3: obtain containing the watermark carrier image according to amended carrier coefficient reconstruction image.
(4) extraction of watermark
Step1: transform to frequency field containing the watermark carrier image, extract the carrier coefficient V ' of embed watermark;
Step2: (i) determine to separate the expansion mode according to V ', determine promptly V ' is (i) from which watermark subchannel C
n(i), the expansion mode of separating of n decision watermark.V ' (i) is separated expansion obtains ciphertext watermark W ' (i):
W’(i)＝(-1)
n*A(n)
-1*(V’(i)-B(n))
I=0 wherein, 1,2 ... 64 * 64-1;
Step3: according to key to ciphertext watermark W ' (i) decipher obtain extracting watermarking images W ":
W”(K)＝W’
Wherein: the generation method of K is identical with the generation method of K in the encrypting step.
The present invention does not adopt the method for the gray scale watermark Bit Plane Decomposition of common methods use, has avoided the watermark Bit Plane Decomposition can produce the shortcoming of big data quantity, and embodiment selects for use the gray level image of 64 * 64 * 8bit as watermark, and watermark capacity is higher relatively.
Fig. 3 (a) is an initial carrier Lena image, and the Lena image is shown in Fig. 3 (b) behind the embed watermark, and its PSNR value (Y-PSNR) is 40.0641dB.The Lena image has kept lower distortion rate behind embed watermark, satisfied the invisibility of watermark preferably.
Fig. 4 is that wherein the attack to carrier after the watermark is respectively from the watermarking images through extracting the carrier Lena image after the watermark after the common attack: (a) after the watermark carrier without any attack; (b), (c), (d) be respectively carrier after the watermark carried out the JPEG compression, compressibility factor is respectively 75,50,30; (e) carrier after the watermark is added Gaussian noise, the Gaussian noise average is 0, variance is 0.0015; (f), adopt 3 * 3 filtering templates to carrier medium filtering after the watermark; (g) cut off carrier 25% etc. after the watermark.As can be seen from the figure, reach the requirement of digital picture copyright authentication from through the essential characteristic that the watermark of extracting the watermark carrier has kept original watermark that contains after the common attack.
Fig. 5 is the anti-robustness curve of attacking of watermark, wherein: (a) the anti-JPEG compression attack of watermark robustness curve; (b) the anti-Gaussian noise of watermark is attacked the robustness curve.The as can be seen from the figure intensity of Gong Jiing and extract relation between the effect of watermark.
Document (reference: Jiang Mingyan, Xu Guoping, Yuan Dongfeng.A novel blind watermarking algorithmbased on multiband wavelet transform[A] .In:2004 International Conference on Signal ProcessingProceedings, ICSP[C], Beijing, China:IEEE Press, 2004,1:857 ~ 860.) use the gray level image of 48 * 48 * 8bit as watermark, the method of watermarking images Bit Plane Decomposition had been adopted in watermark in the past at the embedding carrier, watermarking images is decomposed into 8 bit planes, with gray scale watermark the question resolves itself into binary watermarking problem.Compare with above-mentioned document,, watermark identical at carrier image embeds under the close prerequisite of the carrier distortion rate that causes, the watermark invisibility and the robustness that embed with watermark jump method of the present invention are better than the former, and the watermark capacity that the inventive method embeds is the former 2.8 times.
Claims (1)
1, the watermark jump method of digital watermarking is characterized in that this method comprises following concrete steps:
(1) watermarking images is encrypted: producing a size according to key is m
1* m
2The chaos matrix, the chaos matrix is mapped to orderly matrix, obtain chaos-sorting operator simultaneously, utilize chaos-sorting operator that watermarking images is mapped to the ciphertext watermarking images;
(2) expansion of ciphertext watermark: ciphertext watermarking images sequence is turned to ciphertext watermark value sequence W ' (i), ciphertext watermark value sequence W ' (i) is extended to some watermark subchannel C
j(i):
C
j(i)＝(-1)
j*A(j)*W’(i)+B(j)
I=0 wherein, 1,2 ... m
1* m
2-1, j=0,1 ,-1,2 ,-2 ..., A (j)＞0, the width of A (j) decision watermark subchannel, B (j) guarantees that the watermark subchannel is adjacent;
(3) embedding of watermark: carrier image is transformed to frequency field and choose the carrier frequencies domain coefficient V (i) of carrier frequency domain coefficient, select watermark expansion value C as embed watermark
n(i) carrier coefficient V ' was (i) after replacement carrier frequencies domain coefficient V (i) obtained watermark:
V’(i)＝C
n(i)
Wherein: i=0,1,2 ... m
1* m
2-1, n round numbers, C
n(i) expression covers the watermark subchannel of carrier frequencies domain coefficient V (i); Obtain containing the watermark carrier image according to amended carrier coefficient reconstruction image;
(4) extraction of watermark: transform to frequency field containing the watermark carrier image, find out the watermark of embed watermark after carrier coefficient V ' (i), according to covering V ' watermark subchannel C (i)
n(i) determine concrete n value, V ' (i) separated expansion obtain ciphertext watermark value sequence W ' (i):
W’(i)＝(-1)
n*A(n)
-1*(V’(i)-B(n))
I=0 wherein, 1,2 ... m
1* m
2-1;
According to key to ciphertext watermark value sequence W ' (i) decipher obtain extracting watermarking images W ".
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100974413A CN100568274C (en) | 2006-11-09 | 2006-11-09 | The watermark jump method of digital watermarking |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100974413A CN100568274C (en) | 2006-11-09 | 2006-11-09 | The watermark jump method of digital watermarking |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1963864A CN1963864A (en) | 2007-05-16 |
| CN100568274C true CN100568274C (en) | 2009-12-09 |
Family
ID=38082906
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100974413A Expired - Fee Related CN100568274C (en) | 2006-11-09 | 2006-11-09 | The watermark jump method of digital watermarking |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100568274C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527823B (en) * | 2009-04-10 | 2012-10-17 | 南京大学 | Network video monitoring system based on FPGA chaotic encryption |
| CN104967610B (en) * | 2015-04-30 | 2018-05-29 | 中国人民解放军国防科学技术大学 | A kind of timeslot-based watermark hopping communication means |
| CN107274332A (en) * | 2017-06-19 | 2017-10-20 | 安徽爱普科技有限公司 | A kind of tax web handling system |
| CN108681982A (en) * | 2018-04-04 | 2018-10-19 | 微梦创科网络科技（中国）有限公司 | A kind of embedding algorithm and extracting method and system based on singular value decomposition |
-
2006
- 2006-11-09 CN CNB2006100974413A patent/CN100568274C/en not_active Expired - Fee Related
Non-Patent Citations (9)
| Title |
|---|
| 一种基于混沌加密的DCT域数字图像水印算法. 郑融，金聪，魏文芬，李蓓.计算机应用，第25卷第10期. 2005 |
| 一种基于混沌加密的DCT域数字图像水印算法. 郑融，金聪，魏文芬，李蓓.计算机应用，第25卷第10期. 2005 * |
| 一种强干扰背景下的盲加性水印算法. 燕晓，蒙应杰，王阳，郁军.软件学报，第16卷第9期. 2005 |
| 基于混沌加密的DCT域灰度级盲水印算法. 鲍政，张建伟，夏德深.计算机工程，第32卷第7期. 2006 |
| 基于混沌加密的DCT域灰度级盲水印算法. 鲍政，张建伟，夏德深.计算机工程，第32卷第7期. 2006 * |
| 基于混沌加密的图像数字水印算法研究. 龙伟，温媛媛，高政.计算机与数字工程，第34卷第2期. 2006 |
| 基于混沌加密的图像数字水印算法研究. 龙伟，温媛媛，高政.计算机与数字工程，第34卷第2期. 2006 * |
| 基于视觉特性的灰度水印自适应嵌入与提取算法. 向德生，熊岳山，朱更明.中国图象图形学报，第11卷第7期. 2006 |
| 基于视觉特性的灰度水印自适应嵌入与提取算法. 向德生，熊岳山，朱更明.中国图象图形学报，第11卷第7期. 2006 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1963864A (en) | 2007-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kour et al. | Steganography techniques–A review paper | |
| Cheddad et al. | Digital image steganography: Survey and analysis of current methods | |
| Lou et al. | A novel adaptive steganography based on local complexity and human vision sensitivity | |
| Zamani et al. | A secure audio steganography approach | |
| Zamani et al. | A genetic-algorithm-based approach for audio steganography | |
| Goel et al. | A review of comparison techniques of image steganography | |
| Zamani et al. | Genetic substitution-based audio steganography for high capacity applications | |
| CN100568274C (en) | The watermark jump method of digital watermarking | |
| Shahadi et al. | A novel robust approach for image copyright protection based on concentric rectangles | |
| Pal | A survey on digital watermarking and its application | |
| Almola et al. | Robust method for embedding an image inside cover image based on least significant bit steganography | |
| Ling et al. | Watermarking for image authentication | |
| Surekha et al. | A watermarking technique based on visual cryptography | |
| Pawar et al. | Histogram-based reversible data hiding using block division | |
| Bairagi et al. | A dynamic approach in substitution based audio steganography | |
| Dwivedi et al. | Reversible Digital Image Watermarking scheme using Histogram Shifting Method | |
| Liu et al. | Image information hiding encryption using chaotic sequence | |
| Liu et al. | Video steganalysis based on the expanded markov and joint distribution on the transform domains detecting msu stegovideo | |
| Thepade et al. | Appraise of multifarious image steganography techniques | |
| Lande | Survey of digital watermarking techniques and its application | |
| Pramitha et al. | Image steganography using mod-4 embedding algorithm based on image contrast | |
| Nabi et al. | Image Steganography: Critical Findings through Some Novel Techniques | |
| Audichya et al. | A Review on Colour Image Watermarking based on Wavelet and QR Decomposition | |
| ABBAS et al. | A SCHEME FOR ROBUST AND IMPERCEPTIBLE VIDEO WATERMARKING | |
| Malik et al. | Robust RDH Technique Using Sorting and IPVO-Based Pairwise PEE for Secure Communication |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091209 Termination date: 20101109 |