Abstract
This work presents a vicinity reliant intelligent fragile watermarking scheme for depth image-based rendering technique used for three-dimensional television. Depth map of a centre image is implicitly inserted in the block-based discrete cosine transform (DCT) of the same using an aggregate, which also takes into account the presence of its neighbourhood blocks. Based upon the parity of a Boolean operation on the aggregate, parity is modulated which implicitly embeds the watermark. Genetic algorithm is then utilized to select the appropriate frequency bands in the DCT domain to become eligible for watermark embedding based on imperceptibility requirements. Experimental results demonstrate the usefulness of the proposed scheme in terms of its resistance against a set of fragile watermarking attacks and its ability to detect and localize tempering attempts.
Highlights
With the advent of Internet and high-speed connected networks, multimedia applications have protruded extensively in the last decade
The proposed Vicinity reliant fragile watermarking (VRFW) scheme is implemented in Matlab using Intel Core i7 2.4 GHz processor with an 8 GB onboard RAM
The size of each image as well as the corresponding depth map used in experiments are 256 × 256
Summary
With the advent of Internet and high-speed connected networks, multimedia applications have protruded extensively in the last decade. Several schemes have been proposed in literature including Wu and Liu’s scheme [9] of inserting a binary watermark sequence in DCT coefficients in a lookup table, and Wong’s public key scheme [10] These schemes, along with some others [11,12,13] are block-wise independent and are exposed to cover up, transplantation and vector quantization attacks [6,14]. Li et al [17] proposed a scheme that uses a binary feature-map extracted from an underlying image as a watermark This scheme is simple to implement and takes into consideration of many of the challenges in fragile watermarking. The proposed scheme takes into consideration the neighbourhood, or the vicinity, of the embedding location while calculating a secret sum associated with the implicit embedding of the watermark bit It enhances Li’s [17] DCT-based watermarking scheme by selecting an appropriate frequency band using the genetic algorithm (GA).
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call