A Semi-Fragile Reversible Watermarking for 2D CAD Engineering Graphics with Accurate Tampering Localization

A Semi-Fragile Reversible Watermarking for 2D CAD Engineering Graphics with Accurate Tampering Localization

Min Long, Yan Liu, Fei Peng
Copyright: © 2015 |Pages: 18
DOI: 10.4018/ijdcf.2015070101
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

A semi-fragile reversible watermarking algorithm for 2D CAD engineering graphics with accurate tampering localization is proposed. Firstly, all vertices in the 2D CAD engineering graphics are extracted and partitioned into groups. After that, the relative distance of these vertices are calculated, and the assigned group number is used as watermark. Finally, the watermark is embedded into the factor of relative distance by using an improved difference expansion. Experimental results and analysis show that the proposed algorithm can obtain a large capacity, good invisibility, and robust against translation, rotation, and uniform scaling. At the same time, it can detect malicious attacks such as entity modification, addition and deletion, and can locate the tampering areas with a high precision. As for the watermarked 2D CAD engineering graphics passing authentication, the original 2D CAD engineering graphics can be completely recovered. It has great potential in the application of integrity protection and content authentication of 2D CAD engineering graphics.
Article Preview
Top

Currently, some works have been done to reversible watermarking and fragile watermarking for vector graphics.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 3 Issues (2022)
Volume 13: 6 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing