Robust LSB Watermarking Optimized for Local Structural Similarity

سال انتشار: 1390
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,333

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICEE19_058

تاریخ نمایه سازی: 14 مرداد 1391

چکیده مقاله:

Growth of the Internet and networked multimedia systems has emphasized the need for copyright protection of the media. Media can be images, audio clips, videos and etc. Digital watermarking is today extensively used for many applications such as authentication of ownership or identification of illegal copies. Digital watermark is an invisible or maybe visible structure added to the original media (known as asset). Images are considered as communication channels when they are subject to a watermark embedding procedure so in the case of embedding a digital watermark in an image, the capacity of the channel should be considered. There is a trade-off between imperceptibility, robustness and capacity for embedding a watermark in an asset. In the case of image watermarks, it is reasonable that the watermarking algorithm should depend on the content and structure of the image. Conventionally, mean squared error (MSE) has been used as a common distortion measure to assess the quality of the images. Newly developed quality metrics proposed some distortion measures that are based on human visual system (HVS). These metrics show that MSE is not based on HVS and has a lack of accuracy when dealing with perceptually important signals such as images and videos. SSIM or structural similarity is a state of the art HVS based image quality criterion that has recently been of much interest. In this paper we propose a robust least significant bit (LSB) watermarking scheme which is optimized for structural similarity. The watermark is embedded into a host image through an adaptive algorithm. Embedding will continue in each block of the host image until a certain level of threshold in the structural similarity is met. Various attacks examined on the embedding approach and simulation results revealed the fact that the watermarked sequence can be extracted with an acceptable accuracy after all attacks. In comparison to the original algorithm, the proposed method increases the capacity while the imperceptibility and robustness remain fix.

کلیدواژه ها:

digital watermarking ، least significant bit watermarking ، structural similarity

نویسندگان

Amin Banitalebi Dehkordi

School of Electrical and Computer Engineering University of Tehran, Tehran ۱۴۳۹۵-۵۱۵, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • F. Y. Duan and I King, " A Short Summary ...
  • _ _ 1325-1330, Kuala Lumpur, Malaysia, 2008. ...
  • Conference (HKICC'99), Hong Kong, 1999. ...
  • _ _ _ _ _ _ of Electronic Product Reliability ...
  • _ _ _ Automation and system Engineering, pp. 88-91, 2009. ...
  • _ _ _ Production of Cross Media Content for M ...
  • I. _ _ _ _ _ Morgan Kaufmann, 2008. ...
  • M. Barni and F. Bartolini, Watermarking Systems Engineering, New York: ...
  • E. Salahi, M. S. Moin and A Salahi, _ New ...
  • digital image, " Security and Watermarking of Multimedt Contents, Procedeeings ...
  • Z. Wang and A. C. Bovik, _ squared Error: love ...
  • Z. Wang, A. C. Bovik, H. R. Sheikh, and E. ...
  • A. Banitalebi, S. Nader-Es fahani and A. Nasir Avanaki, :A ...
  • Processing, MVIP, Iran, Oct. 2010. ...
  • A. Banitalebi, R. Parseh, S. Nader-Esfahan i and F. Lahouti, ...
  • IST, Tehran, Iran, Dec. 2010. ...
  • نمایش کامل مراجع