• 沒有找到結果。

Image Hiding Scheme Using Modulus Function and Optimal Substitution Table

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "Image Hiding Scheme Using Modulus Function and Optimal Substitution Table"

Copied!
1
0
0

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

立即下載 ( 1 頁 )

全文

(1)

題名: Image Hiding Scheme Using Modulus Function and Optimal Substitution Table

作者: Chin-Chen Chang;Chi-Shiang Chan

關鍵詞: image hiding;the least-significant;bit substitution technique;modulus function

日期: 2006-06

上傳時間: 2010-04-21T02:55:56Z

摘要: The simple least-significant-bit (LSB) substitution technique is the easiest way to embed secret data in the host image. To avoid image degradation of the simple LSB substitution technique, Wang et al.

proposed a method using the substitution table to process image hiding.

Later, Thien and Lin employed the modulus function to solve the same problem. In this paper, the proposed scheme combines the modulus function and the optimal substitution table to improve the quality of the stego-image. Experimental results show that our method can achieve better quality of the stego-image than Thien and Lin’s method does.

參考文獻

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

相關文件

2 Overview and Contributions of the Paper

Wang, Solving pseudomonotone variational inequalities and pseudocon- vex optimization problems using the projection neural network, IEEE Transactions on Neural Networks 17

3 Properties of the function Ψ

Then, we tested the influence of θ for the rate of convergence of Algorithm 4.1, by using this algorithm with α = 15 and four different θ to solve a test ex- ample generated as

3 Smoothness of the function ψ

Numerical results are reported for some convex second-order cone programs (SOCPs) by solving the unconstrained minimization reformulation of the KKT optimality conditions,

3 Properties of the Merit Function

Particularly, combining the numerical results of the two papers, we may obtain such a conclusion that the merit function method based on ϕ p has a better a global convergence and

3 Properties of the New NCP-Function

Then, it is easy to see that there are 9 problems for which the iterative numbers of the algorithm using ψ α,θ,p in the case of θ = 1 and p = 3 are less than the one of the

3 Differentiability of the function ψ

By exploiting the Cartesian P -properties for a nonlinear transformation, we show that the class of regularized merit functions provides a global error bound for the solution of

3 Generalized Differentiation of the Projection Operator onto the Circular Cone

In this paper we establish, by using the obtained second-order calculations and the recent results of [23], complete characterizations of full and tilt stability for locally

Variational analysis of circular cone programs

In this paper we establish, by using the obtained second-order calculations and the recent results of [25], complete characterizations of full and tilt stability for locally