This paper presents a novel spatial data hiding scheme based on the Least Significant Bit insertion. The bit-plane decomposition is obtained by using the (p,r)-Fibonacci sequences. This decomposition depends on two parameters, p and r. Those values increase the security of the whole system: without their knowledge it is not possible to perform the same decomposition used in the embedding process and to extract the embedded information. Experimental results show the effectiveness of the proposed method.
A novel spatial data hiding scheme based on generalized Fibonacci sequences
Battisti F.;
2008
Abstract
This paper presents a novel spatial data hiding scheme based on the Least Significant Bit insertion. The bit-plane decomposition is obtained by using the (p,r)-Fibonacci sequences. This decomposition depends on two parameters, p and r. Those values increase the security of the whole system: without their knowledge it is not possible to perform the same decomposition used in the embedding process and to extract the embedded information. Experimental results show the effectiveness of the proposed method.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
