An Image Hiding Scheme by Fiding an Optimal One-to-two Substitution Table Using Dynamic Programming Strategy

ASIAIR > College of Computer Science > Department of Applied Informatics and Multimedia > Journal Article > Item 310904400/9015

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/9015

Title:	An Image Hiding Scheme by Fiding an Optimal One-to-two Substitution Table Using Dynamic Programming Strategy
Authors:	Chin-Chen Chang;Chi-Shiang Chan;Chun-Sen Tseng
Keywords:	IMAGE HIDING;LEAST-SIGNIFICANT-BIT SUBSTITUTION;DYNAMIC PROGRAMMING
Date:	2007-03
Issue Date:	2010-04-21 02:56:01 (UTC+0)
Abstract:	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.
Relation:	Imaging Science Journal 55(1) : 13-22
Appears in Collections:	[Department of Applied Informatics and Multimedia] Journal Article

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	492	View/Open
310904400-9015.doc		37Kb	Microsoft Word	255	View/Open