Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation

Pu, Yu-Chi; Du, Weichang; Jou, I-Chang

doi:10.1093/ietisy/e89-d.12.2939

Cited by 2 publications

(5 citation statements)

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

“…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 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

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: Introductionmentioning

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

“…Doncel et al 10 consider multiple polygonal chains sharing common vertices, such as the border of neighboring countries, and discuss how to preserve connectivity after watermarking. In Pu et al 26 and Shao et al, 29 methods are proposed that avoid perturbing certain vertices to preserve the visual appearance of the original data. In order to preserve the perceived shape of watermarked 2D vector data, Shao et al 29 design an embedding method based on polygon simplification employing the Ramer-Douglas-Peucker algorithm.…”

Section: Prior Workmentioning

confidence: 99%

“…In order to preserve the perceived shape of watermarked 2D vector data, Shao et al 29 design an embedding method based on polygon simplification employing the Ramer-Douglas-Peucker algorithm. 11,27 Following a similar idea, Pu et al 26 propose an alternative method based on normalized meshes. 14 Both approaches explicitly avoid perturbing certain vertices to retain the visual appearance of the data set.…”

Section: Prior Workmentioning

confidence: 99%

“…Perceptual models are often formulated in a transform domain such as the discrete cosine transformation 33 (DCT) or discrete wavelet transform 3 (DWT) domain. Watermark embedding is either performed directly in the coordinate domain, 26,29 or in some transform domain: Ohbuchi et al 21 utilize the mesh-spectral domain, Solachidis and Pitas 31 propose the complex discrete Fourier transform (DFT) domain due to its invariance against a number of attacks (translation, rotation, scaling). An advantage of transform-domain approaches is that selection of mid-frequency coefficients for watermarking, guided by a perceptual model, provides a convenient way to embed information in a significant portion of the host data without causing severe, noticeable perturbation.…”

Section: Watermarkingmentioning

confidence: 99%

See 1 more Smart Citation

Topology-Preserving Watermarking of Vector Graphics

Huber

Held

Meerwald

et al. 2014

Int. J. Comput. Geom. Appl.

View full text Add to dashboard Cite

Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing selfintersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.

show abstract

Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation

Cited by 2 publications

References 0 publications

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

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

Topology-Preserving Watermarking of Vector Graphics

Contact Info

Product

Resources

About