Full-Index-Embedding Patchwork Algorithm for Audio Watermarking

被引:29
作者
Kang, Hyunho [1 ]
Yamaguchi, Koutarou [2 ]
Kurkoski, Brian [2 ]
Yamaguchi, Kazuhiko [2 ]
Kobayashi, Kingo [2 ]
机构
[1] Chuo Univ, Ctr Res & Dev Initiat, Tokyo 1128551, Japan
[2] Univ Electrocommun, Chofu, Tokyo 1828585, Japan
关键词
audio watermarking; patchwork; DWPT (discrete wavelet packet transform); psychoacoustic model;
D O I
10.1093/ietisy/e91-d.11.2731
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2731 / 2734
页数:4
相关论文
共 8 条
[1]  
Arnold M, 2000, 2000 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, PROCEEDINGS VOLS I-III, P1013, DOI 10.1109/ICME.2000.871531
[2]   Techniques for data hiding [J].
Bender, W ;
Gruhl, D ;
Morimoto, N ;
Lu, A .
IBM SYSTEMS JOURNAL, 1996, 35 (3-4) :313-336
[3]   Digital watermarks for audio signals [J].
Boney, L ;
Tewfik, AH ;
Hamdy, KN .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS, 1996, :473-480
[4]  
Gruhl D., 1996, Information Hiding. First International Workshop Proceedings, P295
[5]  
ISO/IEC, 1993, 111723 ISOIEC
[6]  
*ITU R, 1990, BS5623 ITUR
[7]   Wavelet packet filterbanks for low time delay audio coding [J].
Philippe, P ;
de Saint-Martin, FM ;
Lever, M .
IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 1999, 7 (03) :310-322
[8]   Modified patchwork algorithm: A novel audio watermarking scheme [J].
Yeo, IK ;
Kim, HJ .
IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 2003, 11 (04) :381-386