Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181
DOI: 10.1109/icassp.1998.678150
|View full text |Cite
|
Sign up to set email alerts
|

The impact of channel coding on the performance of spatial watermarking for copyright protection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
18
0
2

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(20 citation statements)
references
References 6 publications
0
18
0
2
Order By: Relevance
“…The bit string is then encrypted using a key-dependent primitive (based on the secret key k) and mapped from {0; 1} to {−1; 1}, resulting into a codeword c = (c 1 ; : : : ; c K ) T , with c i ∈ {−1; 1}, i = 1; : : : ; K, followed by a spreading over a rectangular or square block of size t 1 × t 2 with some density The message is encoded using ECC with soft decoding [23] such as Turbo codes [3] or the Low Density Parity Check Codes (LDPC) [20], that belongs to the iterative coding codes, and which we tested at rates r ecc = 1 2 or r ecc = 1 3 ; the lower is the rate, the more robust to distortions is the codeword. Such ECC encoding achieves signiÿcantly superior performance than binary modulation or any other codes based on hard decoding, like the BoseChaudhuri-Hocquenghem (BCH) cyclic codes which are often used in the watermarking community.…”
Section: Message Encodingmentioning
confidence: 99%
See 1 more Smart Citation
“…The bit string is then encrypted using a key-dependent primitive (based on the secret key k) and mapped from {0; 1} to {−1; 1}, resulting into a codeword c = (c 1 ; : : : ; c K ) T , with c i ∈ {−1; 1}, i = 1; : : : ; K, followed by a spreading over a rectangular or square block of size t 1 × t 2 with some density The message is encoded using ECC with soft decoding [23] such as Turbo codes [3] or the Low Density Parity Check Codes (LDPC) [20], that belongs to the iterative coding codes, and which we tested at rates r ecc = 1 2 or r ecc = 1 3 ; the lower is the rate, the more robust to distortions is the codeword. Such ECC encoding achieves signiÿcantly superior performance than binary modulation or any other codes based on hard decoding, like the BoseChaudhuri-Hocquenghem (BCH) cyclic codes which are often used in the watermarking community.…”
Section: Message Encodingmentioning
confidence: 99%
“…based on the central limit theorem (CLT), since most researchers assume that the observed vector r can be accurately approximated as the output of an additive Gaussian channel noise [23,30] for a large sample space. We use the Bahl-Cocke-Jelinek-Raviv (BCJR) decoder [3] for the Turbo codes.…”
Section: Robust Message Decodingmentioning
confidence: 99%
“…Error correction techniques of channel coding such as the BCH (Bose-Chaudhuri-Hockquenghem) codes can be used to improve the robustness of spatial-domain watermarks [2]. A number of the related coding methods were studied in the late 1990's [3].…”
Section: Introductionmentioning
confidence: 99%
“…The PS method reduces effects of signal distortions on the embedded watermark by averaging pixel values, which is a kind of low pass filtering. On the other hand, error correcting techniques in channel coding such as the BoseChaudhuri-Hockquenghem (BCH) codes [4] can be used to improve robustness of spatial-domain watermarks [5]. A number of the related coding methods were studied in the late 1990's [2].…”
Section: Introductionmentioning
confidence: 99%