• 沒有找到結果。

Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy"

Copied!
1
0
0

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

立即下載 ( 1 頁 )

全文

(1)

題名: Scheme for hiding images by finding optimal one-to-two substitution table using dynamic programming strategy

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

關鍵詞: IMAGE HIDING;LEAST-SIGNIFICANT-BIT SUBSTITUTION;DYNAMIC PROGRAMMING

日期: 2007-03

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

摘要: In 2003, Chang et al. (Pattern Recognition, 2003, 36(7), 1583-1595) proposed a way to find an optimal one-to-one substitution table using a dynamic programming strategy in image hiding. The present paper introduces a new method which uses the one-to-two substitution table to help with image hiding. First, a square-error matrix with three dimensions was built up. After applying a dynamic programming strategy on the square-error matrix, one can obtain the optimal one-to- two substitution table. According to the experimental results, the new method is capable of offering much better stego-image quality than the LSB substitution method and the one-to-one substitution method.

(2)

參考文獻

立即下載 ( DOC - 1 頁 - 60.50 KB )

相關文件

(1)A CLASS OF INTERIOR PROXIMAL-LIKE ALGORITHMS FOR CONVEX SECOND-ORDER CONE PROGRAMMING∗ SHAOHUA PAN† AND JEIN-SHAN CHEN‡ Abstract

In this paper, we extended the entropy-like proximal algo- rithm proposed by Eggermont [12] for convex programming subject to nonnegative constraints and proposed a class of

Department of Physics and Astronomy, Rutgers Unit'ersity, Piscataway, NJ 08855-0849, USA

One of the technical results of this paper is an identifi- cation of the matrix model couplings ti(/x) corresponding to the Liouville theory coupled to a

甄試類(群)組別：二技組

According to Shelly, what is one of the benefits of using CIT Phone Company service?. (A) The company does not charge

Iterative techniques in matrix algebra

One way to select a procedure to accelerate convergence is to choose a method whose associated matrix has minimal spectral

1Introduction NonsingularityconditionsforFBsystemofreformulatingnonlinearsecond-orderconeprogramming

Specifically, for a locally optimal solution to the nonlinear second-order cone programming (SOCP), under Robinson’s constraint qualification, we establish the equivalence among

本培訓課程目標本培訓課程目標

January/Kindergarten%20space.html.. More than one way: An approach to teaching that supports playful learning. Project Zero: A Pedagogy of Play working paper .Retrieved

假如我們有點記性的話…

 Definition: A problem exhibits  optimal substructure if an ..

Dynamic Progr amming I

 Definition: A problem exhibits optimal subst ructure if an optimal solution to the proble m contains within it optimal solutions to su bproblems..  怎麼尋找 optimal