2014
DOI: 10.2495/icct20130151
|View full text |Cite
|
Sign up to set email alerts
|

An asymmetrical watermarking algorithm for vector map data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…With the precision tolerance of the map, the upper and lower bounds of (denoted as and , resp.) can be calculated by (4). Therefore, ℎ is the largest number by which ( , ℎ), ( , ℎ), and ( , ℎ) have the same value:…”
Section: Watermark Bit Mappingmentioning
confidence: 99%
See 1 more Smart Citation
“…With the precision tolerance of the map, the upper and lower bounds of (denoted as and , resp.) can be calculated by (4). Therefore, ℎ is the largest number by which ( , ℎ), ( , ℎ), and ( , ℎ) have the same value:…”
Section: Watermark Bit Mappingmentioning
confidence: 99%
“…Although many watermarking schemes have been proposed [1][2][3][4][5][6][7], most of them modify the map more or less to embed the watermark in it. For a vector map, which is sensitive to the precision, any form of distortion is insufferable.…”
Section: Introductionmentioning
confidence: 99%