A new technique on progressive secret sharing is presented. The proposed method offers two different approaches on converting a secret image into a set of shared images. The first approach exploits ...the generalized random grids or bitwise level computation, whereas the second approach utilizes the eXclusive-OR (XOR) operation to generate a set of shared images. The proposed method has lossless ability in the recovery process of secret image. This scheme performs well not only for binary image, but it also gives satisfactory result for grayscale and color secret image. As results show that the proposed method yields better results compared to the former existing schemes under visual investigation and objective assessment on the recovered secret image. In addition, the proposed method does not require high computational burden in the shared image generation as well as in the secret image recovery process. Yet, it can be regarded as good candidate for applying the progressive secret sharing with lossless reconstruction constraint.
This paper presents a new technique on (
n
,
n
)-Multiple Secret Sharing (MSS) of color images. In this task,
n
shared images are generated from
n
secret images, while
n
recovered secret images can ...be reconstructed from
n
shared images. The proposed method employs the Chinese Remainder Theorem (CRT) and bitwise eXclusive-OR (XOR) operation for generating a set of shared image from a set of secret images. The proposed method improves the security level of (
n
,
n
)- MSS scheme by developing and utilizing the generalized chaotic image scrambling. This image scrambling effectively overcomes the problem on former existing MSS scheme while the number of secret images is odd number. As documented in experimental section, the proposed method offers a good result on (
n
,
n
)- MSS task. At the same time, the proposed method outperforms the former exising schemes in the MSS field.
ABSTRACT This paper presents a new method on passive copy-move forgery detection by exploiting the effectiveness and usability of Halftoning-based Block Truncation Coding (HBTC) image feature. ...Copy-move forgery detection precisely locates the large size or flat tampered regions of an image. On our method, the tampered input image is firstly divided into several overlapping image blocks to construct the image feature descriptors. Each image block is further divided into several non-overlapping image blocks for processing HBTC. Two image feature descriptors, namely Color Feature (CF) and Bit Pattern Feature (BF) are computed from the HBTC compressed data-stream of each image block. Lexicography sorting rearranges the image feature descriptors in ascending manner for whole image. The similarity between some tampered image regions is measured based on their CF and BF under specific shift frequency threshold. As documented in the experimental results, the proposed method yields a promising result for detecting the tampered or copy-move forgery regions. It has proved that the HBTC is not only suitable for image compression, but it can also be used in the copy-move forgery detection.
This paper presents a simple method for performing (k,n)-Secret Sharing (SS) with fast computation. It aims to reduce the computational time of the former scheme in the shadow generation process. The ...former scheme performs SS with the polynomial function computation by involving the color palette. The color palette transforms noisy-like shadow image into more meaningfull appearance. However, this scheme requires a high computational burden on this transformation process. The proposed method exploits naive image compression to decrease the required bit for representing a secret and cover image. It effectively avoids the color palette usage previously used by the former scheme. The proposed method produces a set of shadow images with a cover image-like appearance. In addition, the secret and cover image can be reconstructed by gathering at least k shadow images. As documented in the Experimental Results section, the proposed method yields a promising result in the (k,n)-SS with reduced computational time compared to that of the former scheme.
This paper reports the effect of hyperchaos permutation on the False-Positive-Free (FPF) Singular Value Decomposition (SVD)-based image watermarking scheme. To further improve the security aspect, ...the watermark image is firstly processed using the hyperchaos permutation before being embedded into the host image. In this scheme, only principal component of watermark image is inserted into the transformed host image to avoid the false positive problem. As reported in the experimental results, the proposed method satisfies the imperceptibility and robustness aspects. At the same time, the proposed method can suffer from the false positive problem which often occurs in the former existing SVD-based image watermarking schemes.
This paper reviews the former existing scheme on <inline-formula> <tex-math notation="LaTeX">(n,n) </tex-math></inline-formula>-multiple secret sharing (MSS) for color images along with its slight ...limitation. This scheme generates a set of <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> shared images from a set of <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> secret images using the Chinese remainder theorem (CRT) and Boolean exclusive-OR (XOR) operation. This scheme works well if the number of secret images <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is even number. However, the former scheme has a slight problem while the number of secret images <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is an odd number. This paper proposes a new technique to overcome this problem by introducing symmetric and transferred masking coefficients to generate a set of shared images. To further improve the security level of the proposed method, a set of secret images is first transformed with hyperchaotic scrambling method before generating shared images. The security of the proposed <inline-formula> <tex-math notation="LaTeX">(n,n) </tex-math></inline-formula>-MSS can also be increased by merging a shared color image into 2-D matrix representation. As documented in the experimental results, the proposed method offers a promising result on <inline-formula> <tex-math notation="LaTeX">(n,n) </tex-math></inline-formula>-MSS scheme regardless of the number of secret images <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is odd or even number. In addition, the proposed method outperforms the former existing <inline-formula> <tex-math notation="LaTeX">(n,n) </tex-math></inline-formula>-MSS schemes in terms of quantitative measurements.
This paper presents a simple technique for estimating the noise levels in noisy images corrupted by additive white Gaussian noise. The proposed technique modifies the existing ...singular-valuedecomposition- based noise level estimation method. The proposed method calculates the sum of trailing singular values to infer noise levels. Particle swarm optimization and its variants can be used compute the optimal scalar value for the proposed noise level estimation method over a set of training images. As discussed in the experimental section, the proposed method outperforms existing schemes on noise level estimation tasks. Additionally, the estimated noise obtained from the proposed method can be used to improve the quality of denoised images. KCI Citation Count: 0
This paper proposes a new simple image encryption technique using the Beta chaotic map for performing the confusion and diffusion of input plain image. This image encryption is further applied to the ...multiple secret sharing (MSS). The former existing scheme in MSS employs the Chinese remainder theorem (CRT) and eXclusive- OR (XOR) operations to convert the secret image to become a set of shared images. The former scheme yields a good result while the number of secret images is even. However, it has slight limitation while the number of secret images is odd. This paper aims to overcome this problem by utilizing the proposed image encryption along with three new MSS approaches: 1) incorporating an additional random images; 2) performing <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula> image encryption; and 3) using two different masking coefficients. As documented in the experimental section, the proposed method performs well in the MSS task. It solves the problem in former scheme on dealing with odd number of secret images. In addition, the proposed method is superior compared with the other competing schemes. The proposed image encryption also improves the security level in the MSS system.
This study reviews the superiority and limitations of the Singular Value Decomposition (SVD)-based video watermarking scheme. First applies key frame selection to the video sequence to obtain an ...appropriate video frame for the purpose of watermark embedding in this paper. The Fibonacci-Lucas image transformation scrambles the grayscale watermark image before the embedding process. The former scheme satisfies the imperceptibility and robustness aspects. However, it can suffer from the False-Positive-Problem (FPP) in which a counterfeit watermark image can be easily reconstructed by a malicious attacker. This study presents a new technique for overcoming the FPP of the aforementioned scheme. The proposed method embeds the principal components of the watermark image rather than the Singular Value Matrix (SVM) into the host video. As results, the proposed methods yield promising results in terms of imperceptibility as well as robustness. At the same time, it solves the FPP. A theoretical analysis of embedded watermark information is also provided in this work. The theoretical analysis meets the experimental-based results in the SVD-based video watermarking scheme.
PDF
