Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. A robust image watermarking using multiresolution analysis of wavelet
Loading...
Thumbnail Image

A robust image watermarking using multiresolution analysis of wavelet

Author(s)
Temi, Chirawat
Choomchuay, Somsak
Lasakul, Attasit
Date Issued
December 1, 2005
Type
Conference Paper
DOI
10.1109/ISCIT.2005.1566932
Abstract
Embedding watermark in the wavelet becomes more attractive to most researchers as it could provide better performance. In this paper present a method of embedding binary visualized image into the host image by modifying coefficients of wavelet domain in LL bands with appropriate strength factor in order to compromise between acceptable imperceptibility level and attacks' resistance. Qualified Significant Wavelet Tree (QSWT) is used in both to select locations where watermark data are to be embedded, and to find locations of watermark in the extraction process. Results show that the proposed method successfully achieves robustness level of various attacks such as image processing, rotation attack etc. © 2005 IEEE.
Citation
Iscit 2005 International Symposium on Communications and Information Technologies 2005 Proceedings, II, 603-606, 2005
Subjects

Data hiding

Digital watermarking

Multiresolution analy...

Qualified significant...

Wavelet decomposition...

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback