For the digital watermarking patchwork algorithm originally given by Bender et al., this paper proposes two improvements applicable to audio watermarking. First, the watermark embedding strength is psychoacoustically adapted, using the Bark frequency scale. Second, whereas previous approaches leave the samples that do not correspond to the data untouched, in this paper, these are modified to reduce the probability of misdetection, a method called full index embedding. In simulations, the proposed combination of these two proposed methods has higher resistance to a variety of attacks than prior algorithms.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hyunho KANG, Koutarou YAMAGUCHI, Brian KURKOSKI, Kazuhiko YAMAGUCHI, Kingo KOBAYASHI, "Full-Index-Embedding Patchwork Algorithm for Audio Watermarking" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 11, pp. 2731-2734, November 2008, doi: 10.1093/ietisy/e91-d.11.2731.
Abstract: For the digital watermarking patchwork algorithm originally given by Bender et al., this paper proposes two improvements applicable to audio watermarking. First, the watermark embedding strength is psychoacoustically adapted, using the Bark frequency scale. Second, whereas previous approaches leave the samples that do not correspond to the data untouched, in this paper, these are modified to reduce the probability of misdetection, a method called full index embedding. In simulations, the proposed combination of these two proposed methods has higher resistance to a variety of attacks than prior algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.11.2731/_p
Copy
@ARTICLE{e91-d_11_2731,
author={Hyunho KANG, Koutarou YAMAGUCHI, Brian KURKOSKI, Kazuhiko YAMAGUCHI, Kingo KOBAYASHI, },
journal={IEICE TRANSACTIONS on Information},
title={Full-Index-Embedding Patchwork Algorithm for Audio Watermarking},
year={2008},
volume={E91-D},
number={11},
pages={2731-2734},
abstract={For the digital watermarking patchwork algorithm originally given by Bender et al., this paper proposes two improvements applicable to audio watermarking. First, the watermark embedding strength is psychoacoustically adapted, using the Bark frequency scale. Second, whereas previous approaches leave the samples that do not correspond to the data untouched, in this paper, these are modified to reduce the probability of misdetection, a method called full index embedding. In simulations, the proposed combination of these two proposed methods has higher resistance to a variety of attacks than prior algorithms.},
keywords={},
doi={10.1093/ietisy/e91-d.11.2731},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Full-Index-Embedding Patchwork Algorithm for Audio Watermarking
T2 - IEICE TRANSACTIONS on Information
SP - 2731
EP - 2734
AU - Hyunho KANG
AU - Koutarou YAMAGUCHI
AU - Brian KURKOSKI
AU - Kazuhiko YAMAGUCHI
AU - Kingo KOBAYASHI
PY - 2008
DO - 10.1093/ietisy/e91-d.11.2731
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2008
AB - For the digital watermarking patchwork algorithm originally given by Bender et al., this paper proposes two improvements applicable to audio watermarking. First, the watermark embedding strength is psychoacoustically adapted, using the Bark frequency scale. Second, whereas previous approaches leave the samples that do not correspond to the data untouched, in this paper, these are modified to reduce the probability of misdetection, a method called full index embedding. In simulations, the proposed combination of these two proposed methods has higher resistance to a variety of attacks than prior algorithms.
ER -