• 沒有找到結果。

An Image Hiding Scheme Based on Multi-bit-reference Substitution Table Using Dynamic Programming Strategy

N/A
N/A
Protected

Academic year: 2022

Share "An Image Hiding Scheme Based on Multi-bit-reference Substitution Table Using Dynamic Programming Strategy"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: An Image Hiding Scheme Based on Multi-bit-reference Substitution Table Using Dynamic Programming Strategy

作者: Chan, C. S.;Chang, C. C

關鍵詞: Image hiding;least-significant-bit substitution;dynamic programming 日期: 2005-08

上傳時間: 2009-12-17T06:58:33Z 出版者: Asia University

摘要: Simple least-significant-bit (LSB) substitution is the most straightforward way to embed the secret image in the host image. Based on the simple LSB substitution, the method using substitution table is proposed to improve the quality of the stego- image. In this paper, we shall bring up a new method that uses the un-embedded host pixel bits to partition the host pixel into different planes. This way, we can derive the optimal substitution table for each plane. By combining the optimal substitution tables, we can obtain the final result that we call the multi-bit-reference substitution table. After transforming the secret data according multi-bit-reference substitution table, we can embed the transformed secret data in the host image so that the host image will be degraded possibly less. The experimental results show that our method leads to good results.

參考文獻

相關文件

debug 題:請問右邊這份 code 錯在哪( 題目在此).. What

• 我們通常用 nD/mD 來表示一個狀態 O(N^n) ,轉移 O(N^m) 的 dp 演算法. • 在做每題

• 也就是 ”我的dp是n^3”這句話本身不夠表示你的dp演算法,必須 要說“我的dp是個狀態n^2,轉移n”才夠精確. •

[r]

[r]

• 有一個可以耐重 W 的背包,及 N 種物品,每種物品有各自的重量 w[i] 和價值 v[i] ,且數量為 k[i] 個,求在不超過重量限制的情 況下往背包塞盡量多的東西,總價值最大為多少?.

依賴背包問題 and

creted by howard41436 edited by