CN101968878B - Multiple digital watermarking method for geographic information system (GIS) vector data - Google Patents
Multiple digital watermarking method for geographic information system (GIS) vector data Download PDFInfo
- Publication number
- CN101968878B CN101968878B CN 201010548741 CN201010548741A CN101968878B CN 101968878 B CN101968878 B CN 101968878B CN 201010548741 CN201010548741 CN 201010548741 CN 201010548741 A CN201010548741 A CN 201010548741A CN 101968878 B CN101968878 B CN 101968878B
- Authority
- CN
- China
- Prior art keywords
- watermark
- data
- key element
- watermark information
- sequence node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Image Processing (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
The invention discloses a multiple digital watermarking method for geographic information system (GIS) vector data, and belongs to the field of geographic information copyright protection. The watermark embedding process of the method comprises the following steps of: reading and processing the data; embedding algorithms by an odd-even method; respectively embedding watermarks into a spatial domain, a discrete wavelet transform domain, a discrete cosine transform domain of horizontal coordinates and vertical coordinates by a low-order additive method and a least significant bit substitution method; adopting a zero-watermark algorithm; and storing watermark-containing data. The watermark extraction process of the method is the inverse process of the embedding process. A practical multiple digital watermark protection method is comprehensively integrated aiming at the common attack modes of the GIS vector data and according to the principle and anti-attack performance of each single algorithm. Various embedding modes are adopted and the specific embedding position of each watermark is controlled, so that embedding and extraction are non-interfering, conflicts are avoided, the advantages of each algorithm are exerted and complemented and the anti-attack capability of digital watermarks is greatly improved.
Description
Technical field
The invention belongs to geography information copyright protection field, be specifically related to a kind of for the embedding of GIS vector data employing comprehensive method and the multiple digital watermarking method of extraction watermark with raising algorithm robustness.
Background technology
In recent years, Chinese scholars is paid close attention to the design of GIS-Geographic Information System (GIS) vector data digital watermarking algorithm, has proposed multiple GIS vector data digital watermarking algorithm.Along with digital watermark technology deepening continuously in GIS vector data product is used, single watermark has obvious targeting aspect robustness, anti-attack ability is limited, thereby easily the needs that can not satisfy people are grasped or destroyed to victim, has therefore just produced Multiple Digital Watermarking Technology.Multi-watermarking refers to embed in many ways the technology of a plurality of watermarks in same carrier, it can be used to digital product is transmitted tracking, multiple authentication etc., has actual application value at aspects such as copyright protection of digital product and ownership discriminatings.At present, the research about multi-watermarking both at home and abroad also mainly concentrates on the MultiMedia Fields such as image, audio frequency, and has obtained some achievements.For example, horse strong (computer application and software, Vol.24, No.8,186-188,2007) etc. proposed the host image frequency domain is carried out two-dimension discrete cosine transform (dct transform), adopt gray level image YND threshold value and Multiple-based that the DCT frequency domain of host image has been constructed and select the piece group technology, to the DCT ac coefficient of the intermediate frequency component watermarked bit that divides into groups, to the random watermarked bit of the DCT coefficient of low-and high-frequency component, a plurality of gray scale digital blind watermarks have been embedded.Multiple digital watermarking research for the GIS vector data is then relatively less.Wherein, Min Lianquan etc. (computer application and software, Vol.24, No.1,146-148,174,2007 years) have designed a numerical map watermarking algorithm based on DCT, at first extract the characteristic point of map datum, the composition characteristic image; Then characteristic image is done discrete cosine transform, watermark information is embedded on the medium and low frequency coefficient.This algorithm is simultaneously watermarked on the medium and low frequency coefficient, and embedding capacity promotes to some extent, but do not consider intermediate frequency, coefficient characteristics that low frequency is different.In addition, this can be regarded as a kind of non-proper multiple digital watermarking algorithm in fact.
Summary of the invention
The object of the invention is to: not strong for present single watermarking algorithm robustness; can not effectively protect the problem of GIS vector data; propose a kind of multiple digital watermarking for GIS vector data feature and embed and the method for extracting, make it in the attack of opposing coordinate system transformation, shearing attack, compression attack, add the aspects such as attacks of making an uproar, editor are attacked, increase Data attack and have preferably robustness.
To achieve these goals, the technical solution used in the present invention is:
A kind of multiple digital watermarking method for the GIS vector data mainly comprises following process:
(1) watermark embed process:
The GIS vector data is read in reading and processing of data, and configuration embeds the parameter of algorithm, checks the legitimacy of all input data and configuration parameter;
Odd embeds algorithm, embedded object is that source data is whole, utilize the parity of key element node number to represent watermark information " 1 " or " 0 ", a key element embeds one watermark information, by increase the parity that a redundant points changes current key element in sequence node;
After utilizing Douglas Pu Kefa that the sequence node S of key element is compressed, sequence node R after obtaining compressing and embedding table of comparisons T, then it is watermarked that the low frequency coefficient in the wavelet transform territory of the abscissa of the sequence node R after compression adopts the additivity method, obtain exporting data R1j, 0＜=j＜n wherein, n is the key element number; Watermarked with the least significant bit Shift Method in the spatial domain of the abscissa of exporting data R1j, obtain exporting data R2j; Adopt again the low frequency additive algorithms watermarked in the low frequency coefficient after the d discrete cosine transform of the ordinate of exporting data R2j, obtain exporting data R3j; Adopt at last the intermediate frequency additive algorithms watermarked in the intermediate frequency coefficient after the discrete cosine transform of the ordinate of exporting data R3j, the watermark embedded object is described key element;
Douglas back-pressure contracting is integrated into the key element sequence node of embed watermark information among the sequence node S of the described key element of not compressing according to embedding table of comparisons T, obtains containing the not packed data S1 of watermark;
Zero watermarking algorithm, utilize the resulting key character that contains the not packed data S1 of watermark of previous step to construct watermark information, by with the described not packed data S1 of watermark that contains according to the regional extent subregion of spatial distribution, then add up the node number in each subregion, construct zero watermark according to the result, and zero watermark is preserved;
Preserve watermarked data afterwards;
(2) watermark extraction process::
The reading and processing of data read the GIS vector data of watermark to be extracted and is converted into the sequence node of key element, reads the configuration parameter file, checks the legitimacy of input data and configuration parameter;
Adopt zero watermarking algorithm from the sequence node of key element obtained in the previous step, to extract watermark information;
Adopt odd from the sequence node of above-mentioned zero watermarking algorithm processing key element afterwards, to extract watermark information;
After the sequence node of key element utilized the general gram compression method compression of Douglas, the low frequency coefficient in the wavelet transform territory of the abscissa of the sequence node after compression adopted the additivity method to extract watermark information; Extract watermark information with the least significant bit Shift Method in the spatial domain of the abscissa of the sequence node after described compression; Adopt the low frequency additive algorithms to extract watermark information in the low frequency coefficient after the discrete cosine transform of the ordinate of the sequence node after described compression; Adopt the intermediate frequency additive algorithms to extract watermark information in the intermediate frequency coefficient after the discrete cosine transform of the ordinate of the sequence node after described compression;
The comprehensive watermark information that compares, analyzes the above-mentioned steps extraction draws the optimum result of extraction.
Wherein, the present invention is directed to the embedding step of multiple digital watermarking method of GIS vector data specific as follows:
Link one: the data before watermarked are prepared.
Read the GIS vector data, then adopt the interval polygon method to choose watermarked polygon and be organized as self-defined structure S0; Input copyright mark watermark information W1, and be converted into the watermark W2 to be embedded of algorithm inside; Configuration embeds the parameter of algorithm; Check the legitimacy of all input data and configuration parameter.
Link two: odd embed watermark information.The method belongs to the customization watermarking algorithm, is only applicable to line, face data, and it utilizes the parity of the node sum of single key element interior element to represent watermark bit, and namely even number represents 0, and odd number represents 1.Wherein, change the parity of current key element by in sequence node, increasing a redundant points because key element has a large amount of nodes, therefore increase a point (can be the mid point of adjacent two nodes) for key element without any impact.
The processing procedure of algorithm is as follows:
1) calculate the embedding number of times, formula is as follows:
Wherein, c embeds number of times, and n is the key element number, and l is the length of watermark,
To round symbol.If c＜1 is then returned.
2) get successively a watermark information Wi (0＜=i＜l), key element node set S0j (0＜=j＜n); If watermark information is " 0 ", and key element node number is odd number, then increases a point in the middle of point sequence, and the coordinate of point is got the average of its former and later two points; If watermark information is " 1 ", and key element node number is even number, also increases a point in the middle of point sequence, and the coordinate of point is got the average of its former and later two points;
Link three: (0＜=j＜n) carries out the general gram compression method compression of Douglas, and (0＜=j＜n) is as the input data of next stage, and embeds table of comparisons T for the sequence node R0j after being simplified to S0j.
Link four: abscissa DWT low frequency additive algorithms is watermarked.At first sequentially choose R0j (the summit composition data sequence among 0＜=j＜n) according to 8 one group, by this data sequence being carried out wavelet transform (DWT), isolate basic, normal, high three kinds of coefficient of frequencies, then on low frequency coefficient according to the following formula embed watermark information, last again through the data R1j of DWT inverse transformation output embed watermark information (0＜=j＜n).
x
w＝x+w (2)
Wherein,
For containing watermark carrier, x={x
i, 0≤i＜N} and w={w
i, 0≤i＜N} is respectively initial carrier and watermark.
Link five: abscissa spatial domain least significant bit replace Algorithm is watermarked.Namely in the scope that the map datum precision allows, utilize the least significant bit replace Algorithm that watermark information directly is embedded in input data (the output data R1j in the link four (0＜=j＜the n)) abscissa, obtain exporting data R2j (0＜=j＜n).
Link six: ordinate DCT low frequency additive algorithms embed watermark information.With link four, only what carry out is the discrete cosine transform of ordinate to this link, then watermark information is embedded in its low frequency coefficient to carrier data (R2j (0＜=j＜n)), obtains exporting data R3j (0＜=j＜n).
Concrete embedding formula is with link four.
Link seven: ordinate DCT intermediate frequency additive algorithms embed watermark information.With link four, only what carry out is the discrete cosine transform of ordinate to the carrier data of this link (R3j (0＜=j＜n)), then watermark information is embedded in its intermediate frequency coefficient, obtains exporting data R4j (0＜=j＜n).
Concrete embedding formula is with link four.
Link eight: douglas' method back-pressure contracting.According to the embedding table of comparisons T that link three produces, the carrier data (R4j (0＜=j＜n)) that will contain watermark is integrated among the total data S0 that did not compress, and obtains containing the not packed data S1 of watermark.
Link nine: zero watermarking algorithm.The key character of this link utilization input data S1 is constructed watermark information, does not revise any information of S1 in the construction process.Detailed process is as follows:
1) all nodes among the traversal S1 obtain its locus distribution maximum magnitude D;
2) obtain (C=H * Z) of number C between Statistical Area according to the horizontal piece number H that arranges, vertical piece number Z;
3) with 1) in D be divided into C subinterval, and store the bounds in each subinterval;
4) travel through all nodes, judge which subinterval this node belongs to, the node sum Ccount that this is interval increases by 1;
5) according to number, each interval interior nodes structure " zero watermark " between node sum, Statistical Area, and save as physical file.
Link ten: preserve watermarked file afterwards.Detailed process is as follows:
1) node of embed watermark information is ressembled back Data Elements;
2) Data Elements are saved to hard disk.
The extraction concrete steps of multiple digital watermarking method that the present invention is directed to the GIS vector data are as follows:
Link one: extract the front data of watermark and prepare.
Read the GIS vector data of watermark to be extracted, and be organized as self-defined structure S0; Read the configuration parameter file; Check the legitimacy of input data and configuration parameter.
Link two: extract zero watermarking algorithm.The key character of this link utilization input data S0 is constructed watermark information, does not revise any information of S0 in the construction process.Detailed process is as follows:
1) all nodes among the traversal S0 obtain its locus distribution maximum magnitude D;
2) obtain (C=H * Z) of number C between Statistical Area according to the horizontal piece number H in the configuration parameter, vertical piece number Z;
3) with 1) in D be divided into C subinterval, and store the bounds in each subinterval;
4) travel through all nodes, judge which subinterval this node belongs to, the node sum Ccount that this is interval increases by 1;
5) according to number, each interval interior nodes structure " zero watermark " W0 between node sum, Statistical Area, and save as physical file.
Link three: odd extracts watermark information.
The processing procedure of algorithm is as follows:
1) gets successively key element node set S0j (0＜=j＜n), and to the complementation of node number, obtain M, and M is added into watermark character string W1;
2) according to the rule parsing W1 of system in advance, obtain copyright mark watermark W1.
Link four: (0＜=j＜n) carries out the general gram compression method compression of Douglas, and (0＜=j＜n) is as the input data of next stage for the sequence node R0j after being simplified to S0j.
Link five: abscissa DWT low frequency additive algorithms is extracted watermark.At first sequentially choose R0j (the summit composition data sequence among 0＜=j＜n) according to 8 one group, by this data sequence being carried out wavelet transform (DWT), isolate basic, normal, high three kinds of coefficient of frequencies, then on low frequency coefficient, extract watermark information according to following formula, obtain watermark information W2.
w＝x
w-x (3)
Wherein, w={w
i, the watermark information of 0≤i＜N} for extracting,
X={x
i, 0≤i＜N} is for containing watermark carrier data and initial carrier data.
Link six: abscissa spatial domain least significant bit replace Algorithm extracts watermark.Directly (utilize the least significant bit replace Algorithm to extract watermark information in the abscissa sequence of 0＜=j＜n), and the copyright mark information that the obtains W3 of parsing at R0j according to the parameter that reads.
Link seven: ordinate DCT low frequency additive algorithms is extracted watermark information.With link four, only what carry out is the discrete cosine transform of ordinate to this link, then extracts watermark information from low frequency coefficient to carrier data (R0j (0＜=j＜n)), and resolves and obtain copyright mark information W4.
The concrete formula that extracts is with link five.
Link eight: ordinate DCT intermediate frequency additive algorithms is extracted watermark information.With link four, only what carry out is the discrete cosine transform of ordinate to the carrier data of this link (R0j (0＜=j＜n)), then extracts watermark information from intermediate frequency coefficient, and resolves and obtain copyright mark information W5.
The concrete formula that extracts is with link five.
Link nine: comprehensively compare, analyze W0, W1, W2, W3, W4, W5, draw the optimum as a result W that extracts.
The present invention is according to the feature of GIS vector data and the custom-designed a kind of multiple digital watermarking method of form that is vulnerable to attack, it is respectively with the characteristic point of whole, the geographical space key element of the carrier data embedded object as watermark information, adopts watermarked and zero watermark combines, the watermark embedded mode that frequently merges mutually of same area does not strengthen the robustness of algorithm with this.It is not strong that the method applied in the present invention has overcome traditional single watermarking algorithm robustness, can't effectively protect the restriction of GIS vector data copyright, can provide effective guarantee for production, propagation, the application of GIS vector data.
Description of drawings
Fig. 1 watermark of the present invention embeds flow chart.
Fig. 2 watermark extracting flow chart of the present invention.
Fig. 3 is that vector data is drawn by Chinese administrative areas at the county level.
Fig. 4 is the as a result figure of the watermarked afterwards cropped attack of Fig. 3.
Embodiment
Be described in further details below in conjunction with drawings and Examples.
Embodiment 1
This example is selected a kind of typical GIS vector data, for the reading of data, preliminary treatment, watermark embedding, result preserve, the whole process of watermark extracting, provide one embodiment of the present of invention, further describe the present invention.The present embodiment selects Chinese administrative areas at the county level to draw vector data (such as Fig. 3) as experimental data, and data format is shp, face figure layer, and the data record number is 3407.The watermark content is " Nanjing Normal University " text message, and corresponding binary system watermark sequence W is " 11000100110011111 ... 100111 ", and length is 96.
1, for the multiple digital watermarking embedding grammar of GIS vector data.
Such as Fig. 1, it is the embedding workflow diagram of GIS vector data multiple digital watermarking method proposed by the invention.Whole flow process is divided into following components:
Step 1: the reading and preliminary treatment of carrier data.
1) utilize the increase income function reading of plug-in unit of MapWinGIS to read corresponding carrier data information, the data that the present embodiment is chosen such as Fig. 3.It is the face data in the GIS vector data.
2) the data preliminary treatment comprised for two steps: at first, the sequence node in the reading face data is List＜IFMEOPoint with Organization of Data〉[] structure, each List object is a sequence node in the polygon key element; Secondly, adopt the watermarked strategy of interval polygon, filter out watermarked polygon, thereby make any two polygonal common edge all only embed a watermark.Afterwards embedding polygonal number through screening is 1057.
Step 2: odd is watermarked.
1) calculates the embedding number of times.According to the formula (1) that embeds link two in the step,
2) to embed a watermark as example, obtain successively certain information of binary system watermark, be made as w
i, 0≤i＜l, l are watermark length.Get the node number n (n＞=3) of current embedding key element, if w
i≠ n%2, % are the complementation symbols, and then the 2nd position in this sequence node increases a some p
2, p
2The transverse and longitudinal coordinate be the mean value of former and later two points;
3) repeat c-1 time 2);
Step 3: carry out the node compression to embedding polygon according to Douglas Pu Kefa, get List＜IFMEOPoint〉[] type characteristic point data tabulation CompressedPoints, List＜int〉the corresponding table of [] type compression CompressedTable.Douglas Pu Kefa is a kind of vector data compression method of maturation, does not repeat them here.
Step 4: abscissa DWT low frequency additivity mode is watermarked.Sequence node take each key element is tabulated as unit, and per 8 one group is carried out wavelet transform, and 8 of less thaies are not then carried out conversion; Afterwards, by formula (2) with watermark information and embedded position information addition, with this embed watermark information;
Step 5: replacement abscissa least significant bit method is watermarked.According to the embedding point position (value is 4) that arranges, embedded length (value is 4) watermark information is replaced directly that numerical value is watermarked with this accordingly in the abscissa;
Step 6: ordinate DCT intermediate frequency, low frequency are watermarked in the additivity mode respectively.The same step 4 of detailed process;
Step 7: the compression of the general gram of anti-Douglas, the parameters C ompressedTable that watermarked sequence node is produced during according to compression is integrated in whole node listings.
Step 8: extract " zero watermark ".Size of data according to whole nodes, determine distribution, distribution is Xmax=134.3835199 in the present embodiment, Xmin=74.848011010179221, Ymax=52.90461345, Ymin=18.3902364, according to the piecemeal number (6 * 6=36 piece) that arranges distribution is divided between concrete Statistical Area, then travel through whole nodes and judge which interval it is positioned at, the sum of interior nodes between recording areas, at last with the node sum, block information, the information such as interval interior nodes number composition character string preserves with the form of text, i.e. " zero watermark ", 00,220,060,600,000,000,000,000,000,800,002,800,002,100,000,000,000,000,003 60,000,220,000,070,000,280,000,040,000,380,001,400,000,990,000,550,000,020 00,000,000,144,000,302,000,314,000,196,000,012,000,000,000,037,000,218,000 25,800,028,000,007,100,001,800,000,000,000,000,000,000,000,300,008,500,002 6.
Step 9: preserve watermarked data afterwards.The parameter information that adopts during according to reading out data writes Data Elements in the middle of the new data file, obtains vector data file with watermarked information.
2, for the multiple digital watermarking extracting method of GIS vector data.
Embed and carry out watermark information after complete and extract checking.The essence of this part is the inverse process of telescopiny, is the workflow of extracting method such as Fig. 2, and different from telescopiny is not need to carry out " going common edge " to process when the data preliminary treatment.Concrete steps are as follows:
Step 1: the reading and preliminary treatment of carrier data.
1) utilize the increase income function reading of plug-in unit of MapWinGIS to read and contain accordingly the watermark carrier data, the data after namely Fig. 3 processes through above-mentioned telescopiny.It is the face data in the GIS vector data.
2) data preliminary treatment: the sequence node in the reading face data is List＜IFMEOPoint with Organization of Data〉self-defined structure of [], be designated as S0, each List object is a sequence node in the polygon key element.
Step 2: extract zero watermark.
The key character of this link utilization input data S0 is constructed watermark information.Detailed process is as follows:
1) all nodes among the traversal S0 obtain its locus distribution maximum magnitude D;
2) obtain number C between Statistical Area (C=6 * 6) according to the horizontal piece number H in the configuration parameter, vertical piece number Z;
3) with 1) in D be divided into C subinterval, and store the bounds in each subinterval;
4) travel through all nodes, judge which subinterval this node belongs to, the node sum Ccount that this is interval increases by 1;
5) according to number, each interval interior nodes structure " zero watermark " W0 between node sum, Statistical Area, and save as physical file.
Step 3: odd extracts watermark.
The processing procedure of algorithm is as follows:
1) gets successively key element node set S0j (0＜=j＜n), and to the complementation of node number, obtain M, and M is added into watermark character string W1;
2) according to the rule parsing W1 of system in advance, obtain copyright mark watermark W1.
Step 4: (0＜=j＜n) carries out the general gram compression method compression of Douglas, and (0＜=j＜n) is as the input data of next stage for the sequence node R0j after being simplified to S0j.
Step 5: abscissa DWT low frequency additive algorithms is extracted watermark.At first sequentially choose R0j (the summit composition data sequence among 0＜=j＜n) according to 8 one group, by this data sequence being carried out wavelet transform (DWT), isolate basic, normal, high three kinds of coefficient of frequencies, then extract watermark information at low frequency coefficient, obtain watermark information W2.
Step 6: abscissa spatial domain least significant bit replace Algorithm extracts watermark.Directly (utilize the least significant bit replace Algorithm to extract watermark information in the abscissa sequence of 0＜=j＜n), and the copyright mark information that the obtains W3 of parsing at R0j according to the parameter that reads.
Step 7: ordinate DCT low frequency additive algorithms is extracted watermark information.With step 5, only what carry out is the discrete cosine transform of ordinate to this step, then extracts watermark information from low frequency coefficient to carrier data (R0j (0＜=j＜n)), and resolves and obtain copyright mark information W4.
Step 8: ordinate DCT intermediate frequency additive algorithms is extracted watermark information.With step 5, only what carry out is the discrete cosine transform of ordinate to the carrier data of this step (R0j (0＜=j＜n)), then extracts watermark information from intermediate frequency coefficient, and resolves and obtain copyright mark information W5.
Step 9: utilize editing distance to calculate in twos the similarity between W0, W1, W2, W3, W4, the W5 and accept or reject, draw the optimum as a result W (11000100110011111 that extracts ... 100111) be original copyright information " Nanjing Normal University " after the reduction.
3, test and analysis.
Method proposed by the invention is the integrated of algorithm, adopts the method to develop and realizes GIS vector data multiple digital watermarking system.
(1) coordinate system transformation is attacked
The data that will contain watermark are carried out Coordinate Conversion, because the coordinate system conversion can cause the coordinate of the point of element that slight variation all occurs, therefore watermarked algorithm can not extract watermark by changing coordinate, but this attack can not affect the watermark extracting of odd, zero watermarking algorithm.Experiment shows, the recovery rate of odd and zero watermarking algorithm all reaches 100%, so the present invention can resist coordinate system transformation and attacks.
(2) shearing attack
According to carrying out shearing attack, effect as shown in Figure 4 to containing watermark.By the algorithm principle analysis as can be known, the embedding carrier of watermark is all polygons that meet the interval strategy, is equally distributed so embed polygon in all polygons.Therefore, even if be subject in a big way shearing attack, as long as it is to belong to the embedding polygon that a polygon is still arranged, this method just can extract watermark so, and such as the universal method among the present invention, the recovery rate of Water In The Experiment seal is 100%.But because being based on global data, odd, zero watermark carry out the embedding of watermark and extraction, so do not resist shearing attack.
(3) compression attack
To workflow Fig. 1 analysis of this method as can be known, just carrier data was carried out Douglas Pu Kefa compression before general mode is watermarked, the embedded location of afterwards watermark is some characteristic point in the key element.As long as compression attack is not malice, namely this compress mode still keeps the grown form of key element, and the inventive method can be resisted this compression attack so.The experiment of carrying out compression attack based on the Generalize compress order of ArcGIS 9.2 shows, when compression ratio reaches 30%, still can 100% extract watermark.
(4) add the attack of making an uproar, editor's attack, increase Data attack
This type of attack all is to carry out for the node in the carrier data, in case on a large scale carrier data is used this attack, will greatly reduce the use value of map datum so, and this has just determined that this type of attack belongs to local assault.Analyze principle of the present invention as can be known, in general manner watermarked destination object all is the feature object of the overall situation, that is to say, watermark is uniformly distributed in the carrier data, so this type of local assault can not affect the normal extraction of watermark.Experimental result shows, the comprehensive extraction result of these three kinds of attacks has reached 100%.
To sum up analysis, the embedding of inside of the present invention can not cause interference each other with extracting method and conflict, and these methods can be had complementary advantages on the contrary, the Effective Raise robustness, thus in producing, propagate, using, effectively protect the GIS vector data.
Claims (1)
1. multiple digital watermarking method for the GIS vector data is characterized in that comprising following process:
(1) watermark embed process:
The GIS vector data is read in reading and processing of data, and configuration embeds the parameter of algorithm, checks the legitimacy of all input data and configuration parameter;
Odd embeds algorithm, embedded object is that source data is whole, utilize the parity of key element node number to represent watermark information " 1 " or " 0 ", a key element embeds one watermark information, by increase the parity that a redundant points changes current key element in sequence node;
After utilizing Douglas Pu Kefa that the sequence node S of key element is compressed, sequence node R after obtaining compressing and embedding table of comparisons T, then it is watermarked that the low frequency coefficient in the wavelet transform territory of the abscissa of the sequence node R after compression adopts the additivity method, obtain exporting data R1j, 0＜=j＜n wherein, n is the key element number; Watermarked with the least significant bit Shift Method in the spatial domain of the abscissa of exporting data R1j, obtain exporting data R2j; Adopt again the low frequency additive algorithms watermarked in the low frequency coefficient after the d discrete cosine transform of the ordinate of exporting data R2j, obtain exporting data R3j; Adopt at last the intermediate frequency additive algorithms watermarked in the intermediate frequency coefficient after the discrete cosine transform of the ordinate of exporting data R3j, the watermark embedded object is described key element;
Douglas back-pressure contracting is integrated into the key element sequence node of embed watermark information among the sequence node S of the described key element of not compressing according to embedding table of comparisons T, obtains containing the not packed data S1 of watermark;
Zero watermarking algorithm, utilize the resulting key character that contains the not packed data S1 of watermark of previous step to construct watermark information, by with the described not packed data S1 of watermark that contains according to the regional extent subregion of spatial distribution, then add up the node number in each subregion, construct zero watermark according to the result, and zero watermark is preserved;
Preserve watermarked data afterwards;
(2) watermark extraction process:
The reading and processing of data read the GIS vector data of watermark to be extracted and is converted into the sequence node of key element, reads the configuration parameter file, checks the legitimacy of input data and configuration parameter;
Adopt zero watermarking algorithm from the sequence node of key element obtained in the previous step, to extract watermark information;
Adopt odd from the sequence node of above-mentioned zero watermarking algorithm processing key element afterwards, to extract watermark information;
After the sequence node of key element utilized the general gram compression method compression of Douglas, the low frequency coefficient in the wavelet transform territory of the abscissa of the sequence node after compression adopted the additivity method to extract watermark information; Extract watermark information with the least significant bit Shift Method in the spatial domain of the abscissa of the sequence node after described compression; Adopt the low frequency additive algorithms to extract watermark information in the low frequency coefficient after the discrete cosine transform of the ordinate of the sequence node after described compression; Adopt the intermediate frequency additive algorithms to extract watermark information in the intermediate frequency coefficient after the discrete cosine transform of the ordinate of the sequence node after described compression;
The comprehensive watermark information that compares, analyzes the above-mentioned steps extraction draws the optimum result of extraction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010548741 CN101968878B (en) | 2010-11-18 | 2010-11-18 | Multiple digital watermarking method for geographic information system (GIS) vector data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010548741 CN101968878B (en) | 2010-11-18 | 2010-11-18 | Multiple digital watermarking method for geographic information system (GIS) vector data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101968878A CN101968878A (en) | 2011-02-09 |
| CN101968878B true CN101968878B (en) | 2013-01-02 |
Family
ID=43548028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010548741 Expired - Fee Related CN101968878B (en) | 2010-11-18 | 2010-11-18 | Multiple digital watermarking method for geographic information system (GIS) vector data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101968878B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102509058B (en) * | 2011-11-04 | 2014-07-30 | 南京师范大学 | Point type GIS vector data disguise and recovery method based on redundant bit replacement |
| CN102393895A (en) * | 2011-11-15 | 2012-03-28 | 南京师范大学 | Line/plane type GIS (geographic information system) vector data hiding and restoring method based on interpolation prediction |
| CN103379325B (en) * | 2012-04-19 | 2017-02-15 | 常熟南师大发展研究院有限公司 | Video geographical data digital watermarking method with copyright protection service orientation |
| CN103383721B (en) * | 2012-05-04 | 2016-12-14 | 天津市地下空间规划管理信息中心 | The pipeline data monitoring method combined based on digital watermarking and process concealed-enciphering |
| CN102708535B (en) * | 2012-05-11 | 2014-07-23 | 宁波大学 | Zero-watermark insertion and extraction methods with multiple keys for digital images |
| CN103310407B (en) * | 2013-06-25 | 2015-10-21 | 兰州交通大学 | Based on the vectorial geographical spatial data total blindness water mark method of QR code |
| CN104616240B (en) * | 2013-11-01 | 2019-08-30 | 深圳力维智联技术有限公司 | Watermark insertion and extracting method, device and its system |
| CN103593590B (en) * | 2013-11-18 | 2016-03-30 | 南京信息工程大学 | Based on mixing additivity repeatedly watermark embedding method and the coding/decoding method of cloud environment |
| CN105069739A (en) * | 2015-08-04 | 2015-11-18 | 国家电网公司 | Power grid GIS (Geographic Information System) spatial image copyright control method |
| CN105303076B (en) * | 2015-10-23 | 2017-12-15 | 南京师范大学 | GIS vector data copyright authentication method based on closest index |
| CN105678122B (en) * | 2016-01-11 | 2018-04-24 | 南京师范大学 | A kind of GIS vector data copyright authentication method based on topology information entropy |
| CN106101821A (en) * | 2016-06-21 | 2016-11-09 | 中国农业大学 | The building method of dual zero watermarking and device in video |
| CN110288505B (en) * | 2019-06-30 | 2022-11-29 | 湖南科技大学 | Space vector geographic space data digital watermarking method for resisting geometric transformation attack |
| CN111625786B (en) * | 2020-05-07 | 2022-03-01 | 清华四川能源互联网研究院 | Time sequence data watermarking method based on discrete cosine transform |
| CN111831983B (en) * | 2020-06-30 | 2023-03-10 | 新大陆数字技术股份有限公司 | Watermark embedding method, watermark reading method and watermark system based on desensitization data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060120561A1 (en) * | 2000-10-31 | 2006-06-08 | Hirofumi Muratani | Digital watermark embedding apparatus, digital watermark detecting apparatus, digital watermark embedding method, digital watermark detecting method and computer program product |
| CN101093574A (en) * | 2007-07-23 | 2007-12-26 | 中国人民解放军信息工程大学 | Watermark method of vectorial geographical spatial data based on integral wavelet transforms |
| CN101149835A (en) * | 2007-10-29 | 2008-03-26 | 中国人民解放军信息工程大学 | Map data rasterizing based robust blind water mark embedding and extraction method |
| CN101576993A (en) * | 2009-06-01 | 2009-11-11 | 南京师范大学 | Digital watermark embedding and extraction method for GIS vector data based on data mask |
-
2010
- 2010-11-18 CN CN 201010548741 patent/CN101968878B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060120561A1 (en) * | 2000-10-31 | 2006-06-08 | Hirofumi Muratani | Digital watermark embedding apparatus, digital watermark detecting apparatus, digital watermark embedding method, digital watermark detecting method and computer program product |
| CN101093574A (en) * | 2007-07-23 | 2007-12-26 | 中国人民解放军信息工程大学 | Watermark method of vectorial geographical spatial data based on integral wavelet transforms |
| CN101149835A (en) * | 2007-10-29 | 2008-03-26 | 中国人民解放军信息工程大学 | Map data rasterizing based robust blind water mark embedding and extraction method |
| CN101576993A (en) * | 2009-06-01 | 2009-11-11 | 南京师范大学 | Digital watermark embedding and extraction method for GIS vector data based on data mask |
Non-Patent Citations (1)
| Title |
|---|
| 张丽娟等.GIS矢量数据的自适应水印研究.《地球信息科学》.2008,第10卷(第6期),第723－728页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101968878A (en) | 2011-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101968878B (en) | Multiple digital watermarking method for geographic information system (GIS) vector data | |
| Hu et al. | Reversible visible watermarking and lossless recovery of original images | |
| Maity et al. | Joint robust and reversible watermarking for medical images | |
| CN108009975A (en) | Jpeg image reversible information hidden method based on two-dimensional histogram modification | |
| Zheng et al. | Reversible data hiding for electrocardiogram signal based on wavelet transforms | |
| CN102110281B (en) | Method for embedding and extracting watermarks by adopting difference expansion aiming at shape point map layer data | |
| Tsai | Histogram-based reversible data hiding for vector quantisation-compressed images | |
| CN107689026A (en) | Reversible steganography method based on optimum code | |
| CN109727179A (en) | A kind of zero watermarking generation method and system, extracting method and system | |
| CN103871088A (en) | Method and system for partitioning compression of spatial statistical data based on sparse characteristic of image | |
| CN103295180B (en) | The digital watermark method of robustness and transparent optimum balance | |
| Umaroh et al. | A robust image watermarking using hybrid DCT and SLT | |
| CN109754358B (en) | Image watermarking method and system based on significance detection and contourlet transformation | |
| CN111654592A (en) | Multi-image hiding method based on secret sharing | |
| CN102243700A (en) | Chaos transformation-based shp liner and planar layer data disguising and restoring method | |
| CN102075283A (en) | Information steganography method and device | |
| Gao et al. | Reversible watermarking algorithm based on wavelet lifting scheme | |
| Youssef et al. | A robust steganography model using wavelet-based block-partition modification | |
| Cao et al. | Iterative embedding-based reversible watermarking for 2D-vector maps | |
| Fei et al. | A reversible watermark scheme for 2D vector map based on reversible contrast mapping | |
| CN105023235B (en) | A kind of electronic chart water mark method based on spatial redundancy relationship | |
| CN115049715B (en) | Image steganography method based on texture fusion feature block matching and large embedding rate product code | |
| Shahraeini et al. | A robust digital image watermarking approach against jpeg compression attack based on hybrid fractal-wavelet | |
| Liu et al. | Novel robust multiple watermarking against regional attacks of digital images | |
| CN104103031A (en) | Normalization-based vector spatial data blind watermark method |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: SUZHOU NANSHIDA WISDOM CREATIVE INDUSTRY CO., LTD. Free format text: FORMER OWNER: NANJING NORMAL UNIVERSITY Effective date: 20131121 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 210046 NANJING, JIANGSU PROVINCE TO: 215164 SUZHOU, JIANGSU PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20131121 Address after: 215164, Suzhou, Jiangsu province Wuzhong District Xu Kou Town Street No. 550 Patentee after: Suzhou Normal University wisdom Creative Industry Co., Ltd. Address before: Yuen Road Qixia District of Nanjing City, Jiangsu Province, No. 1 210046 Patentee before: Nanjing Normal University |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130102 Termination date: 20141118 |
|
| EXPY | Termination of patent right or utility model |