This paper proposes a high-performance reversible data hiding algorithm based on the block difference histogram of a cover image. If a message is to be embedded into an image, the difference of the block at the maximum point is increased by 1 or left unchanged if the message bit is 1" or 0", respectively. Experimental results show that the average payload capacity of the test images can be up to 1.52 bits per pixel (bpp). Average payload and pure payload capacities for PSNR ^(3) 30 dB can be up to 1.13 bpp and 1.06 bpp, respectively. Moreover, the original cover image can be recovered without any distortion and the implementation of the proposed algorithm is very easy.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this paper, we propose an embedding algorithm, of high visual quality, that can adaptively embed a binary message into an image. The binary message to be embedded is divided into two segments, each of which is then decomposed into n+1 or n types of sub-messages (where n ^(3) 3 enables each pixel to embed a sub-message), respectively, according to the desired embedding capacity. Embedding is done by leaving the pixel value unchanged or changing it into one of its n or n-1 neighboring values according to the type of the sub-message. From the results of this study, each pixel may not embed a fixed number of message bits and the adjustment of the pixel value is minimal, thus the image quality is significantly improved by adaptively decomposing the message into sub-messages and embedding them into the host image.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.