A novel multi-stage watermarking scheme of vector maps

Author(s):  
Yinguo Qiu ◽  
Hongtao Duan
2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.


2019 ◽  
Vol 78 (17) ◽  
pp. 24955-24977 ◽  
Author(s):  
Yinguo Qiu ◽  
Hongtao Duan ◽  
Jiuyun Sun ◽  
Hehe Gu

2017 ◽  
Vol 77 (5) ◽  
pp. 6385-6403 ◽  
Author(s):  
Yinguo Qiu ◽  
Hehe Gu ◽  
Jiuyun Sun

2017 ◽  
Vol 20 (4) ◽  
pp. 3667-3675 ◽  
Author(s):  
Yizhi Liu ◽  
Fan Yang ◽  
Kun Gao ◽  
Wenjie Dong ◽  
Jun Song

2015 ◽  
Author(s):  
Xiaowei Jing ◽  
Mei Feng ◽  
Biao Guo ◽  
Liang Chen ◽  
Youjian Zhao ◽  
...  

2021 ◽  
Vol 10 (11) ◽  
pp. 718
Author(s):  
Yu Li ◽  
Liming Zhang ◽  
Xiaolong Wang ◽  
Xingang Zhang ◽  
Qihang Zhang

Commutative encryption and watermarking (CEW) is an emerging method that combines encryption technology with digital watermarking technology. It has the dual capability of secure transmission and copyright protection. However, the existing CEW methods for vector maps have good robustness in resisting geometric attacks but poor resistance to vertex attacks (e.g., addition, deletion, etc.). To solve this problem, here we propose a novel invariant-based CEW algorithm for vector maps, which consists of permutation-based encryption scheme and coordinates-based watermarking scheme. In the encryption scheme, the encryption key is generated via the Gaussian distribution method combined with the SHA-512 hash method; then, the double random position permutation strategy is applied to the vector map encryption. In watermarking embedding scheme, the original watermark image is scrambled via logistic chaotic encryption before embedding, and the coordinates of all the vertices are normalized. Then, the scrambled watermark image is embedded into the normalized coordinates. Results show that: proposed method is more robust to conventional attacks (e.g., vertex addition and deletion, reordering and data format conversion) and geometric attacks (e.g., scaling and translation). In addition, compared with the existing CEW methods for vector maps, the proposed method has higher security and stronger robustness against vertex attacks.


Symmetry ◽  
2018 ◽  
Vol 10 (9) ◽  
pp. 397 ◽  
Author(s):  
Xiang Hou ◽  
Lianquan Min ◽  
Hui Yang

To protect the security of vector maps, we propose a novel reversible watermarking scheme for vector maps based on a multilevel histogram modification. First, a difference histogram is constructed using the correlations of adjacent coordinates, and the histogram is divided into continuous regions and discontinuous regions by combining the characteristics of vector map data. Second, the histogram bins that require modification are determined in the continuous regions through the optimal peak value, and the peak values are chosen from the flanking discontinuous regions in both directions; the watermarks are embedded by adopting the multilevel histogram modification strategy. The watermark extraction process is the reverse of the embedding process, and after completing the watermark extraction, the carrier data can be recovered losslessly. The experimental results show that the proposed algorithm has good invisibility and is completely reversible. Compared with similar algorithms reported previously, it achieves higher watermark embedding capacity under the same embedding distortion with lower complexity, thereby having a higher application value.


Sign in / Sign up

Export Citation Format

Share Document