National Changhua University of Education Institutional Repository : Item 987654321/9984
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 24929145      在线人数 : 82
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

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

题名: Finding Optimal Least-Significant-Bit Substitution in Image Hiding by Dynamic Programming Strategy
作者: Chang, Chin-Chen;Hsiao, Ju-Yuan;Chan, Chi-Shiang
贡献者: 資訊工程系
关键词: Image hiding;Least-significant-bit substitution;Dynamic programming;Genetic algorithm;Image embedding;Watermarking
日期: 2003-07
上传时间: 2012-05-02T09:37:59Z
出版者: Elsevier
摘要: The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search ''approximate'' optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.
關聯: Pattern Recognition, 36(7): 1583-1595
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
index.html0KbHTML486检视/开启


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

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈