Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation

Yu-Chi PU; Wei-Chang DU; I-Chang JOU

doi:10.1093/ietisy/e89-d.12.2939

Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation

Yu-Chi PU, Wei-Chang DU, I-Chang JOU

Full Text Views

0

Cite this

Summary :

Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.

Publication: IEICE TRANSACTIONS on Information Vol.E89-D No.12 pp.2939-2949

Publication Date: 2006/12/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e89-d.12.2939

Type of Manuscript: PAPER

Category: Application Information Security

Cite this

Copy

Yu-Chi PU, Wei-Chang DU, I-Chang JOU, "Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation" in IEICE TRANSACTIONS on Information, vol. E89-D, no. 12, pp. 2939-2949, December 2006, doi: 10.1093/ietisy/e89-d.12.2939.
Abstract: Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.12.2939/_p

Copy

@ARTICLE{e89-d_12_2939,
author={Yu-Chi PU, Wei-Chang DU, I-Chang JOU, },
journal={IEICE TRANSACTIONS on Information},
title={Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation},
year={2006},
volume={E89-D},
number={12},
pages={2939-2949},
abstract={Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.},
keywords={},
doi={10.1093/ietisy/e89-d.12.2939},
ISSN={1745-1361},
month={December},}

Copy

TY - JOUR
TI - Perceptually Transparent Polyline Watermarking Based on Normal Multi-Resolution Representation
T2 - IEICE TRANSACTIONS on Information
SP - 2939
EP - 2949
AU - Yu-Chi PU
AU - Wei-Chang DU
AU - I-Chang JOU
PY - 2006
DO - 10.1093/ietisy/e89-d.12.2939
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2006
AB - Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.
ER -