Computer Science > Multimedia
[Submitted on 14 Dec 2010]
Title:Digital watermarking : An approach based on Hilbert transform
View PDFAbstract:Most of the well known algorithms for watermarking of digital images involve transformation of the image data to Fourier or singular vector space. In this paper, we introduce watermarking in Hilbert transform domain for digital media. Generally, if the image is a matrix of order $m$ by $n$, then the transformed space is also an image of the same order. However, with Hilbert transforms, the transformed space is of order $2m$ by $2n$. This allows for more latitude in storing the watermark in the host image. Based on this idea, we propose an algorithm for embedding and extracting watermark in a host image and analytically obtain a parameter related to this procedure. Using extensive simulations, we show that the algorithm performs well even if the host image is corrupted by various attacks.
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.