Damage-less robust watermark extraction using non-linear feature extraction scheme trained on frequency domain

نویسندگان

  • KENSUKE NAOE
  • YOSHIYASU TAKEFUJI
چکیده

In this paper we propose a new information hiding and extracting method without embedding any information to a target content using non-linear feature extraction trained on frequency domain. Our system can detect a hidden bit code from the content by processing coefficients of the selected feature block of frequency domain. For the generation of the keys which is needed for extracting a bit code from a content, is done by a supervised learning of the set of values in the selected feature block with the teacher signal value. The teacher signal value is the bit code that you want to relate to the content. The connection weight which was processed by the supervised learning will be used as the key for extracting the bit code that you related to the content. With our proposed method, we were able to introduce a watermark scheme with no damage to a target content because there are no information added to the target content, and this characteristic is effective when you don’t want the target content to be damaged at all. Key-Words: damage-less embedding, non-linear feature extraction, supervised learning on DCT domain, robust watermark, feature selection on frequency domain

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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

In this chapter, we propose a new information hiding and extraction scheme for the application in digital watermarking, which does not embed any data to target content, by using non-linear feature extraction scheme trained on frequency domain. This is done by processing the selected coefficients from the selected feature sub-blocks as an input vector to the trained neural network and observing ...

متن کامل

Damageless Watermark Extraction Using Nonlinear Feature Extraction Scheme Trained on Frequency Domain

IntroductIon In this chapter, we present a new model of digital watermark that does not embed any data into the content, but is able to extract meaningful data from the content. This is done by processing the coefficients of the selected feature subblocks to the trained neural network. This model trains a neural AbstrAct In this chapter, we propose a new information hiding and extracting method...

متن کامل

Robust multiplicative video watermarking using statistical modeling

The present paper is intended to present a robust multiplicative video watermarking scheme. In this regard, the video signal is segmented into 3-D blocks like cubes, and then, the 3-D wavelet transform is applied to each block. The low frequency components of the wavelet coefficients are then used for data embedding to make the process robust against both malicious and unintentional attacks. Th...

متن کامل

On watermarking in frequency domain

A wavelet-based image watermarking scheme is proposed, based on insertion of ‘logo’ image as watermark in mid-frequency domain. This new approach provides flexibility in determining the pixel to be watermarked and increases the data hiding capacity. It is easy to implement watermark embedding algorithm as well as the corresponding detection algorithm. The watermarking algorithm is tested under ...

متن کامل

Robust Colour Image Watermarking Scheme Based on Feature Points and Image Normalization in Dct Domain

Geometric attacks can desynchronize the location of the watermark and hence cause incorrect watermark detection. This paper presents a robust colour image watermarking scheme based on visually significant feature points and image normalization technique. The feature points are used as synchronization marks between watermark embedding and detection. The watermark is embedded into the non overlap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006