A reversible watermark scheme for 2D vector map based on reversible contrast mapping

Peng, Fei; Li, Chen; Long, Min

doi:10.1002/sec.680

Cited by 13 publications

(7 citation statements)

References 19 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%

“…The capacity of this method exceeded 5 bits/vertex with some visible distortions. The methods provided in [23,33] embed watermarks according to a histogram of the coordinates and result in a capacity of approximately 0.8 bits/vertex. Xiao improved the quantization modulation scheme by setting more quantization intervals, which resulted in a capacity of 2 bits/vertex [28].…”

Section: Related Workmentioning

confidence: 99%

“…Digital watermarking is an effective method for copyright identification and usage tracking, which means embedding copyright information into media secretly without degrading data fidelity [3,4]. It has been studied and applied in copyright protection for a variety of multimedia data [5][6][7][8][9][10][11][12], including vector data [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30]. However, in terms of small-scale vector data, both the watermarking capacity and robustness have been the key factors in watermarking algorithm research.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…[29] sorted the horizontal and vertical coordinates separately, and they divided the coordinate axes into several sub-segments, and boundary coordinates were added for each sub-segment, which are removed after the watermark embedding. Peng et al [30] proposed using reversible watermarks with contrast mapping to distinguish the sets that correspond to the coordinate points to which they belong by adopting different embedding methods, but the least-significant bits of the coordinate points of some of the individual sets must be saved.…”

Section: Introductionmentioning

confidence: 99%

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

“…Watermarking approaches obviously have three main constraints that are: robustness, embedding capacity, and watermark imperceptibility. Moreover, the performance of a proposed watermarking scheme depends on the characteristics of the watermark embedding algorithm and recovering protocol .…”

Section: Introductionmentioning

confidence: 99%

Invariant digital image watermarking based on Defragmented Delaunay Triangulation for optimal watermark synchronization

Essaidani¹,

Seddik²,

Braiek³

2016

Security Comm Networks

View full text Add to dashboard Cite

Dramatic technology progress in data manipulation induced several attempts of baleful and illegal processing. In this regard, several protection techniques, including cryptography, steganography, and watermarking have been used to avoid the illegal production and distribution of data online. On the other side, the attacks are still a major problem that limits the effectiveness of watermarking techniques. The geometric attacks involve displacement of pixels. Therefore, they induce synchronization errors between the original and attacked image that complicates the watermark recovery process. So in order to solve the desynchronization problem, we propose to use a robust meshing technique between different geometrical data of the image to correct the geometric distortion. In this work, we propose a novel geometrically invariant digital image watermarking approach based on the geometrical feature of the cover image and the Defragmented Delaunay Triangulation on respecting the three constraints of watermarking approaches (imperceptibility of embedded watermark, embedding capacity, and robustness). The aim idea of this work is to propose a blind, imperceptible, and robust digital image watermarking scheme based on Defragmented Delaunay Tessellation and Weber's law. The defragmented triangulation provides a best synchronization of the embedded data after attacks application. The Weber's law is used to propose an auto-thresholding algorithm to compute the optimal embedding gain factor for each watermark's bit in order to ensure the imperceptibility of the hidden data. Firstly, the invariant features in the host gray scale image are extracted by using the canny edge detector. Then, the Delaunay tessellation of the saved keys points set is generated and defragmented to select the optimal robust triangles for watermark embedding. Simulation results illustrate the imperceptibility of the embedded data and the robustness of the proposed approach against intentional and unintentional geometrical attacks are presented in the finally section.

show abstract

A reversible watermark scheme for 2D vector map based on reversible contrast mapping

Cited by 13 publications

References 19 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

Invariant digital image watermarking based on Defragmented Delaunay Triangulation for optimal watermark synchronization

Contact Info

Product

Resources

About