An Efficient Probability-based t out of n Secret Image Sharing Scheme

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6346

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6346

题名:	An Efficient Probability-based t out of n Secret Image Sharing Scheme
作者:	Chang, C. C.;Wang, Y. Z.;Chan, C. S.
日期:	2009-03
上传时间:	2009-12-17 06:57:27 (UTC+0)
出版者:	Asia University
摘要:	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.
關聯:	International Journal of Signal Processing, Image Processing and Pattern 2(1):71-78
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	471	检视/开启
310904400-6346.doc		30Kb	Microsoft Word	253	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.