The maximum amounts of embedded information that is important in practical system design of two watermarking methods based on the parallel combinatorial spread spectrum (PC/SS) scheme are discussed in this paper. One is a private watermarking method proposed in this paper and has a practical strong point to make the quality of the watermarked image to be constant in any images. The other is a public watermarking method that was previously proposed by the authors. Through this study, the minimum number of orthogonal sequences for embedding the required amount of information under the condition that quantization noise is only assumed is found in each watermarking method.
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
Masaaki FUJIYOSHI, Takaaki HASEGAWA, "On the Amount of Embedded Information of Watermarking Methods Based on the Parallel Combinatorial Spread Spectrum Scheme" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 4, pp. 941-948, April 2001, doi: .
Abstract: The maximum amounts of embedded information that is important in practical system design of two watermarking methods based on the parallel combinatorial spread spectrum (PC/SS) scheme are discussed in this paper. One is a private watermarking method proposed in this paper and has a practical strong point to make the quality of the watermarked image to be constant in any images. The other is a public watermarking method that was previously proposed by the authors. Through this study, the minimum number of orthogonal sequences for embedding the required amount of information under the condition that quantization noise is only assumed is found in each watermarking method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_4_941/_p
Copy
@ARTICLE{e84-a_4_941,
author={Masaaki FUJIYOSHI, Takaaki HASEGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Amount of Embedded Information of Watermarking Methods Based on the Parallel Combinatorial Spread Spectrum Scheme},
year={2001},
volume={E84-A},
number={4},
pages={941-948},
abstract={The maximum amounts of embedded information that is important in practical system design of two watermarking methods based on the parallel combinatorial spread spectrum (PC/SS) scheme are discussed in this paper. One is a private watermarking method proposed in this paper and has a practical strong point to make the quality of the watermarked image to be constant in any images. The other is a public watermarking method that was previously proposed by the authors. Through this study, the minimum number of orthogonal sequences for embedding the required amount of information under the condition that quantization noise is only assumed is found in each watermarking method.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On the Amount of Embedded Information of Watermarking Methods Based on the Parallel Combinatorial Spread Spectrum Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 941
EP - 948
AU - Masaaki FUJIYOSHI
AU - Takaaki HASEGAWA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2001
AB - The maximum amounts of embedded information that is important in practical system design of two watermarking methods based on the parallel combinatorial spread spectrum (PC/SS) scheme are discussed in this paper. One is a private watermarking method proposed in this paper and has a practical strong point to make the quality of the watermarked image to be constant in any images. The other is a public watermarking method that was previously proposed by the authors. Through this study, the minimum number of orthogonal sequences for embedding the required amount of information under the condition that quantization noise is only assumed is found in each watermarking method.
ER -