Limits...
Improved Secret Image Sharing Scheme in Embedding Capacity without Underflow and Overflow.

Pang L, Miao D, Li H, Wang Q - ScientificWorldJournal (2015)

Bottom Line: Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less.Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations.Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.

View Article: PubMed Central - PubMed

Affiliation: School of Life Science and Technology, Xidian University, Xi'an 710071, China ; Department of Computer Science, Wayne State University, Detroit, MI 48202, USA.

ABSTRACT
Computational secret image sharing (CSIS) is an effective way to protect a secret image during its transmission and storage, and thus it has attracted lots of attentions since its appearance. Nowadays, it has become a hot topic for researchers to improve the embedding capacity and eliminate the underflow and overflow situations, which is embarrassing and difficult to deal with. The scheme, which has the highest embedding capacity among the existing schemes, has the underflow and overflow problems. Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less. Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations. Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.

No MeSH data available.


Related in: MedlinePlus

Cover images.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4553325&req=5

fig6: Cover images.

Mentions: In this section, we shall use experiments to evaluate the performance of the proposed scheme, including the embedding capacity and the visual quality and then compare it with Lin and Chan's scheme [14]. Five experiments have been done. The first experiment in Section 4.2.1 is used to illustrate the embedding capacity of the proposed scheme and the second one in Section 4.2.2 is used to compare Lin and Chan's scheme [14] with the proposed scheme in embedding capacity, because Lin and Chan's scheme [14] has the largest embedding capacity among the existing schemes. The third experiment in Section 4.2.3 is used to illustrate the visual quality of the proposed scheme and the fourth one in Section 4.2.4 is used to compare Lin and Chan's scheme [14] with the proposed scheme in visual quality. The last one is shown in Section 4.2.3, and it displays the visual quality of the proposed scheme for binary covers that could not be used in Lin and Chan's scheme [14]. The detailed images used in five experiments are shown in Table 5 and Figures 5 and 6.


Improved Secret Image Sharing Scheme in Embedding Capacity without Underflow and Overflow.

Pang L, Miao D, Li H, Wang Q - ScientificWorldJournal (2015)

Cover images.
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4553325&req=5

fig6: Cover images.
Mentions: In this section, we shall use experiments to evaluate the performance of the proposed scheme, including the embedding capacity and the visual quality and then compare it with Lin and Chan's scheme [14]. Five experiments have been done. The first experiment in Section 4.2.1 is used to illustrate the embedding capacity of the proposed scheme and the second one in Section 4.2.2 is used to compare Lin and Chan's scheme [14] with the proposed scheme in embedding capacity, because Lin and Chan's scheme [14] has the largest embedding capacity among the existing schemes. The third experiment in Section 4.2.3 is used to illustrate the visual quality of the proposed scheme and the fourth one in Section 4.2.4 is used to compare Lin and Chan's scheme [14] with the proposed scheme in visual quality. The last one is shown in Section 4.2.3, and it displays the visual quality of the proposed scheme for binary covers that could not be used in Lin and Chan's scheme [14]. The detailed images used in five experiments are shown in Table 5 and Figures 5 and 6.

Bottom Line: Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less.Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations.Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.

View Article: PubMed Central - PubMed

Affiliation: School of Life Science and Technology, Xidian University, Xi'an 710071, China ; Department of Computer Science, Wayne State University, Detroit, MI 48202, USA.

ABSTRACT
Computational secret image sharing (CSIS) is an effective way to protect a secret image during its transmission and storage, and thus it has attracted lots of attentions since its appearance. Nowadays, it has become a hot topic for researchers to improve the embedding capacity and eliminate the underflow and overflow situations, which is embarrassing and difficult to deal with. The scheme, which has the highest embedding capacity among the existing schemes, has the underflow and overflow problems. Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less. Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations. Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.

No MeSH data available.


Related in: MedlinePlus