Embedding digital watermark in one-dimensional signals using wavelet and Schur decomposition Online publication date: Sat, 14-Oct-2017
by Arashdeep Kaur; Malay Kishore Dutta; K.M. Soni; Nidhi Taneja
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 9, No. 4, 2017
Abstract: An efficient, robust and secure audio watermarking algorithm which can hide large number of watermarking bits without perceptually affecting the quality of the audio signal is presented in this paper. The proposed algorithm has been designed using Schur decomposition of wavelet coefficients to achieve the optimal balance between conflicting design parameters of audio watermarking. Schur decomposition makes the proposed method significantly robust against challenging signal processing attacks and discrete wavelet transform provides a good opportunity for the accommodating very high watermarking payload without affecting the perceptual quality. The choice of these two domains complements each other in addressing the contradictory design requirements of watermarking. Experimental results indicate that this algorithm is highly perceptually transparent and have an excellent subjective audible quality at 480 bps embedding capacity. This algorithm has shown very good robustness to the challenging synchronisation attacks like compression and various signal processing attacks at very high payload without affecting the audible quality of the signal. The computation time of the proposed algorithm is also found to be very less making it suitable for real time applications.
Online publication date: Sat, 14-Oct-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org