Loading…
Computationally efficient joint imperceptible image watermarking and JPEG compression: a green computing approach
This paper presents a computationally efficient joint imperceptible image watermarking and joint photographic experts group (JPEG) compression scheme. In recent times, the transmission and storage of digital documents/information over the unsecured channel are enormous concerns and nearly all of the...
Saved in:
Published in: | Multimedia tools and applications 2018-07, Vol.77 (13), p.16447-16459 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper presents a computationally efficient joint imperceptible image watermarking and joint photographic experts group (JPEG) compression scheme. In recent times, the transmission and storage of digital documents/information over the unsecured channel are enormous concerns and nearly all of the digital documents are compressed before they are stored or transmitted to save the bandwidth requirements. There are many similar computational operations performed during watermarking and compression which lead to computational redundancy and time delay. This demands development of joint watermarking and compression scheme for various multimedia contents. In this paper, we propose a technique for image watermarking during JPEG compression to address the optimal trade-off between major performance parameters including embedding and compression rates, robustness and embedding alterations against different known signal processing attacks. The performance of the proposed technique is extensively evaluated in the form of peak signal to noise ratio (PSNR), correlation, compression ratio and execution time for different discrete cosine transform (DCT) blocks and watermark sizes. Embedding is done on DCT coefficients using additive watermarking. |
---|---|
ISSN: | 1380-7501 1573-7721 |
DOI: | 10.1007/s11042-017-5214-8 |