Scalable, Adaptive and Blind Watermarking Approach for Color Images, Robust against Progressive Transmission

Message:
Abstract:
An adaptive, scalable, completely blind and robust wavelet-based watermarking approach for color images is proposed. The proposed approach enables scalable watermark detection and provides robustness against progressive wavelet image compression. The binary watermark is divided to three slices and a multiresolution decomposition of each watermark slice is inserted into the selected coefficients of one component image (e.g. red, green and blue component images), adaptively that affect the high activity regions of the image. The watermark insertion is started from the lowest frequency subband of the decomposed component image and each decomposed watermark slice subband is inserted into its counterpart subband of the decomposed component image. In the lowest frequency subband, coefficients with maximum local variance and in the higher frequency subbands, coefficients with maximum magnitude are selected. The watermarked test images are transparent according to the human vision system characteristics and do not show any perceptual degradation. The experimental results very efficiently prove the robustness of the approach against progressive wavelet image coding even at very low bit rates. The watermark extraction process is completely blind and multiple spatial resolutions of the watermark are progressively detectable from the compressed watermarked image. This approach is a suitable candidate for providing efficient authentication for progressive image transmission applications especially over heterogeneous networks, such as the Internet.An adaptive, scalable, completely blind and robust wavelet-based watermarking approach for color images is proposed. The proposed approach enables scalable watermark detection and provides robustness against progressive wavelet image compression. The binary watermark is divided to three slices and a multiresolution decomposition of each watermark slice is inserted into the selected coefficients of one component image (e.g. red, green and blue component images), adaptively that affect the high activity regions of the image. The watermark insertion is started from the lowest frequency subband of the decomposed component image and each decomposed watermark slice subband is inserted into its counterpart subband of the decomposed component image. In the lowest frequency subband, coefficients with maximum local variance and in the higher frequency subbands, coefficients with maximum magnitude are selected. The watermarked test images are transparent according to the human vision system characteristics and do not show any perceptual degradation. The experimental results very efficiently prove the robustness of the approach against progressive wavelet image coding even at very low bit rates. The watermark extraction process is completely blind and multiple spatial resolutions of the watermark are progressively detectable from the compressed watermarked image. This approach is a suitable candidate for providing efficient authentication for progressive image transmission applications especially over heterogeneous networks, such as the Internet.
Language:
English
Published:
Majlesi Journal of Multimedia Processing, Volume:4 Issue: 1, Mar 2015
Page:
9
magiran.com/p1412629  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!