CN104103031B - Based on normalized Vector spatial data blind watermark method - Google Patents
Based on normalized Vector spatial data blind watermark method Download PDFInfo
- Publication number
- CN104103031B CN104103031B CN201410376222.3A CN201410376222A CN104103031B CN 104103031 B CN104103031 B CN 104103031B CN 201410376222 A CN201410376222 A CN 201410376222A CN 104103031 B CN104103031 B CN 104103031B
- Authority
- CN
- China
- Prior art keywords
- watermark
- embedded
- data
- spatial data
- value
- 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.)
- Active
Links
Landscapes
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
For robust Vector spatial data digital watermark, Geometrical attack is a kind of more ticklish attack.The algorithm of existing anti-Geometrical attack is difficult to the attack of resistance summit again.Borrow the thought of data normalization, it is proposed that one kind is based on normalized Vector spatial data blind watermarking algorithm.The coordinate value of spatial data is normalized before embedded watermark for the algorithm, and to realize the consistency to Pan and Zoom, watermark is embedded in by changing the normalized value of vertex coordinates data.Watermark is repeatedly embedded in, and realizes the Blind extracting of watermark.Result of the test shows that this method has preferable robustness to the attack such as translation, scaling, additions and deletions point, cutting, compression, key element sequence, Data Format Transform, while watermark can be controlled to be embedded in the size for causing spatial data error.
Description
Technical field
It is a kind of vectorial geographical based on method for normalizing the invention belongs to cartography and Geographical Information Sciences technical field
Spatial data blind watermarking algorithm.
Background technology
Vectorial geographical spatial data is the important strategic information resource of country, is economic, military, national defense construction and society
The basic data of development, acquisition generally by means of expensive professional equipment and will spend substantial amounts of human and material resources, so, its version
Power protection is most important.Vectorial geographical spatial data is preserved in digitized form, while data copy and propagation is facilitated,
Also piracy is made to become extremely easy.At present, in the urgent need to the safety of reliable technical guarantee geographical spatial data.
With the development of computer techno-stress technology, copyright protection of digital product causes people widely to study and pay close attention to.
Digital watermark is in digital content security, copyright protection and authenticated connection, it is considered to be current most promising technology.Digital watermark
Video watermark, audio frequency watermark, Text Watermarking, database water mark, spatial data watermark etc. are developed into from initial image watermark.Phase
For other digital watermarks, the development of Vector spatial data digital watermark relatively lags behind.
In general, according to the embedded location of watermark, Vector spatial data watermarking algorithm can be divided into：Spatial domain watermark algorithm
With frequency domain water mark algorithm.However, the usual algorithm of spatial-domain algorithm is simple, easy to operate, watermark capacity is larger, can resist increase
Effect is poor in terms of point, deletion point, cutting and attacked by noise, but resistance geometric attack；Although and frequency domain algorithm can resist several
What is attacked, the poor robustness in terms of summit increase, deletion.So, existing algorithm is difficult to attack with geometry while resisting summit attack
Hit.
The content of the invention
For above-mentioned situation, the present invention proposes a kind of " being based on normalized Vector spatial data blind watermark method ", should
The coordinate value of spatial data is normalized before embedded watermark for algorithm, to realize the consistency to Pan and Zoom,
Watermark is embedded in by changing the normalized value of vertex coordinates data.Watermark is repeatedly embedded in, and realizes the Blind extracting of watermark；Solution
Vector spatial data watermarking algorithm determined while the problem of being attacked by geometric attack and summit, improves the robust of watermarking algorithm
Property.
The apex coordinate insertion watermark of Vector spatial data geometric figure is chosen herein.In order to be embedded in watermark information
All Vector spatial datas, with resisting cropping attack, watermark information should be uniformly embedded into X, the Y on all summits of Vector spatial data
Coordinate, to ensure the anti-attack ability of watermark.Before watermark insertion, place first is normalized to the coordinate value on Drawing Object summit
Manage, then the embedded watermark information in normalized value.So, after spatial data containing watermark implements geometric transformation, it is not necessary to right
Geometric transformation is corrected, it is possible to extract watermark.At the same time, in order to eliminate the correlation between watermarking images pixel, strengthen
The security of watermark, using Logistic chaos algorithm scrambles in watermarking images before embedding.The initial value of chaos transformation can
Using the key extracted as watermark information.
The inventive method includes：The insertion of watermark information and the extraction of watermark information.
Watermark information insertion, which refers to watermark information to be embedded into original vector geographical spatial data, obtains with watermarked information
Vectorial geographical spatial data.Step is as follows：First, Vector spatial data is read, all coordinate points of Drawing Object, structure are extracted
Produce X0, Y0Set；Secondly, to X0, Y0Data normalization and amplification 10 are carried out respectivelynTimes；Secondly, in coordinate points after amplification
Watermark is embedded in quantization method；Finally, 10 are reduced to the coordinate points after embedded watermarknTimes, and renormalization, afterwards containing water
The spatial data of print preserves output.
The extraction process of watermark is the inverse process of telescopiny.First, testing data is read, data are normalized simultaneously
Amplification 10nTimes, n takes and identical n values when being embedded in watermark；Secondly, by Hash () function, calculating i, (i is the position of watermark
Put)；Secondly, watermark bit W (i) value, quantized value when R water intaking prints are embedded are extracted by QIM quantization methods；Finally, to extracting
The one-dimensional watermark sequence arrived, carries out rising dimension processing and inverts unrest, obtain final watermarking images.
Brief description of the drawings
Fig. 1 is watermark insertion flow chart
Fig. 2 is watermark extraction process
Fig. 3 (a) is original watermark
Fig. 3 (b) is watermark after scramble
Fig. 4 is error distribution histogram
Fig. 5 (a) is superposition before and after embedded watermark
Fig. 5 (b) is partial enlarged drawing after superposition
Fig. 6 (a) is data after cutting
Fig. 6 (b) is the watermark extracted
Table 1 is n values and worst error, RMSE relations
Table 2 is the robustness of geometric attack
Table 3 be increase, delete a little and modifying point attack robustness
Table 4 is compression, the robustness of key element deletion attack
Embodiment
In order to describe technology contents, construction feature, the purpose realized and the effect reached of the present invention in detail, below
Described in detail with reference to embodiment.
The implementation steps of the present invention may be summarized to be two parts：Watermark information is embedded in and watermark information is extracted.It is right below
Each implementation steps are further elaborated.
Watermark information insertion, which refers to watermark information to be embedded into original vector geographical spatial data, obtains with watermarked information
Vectorial geographical spatial data.
The embedded watermark in units of vector graphic object of this algorithm.The summit of Drawing Object set V0It is expressed as：
V0={vi}; vi=(xi,yi) i=1,2,…,N
X0={xi}; Y0={yi} i=1,2,…,N
Wherein viRepresent each summit, (xi,yi) represent summit two coordinate values, X0The set of abscissa value is represented,
Y0The set of ordinate value is represented, N is the number on summit.
The idiographic flow of watermark insertion is as follows：
(1) Vector spatial data is read, all coordinate points of Drawing Object is extracted, constructs X0, Y0Set；
(2) to X0, Y0Data normalization and amplification 10 are carried out respectivelynTimes, it is designated as；
(3) existIn quantization method insertion watermark is respectively adopted, specific embedding grammar is as follows：
1. the value i, x for calculating Hash (x) are watermark data to be embedded, and Hash (x) functions are between x values and watermark bit
Hash mapping function；
2. watermark bit w [i] (1 to be embedded is extracted), w is the watermark after scramble, and M is the length of watermark；
3. QIM methods are applied, the embedded watermark in x calculates data x ', R after embedded watermark to quantify by formula (3)
Value；
(3)
(4) after to embedded watermarkReduce 10nTimes, and renormalization；
(5) the output preservation of watermark spatial data will finally be contained.
In watermark telescopiny, setting up higher effective bit position of normalized value using Hash functions, (this part will not
Embedded watermark), with the mapping relations between watermark bit (1 ~ M).By to normalization data amplification 10nAfter times, water will be made
Print is embedded into the relatively low order part of numerical value, can thus greatly reduce error caused by watermark insertion.After embedded watermark
Data also need to use extreme value renormalization, in order to reduce data error as far as possible, the extraction of watermark are not influenceed, in extreme value data
In can not be embedded in watermark.
The extraction process of watermark is the inverse process of telescopiny, as shown in Figure 3.Watermark extracting detailed process is as follows：
1) testing data is read, data are normalized and amplify 10nTimes, n takes and identical n when being embedded in watermark
Value；
2) by Hash () function, calculate i (i is the position of watermark)；
3) watermark bit W (i) value, quantized value when R water intaking prints are embedded are extracted by QIM quantization methods；
4) to the one-dimensional watermark sequence extracted, carry out rising dimension processing and invert unrest, obtain final watermarking images.
In watermark insertion, watermark may be repeatedly embedded in, therefore determine watermark information using Voting principle.Calculate
Method is：An integer sequence { B (i)=0, i=1 ..., M } isometric with watermark sequence is defined, M is watermark length.Single water
Print position={ 1, -1 }, same watermark position extraction process in, using formula B (i)=B (i)+To count watermark information
The majority of value -1 and 1, such as " 1 " are majority, then；Then binary bitmap is reconstructed according to formula (4).
(4)。
Claims (1)
1. one kind is based on normalized Vector spatial data blind watermark method, its feature comprises the following steps：
This method embedded watermark in units of vector graphic object, the summit set V of Drawing Object0It is expressed as：
V0={vi}; vi=(xi,yi) i=1,2,…,N
X0={xi}; Y0={yi} i=1,2,…,N
Wherein viRepresent each summit, (xi,yi) represent summit two coordinate values, X0Represent the set of abscissa value, Y0Table
Show the set of ordinate value, N is the number on summit；
The specific steps content of watermark insertion is as follows：
Step one：Vector spatial data is read, all coordinate points of Drawing Object is extracted, constructs X0, Y0Set；
Step 2：To X0, Y0Data normalization and amplification 10 are carried out respectivelynTimes, it is designated as；
Step 3：In quantization method insertion watermark is respectively adopted, specific embedding grammar is as follows：
Step a：The value i, x for calculating Hash (x) are watermark data to be embedded, and Hash (x) functions are between x values and watermark bit
Hash mapping function；
Step b：Extract watermark bit w [i] to be embedded, 1, w is the watermark after scramble, and M is the length of watermark；
Step c：Using QIM methods, the embedded watermark in x, data x ', R after embedded watermark are calculated by below equation is
Quantized value；
Step 4：After embedded watermarkReduce 10nTimes, and renormalization；
Step 5：The output preservation of watermark spatial data will finally be contained；
The extraction of watermark information and its step content：
Step one：Testing data is read, data are normalized and amplify 10nTimes, n takes and identical n when being embedded in watermark
Value；
Step 2：By Hash () function, i is calculated, i is the position of watermark；
Step 3：Watermark bit w [i] value, quantized value when R water intaking prints are embedded are extracted by QIM quantization methods；
Step 4：To the one-dimensional watermark sequence extracted, carry out rising dimension processing and invert unrest, obtain final watermarking images.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410376222.3A CN104103031B (en) | 2014-08-03 | 2014-08-03 | Based on normalized Vector spatial data blind watermark method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410376222.3A CN104103031B (en) | 2014-08-03 | 2014-08-03 | Based on normalized Vector spatial data blind watermark method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104103031A CN104103031A (en) | 2014-10-15 |
| CN104103031B true CN104103031B (en) | 2017-07-25 |
Family
ID=51671159
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410376222.3A Active CN104103031B (en) | 2014-08-03 | 2014-08-03 | Based on normalized Vector spatial data blind watermark method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104103031B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110222481B (en) * | 2019-06-14 | 2022-07-29 | 兰州交通大学 | BIM model copyright protection spatial domain digital watermarking method |
| CN110933161B (en) * | 2019-11-27 | 2022-06-28 | 北京拓普丰联信息科技股份有限公司 | Information anti-theft management method, device, server and readable storage medium |
| CN116362952B (en) * | 2023-04-18 | 2024-04-12 | 兰州交通大学 | Three-dimensional point cloud data digital watermarking method using grid division |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039371A (en) * | 2006-03-18 | 2007-09-19 | 辽宁师范大学 | Novel method of digital watermarking for protecting literary property of presswork |
| CN101556686A (en) * | 2009-03-30 | 2009-10-14 | 西安电子科技大学 | Robust image watermark method based on local Tchebichef moment |
| CN103034970A (en) * | 2012-12-10 | 2013-04-10 | 大连大学 | Multiple information hiding method based on combination of image normalization and principal component analysis (PCA) |
| CN103366335A (en) * | 2013-07-17 | 2013-10-23 | 兰州交通大学 | Vector point spatial data full-blind watermarking method based on grid dividing |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103067159B (en) * | 2012-12-28 | 2016-03-02 | 南京师范大学 | A kind of reversible DecryptDecryption method of GIS vector data |
-
2014
- 2014-08-03 CN CN201410376222.3A patent/CN104103031B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039371A (en) * | 2006-03-18 | 2007-09-19 | 辽宁师范大学 | Novel method of digital watermarking for protecting literary property of presswork |
| CN101556686A (en) * | 2009-03-30 | 2009-10-14 | 西安电子科技大学 | Robust image watermark method based on local Tchebichef moment |
| CN103034970A (en) * | 2012-12-10 | 2013-04-10 | 大连大学 | Multiple information hiding method based on combination of image normalization and principal component analysis (PCA) |
| CN103366335A (en) * | 2013-07-17 | 2013-10-23 | 兰州交通大学 | Vector point spatial data full-blind watermarking method based on grid dividing |
Non-Patent Citations (2)
| Title |
|---|
| 利用QIM的DFT矢量空间数据盲水印模型;许德合等;《武汉大学学报.信息科学版》;20100930;第35卷(第9期);第1100-1103页 * |
| 数字水印抗几何攻击理论及应用研究;李雷达;《中国博士学位论文全文数据库 信息科技辑（月刊）》;20091215;第2009年卷(第12期);参见正文第2.3节，图2.18、图2.20 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104103031A (en) | 2014-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | A recent survey of reversible watermarking techniques | |
| Benhocine et al. | New images watermarking scheme based on singular value decomposition. | |
| Wang et al. | A high capacity reversible data hiding method for 2D vector maps based on virtual coordinates | |
| CN104680472B (en) | The multiple blind watermark method of Vector spatial data that spatial domain and frequency domain are combined | |
| CN104794671B (en) | The Vector spatial data blind watermark method of anti-projection attack | |
| Liu et al. | Robust blind image watermarking based on chaotic mixtures | |
| Munib et al. | Robust image watermarking technique using triangular regions and Zernike moments for quantization based embedding | |
| CN104103031B (en) | Based on normalized Vector spatial data blind watermark method | |
| Gupta et al. | Image Watermarking using IWT-SVD and its Comparative Analysis with DWT-SVD | |
| Parah et al. | StegNmark: a joint Stego-watermark approach for early tamper detection | |
| Kamble et al. | DWT-SVD based robust image watermarking using Arnold map | |
| Thilagavathi et al. | A survey of reversible watermarking techniques, application and attacks | |
| CN104766263A (en) | Color image watermark embedding and detecting method based on quaternion Legendre moment correction | |
| CN103428503A (en) | Method and device for watermark extraction in digital medium | |
| CN104091304A (en) | Vector spatial data blind watermarking method based on feature point | |
| CN106373079A (en) | Android photo position and time digital watermark embedding and extraction method | |
| CN111275602A (en) | Face image security protection method, system and storage medium | |
| Roy et al. | A robust reversible image watermarking scheme in DCT domain using Arnold scrambling and histogram modification | |
| CN103390261A (en) | Vector geographic space data total blindness watermarking method based on error reduction | |
| He-Jing | A DCT domain image watermarking method based on Matlab | |
| Shady et al. | Local features-based watermarking for image security in social media | |
| Li et al. | The Medical Image Watermarking Using Arnold Scrambling and DFT | |
| Bhatnagar | Robust covert communication using high capacity watermarking | |
| Uludag et al. | Robust watermarking of busy images | |
| Kumar | Towards robust reference image watermarking using DWT-SVD and edge detection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |