• 沒有找到結果。

Lossless Data Hiding for Color Images Based on Block Truncation Coding

N/A
N/A
Protected

Academic year: 2022

Share "Lossless Data Hiding for Color Images Based on Block Truncation Coding"

Copied!
1
0
0

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

全文

(1)

題名: Lossless Data Hiding for Color Images Based on Block Truncation Coding 作者: Chang, C. C.;Lin, C. Y.;Fan, Y. H.

關鍵詞: Reversible data hiding;Steganography;Block truncation coding (BTC);Genetic algorithm (GA)

日期: 2008-07

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

摘要: In this paper, we present a novel, reversible steganographic method, which can reconstruct an original image effectively after extracting the embedded

(2)

secret data. The proposed reversible hiding method aims at BTC (block truncation coding)-compressed color images. Conventionally, each block of a color image compressed by BTC requires three bitmaps and three pairs of quantization levels for reconstruction. In order to improve the compression rate, a genetic algorithm (GA) is applied to find an approximate optimal common bitmap to replace the original three. The secret data then are embedded in the common bitmap and the quantization levels of each block use the properties of side matching and the order of these quantization levels to achieve reversibility. The experimental results demonstrate that the proposed method is practical for BTC-compressed color images and can embed more than three bits in each BTC-encoded block on average.

參考文獻

相關文件

Al atoms are larger than N atoms because as you trace the path between N and Al on the periodic table, you move down a column (atomic size increases) and then to the left across

You are given the wavelength and total energy of a light pulse and asked to find the number of photons it

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

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

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

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

massive gravity to Ho ř ava-Lifshitz Stochastic quantization and the discrete quantization scheme used for dimer model and crystal melting. are

volume suppressed mass: (TeV) 2 /M P ∼ 10 −4 eV → mm range can be experimentally tested for any number of extra dimensions - Light U(1) gauge bosons: no derivative couplings. =>