z-logo
open-access-imgOpen Access
Digital image watermarking using partial pivoting lower and upper triangular decomposition into the wavelet domain
Author(s) -
Muhammad Nazeer,
Bibi Nargis
Publication year - 2015
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2014.0395
Subject(s) - digital watermarking , triangular matrix , singular value decomposition , watermark , permutation matrix , mathematics , robustness (evolution) , algorithm , image (mathematics) , digital image , lu decomposition , wavelet , cover (algebra) , computer science , image processing , matrix decomposition , artificial intelligence , pure mathematics , engineering , gene , mechanical engineering , biochemistry , chemistry , invertible matrix , circulant matrix , eigenvalues and eigenvectors , physics , quantum mechanics
A digital image watermarking algorithm using partial pivoting lower and upper triangular (PPLU) decomposition is proposed. In this method, a digital watermark image is factorised into lower triangular, upper triangular and permutation matrices by PPLU decomposition. The permutation matrix is used as the valid key matrix for authentication of the rightful ownership of the watermark image. The product of the lower and upper triangular matrices is embedded into particular sub‐bands of a cover image that is decomposed by wavelet transform using the singular value decomposition. The weightage‐based differential evolution algorithm is used to achieve the possible scaling factor for obtaining the maximum possible robustness against various image processing operations and pirate attacks. The authors experiments show that the proposed algorithm is highly reliable with better imperceptibility of the embedded image and computationally efficient compared with recently existed methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here