Home
Author Guide
Editor Guide
Reviewer Guide
Published Issues
Special Issue
Introduction
Special Issues List
Sections and Topics
Sections
Topics
journal menu
Aims and Scope
Editorial Board
Indexing Service
Article Processing Charge
Open Access
Copyright and Licensing
Preservation and Repository Policy
Publication Ethics
Editorial Process
Contact Us
General Information
ISSN:
1798-2340 (Online)
Frequency:
Monthly
DOI:
10.12720/jait
Indexing:
ESCI (Web of Science)
,
Scopus
,
CNKI
,
etc
.
Acceptance Rate:
19%
APC:
500 USD
Average Days to Accept:
135 days
Journal Metrics:
Impact Factor 2022: 1.0
3.1
2022
CiteScore
49th percentile
Powered by
Editor-in-Chief
Prof. Kin C. Yow
University of Regina, Saskatchewan, Canada
I'm delighted to serve as the Editor-in-Chief of
Journal of Advances in Information Technology
.
JAIT
is intended to reflect new directions of research and report latest advances in information technology. I will do my best to increase the prestige of the journal.
What's New
2024-03-28
Vol. 15, No. 3 has been published online!
2024-02-26
The papers published in Vol. 15, Nos. 1&2 have been registered with Crossref.
2024-02-26
Vol. 15, No. 2 has been published online!
Home
>
Published Issues
>
2020
>
Volume 11, No. 3, August 2020
>
Study on Improved Cooperative Spread Spectrum Based Robust Blind Image Watermarking
Tuan Nguyen-Thanh and Thuong Le-Tien
Ho Chi Minh City University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam
Vietnam National University Ho Chi Minh City (VNU-HCM), Linh Trung Ward, Thu Duc District, Ho Chi Minh City, Vietnam
Abstract
—Spread Spectrum (SS) is one of the most common techniques used in watermarking systems due to its security, robustness, imperceptibility and information extracting without the host data. However, this technique suffers the interference between the host data and the watermark, which degrades significantly the performance of watermarking system. In the other hand, most existing spread spectrum-based image watermarking methods are non-blind and implemented for single channel images with one information bit. Therefore, this paper presents a new cooperative spread spectrum based blind watermarking technique, which can apply to not only single channel images but also multi-channel images or set of images. In this technique, the same information is embedded into multiple channels and a global linear cooperative decision is used to exploit the collaboration among the local correlation detectors. Moreover, improved method is also mentioned to eliminate the interference between the host images and the watermarks. Especially, the Karhunen Loeve Transform (KLT) is exploited to enhance the performance of the proposed cooperative watermarking system. Furthermore, extensive methods for multi-bit watermarking are also discussed. Based on theoretical analysis, the optimal solutions of the watermark, watermark strength coefficients, weighting coefficients, threshold, and probability error are established. Experimental results are simulated with ideal channel (without attack) as well as additive Gaussian channel to verify theoretical analysis.
Index Terms
—robust blind image watermarking, spread spectrum, correlation, Karhunen Loeve Transform
Cite: Tuan Nguyen-Thanh and Thuong Le-Tien, "Study on Improved Cooperative Spread Spectrum Based Robust Blind Image Watermarking," Journal of Advances in Information Technology, Vol. 11, No. 3, pp. 119-127, August 2020. doi: 10.12720/jait.11.3.119-127
Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License (
CC BY-NC-ND 4.0
), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.
2-SC044_Vietnam
PREVIOUS PAPER
Quantifying the Natural Sentiment Strength of Polar Term Senses Using Semantic Gloss Information and Degree Adverbs
NEXT PAPER
Effects of Noisy Multiobjective Test Functions Applied to Evolutionary Optimization Algorithms