Blind and Robust Watermarking for Street-Network Vector Maps

Pu, Yu-Chi; Jou, I-Chang

doi:10.3923/itj.2009.982.989

Cited by 7 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The feature points of a polyline are the vertices that are most likely to represent the objects structure and cannot be arbitrarily added or removed under interpolation or simplification [10,11]. Methods that extract their cover data based on feature points take full advantage of this property to resist vertex attacks [12,13]. As a result, the cover data can properly resist interpolation and simplification attacks under the assumption that a successful attack should not violate the map's validity.…”

Section: Feature Point Selectionmentioning

confidence: 99%

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

Peng

Yue

2015

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

With the rapid development of GIS and computer techniques, vector map data has been widely used in many fields. Since the production of map data is very costly, illegal copying will result in huge loss for data owners. In order to protect the copyright of vector data, digital watermarking has been employed in recent years. In this paper, a zero-watermarking scheme for vector map data is proposed. In the proposed scheme, FVDR (feature vertex distance ratio) is constructed based on the feature vertices of objects. The feature data, FVDR, is combined with watermark to generate the zero-watermark. Due to the specially designed cover data, the proposed scheme is robust to geometrical attacks, vertex attacks, and object attacks. The results of extensive experiments also demonstrate the robustness of the proposed scheme.

show abstract

Section: Feature Point Selectionmentioning

confidence: 99%

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

Peng

Yue

2015

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

show abstract

“…Other blind watermarking algorithms [23,18,17,5,10] provide some limited resistance against crop attacks to some extent. Voigt et al [23] proposed a feature based watermarking algorithm which is relies on statistical detection.…”

Section: Blind Methods In Spatial Domainmentioning

confidence: 99%

“…In this part, we compare the proposed approach with two other watermarking algorithms proposed by Pu [17] and Voigt [23]. Both methods are blind watermarking algorithms and provide some resistance to crop attack.…”

Section: Figure 10: Twin-cities Seven-county Road Mapmentioning

confidence: 99%

See 1 more Smart Citation

Watermarking road maps against crop and merge attacks

Jiang

Zhu

Huang

et al. 2013

Proceedings of the First ACM Workshop on Information Hiding and Multimedia Security

View full text Add to dashboard Cite

Past research on watermarking digital road maps has been focused on deterring common attacks such as adding noise to the whole map so as to destroy the embedded watermarks. This paper focuses on two less common but increasingly used types of attack: crop attacks and merge attacks. Crop attack crops a fragment of the original map and uses the fragment as a new map. When the new map is much smaller than the original map, it is called massive cropping. Merge attack merges maps from various sources together to form a new map. Conventional watermarking techniques fail against these attacks either because they require global information from the whole map or they must add too many local watermarks and affect the usability of the maps. This paper proposes a novel quad-tree based blind watermarking scheme that partitions the original map according to the quad-tree and plants just one single bit in each sub-region of the map. The approach achieves almost 100% detection accuracy for moderate crop and merge attacks, and over 80% accuracy with more than 95% of the original map cropped and removed. Furthermore, the method introduces very little distortion to the original map: to effectively protect a 23.5MB MinneapolisSt.Paul map against crop and merge as well as other common attacks, only 423 bits or 53 bytes of watermark is required.

show abstract

“…The resilience to both geometric and operational attacks is measured by comparing the extracted watermark with the original watermark by using the metrics that are shown in [22,70,112,118,124,152,167,174,192,196,197,211], [43,46,48,69,86,115,130,131,134,177,199,217], [40,74,82,85,113,120,122,127,171,188,190] Noise addition 37 [3,93,101,112,117,165,169,172,180,184,185,203], [10,39,46,…”

Section: Robustnessmentioning

confidence: 99%

Advancements in GIS map copyright protection schemes - a critical review

Abubahia

Cocea

2016

Multimed Tools Appl

View full text Add to dashboard Cite

Dramatic advancements in Geographic Information Systems (GIS) and computer technologies resulted in a wide availability of rich-knowledge GIS digital vector maps that are easily accessible and downloadable through the world wide web. This led to the need of copyright protection systems to protect the rights of the producers of these maps. Unlike the research on copyright protection for raster/image data types, the research for vector map data is less documented. This article surveys and classifies the GIS vector map copyright protection research papers published between 2000 and 2014, towards a thorough understanding of the-state-of-the-art, addressing significant limitations of previous review articles, and outlining effective recommendations for future research directions.

show abstract

Blind and Robust Watermarking for Street-Network Vector Maps

Cited by 7 publications

References 3 publications

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

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

Watermarking road maps against crop and merge attacks

Advancements in GIS map copyright protection schemes - a critical review

Contact Info

Product

Resources

About