CN103093127B - Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks - Google Patents
Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks Download PDFInfo
- Publication number
- CN103093127B CN103093127B CN201310021067.9A CN201310021067A CN103093127B CN 103093127 B CN103093127 B CN 103093127B CN 201310021067 A CN201310021067 A CN 201310021067A CN 103093127 B CN103093127 B CN 103093127B
- Authority
- CN
- China
- Prior art keywords
- matrix
- binary bitmap
- coefficients
- watermark
- key
- 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
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a method and a system of dynamic copyright protection based on sudoku and multiple digital watermarks. The method and the system of the dynamic copyright protection based on the sudoku and the multiple digital watermarks comprise a data base, a dividing block module, a processing module, a watermark pretreatment module and an embedment module. The method and the system of the dynamic copyright protection based on the sudoku and the multiple digital watermarks solve the problem that the multiple digital watermarks are dynamically embedded in different host regions by using the sudoku character, achieves a robustness watermarking algorithm, and resolves a multiple copyrights problem and a copyright authentication problem in different phases of release, sale and use of digital products. The method of the dynamic copyright protection based on the sudoku and the multiple digital watermarks is not only practical and strong in operability, but also a good expandability template, and thus any additive digital watermarks proposed subsequently can achieve dynamic embedment based on the template.
Description
Technical field
The present invention relates to dynamic copyright protection technology field, particularly relating to a kind of dynamic copyright protecting system and implementation method based on counting only and multiple digital watermarking.
Background technology
Digital product copyright improves constantly as the value of intellecture property.From technical elements, be exactly prove that author is to the entitlement of digital product by enough evidences to the protection of digital product, and the watermark be embedded in digital product is the proprietorial evidence of this proof product author.
Watermark can be passage, mark, sequence number etc., and the raw data such as it and image is combined closely and hides wherein, becomes the inseparable part of data source.In general, watermark should have following several essential characteristics:
A, vindicability: watermark should be able to provide complete and reliable evidence for the ownership of information products protected by copyright;
B, not sentience: perception can not comprise the meaning of two aspects, invisibility on a finger vision, namely because embed watermark causes the change of image should be ND to the vision system of observer, optimal situation is that watermarking images and original image are visually the same, and this is the requirement that most watermarking algorithm should reach; Watermark statistical method is also irreclaimable on the other hand, as namely used statistical method also cannot extract watermark with the information products that same method and watermark processing are crossed to a large amount of or determine the existence of watermark;
C, robustness: robustness problem is very important for watermark.Robustness is a technical term, briefly, just refer to that a digital watermarking should be able to bear a large amount of, different physics and geometric distortion, comprise (as malicious attack) intentionally or (as compression of images, scan and duplicating, noise pollution, change in size etc.) unintentionally.After these operations, the watermarking algorithm of robust still should can extract the watermark of embedding or prove the existence of watermark from watermarking images.
Mostly be confined on static Multiple Digital Watermarking Technology to the research of Multiple Digital Watermarking Technology at present, i.e. the number of just clear and definite watermark before embed watermark.
Generation and the embedding grammar of static multiple digital watermarking can be divided into following two kinds substantially: (1) multiple watermark embeds respectively.Its basic thought is the division first host signal being carried out to some feature.As different watermarks is embedded in the different frame of video by Cox respectively, realize embedding multi-watermarking in digital video signal, or such as utilize wavelet transformation and threshold value by different watermark embedment to different hosts region; Also have and utilize k different double secret key to answer embedding and the extraction of k watermark.Obviously, in this multi-watermarking embedding grammar, the number of watermark can be subject to the impact of carrier signal capacity and embedded mobile GIS, can not embed more watermark in an immobilization carrier.(2) multiple watermark embeds after merging.Being embedded into again in host after first multiple watermark for embedding being merged into a watermark exactly, embedding the operation all returning into single watermark with extracting method.This scheme can break away from bearer capabilities and embedded mobile GIS preferably to the restriction of embed watermark number, but the watermark content and quantity thereof that will embed must be known in advance, the problem that multiple watermark merges will be solved simultaneously, consider that the amount of redundancy of host signal is limited, can not embed after multiple watermark splicing simply, especially run into the situation that type of watermark is different.
In view of this, prior art haves much room for improvement and improves.
Summary of the invention
In view of the deficiencies in the prior art, the object of the invention is to provide a kind of dynamic copyright protecting system and implementation method based on counting only and multiple digital watermarking.Be intended to solve many Copyrights and digital product issuing, sell and the copyright authentication problem of the different phase such as use.
Technical scheme of the present invention is as follows:
Based on counting solely and a dynamic copyright protecting system for multiple digital watermarking, wherein, comprising:
Database, selects block key, restructuring key and copyright information key for preserving in advance;
Piecemeal module, for according to selecting block double secret key original image to carry out selecting block process, confirms the region of watermark embedment;
Processing module, makes 8*8 Block DCT to the region of described watermark embedment and obtains matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and the only matrix of this number is exactly the restructuring key in database;
Watermark pretreatment module, for carrying out pre-service according to copyright information double secret key binary bitmap I_B, generates a matrix
;
Merge module, for pressing expression formula:
=
+ a.*
, binary bitmap I_B is embedded into matrix of coefficients
in obtain
matrix, wherein a is the embedment strength factor, then by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.
The dynamic copyright protecting system of described and multiple digital watermarking only based on number, wherein, also comprises watermark detection module, for the image to embedding binary bitmap I_B
, hurry by half and extract binary bitmap I_B.
The dynamic copyright protecting system of described and multiple digital watermarking only based on number, wherein, described watermark pretreatment module comprises further:
Scramble unit, to distribute the homogenising be tending towards in some sense for making the black-white point of binary bitmap;
Accounting for " 1 " than controlled processing unit, accounting for " 1 " than being less than 8% for what make watermarking images.What is called accounts for " 1 " than the number percent referring to gray-scale value in bianry image to be the number of " 1 " and gray-scale value be total number of " 0 " and " 1 ".
Based on counting solely and an implementation method for the dynamic copyright protecting system of multiple digital watermarking, wherein, comprise the following steps:
S1, in advance preservation select block key, restructuring key and copyright information key;
S2, according to selecting block double secret key original image to carry out selecting block process, confirm the region of watermark embedment;
S3,8*8 Block DCT is done to the region of described watermark embedment obtain matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and it is kept in restructuring key;
S4, carry out pre-service according to copyright information double secret key binary bitmap I_B, generate a matrix
;
S5, by expression formula:
=
+ a.*
, binary bitmap I_B is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor;
S6, by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.
The implementation method of the dynamic copyright protecting system of described and multiple digital watermarking only based on number, wherein, described step S4 specifically comprises:
S41, copyright information, signing messages are made into binary bitmap I_B;
S42, the black-white point of binary bitmap I_B is distributed the homogenising be tending towards in some sense;
S43, make that binary bitmap I_B's account for " 1 " than being less than 8%.
The implementation method of the dynamic copyright protecting system of described and multiple digital watermarking only based on number, wherein, also comprises step S7, to the image embedding binary bitmap I_B
, hurry by half and extract binary bitmap I_B.
The implementation method of the dynamic copyright protecting system of described and multiple digital watermarking only based on number, wherein, described coordinate (m_x, m_y) determined according to the only matrix of the number of a 4X4.
Beneficial effect:
The dynamic copyright protecting system of and the multiple digital watermarking only based on number of the application and implementation method, the characteristic utilizing number only solves the problem that multi-watermarking is dynamically embedded into different hosts region; Thus achieve the watermarking algorithm of a robustness, solve many Copyrights and digital product issuing, sell and the copyright authentication problem of the different phase such as use.Dynamic multi watermarking algorithm in the present invention, not only has practical but also workable, or a good extensibility template: any additivity digital watermarking of follow-up proposition all can realize being dynamically embedded into based on this template.
Accompanying drawing explanation
Fig. 1 is of the present invention based on counting solely and the structured flowchart of the dynamic copyright protecting system of multiple digital watermarking.
Fig. 2 is only based on number and the process flow diagram of the implementation method of the dynamic copyright protecting system of multiple digital watermarking.
Fig. 3 is the schematic diagram of the only matrix of number of one 9 × 9.
Fig. 4 is of the present invention based on number process flow diagram of embedded mobile GIS step and watermark pretreatment step in dct transform domain solely and in the dynamic copyright protecting system of multiple digital watermarking.
Fig. 5 is the schematic diagram of the only matrix of number of one 4 × 4.
Fig. 6 is the process flow diagram based on number half Blind extracting solely and in the dynamic copyright protecting system of multiple digital watermarking of the present invention.
Fig. 7 is the schematic diagram based on number original binary bitmap solely and in the embodiment of the dynamic copyright protecting system of multiple digital watermarking of the present invention.
Fig. 8 is the schematic diagram based on the binary bitmap of number solely and in the embodiment of the dynamic copyright protecting system of multiple digital watermarking after scramble of the present invention.
Fig. 9 is the schematic diagram based on number original image solely and in the embodiment of the dynamic copyright protecting system of multiple digital watermarking of the present invention.
Figure 10 is the schematic diagram based on counting solely and embed in the embodiment of the dynamic copyright protecting system of multiple digital watermarking the image after binary bitmap of the present invention.
The image be respectively shown in Figure 11 a, Figure 11 b and Figure 11 c in Figure 10 after embedding binary bitmap is subject to deleting both that attack, change of scale are attacked, convolution attack after the schematic diagram of binary bitmap of extraction.
The image be respectively shown in Figure 12 a, Figure 12 b and Figure 12 c in Figure 10 after embedding binary bitmap is subject to the schematic diagram of the binary bitmap of the extraction after JPEG80 attack, JPEG40 attack, JPEG30 attack.
Embodiment
The invention provides a kind of dynamic copyright protecting system and implementation method based on counting only and multiple digital watermarking, for making object of the present invention, technical scheme and effect clearly, clearly, the present invention is described in more detail below.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
Many Copyrights refer to the situation of multiple creators occurred in design at the digital product process especially by procotol cooperation complete design, and the time that each author enters product design is different.In today of network high development, a piece of digital product there is multiple author and between author may and unfamiliar situation is very common.Constantly perfect along with works, the number of author also may constantly increase.In order to protect the right of every author, should by the identity watermark embedment of every author in digital product.Can see, what at a time embed in (even if at this moment digital product is issued on network) product is the watermark of all authors to this moment, and whether subsequent time also has other watermark embedment or have which watermark embedment all cannot expect in advance concerning watermarking algorithm.The feature of the dynamic copyright protecting system of basis that Here it is---how many watermark cannot be predicted will be embedded in digital product before embed watermark.This is the new demand that network world proposes links such as digital production, issue, sale, and the present invention proposes corresponding dynamic multi digital watermark from point of view of practicability.The watermark of what it at a time embedded in (even if at this moment digital product is issued on network) product is all authors to this moment, and whether subsequent time also has other watermark embedment or have which watermark embedment all cannot expect in advance concerning watermarking algorithm.So dynamic multi watermark first technical barrier that will solve is exactly how to guarantee that the watermark of follow-up embedding is embedded into different hosts region, avoid the extraction error because overlap causes.Second problem that will solve: dynamic multi watermark will be embedded in works along with the propelling of time has a lot of watermark successively, and this will ask newly-designed watermarking algorithm must have larger embedding capacity.3rd problem that will solve is exactly how be applied to well in dynamic copyright protection by dynamic multi digital watermarking algorithm to go, and this just requires the dynamic multi digital watermark copyright protecting system that design practicality is good workable.
Conveniently understand, we first introduce several only concept.
" number solely " is the game of a kind of logic, and player needs according to the known digital in 9 × 9 cards, infers the numeral in all residue spaces, and meets every a line, each row, each thick line numeral in utero and all do not repeat containing 1-9.
Array during number is only is ever-changing, has 6,670,903,752,021,072,936,960(about has 21 powers of 6.67 × 10) plant combination, within 2005, calculate this numeral by Bertram Felgenhauer and Frazer Jarvis, and computing method are distributed on their website, if by final quotation of equal value (as rotation, upset, every trade exchange, numeral exchange waits distortion) do not calculate, then have 5,472,730,538 combinations.If with the only matrix of certain 9 × 9 number for key, then its security is very high, and shared by this key, storage space is very little.The only matrix of number of one 9 × 9 as shown in Figure 3.
Two row are chosen arbitrarily from several only matrix, two number xi1 of same row are belonged to arbitrarily in this two row, j, yi2, j form coordinate (xi1, j, yi2, j), nine such coordinate points can be obtained, can judge that these nine coordinate points are different according to several only regular nature, wherein the integer of all desirable 1-9 of i1, i2, j.Such as in figure 3, get i1=1, i2=2 then can obtain following nine coordinates:
(9,2), (8,6), (5,7), (7,1), (6,3), (2,4), (1,5), (3,8),(4,9)；
Can conclude that these nine coordinates must be different, namely there is not overlay coordinates point.In like manner, work as i1=3, during i2=2, also can obtain mutually different nine points:
(3,2), (1,6), (4,7), (8,1), (9,3), (5,4), (7,5), (6,8),(2,9)；
Conscientiously relatively can find that above 18 points are also different, can draw the following conclusions by analysis: in the only matrix of number of 9 × 9, arbitrary three row can determine the coordinate points of 18 non-overlapping copies.Further research is not difficult to draw a general conclusion like this: the capable coordinate points can determining (n-1) * n non-overlapping copies of any n of the only matrix of number of n × n, wherein 2 powers of n=2,2 powers of 3, the quadratic power of 4 ...This conclusion is solve problem watermark being dynamically embedded into different hosts region to have prepared theoretical foundation.
Refer to Fig. 1, it is dynamic copyright protecting system that is only based on number and multiple digital watermarking, as shown in the figure, comprising:
Database 100, selects block key, restructuring key and copyright information key for preserving in advance;
Piecemeal module 200, for according to selecting block double secret key original image to carry out selecting block process, confirms the region of watermark embedment;
Processing module 300, makes 8*8 Block DCT to the region of described watermark embedment and obtains matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and it is kept in restructuring key;
Watermark pretreatment module 400, for carrying out pre-service according to copyright information double secret key binary bitmap I_B, generates a matrix
;
Merge module 500, for pressing expression formula:
=
+ a.*
, binary bitmap I_B is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor, then by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.
First, must set up a database 100, it is preserved in advance and selects block key, restructuring key and copyright information key.Wherein, select block key, restructuring key deposit respectively one number only matrix.Then piecemeal module 200, according to selecting block double secret key original image to carry out selecting block process, confirms the region of watermark embedment.Because in general, original image all larger (as 2048*2048), first must carry out piecemeal to original image, chooses one piece of region as watermark embedment.Area size as chosen is 256*256.The region of processing module 300 to described watermark embedment is made 8*8 Block DCT and is obtained matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and it is kept in restructuring key.In the present embodiment, it is determined by the only matrix of the number of a 4*4, can describe in detail below.Watermark pretreatment module 400 carries out pre-service according to copyright information double secret key binary bitmap I_B, generates a matrix
.Merge module 500 is by expression formula:
=
+ a.*
, binary bitmap I_B is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor.Again by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.Thus complete the embedding of watermark.
Wherein, be with should be noted that, in processing module 300, after image does discrete cosine transform, most parameters is close to zero, and only have the low frequency part in the upper left corner to have larger numerical value, intermediate-frequency section parameter value is relatively little, and most of high-frequency parameter value is very little, close to zero.So in discrete cosine transform domain, the position of embed watermark mainly fixes on Low Medium Frequency band coefficient, because still can save from damage to get off after the coefficient low-pass filtering of this part.On the other hand, the size of the only matrix of described number should be suitable for.
Refer to Fig. 4, wherein, embedded mobile GIS step in dct transform domain:
First, 8*8 Block DCT is done to original image I and obtain matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, preserve a
as extracting key in matrix data to Key_1.Then, make bianry image I_B, accounted for " 1 " after pre-service than the matrix being less than 10%
, what is called accounts for " 1 " than the number percent referring to gray-scale value in bianry image to be the number of " 1 " and gray-scale value be total number of " 0 " and " 1 ".By expression formula:
=
+ a.*
, bianry image I_B is embedded into matrix of coefficients
in obtain
matrix.Again by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
.Finally, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.
Please continue to refer to Fig. 4, carry out watermark pretreatment in described watermark pretreatment module 400, it comprises: copyright information, signing messages are made into binary bitmap I_B; Then, the black-white point of binary bitmap I_B is made to distribute the homogenising be tending towards in some sense; Finally, make that binary bitmap I_B's account for " 1 " than being less than 8%.Wherein, key point is:
(1) scramble decorrelation, the black-white point of binary bitmap is distributed the homogenising be tending towards in some sense, and namely in territory, same cells, the quantity of stain or white point is more or less the same, for follow-up further pre-service lays the foundation;
(2) account for " 1 " than control treatment, what make watermarking images accounts for " 1 " than being less than 8%.What is called accounts for " 1 " than the number percent referring to gray-scale value in bianry image to be the number of " 1 " and gray-scale value be total number of " 0 " and " 1 ".In additive insertion pattern, the watermark after process is very little to host image quality quality influence.Concrete processing mode is given exactly and is carried out " 0 " row or the expansion of " 0 " row to watermark, accounts for " 1 " than (about the theory and the control treatment that account for " 1 " ratio, be that inventor creates, adopt in this way, can effectively reduce successive image intractability) to reduce.
Present invention also offers a kind of based on counting solely and the implementation method of the dynamic copyright protecting system of multiple digital watermarking, as shown in Figure 2, comprising the following steps:
S1, in advance preservation select block key, restructuring key and copyright information key;
S2, according to selecting block double secret key original image to carry out selecting block process, confirm the region of watermark embedment;
S3,8*8 Block DCT is done to the region of described watermark embedment obtain matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and it is kept in restructuring key;
S4, carry out pre-service according to copyright information double secret key binary bitmap I_B, generate a matrix
;
S5, by expression formula:
=
+ a.*
, binary bitmap I_B is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor;
S6, by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) obtains new matrix of coefficients by matrix of coefficients ML ' again assignment
, to new matrix of coefficients
the image embedding binary bitmap I_B is obtained do inverse discrete cosine transform
.
Further, described step S4 specifically comprises:
S41, copyright information, signing messages are made into binary bitmap I_B;
S42, the black-white point of binary bitmap I_B is distributed the homogenising be tending towards in some sense;
S43, make that binary bitmap I_B's account for " 1 " than being less than 8%.
Illustrate that how realizing watermark is dynamically embedded into below by an object lesson.
First the only matrix of the Generalized Number of 4 × 4 sizes, is determined
, as shown in Figure 5:
Then the only matrix of number, is utilized
any three row determine the coordinate of 8 non-overlapping copies can obtain following 8 coordinate: Z1 (1,3) as got first three rows, Z2 (2,4), Z3 (3,1), Z4 (4,2), Z5 (4,3), Z6 (3,4), Z7 (2,1), Z8 (1,2);
When the author A of works to complete the work of oneself in the T1 time, author A chooses coordinate Z1 (1 in the T1 time, 3) embed the copyright information of oneself by the embedded mobile GIS of technical scheme two, namely 8*8 Block DCT is done to the original image works I chosen and obtain matrix of coefficients
, get several restructuring matrix of coefficients that coordinate in each 8*8 fritter is Z1 (1,3)
, then complete watermark embedment by step in technical scheme two.Another author B of these works same completes the work of oneself in the T2 time, author B chooses coordinate Z2 (2 in the T2 time, 4) copyright information of oneself is also embedded by the embedded mobile GIS of technical scheme two, in like manner ensuing author all chooses remaining coordinate embeds oneself again copyright information by technical scheme two after the work of oneself completes, just achieve a dynamic watermark along with time stepping method and so forth and embed effect, and ensure that embedded watermark is all be embedded in different host regions.
Finally, when author's quantity is greater than 8 time, another piece image in works can be chosen again as original image I, and then embed the copyright information of each author by above-mentioned steps.
Further, utilize inventor for the capable coordinate points can determining (n-1) * n non-overlapping copies of any n of the only matrix of number of conclusion: the n × n made in several only matrix.Namely the only matrix of the number of 4 × 4 can determine the coordinate points of 3 × 4=12 non-overlapping copies.Thus, the coordinate points that can provide 12 non-overlapping copies, to different authors, embeds copyright information for it.This is also one of key of the present invention, and wherein, n can be 2 powers of k.
Further, the implementation method of the dynamic copyright protecting system of described and multiple digital watermarking only based on number also comprises step S7, to the image embedding binary bitmap I_B
, hurry by half and extract binary bitmap I_B, its process as shown in Figure 6.
See also Fig. 7, Fig. 8 and Fig. 9, it is respectively the schematic diagram of binary bitmap after the schematic diagram of original binary bitmap, scramble and the schematic diagram of original image.To embedding after the image (as shown in Figure 10) of binary bitmap I_B carries out JPEG attack, its binary bitmap extracted is respectively as Figure 12 a(JPEG80 attacks), 12b(JPEG40 attack) and 12c(JPEG30 attack) shown in.In addition, as shown in Figure 11 a, 11b and 11c, it is respectively the attack that is subject to deleting both, change of scale is attacked, convolution attack after the schematic diagram of binary bitmap of extraction.
As can be seen here, its robustness is better, can resist common attack.Meanwhile, its embedding capacity is more satisfactory (can embed the watermark of 12 32*32) also in the host region of 256*256, watermark embedment capacity and watermark robustness are averaged out.12 watermarks embed by the coordinate of non-overlapping copies, so also can not embed in the same time respectively, are achieving and are dynamically embedded into effect.
In sum, dynamic copyright protecting system and the implementation method based on counting only and multiple digital watermarking of the present invention, it comprises database, piecemeal module, processing module, watermark pretreatment module and merge module.Its characteristic utilizing number only solves the problem that multi-watermarking is dynamically embedded into different hosts region; Thus achieve the watermarking algorithm of a robustness, solve many Copyrights and digital product issuing, sell and the copyright authentication problem of the different phase such as use.Dynamic multi watermarking algorithm in the present invention, not only has practical but also workable, or a good extensibility template: any additivity digital watermarking of follow-up proposition all can realize being dynamically embedded into based on this template.
Should be understood that, application of the present invention is not limited to above-mentioned citing, for those of ordinary skills, can be improved according to the above description or convert, and all these improve and convert the protection domain that all should belong to claims of the present invention.
Claims (5)
1., based on counting solely and a dynamic copyright protecting system for multiple digital watermarking, it is characterized in that, comprise:
Database, selects block key, restructuring key and copyright information key for preserving in advance;
Piecemeal module, for according to selecting block double secret key original image to carry out selecting block process, confirms the region of watermark embedment;
Processing module, makes 8*8 Block DCT to the region of described watermark embedment and obtains matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and the only matrix of this number is exactly the restructuring key in database;
Watermark pretreatment module, for carrying out pre-service according to copyright information double secret key binary bitmap, generates a matrix
;
Merge module, for pressing expression formula:
=
+ a.*
, binary bitmap is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor, then by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) is by matrix of coefficients
again assignment obtains new matrix of coefficients
, to new matrix of coefficients
the image embedding binary bitmap is obtained do inverse discrete cosine transform
;
Described watermark pretreatment module comprises further:
Scramble unit, to distribute the homogenising be tending towards in some sense for making the black-white point of binary bitmap;
Accounting for " 1 " than controlled processing unit, accounting for " 1 " than being less than 8% for what make binary bitmap;
What is called accounts for " 1 " than the number percent referring to gray-scale value in binary bitmap to be the number of " 1 " and gray-scale value be total number of " 0 " and " 1 ";
Described account for " 1 " than controlled processing unit make binary bitmap account for " 1 " than the processing mode being less than 8% employing for binary bitmap carry out " 0 " row or " 0 " row expand;
The described correlativity evenly turned between removal binary bitmap black-white point be tending towards in some sense, guarantees that the black and white state of each pixel has independence, makes the distribution of black-white point by the impact of the content of binary bitmap own.
2. the dynamic copyright protecting system based on counting only and multiple digital watermarking according to claim 1, is characterized in that, also comprise watermark detection module, for the image to embedding binary bitmap
, hurry by half and extract binary bitmap.
3., based on counting solely and an implementation method for the dynamic copyright protecting system of multiple digital watermarking, it is characterized in that, comprise the following steps:
S1, in advance preservation select block key, restructuring key and copyright information key;
S2, according to selecting block double secret key original image to carry out selecting block process, confirm the region of watermark embedment;
S3,8*8 Block DCT is done to the region of described watermark embedment obtain matrix of coefficients
, getting coordinate in each 8*8 fritter is several restructuring matrix of coefficients of (m_x, m_y)
, wherein, wherein coordinate (m_x, m_y) is exactly determined according to the only matrix of a number, and it is kept in restructuring key;
S4, carry out pre-service according to copyright information double secret key binary bitmap, generate a matrix
;
S5, by expression formula:
=
+ a.*
, binary bitmap is embedded into matrix of coefficients
in obtain
matrix, wherein a is intensity factor;
S6, by matrix of coefficients
in each 8*8 fritter, coordinate is that the number of (m_x, m_y) is by matrix of coefficients
again assignment obtains new matrix of coefficients
, to new matrix of coefficients
the image embedding binary bitmap is obtained do inverse discrete cosine transform
;
Described step S4 specifically comprises:
S41, copyright information, signing messages are made into binary bitmap;
S42, the black-white point of binary bitmap is distributed the homogenising be tending towards in some sense;
S43, make binary bitmap account for " 1 " than being less than 8%; Account for " 1 " than controlled processing unit make binary bitmap account for " 1 " than the processing mode being less than 8% employing for binary bitmap carry out " 0 " row or " 0 " row expand;
The described correlativity evenly turned between removal binary bitmap black-white point be tending towards in some sense, guarantees that the black and white state of each pixel has independence, makes the distribution of black-white point by the impact of the content of binary bitmap own.
4. according to claim 3ly based on number solely and the implementation method of the dynamic copyright protecting system of multiple digital watermarking to it is characterized in that, also comprise step S7, image to embedding binary bitmap
, hurry by half and extract binary bitmap.
5. according to claim 3 based on counting solely and the implementation method of the dynamic copyright protecting system of multiple digital watermarking, it is characterized in that, described coordinate (m_x, m_y) determined according to the only matrix of the number of a 4X4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310021067.9A CN103093127B (en) | 2013-01-21 | 2013-01-21 | Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310021067.9A CN103093127B (en) | 2013-01-21 | 2013-01-21 | Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103093127A CN103093127A (en) | 2013-05-08 |
| CN103093127B true CN103093127B (en) | 2015-07-15 |
Family
ID=48205686
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310021067.9A Expired - Fee Related CN103093127B (en) | 2013-01-21 | 2013-01-21 | Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103093127B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103544674B (en) * | 2013-10-16 | 2016-04-06 | 大连理工大学 | A kind of based on several only gradual Secret Image encryption sharing method |
| CN104616240B (en) * | 2013-11-01 | 2019-08-30 | 深圳力维智联技术有限公司 | Watermark insertion and extracting method, device and its system |
| CN103761459B (en) * | 2014-01-24 | 2016-08-17 | 中国科学院信息工程研究所 | A kind of document multiple digital watermarking embedding, extracting method and device |
| CN105405091A (en) * | 2015-11-03 | 2016-03-16 | 浪潮(北京)电子信息产业有限公司 | Digital watermark realization method and device under cloud environment |
| CN113127911B (en) * | 2021-05-06 | 2022-05-20 | 国网河北省电力有限公司信息通信分公司 | Electric power data encryption method and device and terminal |
| CN116308980B (en) * | 2023-02-28 | 2024-06-21 | 淮阴工学院 | Reversible information hiding method based on block optimal dynamic selection |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003032254A1 (en) * | 2001-10-04 | 2003-04-17 | Universite De Geneve | Digital watermarking method robust against local and global geometrical distortions and projective transforms |
| CN101295336A (en) * | 2007-03-01 | 2008-10-29 | 环达电脑(上海)有限公司 | Copyright protection method of navigation electronic map |
| CN101452570A (en) * | 2008-12-22 | 2009-06-10 | 武汉大学 | Vector space data digital watermarking method based on grid |
| TW201023089A (en) * | 2008-12-11 | 2010-06-16 | Univ Southern Taiwan | Multi-functional watermarking verification technology based on wavelet transformation |
| CN102129657A (en) * | 2011-02-28 | 2011-07-20 | 海南大学 | Method for embedding multiple watermarks in volume data based on three-dimensional DFT (Delayed-First-Transmission) |
| CN102208097A (en) * | 2011-05-26 | 2011-10-05 | 浙江工商大学 | Network image copyright real-time distinguishing method |
| EP2426636A1 (en) * | 2010-09-01 | 2012-03-07 | Thomson Licensing | Method for watermarking free view video with blind watermark detection |
-
2013
- 2013-01-21 CN CN201310021067.9A patent/CN103093127B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003032254A1 (en) * | 2001-10-04 | 2003-04-17 | Universite De Geneve | Digital watermarking method robust against local and global geometrical distortions and projective transforms |
| CN101295336A (en) * | 2007-03-01 | 2008-10-29 | 环达电脑(上海)有限公司 | Copyright protection method of navigation electronic map |
| TW201023089A (en) * | 2008-12-11 | 2010-06-16 | Univ Southern Taiwan | Multi-functional watermarking verification technology based on wavelet transformation |
| CN101452570A (en) * | 2008-12-22 | 2009-06-10 | 武汉大学 | Vector space data digital watermarking method based on grid |
| EP2426636A1 (en) * | 2010-09-01 | 2012-03-07 | Thomson Licensing | Method for watermarking free view video with blind watermark detection |
| CN102129657A (en) * | 2011-02-28 | 2011-07-20 | 海南大学 | Method for embedding multiple watermarks in volume data based on three-dimensional DFT (Delayed-First-Transmission) |
| CN102208097A (en) * | 2011-05-26 | 2011-10-05 | 浙江工商大学 | Network image copyright real-time distinguishing method |
Non-Patent Citations (2)
| Title |
|---|
| 基于数独的大容量可篡改定位动态多重水印算法;张力等;《计算机应用》;20121101;第3129页左列第一段至3130页右列最后一段 * |
| 基于等级结构的多重图像认证水印算法;李赵红等;《北京交通大学学报》;20081031;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103093127A (en) | 2013-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Geometrically resilient color image zero-watermarking algorithm based on quaternion exponent moments | |
| Haghighi et al. | TRLH: Fragile and blind dual watermarking for image tamper detection and self-recovery based on lifting wavelet transform and halftoning technique | |
| CN103093127B (en) | Method and system of dynamic copyright protection based on sudoku and multiple digital watermarks | |
| Aslantas | An optimal robust digital image watermarking based on SVD using differential evolution algorithm | |
| Keshavarzian et al. | ROI based robust and secure image watermarking using DWT and Arnold map | |
| Elshoura et al. | A secure high capacity full-gray-scale-level multi-image information hiding and secret image authentication scheme via Tchebichef moments | |
| Liu et al. | Robust blind image watermarking based on chaotic mixtures | |
| Roy et al. | An indirect watermark hiding in discrete cosine transform–singular value decomposition domain for copyright protection | |
| Dai et al. | SWT-DCT-based robust watermarking for medical image | |
| Roy et al. | Watermarking through image geometry change tracking | |
| Goli et al. | Introducing a new method robust against crop attack in digital image watermarking using two-step sudoku | |
| CN111988490B (en) | Tetrolet-DCT-based medical image robust watermarking method | |
| Han et al. | A digital watermarking algorithm of color image based on visual cryptography and discrete cosine transform | |
| Duan et al. | A novel comprehensive watermarking scheme for color images | |
| Ye et al. | Research on reversible image steganography of encrypted image based on image interpolation and difference histogram shift | |
| Rose et al. | A secure verifiable scheme for secret image sharing | |
| Li et al. | A lightweight authenticable visual secret sharing scheme based on turtle shell structure matrix | |
| Khalid et al. | Anti-cropping digital image watermarking using Sudoku | |
| Renklier et al. | Image authentication and recovery: Sudoku puzzle and MD5 hash algorithm based self-embedding fragile image watermarking method | |
| Surekha et al. | A multiple watermarking technique for images based on visual cryptography | |
| Surekha et al. | A novel copyright protection scheme based on visual secret sharing | |
| Sun et al. | An image watermarking scheme using Arnold transform and fuzzy smooth support vector machine | |
| Habbouli et al. | A secure, self-recovery, and high capacity blind digital image information hiding and authentication scheme using DCT moments | |
| Han et al. | DWT-domain dual watermarking algorithm of color image based on visual cryptography | |
| Sasaki et al. | Constructing Digital Watermark Based on Orthogonal Functions |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150715 Termination date: 20170121 |