Earticle

초록

영어

Noar and Shamir presented the concept of visual cryptography. Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed his probability-based visual secret sharing scheme, where the concept of probability is employed to pick out pixels from the black or white sets. In this paper, we shall propose a new scheme that is a modified version of Yang’s scheme. Our experimental results show that we can obtain better recovered image quality with high contrast.

목차

Abstract
 1. Introduction
 2. Related Works
 3. The Proposed Method
  3.1. Constructed method
  3.2. Stacked method
 4. Experimental results
 5. Conclusions
 References

저자

• Chi-Chen Chang [ Department of Information Engineering and Computer Science, Feng Chia University,Taichung, Taiwan ]
• Yu-Zheng Wang [ Department of Computer Science and Information Engineering, National Chung Cheng University,Chiayi, Taiwan ]
• Chi-Shiang Chan [ Department of Information Science and Applications, Asia University, Wufeng, Taiwan ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605