English  |  正體中文  |  简体中文  |  Items with full text/Total items : 43312/67235
Visitors : 2052201      Online Users : 8
RC Version 5.0 © Powered By DSPACE, MIT. Enhanced by NTU/NCHU Library IR team.

Please use this identifier to cite or link to this item: http://nchuir.lib.nchu.edu.tw/handle/309270000/153925

標題: 里得米勒碼應用於資料藏匿技術之探討
Study of Data Hiding Techniques With Reed Muller Codes
作者: 張建斌
Chang, Jian-Bin
Contributors: 陳後守
通訊工程研究所
關鍵字: 里得米勒碼;線性區塊碼;資料藏匿
Reed Muller Codes;Linear Block Codes;Data Hiding
日期: 2013
Issue Date: 2013-11-19 12:31:57 (UTC+8)
Publisher: 通訊工程研究所
摘要: 本篇論文是利用線性區塊碼:里得米勒碼(Reed Muller codes)運用在二元資料藏匿上,其主要原理是在一組具有相同徵狀的向量集合裡找到一個最接近載體的向量碼,目的就是為了達到高藏匿效率以及低失真度。
我們將利用疊代和圖形架構的方式來修正里得解碼演算法,使之能在解碼複雜度和藏匿效能之間取得平衡。而由實驗結果發現,雖然在複雜度上略微提升,但藉此能達到提高藏匿效能的目的。
In this study, we use Linear Block Codes: Reed Muller codes for binary data hiding algorithm. The main principle is to find a vector which has the same syndrome as the select combination of collection which is the closest to the host. Finally, the purpose is to achieve high embedding efficiency and low distortion .
Then we make use of iteration and factor graph to modify Reed decoding algo- rithm. It can make a balance between decoding complexity and embedding efficiency. According to the experimental results, although the complexity will increase slightly , however, the goal of increase embedding efficiency can be achieved by using the methods.
Appears in Collections:[依資料類型分類] 碩博士論文

Files in This Item:

File SizeFormat
index.html0KbHTML134View/Open


 


學術資源

著作權聲明

本網站為收錄中興大學學術著作及學術產出,已積極向著作權人取得全文授權,並盡力防止侵害著作權人之權益。如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員,將盡速為您處理。

本網站之數位內容為國立中興大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用。

聯絡網站維護人員:wyhuang@nchu.edu.tw,04-22840290 # 412。

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