-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we propose two algorithms which hide visual patterns into two halftone images such that one can see the hidden pattern directly from the overlaid image of the two generated halftone images. For the first algorithm, the experimental result shows that the generated halftone images have reasonable image quality and good visual quality of the hidden pattern from the overlaid image. To enhance protection of the hidden patterns from any one of generated images, a randomized algorithm is proposed. Finally the experimental result shows the modified algorithm still has clear visual quality of the hidden pattern and quite reasonable image quality.
Genetic and Evolutionary Computing (ICGEC), 2011 Fifth International Conference on; 10/2011
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we develop a watermarking scheme for image authentication and verification. The watermarking scheme for tamper detection of an image is fragile and block-based. Such a scheme has good tamper localization and high tamper detection rate. The security of our scheme depends on a secret key, even though the attacker got the original watermark pattern and watermarking algorithm. The watermark extraction process does not need the original image and original watermark. The proposed scheme provides higher level of security and high performance with low computational complexity. This scheme is secure, fast, and able to detect and localize tampered areas against the well-known vector quantization attack. Experimental results indicate the effectiveness and efficiency of the algorithm.
Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on; 01/2011
-
Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2010, 17-20 October 2010, Taichung, Taiwan; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: A distance-preserving mapping is a one-to-one function f from p-ary vectors of length m to q-ary vectors of length n such that any two distinct p-ary vectors are mapped to two different q-ary vectors with an equal or greater Hamming distance. A special distance-preserving mapping called a distance-increasing mapping is a mapping which increases the distance at least one if the distance of two distinct input strings are not equal to the output length. A constant composition vector is a vector under the restriction that each alphabet symbol occurs a given number of times. In this paper, we propose a distance-increasing mapping from binary vectors to constant composition quaternary vectors. We also give an optimal impossibility result for constructing distance-preserving mapping from binary vectors to constant composition ternary vectors in the so-called swapping model.
Information Theory, 2009. ISIT 2009. IEEE International Symposium on; 08/2009
-
IACR Cryptology ePrint Archive. 01/2009; 2009:138.
-
Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2009), Kyoto, Japan, 12-14 September, 2009, Proceedings; 01/2009
