A Fast Decoding Algorithm for Data Hiding with Plus-Minus One or Two

• Main Authors: Cheng-Hsiu Chung, 鍾正修
• Other Authors: Hou-Shou Chen
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/54335761803544997072

碩士 === 國立中興大學 === 電機工程學系所 === 100 === In steganoraphy, we embed some secret messages into cover images. Embedding rate and embedding distortion are two important issues in data hiding schemes. Zhang proposes a triple-layered method for data hiding combining matrix embedding and wet paper code. Zhang modified the image pixels by plus-minus one or two to make embedding rate-distortion function approach the theoretical limit. However Zhang''s method can cause high decoding complexity when the code''s length becomes larger. In this thesis, we use a fast sub-optimal decoding algorithm called LIAE (Linear Independent Approximation Embedding) decoding algorithm. We use LIAE algorithm to solve Zhang''s method for the high complexity problem. The experimental results showed that image''s distortion increase slightly, and we can efficiently decrease the decoding complexity and embed data quickly.