Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Approaching the capacity limit in image watermarking: a perspective on coding techniques for data hiding applications
Autore:
Perez-Gonzalez, F; Hernandez, JR; Balado, F;
Indirizzi:
Univ Vigo, ETSI Telecom, Dept Tecnol Comunicac, Vigo, Spain Univ Vigo Vigo Spain , ETSI Telecom, Dept Tecnol Comunicac, Vigo, Spain
Titolo Testata:
SIGNAL PROCESSING
fascicolo: 6, volume: 81, anno: 2001,
pagine: 1215 - 1238
SICI:
0165-1684(200106)81:6<1215:ATCLII>2.0.ZU;2-Y
Fonte:
ISI
Lingua:
ENG
Soggetto:
PERFORMANCE ANALYSIS; STILL IMAGES; MODULATION; CODES;
Keywords:
digital communications; digital watermarking; capacity; channel coding; turbo codes;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
29
Recensione:
Indirizzi per estratti:
Indirizzo: Perez-Gonzalez, F Univ Vigo, ETSI Telecom, Dept Tecnol Comunicac, Vigo, Spain Univ Vigo Vigo Spain pt Tecnol Comunicac, Vigo, Spain
Citazione:
F. Perez-Gonzalez et al., "Approaching the capacity limit in image watermarking: a perspective on coding techniques for data hiding applications", SIGNAL PROC, 81(6), 2001, pp. 1215-1238

Abstract

An overview of channel coding techniques for data hiding in still images is presented. Use of codes is helpful in reducing the bit error probability of the decoded hidden information, thus increasing the reliability of the system. First, the data hiding problem is statistically modeled for the spatial and DCT domains. Then, the benefits brought about by channel diversity are discussed and quantified. We show that it is possible to improve on this basic scheme by employing block, convolutional and orthogonal codes, again giving analytical results. It is shown that the use of superimposed pulses does not produce any benefit when applying them to data hiding. The possibility of using codes at the 'sample level' (that is, without repeating every codeword symbol) is introduced and its potential analyzed for both hard-and soft-decision decoding. Concatenated and turbo coding are also discussed as ways of approaching the hidden channel capacity limit for the sample level case. Finally, experimental results supporting our theoretical approach are presented for some cases of interest. (C) 2001 Elsevier Science B.V. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 31/05/20 alle ore 09:19:59