Efficient watermark detection by using the longest common substring technique
Large scale of watermarking methods is available in the literature. These methods differ in visibility, capacity, and robustness. In watermarking, the robustness against attacks is the most challenging issue. The desynchronization attacks are the most serious problems facing the watermarking process...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2011-07-01
|
Series: | Egyptian Informatics Journal |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1110866511000193 |
id |
doaj-e4559abb916244cca686c4299fec5d2d |
---|---|
record_format |
Article |
spelling |
doaj-e4559abb916244cca686c4299fec5d2d2021-07-02T03:07:48ZengElsevierEgyptian Informatics Journal1110-86652011-07-0112211512310.1016/j.eij.2011.05.001Efficient watermark detection by using the longest common substring techniqueTaha M. MohamedHesham N. ElmahdyHoda M. OnsiLarge scale of watermarking methods is available in the literature. These methods differ in visibility, capacity, and robustness. In watermarking, the robustness against attacks is the most challenging issue. The desynchronization attacks are the most serious problems facing the watermarking process. The traditional correlation methods fail in watermark detection. Until today there is no widely used algorithm for solving the desynchronization attacks. In this paper, we will introduce a new algorithm for solving the watermark desynchronization attacks. The watermark embedding and detection models are introduced. So, these models are related to the attacker model by presenting four attacking scenarios. We show the effect of each attack scenario on bit rate, signal distortion, and robustness. We conclude that, the attacker could not distort a big part of the watermark. So, we suggest using a probabilistic embedding model combined with the longest common substring technique. This combination is efficient in solving the desynchronization attacks. Results show that, the proposed algorithm is powerful against the attacking scenarios. Moreover, the watermark is still be detected even if only 5% of the watermark is recovered.http://www.sciencedirect.com/science/article/pii/S1110866511000193H.264 watermarkingVLC watermarkingWatermark robustnessWatermark desynchronizationLongest common substring |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Taha M. Mohamed Hesham N. Elmahdy Hoda M. Onsi |
spellingShingle |
Taha M. Mohamed Hesham N. Elmahdy Hoda M. Onsi Efficient watermark detection by using the longest common substring technique Egyptian Informatics Journal H.264 watermarking VLC watermarking Watermark robustness Watermark desynchronization Longest common substring |
author_facet |
Taha M. Mohamed Hesham N. Elmahdy Hoda M. Onsi |
author_sort |
Taha M. Mohamed |
title |
Efficient watermark detection by using the longest common substring technique |
title_short |
Efficient watermark detection by using the longest common substring technique |
title_full |
Efficient watermark detection by using the longest common substring technique |
title_fullStr |
Efficient watermark detection by using the longest common substring technique |
title_full_unstemmed |
Efficient watermark detection by using the longest common substring technique |
title_sort |
efficient watermark detection by using the longest common substring technique |
publisher |
Elsevier |
series |
Egyptian Informatics Journal |
issn |
1110-8665 |
publishDate |
2011-07-01 |
description |
Large scale of watermarking methods is available in the literature. These methods differ in visibility, capacity, and robustness. In watermarking, the robustness against attacks is the most challenging issue. The desynchronization attacks are the most serious problems facing the watermarking process. The traditional correlation methods fail in watermark detection. Until today there is no widely used algorithm for solving the desynchronization attacks. In this paper, we will introduce a new algorithm for solving the watermark desynchronization attacks. The watermark embedding and detection models are introduced. So, these models are related to the attacker model by presenting four attacking scenarios. We show the effect of each attack scenario on bit rate, signal distortion, and robustness. We conclude that, the attacker could not distort a big part of the watermark. So, we suggest using a probabilistic embedding model combined with the longest common substring technique. This combination is efficient in solving the desynchronization attacks. Results show that, the proposed algorithm is powerful against the attacking scenarios. Moreover, the watermark is still be detected even if only 5% of the watermark is recovered. |
topic |
H.264 watermarking VLC watermarking Watermark robustness Watermark desynchronization Longest common substring |
url |
http://www.sciencedirect.com/science/article/pii/S1110866511000193 |
work_keys_str_mv |
AT tahammohamed efficientwatermarkdetectionbyusingthelongestcommonsubstringtechnique AT heshamnelmahdy efficientwatermarkdetectionbyusingthelongestcommonsubstringtechnique AT hodamonsi efficientwatermarkdetectionbyusingthelongestcommonsubstringtechnique |
_version_ |
1721342243859595264 |