Advancement on Damage-Less Watermark Extraction Using Non-Linear Feature Extraction Scheme Trained on Frequency Domain

Advancement on Damage-Less Watermark Extraction Using Non-Linear Feature Extraction Scheme Trained on Frequency Domain

Kensuke Naoe, Yoshiyasu Takefuji
DOI: 10.4018/978-1-61350-135-1.ch004
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The proposed method contributes to secure image digital watermarking for content identification without damaging or losing any detailed data of visual images. The features of our proposed method employ an application to authenticate multimedia, similarity comparison, verification of image integrity and copyright protection of multimedia contents.
Chapter Preview
Top

Introduction

In this chapter, a new model of digital watermarking is proposed, which do not embed any data into the image but are able to extract meaningful data from the image. This is done by processing the coefficients of the selected feature sub blocks to the trained neural network. This model trains artificial neural network to assign predefined secret code and use the artificial neural network weight and the coordinates of the selected feature sub blocks as a key to extract the predefined code. This means that it would not damage the content at all.

Our method consists of three layers for information hiding and retrieval method. First, the proposed method of key generation is to extract certain type of bit patterns in the forms of visual features out of visual objects or data as training data set for machine learning of watermark signal. Second, the proposed method of watermark extraction is processed by presenting visual features of the target visual image into extraction key or herein is a classifier generated in advance by the training approach of machine learning technology. Third, the training approach is to generate the extraction key which is conditioned to generate watermark signal patterns only if proper visual features are presented to the classifier. In our proposed method, this classifier which is generated by the machine learning process is used as watermark extraction key. The discussed watermark extraction key and feature extraction key identify the related or associated hidden bit patterns which is the watermark signal values for proper digital watermark embedding and extraction procedure as shown in Figure 1 and 2.

Figure 1.

Overview of key generation procedure in the proposed method

978-1-61350-135-1.ch004.f01
Figure 2.

Overview of watermark extraction procedure in the proposed method

978-1-61350-135-1.ch004.f02

The proposed method is to hide or relate bit patterns of visual information as training data set for machine learning and to generate classifiers as watermark extraction key. These hidden bit patterns are prepared in advance to the training of classifiers which will eventually generates the associated visual information as watermark signals. This trained classifier acts as watermark extraction key. The feature extraction keys generate the feature values necessary for generation of watermark extraction keys. The feature extraction keys contain visual information including feature coordinates and regions of frequency coefficients. Machine learning also generates classifiers as watermark extraction keys. The discussed watermark extraction key and feature extraction key identify the secure and unique hidden bit patterns for proper digital watermarking procedure. The proposed method is to contribute to secure information hiding and retrieval without losing any detailed data of visual information.

These hidden patterns can be used as the feature values which illustrate the characteristic of the image. Hash functions are frequently called message digest functions. Their purpose is to extract short binary string from a large digital message. A key feature of traditional cryptographic hash algorithms is sensitiveness to the manipulation of the original message. Even with the alteration of one bit of the original content will result in the alteration of the binary string generated by hash functions. However, multimedia content such as digital static visual images undergo various manipulations like compression and graphical alteration by filters and etc. A robust information hiding method should instead take into account the changes in the visual domain and produce information based on the images' visual appearance. Such method would facilitate comparisons and searches in large image databases. Therefore, our proposed method can employ for content protection, content authentication, image identification and image similarity comparison.

Complete Chapter List

Search this Book:
Reset