Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy

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

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6467

題名:	Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy
作者:	Chan, C. S.;Chang, C. C.
關鍵詞:	IMAGE HIDING;LEAST-SIGNIFICANT-BIT SUBSTITUTION;DYNAMIC PROGRAMMING
日期:	2007-03
上傳時間:	2009-12-17 06:58:07 (UTC+0)
出版者:	Asia University
摘要:	In 2003, Chang et al. (Pattern Recognition, 2003, 36(7), 1583-1595) proposed a way to find an optimal one-to-one substitution table using a dynamic programming strategy in image hiding. The present paper introduces a new method which uses the one-to-two substitution table to help with image hiding. First, a square-error matrix with three dimensions was built up. After applying a dynamic programming strategy on the square-error matrix, one can obtain the optimal one-to-two substitution table. According to the experimental results, the new method is capable of offering much better stego-image quality than the LSB substitution method and the one-to-one substitution method.
關聯:	Imaging Science Journal 55(1): 13-22
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
		0Kb	Unknown	488	檢視/開啟
310904400-6467.doc		60Kb	Microsoft Word	242	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.