A Zero-Watermarking Scheme for Vector Map Based on Feature Vertex Distance Ratio

Peng, Yuwei; Yue, Mingliang

doi:10.1155/2015/421529

Cited by 22 publications

(18 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Zero-watermarking has already been applied to various data types [38][39][40] and offers opportunities for the applications in vector maps with high fidelity. There are pioneer studies on zero-watermarking of vector maps and most of them mainly focus on the mining and construction of stable feature information [41][42][43]. The zero-watermarking of a vector map often has the problems of small watermark capacity and lack of robustness because of complex types of attacks to vector maps and the limitation posed by the stability and distribution of feature information.…”

Section: Introductionmentioning

confidence: 99%

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Zhang

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Zhang

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Geographical data have become widely available in digital format due to the advancement in computer devices, database systems, mapping applications and IT (Information Technology) [1,2]. While the wide spread of geographical applications has brought many benefits for IT consumers [3,4], it has also increased the necessity to protect digital geographical data from illegal distribution and modification [5][6][7][8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

Evaluating the topological quality of watermarked vector maps

Abubahia

Cocea

2018

Applied Soft Computing

View full text Add to dashboard Cite

The pervasive use and exchange of digital content led to increased efforts in the research community for efficient approaches to protect intellectual property rights. While watermarking techniques have been used extensively for raster image format, watermarking approaches for the vector map format have been largely inspired from existing image watermarking techniques, without due consideration to the suitability of these techniques for this different data format. A key requirement of any watermarking approach of vector data is the preservation of the topological quality of the watermarked data. This is sometimes referred to as the invisibility of the watermark. For vector map data, the topological quality and invisibility are fundamentally different, but currently submerged

show abstract

“…The process of constructing the watermark does not have to change the information of the original digital work; therefore, the accuracy of the vector data after embedding the watermark is unaffected. The drawback is that although most algorithms are resistant to certain attacks, the robustness is generally poor [33][34][35][36][37]. In summary, the current research on vector data digital watermarking is based on the data structure characteristics of vector data for watermark embedding or watermark information generation.…”

mentioning

confidence: 99%

A Novel Infringement Detection Method for GIS Vector Data

Tang

Zhang

Jing

et al. 2019

IJGI

View full text Add to dashboard Cite

There is undoubtedly a groundswell of support for the concept of geographic data sharing with the rapid development and wide-ranging application of geographic information science. However, copyright protection and infringement detection in the process of geographic data sharing has always been an important issue that needs to be addressed urgently. In this paper, we present a novel infringement detection method for GIS vector data to compensate for the shortcomings of vector data digital watermarking technology in infringement detection. The method determines whether infringement exists by the duplication degree between the original data and the vector data to be detected in three features including feature features, included angle features and vertex features which gets by using the spatial information of vector data to perform the feature matching based on GeoJSON format data. The experimental results indicate that the proposed algorithm can effectively resist common geometric attacks, such as interpolation attack, deletion attack, similarity transformation attack, feature order scrambling attack, and feature simplification attack, on vector data, which proves that the proposed algorithm has excellent robustness and meets the requirements of practical application. but there is growing demand for geographic data in society. This forms a contradiction, and the issue of geographic data sharing needs to be resolved as soon as possible.In order to promote the sharing of geographic data, some international organizations and countries have set up systems and platforms [3][4][5] dedicated to the sharing of geographic data, and there have also been a number of crowd-sourced geographic information platforms [6] established spontaneously. The emergence of these platforms has provided good geographic data support for research, education, and development of the geographic information discipline, but still fails to resolve the above contradiction. there is an urgent demand for a technology that can protect the copyright of geographic data effectively in the case of imperfect laws and regulations.At present, encryption control technology and digital watermarking technology are the main means of geographic data copyright protection [8]. Among them, encryption control technology combines computer hardware, computer software, and geographic data to control the reading and writing of geographic data at the bottom of the computer system. It can prevent users from reading, abusing, and tampering with unauthorized geographic data on unauthorized computers, and can prevent illegal acts such as infringement and disclosure of geographic data in advance. However, this technology is more suitable for the protection of classified data than the public-oriented geographic data sharing process because it is demanding on software and hardware. Digital watermarking technology is an after-the-fact pursuit technique [9], which embeds watermark information (such as a copyright information identification image) into geographic data, and the geogra...

show abstract

A Zero-Watermarking Scheme for Vector Map Based on Feature Vertex Distance Ratio

Cited by 22 publications

References 15 publications

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Evaluating the topological quality of watermarked vector maps

A Novel Infringement Detection Method for GIS Vector Data

Contact Info

Product

Resources

About