High-capacity reversible watermarking scheme of 2D-vector data

Cao, Liujuan; Men, Chaoguang; Ji, Rongrong

doi:10.1007/s11760-013-0606-3

Cited by 20 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the perspective of embedding domain, watermarking algorithms for vector data can be divided into the spatial domain and the transformation domain. Watermarking algorithms based on spatial domain embed watermark into spatial coordinates [15,16,18,20,23,28,31], statistical indices [14,[32][33][34], metric measurements [22], angles [35], areas [36], arc lengths [25], geometric coordinates [26,37,38], etc. Generally, watermarking methods considering geometric feature factors have more resistance against rotation, scaling and translation (RST) attack.…”

Section: Related Workmentioning

confidence: 99%

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

2019

KSII TIIS

View full text Add to dashboard Cite

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

show abstract

Section: Related Workmentioning

confidence: 99%

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…To further verify the superiority of the proposed algorithm to similar algorithms, the proposed algorithm was compared with the algorithms presented in Refs. [16,26,37]. The relationship between the watermark capacity E (bpv) and the embedding distortion RMSE was used to evaluate the embedding performance of the algorithm; under the same watermark capacity, the lower the RMSE was, the higher the embedding performance of the algorithm, and similarly, under the same RMSE, the larger the watermark capacity was, the higher the embedding performance of the algorithm.…”

Section: Embeddedmentioning

confidence: 99%

“…Since watermark embedding can disturb the carrier data, for conventional watermarking technology, even if watermarks are successfully extracted, the change to the carrier is permanent and irreversible. For vector maps used in surveying, mapping, and military fields, which require extremely high data precision, even a slight disturbance can affect the result tremendously, which is unacceptable [14][15][16]. Reversible watermarking is an effective means to overcome this bottleneck, and it can recover the disturbed carrier data caused by watermark extraction to the state before the watermarks are embedded, thus achieving the goal of 2 of 19 "lossless" recovery.…”

Section: Introductionmentioning

confidence: 99%

“…In Ref. [16], map feature points were divided into embeddable groups and non-embeddable groups, and an iterative method was used to modify the coordinates, which gave rise to a larger embedding capacity but also a stronger perturbation of the map data. Qiu et al [27] used a Douglas−Peucker compression to extract the feature points and non-feature points, and they converted the non-feature points into polar coordinates to counter geometric attacks, and added a value in the decimal part of the coordinates to embed the watermark bits; however, the change in the number of digits of the map coordinates could appear suspicious to attackers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Reversible Watermarking Scheme for Vector Maps Based on Multilevel Histogram Modification

2018

View full text Add to dashboard Cite

To protect the security of vector maps, we propose a novel reversible watermarking scheme for vector maps based on a multilevel histogram modification. First, a difference histogram is constructed using the correlations of adjacent coordinates, and the histogram is divided into continuous regions and discontinuous regions by combining the characteristics of vector map data. Second, the histogram bins that require modification are determined in the continuous regions through the optimal peak value, and the peak values are chosen from the flanking discontinuous regions in both directions; the watermarks are embedded by adopting the multilevel histogram modification strategy. The watermark extraction process is the reverse of the embedding process, and after completing the watermark extraction, the carrier data can be recovered losslessly. The experimental results show that the proposed algorithm has good invisibility and is completely reversible. Compared with similar algorithms reported previously, it achieves higher watermark embedding capacity under the same embedding distortion with lower complexity, thereby having a higher application value.

show abstract

“…Currently, research on watermarking for 2D vector maps is mainly focused on robust watermarking [1][2][3][4][5][6][7][8][9] for copyright protection or reversible (also referred to as invertible, lossless, or distortion-free) watermarking [10][11][12][13][14] for content recovery. Few works have been done on 2D vector map fragile watermarking [15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

RST Invariant Fragile Watermarking for 2D Vector Map Authentication

Wang¹,

Bian

Zhang³

2015

IJMUE

View full text Add to dashboard Cite

2D vector maps are very important data in geographical information systems (GISs). It is considered to be content for which verification of integrity and authentication are urgently required. Using a marking technique and a rotation, scaling and translation (RST) invariant watermark generation method, we propose a scheme that detects and locates malicious attacks with high accuracy while providing the RST invariance property. In particular, we propose setting a unique mark on each feature, calculating the authentication watermark for each spatial feature group by folding the hash results of the differences of the log-radiuses, and embedding the watermark using a RST invariant watermarking method. While the watermark ensures both the sensitivity to malicious manipulations and the RST invariance property, the mark of each feature provides superior accuracy of tamper localization. Moreover, this algorithm is immune to feature rearrangement and vertex reversing operations. Theoretical analysis and experimental results are provided to demonstrate the effectiveness of our method.

show abstract

High-capacity reversible watermarking scheme of 2D-vector data

Cited by 20 publications

References 14 publications

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

A Reversible Watermarking Scheme for Vector Maps Based on Multilevel Histogram Modification

RST Invariant Fragile Watermarking for 2D Vector Map Authentication

Contact Info

Product

Resources

About