Digital image watermarking in sparse domain.

Autor:	Deeba, Farah, Dharejo, Fayaz Ali, Zhou, Yuanchun, Memon, Parvez Ahmed, Memon, Hira, Khan, Saeed Ahmed, Larik, Nauman Ali
Předmět:	TRACKING algorithms ORTHOGONAL matching pursuit DATA security DIGITAL images DIGITAL image watermarking RSA algorithm
Zdroj:	Information Security Journal: A Global Perspective; 2022, Vol. 31 Issue 2, p237-250, 14p
Abstrakt:	A watermarking method based on a robust sparse domain is proposed in this paper, which integrates the secret information into the significant sparse elements of the original image. Our algorithm protects the original data by a two-way security process to embed confidential information. First of all, converting the watermark logo into a discrete transform coefficient (DCT) is the protection process. Then, using the dictionary learning method, the transformed coefficient is embedded in the selected effective sparse coefficient in the original image. The embedded logo is extracted from the selected effective sparse coefficient using the sparse orthogonal matching tracking algorithm (OMP) domain. Then, the discrete inverse transformation is performed. To check the algorithm's efficiency, numerous specific attacks are checked. The experimental results show that the algorithm can recover the embedded watermark with precision without losing any information. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.