CN103034971A - BTC-combined visible watermark erasing scheme - Google Patents
BTC-combined visible watermark erasing scheme Download PDFInfo
- Publication number
- CN103034971A CN103034971A CN201310012513XA CN201310012513A CN103034971A CN 103034971 A CN103034971 A CN 103034971A CN 201310012513X A CN201310012513X A CN 201310012513XA CN 201310012513 A CN201310012513 A CN 201310012513A CN 103034971 A CN103034971 A CN 103034971A
- Authority
- CN
- China
- Prior art keywords
- watermark
- original image
- visible
- image
- btc
- 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.)
- Pending
Links
Images
Abstract
The invention discloses a BTC (Block Truncation Coding)-combined visible watermark erasing scheme, which comprises three steps of computing a watermark embedding factor, embedding a watermark, and erasing a visible watermark and restoring an original image. First, a non-watermark region pixel is used for predicting a watermark region pixel so as to generate an original image prediction version. Next, an adaptive embedding factor is computed according to perceptual characteristics of the prediction version. Then, watermark information is adaptively embedded into the original image BTC visibly. In addition, the chaotically encrypted watermark is invisibly embedded into the original image BTC in a lossless manner so as to prevent the visible watermark from being erased illegally. At the receiving end, only an authorized user can accurately extract binary watermark information so as to successfully erase the visible watermark and restore the original image. According to the BTC-combined visible watermark erasing scheme, an explicit copyright notice is provided while the high-quality image browsing is provided for the authorized user; the computational complexity is low; and the real-time communication security of digital images in network environment can be guaranteed.
Description
Technical field
The invention belongs to the multi-media information security field; relate to a kind of erasable visible watermark scheme in conjunction with the BTC coding; particularly utilize visible watermark to realize the explicit copyright notice of multimedia; authorized user obtains the high definition carrier data by effective removal visible watermark, Protection of consumer and copyright owner's legitimate rights and interests.
Background technology
The digital picture visible watermarking technique is rendered as carrier image by watermark in the self-adaptation of initial carrier image a kind of explicit copyright notice is provided, and does not have watermark extracting or testing process, is a kind of effectively Digital Media copyright protection mode directly perceived.Common visible watermark can be introduced distortion inevitably, causes the initial carrier visual quality of images to descend.Although this distortion is not serious, in fields such as Medical Image Processing, the processing of military image, engineering drawing processing, law evidence obtainings, for the consideration of the factors such as fidelity, technique, law, the image deterioration that this distortion causes is not allowed.This has just proposed the requirement to erasable visible watermark.Hu etc. (2006) have proposed a kind of erasable visible watermark algorithm in DCT territory of user key control.This algorithm is that different user embeds similar but the watermark version (list of references [1]: Y. J. Hu that digital content is different of vision, S. Kwong and J. Huang, " An algorithm for removable visible watermarking; " IEEE Trans. Circuits Syst. Video Technol., vol. 16, no. 1, pp. 129 – 133, Jan. 2006.).Yang etc. (2008) are on the basis of considering DCT coefficient visual characteristic, a kind of erasable visible watermark algorithm (list of references [2]: Y. Yang is proposed, X. Sun, H. Yang, and C. T. Li. " Removable visible image watermarking algorithm in the discrete cosine transform domain; " Journal of Electronic Imaging, vol. 17, no. 3, pp. 033008-1 – 033008-11, Jul.-Sep. 2008.), this algorithm is embedded in the original image by the pre-service watermark self-adaptation that key is relevant, illegally removes to stop visible watermark.But these two kinds of algorithms all need original visible watermark information when visible watermark is removed, and this transmission demand to original watermark information under real time environment or low-bandwidth condition is unpractical.In above two kinds of algorithms, the disabled user can remove visible watermark preferably by the key of minor alteration in addition, generates the original image approximate version of better quality, and this can not stop illegal removal visible watermark.Yip etc. (2006) have designed two kinds of reversible visible watermark schemes (list of references [3]: S. K. Yip, O. C. Au, C. W. Ho and H. M. Wong, " Lossless visible watermarking; " in Proc. Int. Conf. Multimedia and Expo., 2006, pp. 853-856.): PVMA (Pixel Value Matching Algorithm) and PPSA (Pixel Position Shift Algorithm), they adopt respectively dijection mapping function and circulation pixel shift to embed visible watermark.Liu and Tsai utilizes one to one, and Compound Mappings realizes that visible watermark embeds and original image Distortionless (list of references [4]: T. Y. Liu and W. H. Tsai, " Generic Lossless Visible Watermarking-A New Approach; " IEEE Transactions on Image Processing, vol. 19, no. 5, pp. 1224-1234, May 2010.).Though document [3], [4] described scheme Distortionless original image needs original watermark information in original image rejuvenation, and watermark is clear not in the concealed image (containing the visible watermark image), visibility is not high.Other has the reversible visible watermark scheme of a class to utilize the lossless data hiding technology that some are embedded in the image-carrier about the additional information of watermark or original image is harmless, thereby the additional information of utilizing Distortionless to go out is removed visible watermark.The embedding of additional information can reduce the visible watermark sharpness undoubtedly.In general, above erasable visible watermark scheme is not all carried out in compression domain, and its practicality is not strong, is difficult to be applied to the internet environment multimedia realtime communication.
Summary of the invention
1. technical matters:
There is certain defect in existing erasable visible watermark scheme, or can't stop the disabled user only illegally to remove visible watermark by the key of subtle change, or the participation of process need original watermark information is removed in watermark, and scarcely directly carrying out visible watermark for compressed image embeds, its practicality is not strong, is difficult to be applied to the internet and communicates by letter with the mobile computing environment multimedia digital.
2. technical scheme:
A kind of erasable visible watermark scheme in conjunction with the BTC coding of the present invention comprises that watermark embeds factor calculating, watermark embedding, visible watermark is removed and original image recovers altogether three phases.Idiographic flow is:
(1) watermark embeds factor calculating
Step 1: read original image, obtain image B TC coding
,
i=1,2 ...,
p, and
, wherein
m*
nBe the image size,
s*
sBe image block size in the BTC cataloged procedure.
Step 2: reading in size is
Two-value visible watermark image
W, according to watermark information, original image can be divided into watermark areas and non-watermark areas (i.e. the corresponding watermark areas of 0 pixel, the corresponding non-watermark areas of 1 pixel).
Step 3: go to predict watermark areas image block average according to the neighborhood pixels predicted method by non-watermark areas image block average, obtain prediction average image
Step 4: by prediction average image version
Calculate the smoothness properties of each piecemeal of image
With the brightness sensitivity characteristic
, and derive thus BTC each image block sight factor of encoding
, be shown below.
Step 5: for avoiding causing concealed image (containing the visible watermark image) visual quality obviously to descend because embedment strength difference is excessive, will
Normalize to the interval [
r 1 ,
r 2 ] in, namely get the image block self-adaptation and embed the factor
, get in the experiment
r 1 =0.1,
r 2 =0.3.
(2) watermark embeds
Step 1: two-dimentional visible watermark is converted to the one dimension watermark signal, namely
W=
Step 2: to each tlv triple of image B TC coding
, embed the visible watermark signal with self-adaptation, tlv triple after must adjusting by adjusting to some extent its quantized level
, the visible watermark embedding strategy is shown below,
Wherein
T, 
Be respectively the image block BTC coded quantization level that embeds after the visible watermark information, namely
t 
,
Parameter
ρ 1 ,
ρ 2 Be user's defining constant, and
,
The watermark component
W A And gray threshold
G 1 For experience often is worth, usually get in the experiment
W A =20 Hes
G 1 =128.This embedding strategy is so that visible watermark has respectively high and low gray-scale value at darker and brighter background area, and this can guarantee that the visible watermark that embeds has higher sharpness.
Step 3: utilize chaotic maps that the one dimension watermark signal is encrypted pre-service.
Step 4: utilize lossless data hiding method, by adjusting the encode magnitude relationship of two quantized levels of image block BTC, the watermark signal that will add after chaos encryption is processed is embedded in the image B CT coding with invisible mode, and the image block BTC coding tlv triple after note is adjusted again is
After whole encrypted watermark bits embeddings are complete, namely produce final concealed image
I w
(3) visible watermark is removed with original image and is recovered
Step 1: read concealed image
I w , obtain image B TC coding.
Step 2: according to concealed image B TC coding tlv triple
In two quantum step sizes relations extract encrypted watermark information, utilize with the watermark embed process same key it carried out chaos decode, obtain watermark signal, and recover each tlv triple that only contains visible watermark information
Step 3: the watermark information according to recovering is divided into watermark areas and non-watermark areas with concealed image.
Step 4: utilize the neighborhood pixels predicted method by the non-watermark areas BTC coded prediction of concealed image watermark areas image block average, can obtain an average image prediction version (since watermark embed before and after average image prediction data produces by non-watermark areas pixel prediction, therefore the original image mean prediction version of the concealed image mean prediction version that produces here and the generation of watermark embedding stage is consistent).
Step 5: according to the watermark embed process same procedure, calculate the visible watermark self-adaptation by concealed image prediction version and embed the factor.
Step 6: to each image block in the concealed image, its BTC coding tlv triple is
, then can remove the visible watermark component by formula (4).Until after all images piecemeal watermark component is removed, namely recover original image.
Wherein
,
tBe respectively the piecemeal BTC coded quantization level of concealed image and Recovery image, namely
,
t 
3. beneficial effect:
Adopt technical scheme provided by the invention, compare with existing correlation technique a few days ago, have following distinguishing feature and advantage:
(1) the concealed image visual effect of embedding visible watermark is good.To dissimilar image, its PNSR value on average can reach more than 24.50 dB, can satisfy preferably domestic consumer to the demand of tentatively browsing of digital visual media.
(2) watermark observability is good.Because the watermark self-adaptation embeds the calculating of the factor and takes into full account the image perception characteristic, visible watermark all has the embedment strength visible watermark contrast of appropriateness high in different brightness, different texture zone, and human eye can clearly pick out the visible watermark in the concealed image.This can play the effect that shows copyright notice effectively.
(3) visible watermark strong robustness.The signal processing operations such as common figure image intensifying, image sharpening, image filtering, compression of images, conspiracy attack, binaryzation are difficult to remove the visible watermark in the concealed image.
(4) high-quality original image recovers.The authorized user that has password can effectively be removed visible watermark, and high quality resume goes out original image.Than document [2] method, the original image PNSR value that method of the present invention recovers on average will exceed more than 8.0 dB.This can guarantee that authorized user browses demand to the high-quality of visual media.
(5) safe.The present invention's key space that proposes a plan is 10
30, can effectively stop exhaustive attack, even and have faint different key and also can't correctly remove visible watermark.When the disabled user uses and with correct key key (only key last different) the removal watermark of subtle change to be arranged, it is following (at this moment that the original image PSNR value that the inventive method recovers is low to moderate 19.0 dB, the original image that recovers has no value for use), compare with document [2] method, its PSNR value on average will be hanged down more than 18.0 dB.This can stop unauthorized user to obtain the high definition visual media preferably.
(6) real-time.Method of the present invention realizes in image B TC coding since BTC coding techniques computation complexity low, simple, be easy to realization, so that this scheme can better be applied to network real time environment digital visual medium copyright protection and secure communication.
Description of drawings
Fig. 1 is that visible watermark embeds factor calculation flow chart
Fig. 2 is that watermark of the present invention embeds process flow diagram
Fig. 3 is that visible watermark of the present invention is removed and original image recovery process flow diagram
Embodiment
The below provides possible Application Example of technical scheme that the present invention proposes.The technical scheme that copyright owner or publisher propose by the present invention obtains original image BTC coding, directly in the BTC coding corresponding BTC compressed image is carried out visible watermark and embed, and watermark data can't harm and is hidden in its BTC encodes after will encrypting.The BTC compressed image that will embed again visible watermark is uploaded to network, browses use for domestic consumer.But domestic consumer can't correctly not extract watermark information owing to there being correct key, thereby can not effectively remove visible watermark information.Played so preferably copyright notice.On the other hand, user's wish interested obtains high-quality image copyright, can obtain correct key with effective removal visible watermark by buying copyright, reaches high-quality and browses demand.
Embodiment is:
(1) visible watermark embeds factor calculating
With reference to Fig. 1, it is as follows that visible watermark embeds factor calculating idiographic flow.
Step 1: read original image, obtain image B TC coding
,
i=1,2 ...,
p, and
, wherein
m*
nBe the image size,
s*
sBe image block size in the BTC cataloged procedure,
Be respectively two quantized levels that are higher than the piecemeal average and are lower than average,
Be image block position diagram (be higher than the corresponding position of average value 1, otherwise value 0).
Step 2: reading in size is
Two-value visible watermark image
W, according to watermark information, original image can be divided into watermark areas
With non-watermark areas
(i.e. the corresponding watermark areas of 0 pixel, the corresponding non-watermark areas of 1 pixel).
Step 3: by image B TC each tlv triple of encoding
, calculate a Mean Matrix
L, its element value is as follows:
Wherein
For in the image block more than or equal to the number of pixels of piecemeal average.
Step 4: for matrix
LBut in the watermark areas pixel value, can use the neighborhood pixels predicted method, by in the image block neighborhood non-watermark areas image block average and watermark areas image block the prediction average produce, thereby obtain predicting the average image
So, the average image
Each pixel value can be calculated by formula (2),
Wherein
={ image block block
iNon-watermark block in the neighborhood },
={ image block block
iObtained to predict the watermark block of average in the neighborhood },
Represent to round up function,
The gesture of set is asked in expression.Attention: prediction average image
Generation do not use the watermark areas Pixel Information, thereby at receiving end, utilize same method, authorized user can generate identical prediction average image by concealed image.
Step 5: by prediction average image version
Calculate the smoothness properties of each piecemeal of image
With the brightness sensitivity characteristic
, and derive thus BTC each image block sight factor of encoding
, be shown below.
Step 6: for avoiding causing concealed image (containing the visible watermark image) visual quality obviously to descend because embedment strength difference is excessive, will
Normalize to the interval [
r 1 ,
r 2 ] in, namely get the image block self-adaptation and embed the factor
Get among the embodiment
r 1 =0.1,
r 2 =0.3.
(2) watermark embeds
With reference to Fig. 2, it is as follows that watermark embeds idiographic flow.
Step 1: two-dimentional visible watermark is mapped as the one dimension watermark signal, namely
W=
Step 2: to each tlv triple of image B TC coding
, by adjusting to some extent its quantized level
Embed the visible watermark signal with self-adaptation, tlv triple was after note was revised and adjusted
, then the visible watermark embedding strategy is shown below,
Wherein
T, Be respectively the image block BTC coded quantization level that embeds after the visible watermark information, namely
t 
,
Parameter
ρ 1 ,
ρ 2 Be user's defining constant, and
,
The watermark component
W A And gray threshold
G 1 For experience often is worth, usually get in the experiment
W A =20 Hes
G 1 =128.This embedding strategy is so that visible watermark has respectively high and low gray-scale value at darker and brighter background area, and this can guarantee that the visible watermark that embeds has higher sharpness.
Step 3: given user key key1, and it is mapped to the interval
In obtain k1.
Step 4: with k1 binary pseudo-random of initial value grey iterative generation as logistic chaotic maps (seeing formula 6)
D 1 ,
D 1 =
d 1 (
i) |
d 1 (
i)=0,1,
i=1,2 ...,
p, }.
Branch parameter wherein
μIn the interval (3.599456,4] interior value, be in chaos state to guarantee chaotic maps.
Step 5: given another user key key2, and it is mapped to the interval
In obtain k2.Utilize k2 to make the chaotic maps initial value to generate a pseudorandom integer sequence
D 2 ,
Step 6: utilize binary pseudo-random
D 1 Carry out the step-by-step XOR with watermark signal W, obtain the modulation watermark signal
Further by the pseudorandom integer sequence
D 2 To the watermark signal after the modulation
Carry out the position scramble, to obtain the encrypted watermark signal
Step 7: utilize lossless data hiding method, by adjusting the encode magnitude relationship of two quantized levels of image block BTC, the watermark signal that will add after chaos encryption is processed is embedded in the image B CT coding with invisible mode.After all encrypted watermark bits embeddings are complete, namely produce final concealed image
I w
Image block BTC coding tlv triple after note is adjusted again is
, then concrete hiding strategy can be expressed as follows,
Wherein
Expression step-by-step inversion operation.
(3) visible watermark is removed with original image and is recovered
With reference to Fig. 3, visible watermark is removed with original image recovery concrete steps and is described below.
Step 1: read concealed image
I w , obtain concealed image B TC coding.
Step 2: according to concealed image B TC coding tlv triple
In two quantized levels
Magnitude relationship is extracted encrypted watermark information
, namely
Step 3: further and recover the image B TC that only contains visible watermark information each tlv triple of encoding
Step 4: given user key key1 and key2, utilize with the watermark embed process same procedure and generate pseudo-random sequence
D 1 With
D 2 Utilize sequence
D 1 With
D 2 To the encrypted watermark signal
Carry out chaos decode, obtain watermark information
W
Step 5: according to the watermark information that recovers
W, concealed image is divided into watermark areas and non-watermark areas.
Step 6: utilize the neighborhood pixels predicted method by the non-watermark areas BTC coded prediction of concealed image watermark areas image block average, can obtain an average image prediction version (since watermark embed before and after average image prediction data produces by non-watermark areas pixel prediction, therefore the original image mean prediction version of the concealed image mean prediction version that produces here and the generation of watermark embedding stage is consistent).
Step 7: according to the watermark embed process same procedure, calculate the visible watermark self-adaptation by concealed image prediction version and embed the factor
Step 8: to each image block in the concealed image, its BTC coding tlv triple is
, then can remove visible watermark component in the concealed image by formula (10).Until after all images piecemeal visible watermark component is removed, namely recover original BTC coded image.
Wherein
,
tBe respectively the piecemeal BTC coded quantization level of concealed image and Recovery image, namely
,
t 
, and
ρ 1 ,
ρ 2 ,
W A With
G 1 Value and watermark to embed the stage identical.
Claims (4)
1. the erasable visible watermark scheme in conjunction with the BTC coding is characterized in that, comprises three steps:
(1) watermark embeds factor calculating: calculate self-adaptation according to the original image apperceive characteristic and embed the factor;
(2) watermark embeds: with visual way watermark information is embedded among the original image adaptively, with invisible mode the encrypted watermark information lossless is embedded in the original image simultaneously;
(3) visible watermark is removed with original image and recovered: authorized user uses correct key correctly to extract binary watermarking information, thereby is removed visible watermark and recover original image.
2. watermark embeds factor computing module as described in claim 1, it is characterized in that, according to visible watermark information original image is divided into watermark areas and non-watermark areas two parts; Utilize the neighbor predicted method to predict the watermark areas pixel by non-watermark areas pixel, to generate an original image predicted version; Calculate self-adaptation in conjunction with former figure predicted version apperceive characteristic and embed the factor.
3. watermark merge module as described in claim 1 is characterized in that, watermark information is embedded into adaptively among two quantized levels of original image BTC coding with visual way; Watermark information is embedded among the former figure BTC coding so that invisible mode is harmless after will encrypting, and illegally removes to stop visible watermark.
4. visible watermark is removed and original image recovery module as described in claim 1, it is characterized in that, at receiving end, the authorized user that has key correctly extracts binary watermarking information; Generate former figure predicted version according to the non-watermark areas pixel prediction of binary watermarking information, and further calculate the embedding factor; Utilize the embedding factor that obtains, from contain watermarking images, remove visible watermark and recover original image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310012513XA CN103034971A (en) | 2013-01-14 | 2013-01-14 | BTC-combined visible watermark erasing scheme |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310012513XA CN103034971A (en) | 2013-01-14 | 2013-01-14 | BTC-combined visible watermark erasing scheme |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103034971A true CN103034971A (en) | 2013-04-10 |
Family
ID=48021840
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310012513XA Pending CN103034971A (en) | 2013-01-14 | 2013-01-14 | BTC-combined visible watermark erasing scheme |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103034971A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104835104A (en) * | 2014-02-07 | 2015-08-12 | 湖南第一师范学院 | Digital image active camouflage scheme based on fractal |
| CN104885082A (en) * | 2013-04-27 | 2015-09-02 | 东莞宇龙通信科技有限公司 | Terminal and method for hiding and protecting data information |
| CN105069455A (en) * | 2015-07-15 | 2015-11-18 | 广州敦和信息技术有限公司 | Method and device for filtering official seal of invoice |
| CN105812816A (en) * | 2016-03-17 | 2016-07-27 | 安徽大学 | Compression, encryption and authentication joint coding method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110194727A1 (en) * | 2010-02-11 | 2011-08-11 | National Taiwan University Of Science & Technology | Image data processig systems for hiding secret information and data hiding methods using the same |
| CN102722855A (en) * | 2011-03-31 | 2012-10-10 | 北京大学 | Reversible watermark embedding method, extracting method thereof, device and system |
-
2013
- 2013-01-14 CN CN201310012513XA patent/CN103034971A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110194727A1 (en) * | 2010-02-11 | 2011-08-11 | National Taiwan University Of Science & Technology | Image data processig systems for hiding secret information and data hiding methods using the same |
| CN102722855A (en) * | 2011-03-31 | 2012-10-10 | 北京大学 | Reversible watermark embedding method, extracting method thereof, device and system |
Non-Patent Citations (4)
| Title |
|---|
| MINGHUI SHI等: "Dual Image Watermarking Algorithm Based on Block Truncation Code", 《INTERNATIONAL JOURNAL OF COMPUTER SCIENCE ISSUES》 * |
| 姜明芳: "基于自适应可见水印的文档资源版权保护机制", 《情报杂志》 * |
| 杨恒伏等: "结合视觉感知的BTC域高容量数据隐藏方案", 《计算机工程与应用》 * |
| 郎永祥等: "用于实时通信版权保护的BTC图像水印技术", 《电视技术》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104885082A (en) * | 2013-04-27 | 2015-09-02 | 东莞宇龙通信科技有限公司 | Terminal and method for hiding and protecting data information |
| CN104885082B (en) * | 2013-04-27 | 2018-04-10 | 东莞宇龙通信科技有限公司 | The hiding guard method of terminal and data message |
| CN104835104A (en) * | 2014-02-07 | 2015-08-12 | 湖南第一师范学院 | Digital image active camouflage scheme based on fractal |
| CN104835104B (en) * | 2014-02-07 | 2017-11-03 | 湖南第一师范学院 | Digital picture active Camouflage project based on point shape |
| CN105069455A (en) * | 2015-07-15 | 2015-11-18 | 广州敦和信息技术有限公司 | Method and device for filtering official seal of invoice |
| CN105069455B (en) * | 2015-07-15 | 2018-04-24 | 广州敦和信息技术有限公司 | A kind of method and device of invoice official seal filtering |
| CN105812816A (en) * | 2016-03-17 | 2016-07-27 | 安徽大学 | Compression, encryption and authentication joint coding method |
| CN105812816B (en) * | 2016-03-17 | 2019-04-09 | 安徽大学 | A kind of compression encryption certification joint coding method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Das et al. | A novel steganography method for image based on Huffman Encoding | |
| Juneja et al. | An improved LSB based steganography technique for RGB color images | |
| Hamid et al. | Image steganography techniques: an overview | |
| Yang et al. | A contrast-sensitive reversible visible image watermarking technique | |
| Hussain et al. | Pixel intensity based high capacity data embedding method | |
| Shejul et al. | A secure skin tone based steganography using wavelet transform | |
| Sajasi et al. | An adaptive image steganographic scheme based on noise visibility function and an optimal chaotic based encryption method | |
| Yang et al. | A secure removable visible watermarking for BTC compressed images | |
| Keyvanpour et al. | Blind image watermarking method based on chaotic key and dynamic coefficient quantization in the DWT domain | |
| Santoso et al. | An improved message capacity and security using divide and modulus function in spatial domain steganography | |
| Bhautmage et al. | Advanced video steganography algorithm | |
| Kang et al. | A digital watermarking approach based on DCT domain combining QR code and chaotic theory | |
| Rai et al. | Analysis of image steganography techniques: a survey | |
| Arora et al. | Comparative study of image steganography techniques | |
| Bekkouch et al. | Robust and reversible image watermarking scheme using combined DCT-DWT-SVD transforms | |
| CN103034971A (en) | BTC-combined visible watermark erasing scheme | |
| Siddiqui et al. | Chaos-based video steganography method in discrete cosine transform domain | |
| Verma | Review of steganography techniques | |
| Yan-yan et al. | A Watermarking-based Visual Cryptography Scheme with Meaningful Shares | |
| Rahmani et al. | A new lossless watermarking scheme based on DCT coefficients | |
| Naseem et al. | Novel technique for capacity maximizing in digital watermarking using fuzzy rule base | |
| Sheth | Snake and ladder based algorithm for steganographic application of specific streamline bits on prime gap method | |
| Shiju et al. | Performance analysis of high dynamic range image watermarking based on quantization index modulation | |
| Goswami et al. | Coloured and Gray Scale Image Steganography using Block Level DWT DCT Transformation | |
| Arjun et al. | An approach to adaptive steganography based on matrix embedding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130410 |