CN102567942A - Reversible watermark method utilizing histogram shifting - Google Patents
Reversible watermark method utilizing histogram shifting Download PDFInfo
- Publication number
- CN102567942A CN102567942A CN2012100051108A CN201210005110A CN102567942A CN 102567942 A CN102567942 A CN 102567942A CN 2012100051108 A CN2012100051108 A CN 2012100051108A CN 201210005110 A CN201210005110 A CN 201210005110A CN 102567942 A CN102567942 A CN 102567942A
- Authority
- CN
- China
- Prior art keywords
- watermark
- zone
- histogram
- information
- pixel
- 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
Links
Images
Abstract
The invention provides a reversible watermark method based on histogram shifting and has significant practical values for protecting multimedia copyrights. By means of the reversible watermark method, traditional histogram shifting algorithms are improved in two aspects, firstly, 1 and 0 in a bite map are more imbalanced by arranging a generation process of the bit map on watermark embedding rather than in a non-pretreatment stage, so that compression is easier, and embedding capacity is improved; and secondly, the reversible watermark method is a two-step embedding method. The watermark blind extraction is achieved and troubles that the histogram shifting method needs extra side information transmitting are solved by dividing an image into an upper large area and a lower large area, subjecting the upper area to the watermark embedding, embedding the generated side information into the lowest significant bit containing watermark pixels in the area, and embedding the left watermark information and the replaced lowest significant information into the lower area.
Description
Technical field
The present invention relates to the multi-media information security field, particularly relate to a kind of reversible water mark method that utilizes the histogram translation.
Background technology
In recent years, as a kind of effective means of multimedia copyright protection, digital watermark technology causes the extensive concern of academia.Traditional digital watermark method is stressed not sentience, robustness and the capacity of watermark; Although watermark embeds and to cause the carrier distortion can not perception, some special occasions of military, medical treatment and judicial domain does not often allow to occur having the watermark carrier of permanent distortion.So the reversible water mark technology is arisen at the historic moment.Reversible water mark requires the extraction watermark that demoder can not only be complete, and can undistorted recovery original artwork after extracting watermark.
Propose by people such as Ni based on the reversible water mark method of histogram translation, and obtain extensively to pay attention in the industry because of its low computation complexity and higher watermarking images quality.The reversible water mark method of existing histogram translation comes with some shortcomings, and for example: watermark capacity is lower, need extra transmission side information (like peak point/zero point) thus reduced availability.
Summary of the invention
The present invention proposes a kind of reversible water mark method based on the histogram translation, has improved the embedding capacity, and extra transmission side information has been avoided in the blind extraction of the watermark that realizes simultaneously, has improved security and availability.
For solving the problems of the technologies described above; The technical scheme that the present invention adopts is: a kind of reversible water mark method that utilizes the histogram translation is provided; Comprise watermark embed process, watermark extraction process and image recovery process; It is characterized in that; Gray scale carrier image for a width of cloth N-pixel 8-bit; The gray-scale value of the individual pixel of
expression gray-scale map
; Wherein
; The watermark that needs to embed is
, and said watermark embed process may further comprise the steps:
A. calculate the difference between the carrier image pixel, generate histogram;
b. According to the histogram and watermarks
determine the embedded layers
;
C. image pixel value is labeled as POPs between the pixel of
, and rest of pixels is labeled as R_POPs;
D. watermark
is divided into
part;
; The initialization number of plies
; Carrying out watermark embeds: layer embeds for
; Select the peak point and the zero point of a pair of optimization; Use
and
expression respectively, use difference territory histogram shift method embed watermark
then; if
; Then make
, and embed the watermark of one deck down; Up to getting into last one deck; Go on foot embedding inlay techniques with
with two; The compression bitmap, side information and total embedding number of plies
be embedded into
layer in.
Further, said
Two step embedding inlay techniquesMay further comprise the steps:
A. generate histogram according to carrier image, select highest frequency point conduct " peak point " in the histogram, and being " zero point " apart from the nearest zero frequency point of peak point in the histogram;
B. the first step embeds: carrier image is divided into two zones, and wherein the zone in order to built-in edges information is " zone one ", and other are " zone two ", and histogram translation and embedded part watermark are carried out in " zone one ";
C. the embedding of side information: the watermark location of pixels according to being used for hidden edge information in the key K definite " zone one ", utilize least significant bit (LSB) replacement technology that histogrammic side information is hidden in the least significant bit (LSB) of watermark pixel;
D. second step embedded: the least significant bit (LSB) that utilizes histogram translation technology will remain watermark information and former replacement pixel is embedded into " zone two ".
As what one of improve, said
Two step embedding inlay techniquesMay further comprise the steps:
A. watermark
is divided into three parts;
; Make
; The pixel that is labeled as POPs is carried out histogram translation of difference territory and embed watermark
; Identify the position of overflowing; Generate bitmap; Bitmap and side information after LM and the compression of SI difference mark, and carry out the histogram shrinkage operation;
B. the first step embeds: carrier image is divided into two zones, and wherein the zone in order to built-in edges information is " zone one ", and other are " zone two "; Utilize difference territory histogram shift method
to be hidden among the R_POPs in " zone one ", to corresponding pixel reconstructed image;
C. with the method for least significant bit (LSB) replacement LM, SI and
are embedded in the least significant bit (LSB) of " zone one " watermarking images, concrete position is controlled by key K;
D. second step embedded: the least significant bit (LSB) information that replacement is come out is embedded into
among the R_POPs in " zone two ".
Described watermark extraction process and image recovery process may further comprise the steps: the watermark receiving end is confirmed watermark location of pixels in " zone one " according to key K; From its least significant bit (LSB) information, extract peak point and information at zero point, and in view of the above watermark extracting and image recovery are implemented in " zone two "; , based on the replacement pixel least significant bit (LSB) information that obtains recover the least significant bit (LSB) information of " zone one " in watermark pixel, and watermark extracting and image recovery are done in " zone one " thereafter.
Further,The capacity in said " zone one " is greater than the volume of side information.
Especially, said
=1.
Compared with prior art, beneficial effect is: the present invention carries out two sports to traditional histogram translation algorithm and improves:
The first, the present invention proposes a kind of algorithm that reduces bit map size in the side information.Through the generative process with bit map be positioned over watermark embed after but not pretreatment stage can make ' 1 ' in the bit diagram with ' thereby 0 ' more unbalancely be easier to compression.The size that therefore can effectively reduce compression bit bitmap in the side information is to improve the embedding capacity.
The second, the present invention proposes a kind of reversible water mark algorithm based on " two step embedding inlay techniques ".Through image being divided into two big zones up and down; To carrying out that watermark embeds and the side information that generates be embedded in the plain least significant bit (LSB) of the moisture printing in this zone in the first area; The least significant bit (LSB) information of then remaining watermark information and replacement being come out is embedded in second area; Realize the blind extraction of watermark, solved the puzzlement that the histogram translation algorithm needs extra transmission side information.
Description of drawings
The two step embedding inlay technique principle schematic that Fig. 1 proposes for the present invention;
Fig. 2 realizes synoptic diagram for the present invention;
Fig. 3 is watermark embedding method result behind the embedded images in Baboon that the present invention proposes, and wherein (a) is original image, (b) is embed watermark image afterwards;
Fig. 4 is watermark embedding method result behind the embedded images in Boat that the present invention proposes, and wherein (a) is original image, (b) is embed watermark image afterwards;
Fig. 5 is watermark embedding method result behind the embedded images in Peppers that the present invention proposes, and wherein (a) is original image, (b) is embed watermark image afterwards.
Embodiment
Below in conjunction with accompanying drawing the present invention is done detailed description.
The present invention adopts two step embedding inlay techniques to carry out the embedding of watermark, and is divided into individual layer embedding and multilayer embedding according to the size of watermark information.
For the ease of understanding the present invention, brief account difference territory histogram translation once watermarking algorithm at first.
Image
is the gray scale carrier image of N-pixel 8-bit; The gray-scale value of our the individual pixel of expression gray-scale map
with
, wherein
.
Image scanned with " type of falling S order " obtains one-dimensional sequence, difference between calculating pixel
:
Difference to generating is asked histogram, the peak point P that is optimized and zero point Z.For based on histogram translation watermarking algorithm, a peak point pixel can embed the secret information of 1 bit.Therefore watermark capacity can be used computes:
Wherein
representes histogrammic frequency.
With peak point be matched to zero point rightly, the histogram that will be positioned at peak point and zero point then is along one of 0:00 direction translation, and exchange to by the peak point this moment at former zero point.The difference of scanning original image, when running into the peak point pixel, embed 1 bit watermark: for information " 0 ", pixel value remains unchanged; For information " 1 ", pixel value becomes adjacent zero point.
Suppose the left side of peak point P at Z at zero point, the histogram translation can be represented with following formula:
（3）
The open interval of
expression
and
, the watermark information that
expression embeds.
Produce watermarking images according to difference
:
（4）
When
=1; Situation is fairly simple, for individual layer embeds.When embed watermark hour, generally use individual layer to embed.Concrete steps are following: 1) select at peak point and zero point: generate histogram according to carrier image, select highest frequency point conduct " peak point " in the histogram, and being " zero point " apart from the nearest zero frequency point of peak point in the histogram; 2) first step embeds: as shown in Figure 1, initial carrier is divided into two zones, and wherein the zone in order to built-in edges information is " zone one ", other are " zone two ".Utilize optimum peak value and the zero point confirmed that histogram translation and embedded part watermark are carried out in " zone one ".3) embedding of side information: the watermark location of pixels of confirming to be used in " zone one " hidden edge information according to key K.Utilize least significant bit (LSB) (LSB) replacement technology with histogrammic peak point and zero point Information hiding in the LSB of watermark pixel.4) second step embedded: the LSB that utilizes histogram translation technology will remain watermark information and former replacement pixel is embedded into " zone two " in the lump.
The watermark receiving end is confirmed watermark location of pixels in " zone one " according to key K, from its LSB, extracts peak point and information at zero point, and in view of the above watermark extracting and image recovery is implemented in " zone two "., based on the replacement pixel LSB information that obtains recover the LSB of " zone one " in watermark pixel, and watermark extracting and image recovery are done in " zone one " thereafter.
For the selection in two zones, can simply adopt image two parts up and down.Concrete area ratio can be by cipher controlled, but will guarantee that the size in " zone one " is enough to hide side informations such as peak point/zero point.
Multilayer embeds watermarking images that (Multi-layer) refer to embedded last time and implements the reversible water mark method of histogram translation as new support, is mainly used in the occasion of bigger embedding capacity.General, multilayer embeds than once selecting the right repeatedly embedding (Multiple) at peak point/zero point of many groups can obtain higher performance.Embed for multilayer; For realizing that the blind watermark of multilayer embeds; Except that adopting " two step embedding inlay techniques "; Also need be used corresponding " chain type embedding " method (see figure 2), specific as follows: as 1) to estimate to embed number of stories m: the histogram according to watermark information size and carrier image generation is estimated the number of stories m that multilayer embeds; 2) chain type embeds: carrier image is carried out the multilayer histogram embed, optimum peak point and layer at zero point to the (m-1) are all selected in every layer of embedding earlier, and peak value/zero point of preceding (m-1) layer is recorded among the ordered series of numbers A side information.3) as shown in Figure 2; The m layer is done the embedding of two steps; And side information ordered series of numbers A and m layer side information be embedded in " zone one " of two step embedding inlay techniques as synchronizing information together, promptly utilize the mode of LSB replacement the side information of preceding m layer all to be embedded into " zone one " of m layer.
When the histogram shift method that uses based on the difference territory, the watermarking images partial pixel that is produced possibly exceed normal range, promptly produces and overflows.In order to address this problem, the method that generally adopts histogram to shrink.Consider that the difference change that each histogram translation causes is " 1 " to the maximum, through the translation of m layer histogram, pixel grey scale accumulative total change amount is no more than m.Histogram shrinks of formula (5):
（5）
In order to distinguish the source of overlay region pixel, can further use a bitmap mark contraction locations of pixels unidimensional with carrier image.When pixel shrank variation, bitmap was labeled as " 1 ", otherwise is labeled as " 0 ".The bitmap that produces is carried out degree of depth lossless compress, and in the middle of watermark information is embedded into carrier image.The histogram contraction method is generally used for pretreatment stage, to might produce the pixel of overflowing (potentially overflowed/underflowed pixels POPs) carries out shrinkage operation.
Yet not all POPs can produce after the watermark of experience m layer embeds and overflow.Our method will be changed the order that histogram translation and multilayer watermark embed, and only among the mark POPs through the multilayer watermark embed the back real produce the pixel of overflowing (actually overflowed/underflowed pixels, AOPs).Embed for the m layer; We are designated as POPs with gray-scale value in the carrier image in interval
pixel, and remaining pixel is designated as R_POPs; Then carrier image is carried out the histogram translation watermark embedding of difference conversion and enforcement preceding (m-1) layer.The mark of AOPs and two steps embed and will when the m layer embeds, carry out.Understand for ease, we are embedded as the example explanation with individual layer (m=1).Watermark
will be divided into three parts,
.At first; According to formula (3) (4) pixel that is labeled as POPs is carried out histogram translation of difference territory and embed watermark
; Identify the position of overflowing; Generate bitmap; Bitmap and side information after LM and the compression of SI difference mark carry out the histogram shrinkage operation with really producing the pixel of overflowing, and are masked as AOPs.Then the pixel that is labeled as R_POPs is implemented improved two step embedding inlay technique (improved two-step embedding, ITSE) operations.LM and SI identify bitmap and the side information (every layer peak point and null position) after the compression respectively.The first step embeds utilizes difference territory histogram shift method
to be hidden among the R_POPs in " zone one ", then to corresponding pixel reconstructed image.Method with the LSB replacement is embedded into LM and SI in the least significant bit (LSB) of " zone one " watermarking images, and concrete position is controlled by key K.The LSBs that second step was come out replacement is embedded into
among the R_POPs in " zone two ".So, final watermarking images has just generated.Last pixel that it should be noted that original image all will remain unchanged in the m layer embeds.
Introduce concrete implementation method below:
Gray scale carrier image
for a width of cloth N-pixel 8-bit; The gray-scale value of the individual pixel of
expression gray-scale map
; Wherein
; The watermark that needs to embed is
, and concrete watermark embedding method is following:
1) difference between calculating carrier image
pixel;
2) Generated based on the difference histogram and watermarks
determine the embedded layers
;
3) pixel value is labeled as POPs between the pixel of
in the carrier image, and remaining is labeled as R_POPs;
4) watermark
is divided into the m part;
; The initialization number of plies
is carried out the watermark embedding of multilayer based on the histogram translation under the framework of " two step embedding inlay techniques ";
4.1) layer embeds for
; Select the peak point and the zero point of a pair of optimization; Use
and
expression respectively, use difference territory histogram shift method embed watermark
then;
4.2) if
; Then make
, and use the method for step 4.1 to embed the watermark of one deck down; Otherwise jump to step 4.3;
4.3) last one deck watermark embedding;
is divided into three parts with watermark;
makes
.The improved two step embedding inlay techniques of using the preamble introduction then are with
; During the bitmap of compression, side information
and total embedding number of plies
are embedded into
layer.So, watermarking images
has just generated.
Existing statement is accomplished the experimental result that watermark embeds with the present invention.Here three width of cloth images of having selected to have the typical texture characteristic experimentize, and are respectively Baboon, and Peppers and Boat, three width of cloth images are the standard grayscale figure of 512 bits * 512 bits * 8.
Fig. 3 is watermark embedding method result behind the embedded images in Baboon that the present invention proposes.Wherein (a) is original image, (b) is embed watermark image afterwards, embeds number of plies m=5, PSNR=35.37db, capacity=0.295bpp; Can know that by figure the watermarking images after the embed watermark does not have notable difference with original image, satisfies the invisibility requirement.
Fig. 4 is watermark embedding method result behind the embedded images in Peppers that the present invention proposes.Wherein (a) is original image, (b) is embed watermark image afterwards, embeds number of plies m=5, PSNR=36.77db, capacity=0.532bpp; Can know that by figure the watermarking images after the embed watermark does not have notable difference with original image, satisfies the invisibility requirement.
Fig. 5 is watermark embedding method result behind the embedded images in Boat that the present invention proposes.Wherein (a) is original image, (b) is embed watermark image afterwards, embeds number of plies m=5, PSNR=36.17db, capacity=0.444bpp; Can know that by figure the watermarking images after the embed watermark does not have notable difference with original image, satisfies the invisibility requirement.
In order to assess the effect of improved bit map method; Here introduce parameter
; Calculate the economy of using improved bit map method, the definition of
is following:
Where
and
denote traditional and improved bitmap size.
Traditional bitmap of table 1 statement and of the comparison of improved bitmap in different embeding layer numerical digit figure sizes.Table 1 has shown the feasibility of our method, and reducing of bitmap is significantly, embeds the many more of the number of plies, and the method efficient that we propose also improves thereupon.
The bitmap size of the different bit map method of table 1
Claims (6)
1. reversible water mark method that utilizes the histogram translation; Comprise watermark embed process, watermark extraction process and image recovery process; It is characterized in that; Gray scale carrier image for a width of cloth N-pixel 8-bit; The gray-scale value of the individual pixel of
expression gray-scale map
; Wherein
; The watermark that needs to embed is
, and said watermark embed process may further comprise the steps:
A. calculate the difference between the carrier image pixel, generate histogram;
b. According to the histogram and watermarks
determine the embedded layers
;
C. image pixel value is labeled as POPs between the pixel of
, and rest of pixels is labeled as R_POPs;
D. watermark
is divided into
part;
; The initialization number of plies
; Carrying out watermark embeds: layer embeds for
; Select the peak point and the zero point of a pair of optimization; Use
and
expression respectively, use difference territory histogram shift method embed watermark
then; if
; Then make
, and embed the watermark of one deck down; Up to getting into last one deck; Go on foot embedding inlay techniques with
with two; The compression bitmap, side information and total embedding number of plies
be embedded into
layer in.
2. the reversible water mark method that utilizes the histogram translation according to claim 1 is characterized in that, and is said
Two step embedding inlay techniquesMay further comprise the steps:
A. generate histogram according to carrier image, select highest frequency point conduct " peak point " in the histogram, and being " zero point " apart from the nearest zero frequency point of peak point in the histogram;
B. the first step embeds: carrier image is divided into two zones, and wherein the zone in order to built-in edges information is " zone one ", and other are " zone two ", and histogram translation and embedded part watermark are carried out in " zone one ";
C. the embedding of side information: the watermark location of pixels according to being used for hidden edge information in the key K definite " zone one ", utilize least significant bit (LSB) replacement technology that histogrammic side information is hidden in the least significant bit (LSB) of watermark pixel;
D. second step embedded: the least significant bit (LSB) that utilizes histogram translation technology will remain watermark information and former replacement pixel is embedded into " zone two ".
3. the reversible water mark method that utilizes the histogram translation according to claim 1 is characterized in that, and is said
Two step embedding inlay techniques, may further comprise the steps:
A. watermark
is divided into three parts;
; Make
; The pixel that is labeled as POPs is carried out histogram translation of difference territory and embed watermark
; Identify the position of overflowing; Generate bitmap; Bitmap and side information after LM and the compression of SI difference mark, and carry out the histogram shrinkage operation;
B. the first step embeds: carrier image is divided into two zones, and wherein the zone in order to built-in edges information is " zone one ", and other are " zone two "; Utilize difference territory histogram shift method
to be hidden among the R_POPs in " zone one ", to corresponding pixel reconstructed image;
C. with the method for least significant bit (LSB) replacement LM, SI and
are embedded in the least significant bit (LSB) of " zone one " watermarking images, concrete position is controlled by key K;
D. second step embedded: the least significant bit (LSB) information that replacement is come out is embedded into
among the R_POPs in " zone two ".
4. according to claim 2 or the 3 described reversible water mark methods that utilize the histogram translation; It is characterized in that; Described watermark extraction process and image recovery process may further comprise the steps: the watermark receiving end is confirmed watermark location of pixels in " zone one " according to key K; From its least significant bit (LSB) information, extract peak point and information at zero point, and in view of the above watermark extracting and image recovery are implemented in " zone two "; , based on the replacement pixel least significant bit (LSB) information that obtains recover the least significant bit (LSB) information of " zone one " in watermark pixel, and watermark extracting and image recovery are done in " zone one " thereafter.
5. according to claim 2 or the 3 described reversible water mark methods that utilize the histogram translation, it is characterized in that the capacity in said " zone one " is greater than the volume of side information.
6. the reversible water mark method that utilizes the histogram translation according to claim 1; It is characterized in that said
=1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210005110.8A CN102567942B (en) | 2012-01-09 | 2012-01-09 | Reversible watermark method utilizing histogram shifting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210005110.8A CN102567942B (en) | 2012-01-09 | 2012-01-09 | Reversible watermark method utilizing histogram shifting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102567942A true CN102567942A (en) | 2012-07-11 |
| CN102567942B CN102567942B (en) | 2014-06-04 |
Family
ID=46413297
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210005110.8A Expired - Fee Related CN102567942B (en) | 2012-01-09 | 2012-01-09 | Reversible watermark method utilizing histogram shifting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102567942B (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103810665A (en) * | 2012-11-15 | 2014-05-21 | 中兴通讯股份有限公司 | Information hiding and extracting method and device |
| CN104933668A (en) * | 2015-06-11 | 2015-09-23 | 广东工业大学 | Processing method of reversible watermark on the basis of local positioning and ALattar integer transform |
| CN105741225A (en) * | 2016-02-01 | 2016-07-06 | 西安电子科技大学 | Reversible watermark method of multi-dimensional prediction error extension |
| CN106205627A (en) * | 2016-07-14 | 2016-12-07 | 暨南大学 | Based on side information prediction and the DAB reversible water mark algorithm of rectangular histogram translation |
| CN106355542A (en) * | 2015-07-13 | 2017-01-25 | Tcl集团股份有限公司 | Method for attaching data to image and method for analyzing attached data in image |
| CN108447492A (en) * | 2018-03-13 | 2018-08-24 | 中山大学 | A kind of self-adapting histogram translation reversible information hidden method based on segmentation |
| CN108614961A (en) * | 2017-12-21 | 2018-10-02 | 神龙汽车有限公司 | A kind of Database Digital Watermark is embedded and guard method |
| CN108876691A (en) * | 2017-05-10 | 2018-11-23 | 北京大学 | Adaptive reversible water mark method and system |
| CN110009548A (en) * | 2019-04-04 | 2019-07-12 | 中国矿业大学 | The more image watermark methods translated based on secret sharing and histogram |
| CN110322387A (en) * | 2019-07-09 | 2019-10-11 | 中国科学技术大学 | A kind of reversible visual watermark method being adapted to picture material |
| CN110445949A (en) * | 2019-08-06 | 2019-11-12 | 绍兴聚量数据技术有限公司 | The domain AMBTC reversible information hidden method based on histogram displacement |
| CN110766597A (en) * | 2019-10-22 | 2020-02-07 | 合肥高维数据技术有限公司 | Picture camouflaging method, picture camouflaging device, electronic equipment and storage medium |
| CN111343466A (en) * | 2020-01-17 | 2020-06-26 | 华南理工大学 | Reversible video data hiding method based on two-dimensional histogram translation |
| CN112669191A (en) * | 2019-10-15 | 2021-04-16 | 国际关系学院 | Anti-overflow reversible digital watermark embedding and extracting method based on image content identification |
| CN112907432A (en) * | 2021-03-08 | 2021-06-04 | 桂林理工大学 | Reversible watermark data hiding method based on bilinear interpolation |
| CN113112392A (en) * | 2020-01-13 | 2021-07-13 | 国际关系学院 | Watermark embedding and extracting method, embedding and extracting device, and processing system |
| CN114827380A (en) * | 2022-06-30 | 2022-07-29 | 智联信通科技股份有限公司 | Network security detection method based on artificial intelligence |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005074249A1 (en) * | 2004-02-02 | 2005-08-11 | Nippon Telegraph And Telephone Corporation | Electronic watermark embedding device, electronic watermark detection device, method thereof, and program |
| CN102156955A (en) * | 2011-04-11 | 2011-08-17 | 西安电子科技大学 | Robust reversible watermark embedding and extracting method based on histogram neighborhood |
-
2012
- 2012-01-09 CN CN201210005110.8A patent/CN102567942B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005074249A1 (en) * | 2004-02-02 | 2005-08-11 | Nippon Telegraph And Telephone Corporation | Electronic watermark embedding device, electronic watermark detection device, method thereof, and program |
| CN102156955A (en) * | 2011-04-11 | 2011-08-17 | 西安电子科技大学 | Robust reversible watermark embedding and extracting method based on histogram neighborhood |
Non-Patent Citations (3)
| Title |
|---|
| JUNXIANG WANG,JIANGQUN NI: "《A FAST PERFORMANCE ESTIMATION SCHEME FOR HISTOGRAM SHIFTING BASED MULTI-LAYER EMBEDDING》", 《IMAGE PROCESSING(ICIP),2010 17TH IEEE INTERNATIONAL CONFERENCE ON》, 29 September 2010 (2010-09-29), pages 3701 - 3704 * |
| 王俊祥，杨波: "《基于直方图平移可逆水印的性能估计》", 《计算机应用》, vol. 30, no. 12, 31 December 2010 (2010-12-31), pages 3246 - 3251 * |
| 王俊祥: "《抗陶瓷烧制变色的鲁棒水印技术算法研究》", 《电脑知识与技术》, vol. 7, no. 10, 30 April 2011 (2011-04-30), pages 2406 - 2407 * |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014075467A1 (en) * | 2012-11-15 | 2014-05-22 | 中兴通讯股份有限公司 | Method and device for information hiding and extraction |
| CN103810665A (en) * | 2012-11-15 | 2014-05-21 | 中兴通讯股份有限公司 | Information hiding and extracting method and device |
| CN104933668A (en) * | 2015-06-11 | 2015-09-23 | 广东工业大学 | Processing method of reversible watermark on the basis of local positioning and ALattar integer transform |
| CN104933668B (en) * | 2015-06-11 | 2019-03-15 | 广东工业大学 | A kind of processing method of the reversible water mark based on local positioning and Alattar integer transform |
| CN106355542A (en) * | 2015-07-13 | 2017-01-25 | Tcl集团股份有限公司 | Method for attaching data to image and method for analyzing attached data in image |
| CN106355542B (en) * | 2015-07-13 | 2019-12-13 | Tcl集团股份有限公司 | method for accompanying data in image and method for analyzing accompanying data in image |
| CN105741225A (en) * | 2016-02-01 | 2016-07-06 | 西安电子科技大学 | Reversible watermark method of multi-dimensional prediction error extension |
| CN106205627B (en) * | 2016-07-14 | 2019-10-18 | 暨南大学 | Digital audio reversible water mark algorithm based on side information prediction and histogram translation |
| CN106205627A (en) * | 2016-07-14 | 2016-12-07 | 暨南大学 | Based on side information prediction and the DAB reversible water mark algorithm of rectangular histogram translation |
| CN108876691B (en) * | 2017-05-10 | 2022-03-08 | 北京大学 | Self-adaptive reversible watermarking method and system |
| CN108876691A (en) * | 2017-05-10 | 2018-11-23 | 北京大学 | Adaptive reversible water mark method and system |
| CN108614961A (en) * | 2017-12-21 | 2018-10-02 | 神龙汽车有限公司 | A kind of Database Digital Watermark is embedded and guard method |
| CN108614961B (en) * | 2017-12-21 | 2020-09-04 | 神龙汽车有限公司 | Method for embedding and protecting digital watermark in database |
| CN108447492B (en) * | 2018-03-13 | 2021-08-20 | 中山大学 | Self-adaptive histogram translation reversible information hiding method based on segmentation |
| CN108447492A (en) * | 2018-03-13 | 2018-08-24 | 中山大学 | A kind of self-adapting histogram translation reversible information hidden method based on segmentation |
| CN110009548A (en) * | 2019-04-04 | 2019-07-12 | 中国矿业大学 | The more image watermark methods translated based on secret sharing and histogram |
| CN110009548B (en) * | 2019-04-04 | 2023-10-27 | 中国矿业大学 | Multi-image watermarking method based on secret sharing and histogram shifting |
| CN110322387A (en) * | 2019-07-09 | 2019-10-11 | 中国科学技术大学 | A kind of reversible visual watermark method being adapted to picture material |
| CN110445949A (en) * | 2019-08-06 | 2019-11-12 | 绍兴聚量数据技术有限公司 | The domain AMBTC reversible information hidden method based on histogram displacement |
| CN110445949B (en) * | 2019-08-06 | 2021-05-07 | 绍兴聚量数据技术有限公司 | Histogram shift-based AMBTC domain reversible information hiding method |
| CN112669191A (en) * | 2019-10-15 | 2021-04-16 | 国际关系学院 | Anti-overflow reversible digital watermark embedding and extracting method based on image content identification |
| CN110766597A (en) * | 2019-10-22 | 2020-02-07 | 合肥高维数据技术有限公司 | Picture camouflaging method, picture camouflaging device, electronic equipment and storage medium |
| CN110766597B (en) * | 2019-10-22 | 2023-07-07 | 合肥高维数据技术有限公司 | Picture camouflage method and device, electronic equipment and storage medium |
| CN113112392A (en) * | 2020-01-13 | 2021-07-13 | 国际关系学院 | Watermark embedding and extracting method, embedding and extracting device, and processing system |
| CN113112392B (en) * | 2020-01-13 | 2023-05-19 | 国际关系学院 | Watermark embedding and extracting method, watermark embedding and extracting device and processing system |
| CN111343466A (en) * | 2020-01-17 | 2020-06-26 | 华南理工大学 | Reversible video data hiding method based on two-dimensional histogram translation |
| CN111343466B (en) * | 2020-01-17 | 2021-09-21 | 华南理工大学 | Reversible video data hiding method based on two-dimensional histogram translation |
| CN112907432A (en) * | 2021-03-08 | 2021-06-04 | 桂林理工大学 | Reversible watermark data hiding method based on bilinear interpolation |
| CN114827380B (en) * | 2022-06-30 | 2022-09-02 | 智联信通科技股份有限公司 | Network security detection method based on artificial intelligence |
| CN114827380A (en) * | 2022-06-30 | 2022-07-29 | 智联信通科技股份有限公司 | Network security detection method based on artificial intelligence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102567942B (en) | 2014-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102567942B (en) | Reversible watermark method utilizing histogram shifting | |
| Ernawan et al. | A robust image watermarking technique with an optimal DCT-psychovisual threshold | |
| Kim et al. | Reversible data hiding exploiting spatial correlation between sub-sampled images | |
| CN103123720B (en) | Based on the lossless data hiding method of error image histogram cycle spinning | |
| CN105512999A (en) | Dual-transform color image holographic watermarking method | |
| Chen et al. | A robust watermarking scheme using phase shift keying with the combination of amplitude boost and low amplitude block selection | |
| Rai et al. | Analysis of image steganography techniques: a survey | |
| Arya et al. | Improved capacity image steganography algorithm using 16-pixel differencing with n-bit LSB substitution for RGB images | |
| CN101833745A (en) | Method for detecting embedding and extracting of multiple binary embedded watermarks of digital image | |
| Meenpal et al. | Digital watermarking technique using dual tree complex wavelet transform | |
| Wang et al. | An efficient reversible data hiding scheme using prediction and optimal side information selection | |
| Li et al. | Data hiding in images by adaptive LSB substitution based on the pixel-value differencing | |
| Chen et al. | DCT-based reversible image watermarking approach | |
| Mathews et al. | Histogram shifting based reversible data hiding using block division and pixel differences | |
| Morzelona | Histogram Based Data Cryptographic Technique with High Level Security | |
| Luo et al. | Asymmetric self-recovery oriented stereo image watermarking method for three dimensional video system | |
| CN102314668A (en) | Difference-expansion digital-watermark-embedding improvement method for enhancing quality of watermark-embedded image | |
| Niimi et al. | An attack to BPCS-steganography using complexity histogram and countermeasure | |
| Kumar et al. | Image steganography in high entropy regions using a key & modified LSB for improved security | |
| Chang | Efficient lossless watermarking algorithm using gradient sorting and selective embedding | |
| Nikbakht et al. | Targeted dewatermarking of two non-blind SVD-based image watermarking schemes | |
| Kuribayashi et al. | Watermarking schemes using the addition property among DCT coefficients | |
| Lo-Varco et al. | DCT-based data hiding for securing ROI of color images | |
| Onoja et al. | Robust Watermarking Techniques for the Authentication and Copyright Protection of Digital Images: A Survey | |
| Channapragada et al. | Digital Watermarking Using Fractal Coding |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140604 Termination date: 20150109 |
|
| EXPY | Termination of patent right or utility model |