English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6491/11663
Visitors : 24732764      Online Users : 56
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9984

Title: Finding Optimal Least-Significant-Bit Substitution in Image Hiding by Dynamic Programming Strategy
Authors: Chang, Chin-Chen;Hsiao, Ju-Yuan;Chan, Chi-Shiang
Contributors: 資訊工程系
Keywords: Image hiding;Least-significant-bit substitution;Dynamic programming;Genetic algorithm;Image embedding;Watermarking
Date: 2003-07
Issue Date: 2012-05-02T09:37:59Z
Publisher: Elsevier
Abstract: 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.
Relation: Pattern Recognition, 36(7): 1583-1595
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
index.html0KbHTML471View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


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