2014
DOI: 10.1007/s11042-014-2259-9
|View full text |Cite
|
Sign up to set email alerts
|

Blind watermarking scheme for polylines in vector geo-spatial data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
15
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(17 citation statements)
references
References 22 publications
0
15
0
Order By: Relevance
“…Equations (9) and (12) in Section 2.3.2 show the distribution probabilities under two conditions, which is the basis of the detection model. However, the premise for Equations (9) and (12) are the Lindeberg conditions, which are difficult to demonstrate by means of theoretical derivation.…”
Section: Applicability Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…Equations (9) and (12) in Section 2.3.2 show the distribution probabilities under two conditions, which is the basis of the detection model. However, the premise for Equations (9) and (12) are the Lindeberg conditions, which are difficult to demonstrate by means of theoretical derivation.…”
Section: Applicability Analysismentioning
confidence: 99%
“…Moreover, the proposed detection algorithm is compatible with single watermarking detection algorithms, and it has good performance in terms of detection efficiency. Therefore, multiple watermarking technology can effectively solve the above information security problems of vector geographic data.Currently, many scholars have been devoted to developing digital watermark technology, and they have proposed many algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. However, these algorithms focus on embedding only one watermark in the cover data, which then lacks multi-copyright protection.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…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%
“…Vector data digital watermarking algorithms can be divided into the spatial domain algorithm, frequency domain algorithm, geometric domain algorithm, and zero-watermarking algorithm according to the watermark embedding position and the source of the watermark information. The spatial domain watermarking algorithm uses quantification, coordinate mapping, and other methods to embed the watermark by modifying the vector data coordinate values within the error tolerance, thus achieving strong resistance to addition and deletion attacks [20][21][22][23][24]. The frequency domain watermarking algorithm embeds the watermark into the coordinate transform domain coefficients such as DFT (discrete Fourier transform), DCT (discrete cosine transform), DWT (discrete wavelet transform), which improves the ability of the algorithm to resist attacks such as noise and translation [25][26][27][28].…”
mentioning
confidence: 99%