Research on zero watermarking technique based on improved Sobel operator

Author(s):  
Lin Li ◽  
Shengquan Wang ◽  
Weijia Zeng ◽  
Fang Qin
2013 ◽  
Vol 33 (2) ◽  
pp. 434-437 ◽  
Author(s):  
Xinghong CHENG ◽  
Yuqing HOU ◽  
Jingxing CHENG ◽  
Xin PU

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.


Author(s):  
Kun Hu ◽  
Xiaochao Wang ◽  
Jianping Hu ◽  
Hongfei Wang ◽  
Hong Qin

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 208
Author(s):  
Qifei Zhou ◽  
Changqing Zhu ◽  
Na Ren ◽  
Weitong Chen ◽  
Weiteng Gong

Zero watermarking is an important part of copyright protection of vector geographic data. However, how to improve the robustness of zero watermarking is still a critical challenge, especially in resisting attacks with significant distortion. We proposed a zero watermarking method for vector geographic data based on the number of neighboring features. The method makes full use of spatial characteristics of vector geographic data, including topological characteristics and statistical characteristics. First, the number of first-order neighboring features (NFNF) and the number of second-order neighboring features (NSNF) of every feature in vector geographic data are counted. Then, the watermark bit is determined by the NFNF value, and the watermark index is determined by the NSNF value. Finally, combine the watermark bits and the watermark indices to construct a watermark. Experiments verify the theoretical achievements and good robustness of this method. Simulation results also demonstrate that the normalized coefficient of the method is always kept at 1.00 under the attacks that distort data significantly, which has the superior performance in comparison to other methods.


2021 ◽  
Vol 1865 (4) ◽  
pp. 042034
Author(s):  
Liang Jing ◽  
Zhentao Sun ◽  
Kexin Chen ◽  
Xue Wen ◽  
Xinyi Cheng

Sign in / Sign up

Export Citation Format

Share Document