Chi-Shiang Chan

• Asia University

This paper proposes a data hiding technology by applying interpolation in Extended Local Binary Pattern (ELBP). The proposed method uses interpolation to predict pixels in blocks so as to reduce image distortion when compressing images using Extended Local Binary Pattern (ELBP). After that, LSB substitution is used to embed the secret data into the...

Reversible data hiding in encrypted images can simultaneously enhance the image privacy and preserve the message security for the purpose of covert communication and cloud data management. The algorithm extends the multi-MSB prediction and Huffman coding to propose the first reversible data hiding in encrypted HDR images in the Radiance RGBE format...

The study proposed a vertex-based authentication algorithm based on spatial subdivision. A binary space partitioning tree was employed to subdivide the bounding volume of the input model into voxels. Each vertex could then be encoded into a series of binary digits, denoted as its authentication code, by traversing the constructed tree. Finally, the...

In 2006, Mielikaine's method partitioned pixels into pixel pairs. Two secret bits are embedded to a pixel pair through modifying only one pixel. After that, Chan's method linked bits of two continuous pixels by using XOR operator to further reduce the pixel modifications. To generalize Chan's method, in this paper, the concept of linking multiple p...

In 2007, Chan and Chang proposed an image authentication method using the Hamming code technique. The parity check bits were produced from pixels by using the Hamming code technique, and the produced bits were embedded in other pixels. When recovering, the method had to predict the value of the most-significant bit of each tampered pixel first. The...

In this paper, we propose a lossless data hiding algorithm for grayscale images. Specifically, our technique is based on the cluster-based difference expansion transform. The main scenario behind our technique is that we use a recursive cluster construction technique to divide the input image into several clusters. In the data embedding process, a...

Verifiability is essential for a secret sharing approach which allows the involved participants to detect cheaters during the secret retrieval process. In this article, we propose a verifiable secret image sharing scheme that can not only resist dishonest participants but can also satisfy the requirements of loss less and camouflage. The new approa...

Object contour detection plays an important role in image processing. Many edge and object contour detectors have been proposed, such as, Canny edge detector, ACM, and level set methods. However, those detection methods often cannot provide the fully edge and object contour perfectly. In the ACM and level set methods, the initial contour of object...

In this paper, a method is proposed to protect a secret image by applying (t, n) threshold scheme. The proposed method first divides the pixels in a four-pixel block into two groups. The first group contains the pixels whose one bit is used to embed authentication data, and the second group consists of the other pixels. One bit of each pixel in the...

The essence of invertible image sharing approaches is that the revealed content of the secret image must be lossless and the distorted stego images must be able to be reverted to the original cover image. In order to achieve these purposes, we first transform the secret pixels into the m-ary notational system and then calculate the information data...

In this paper, we propose a hybrid data hiding method to embed three secret bits to four cover pixels. In the proposed method, a Hamming code word consists of three parity check bits whose values are identical to three secret bits and four data bits whose values are derived by performing XOR Function on four cover pixels. In order to keep the Hammi...

In this paper, we propose a method to hide secret data in parity check bits. In the data embedding phase, the method first takes 4 bits from the cover data and 3 bits from the secret data. The 3-bit secret data are inserted into appropriate positions that represent the parity bits of the 4-bit cover data to form a code word. The Matrix Coding is th...

In this paper, we propose an information hiding scheme to embed secret information into the compression code of an index table. First, the codewords neighboring the current processed index along with their closest codewords form a state codebook. Two indices of the state codebook are reserved as indicators. Once the current processed index satisfie...

The significant essential of secret image sharing approaches is that the revealed content of the secret image must be lossless. Moreover, the distorted stego images can be reverted to the original cover image. In order to achieve these purposes, we first transform the secret pixels into the m-ary notational system. Then, the information data used t...

Noar and Shamir presented the concept of visual cryptography. Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed hisprobabilit...

The proposedmethod in this paper is based on the LSB matching function ofMielikainen for Steganography. However, there is a significant change with respect to Mielikainen's method in the use of the LSB matching function to compute secret bits. Melikainen extracts secret bits in pixel pairs: the first one is the LSB of the first pixel in a pixel pai...

In 2006, Mielikainen proposed LSB matching revisited to achieve image hiding. This method is able to embed two secret bits into a pair of cover pixels by adding or subtracting one from either of the pixel values of the cover pixels. In this paper we apply a dynamic programming strategy to LSB matching revisited, so as to further reduce the number o...

In this survey, we first describe the purposes for image hiding. They are Steganography, Image Watermarking and Image Authentication. Classified by hiding methods, image hiding can be divided into pixel-based image hiding, frequency-based image hiding and VQ-based image hiding. In the aspect of pixel-based image hiding, we describe three representa...

Image authentication has come through a history of several years. However, up to the present time, most mainstream image authentication schemes are still unable to detect burst bit errors. Moreover, the capability of recovering tampered pixels in detail (complex) areas has not been very satisfactory either. In this paper, we offer to combine the Ha...

In this paper, we shall propose an image-hiding scheme to embed color secret images into their compression codes. The color host image is compressed by using the CSMVQ algorithm. Meanwhile, the color secret image is embedded during the production of the compression code. To get this job done, we must have the power to partition the state palette to...

In this paper, we shall propose a new method that modifies the AC coefficients of the image blocks suffering from blocking effects so as to improve the image quality. The AC coefficients are modified in accordance with the information provided by the neighboring blocks. Our new method employs an artificial neural network to help make clear the rela...

In 2002, Tung et al. introduced the so-called intellectual Chinese phonetic symbol input system for the placement of Chinese phonetic symbols on mobile phones keyboard. In order to come to good placements, Thung et al. and Chang et al. have proposed their finding algorithms. In this paper, we shall also present a new method we have developed by usi...

In this paper, we shall propose a method to hide a halftone secret image into two other camouflaged halftone images. In our method, we adjust the gray-level image pixel value to fit the pixel values of the secret image and two camouflaged images. Then, we use the halftone technique to transform the secret image into a secret halftone image. After t...

In this paper, we shall propose a novel image-hiding scheme. Our new scheme classifies the host image pixels into two groups of pixels according to the pixel values. For each group of pixels, the corresponding secret pixel values go through an optimal substitution process and are transformed into other pixel values by following the dynamic programm...

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, we proposed an image sharing method adopting (t, n) threshold scheme. The secret image goes through Vector Quantization (VQ) scheme and permutes the locations of indices to obtain permuted indexed secret image. We select t indices to form a (t-1)-degree polynomial by taking t indices as its coefficients. Then, the values of blocks’ i...

In this paper, we shall propose a method to invert halftone images. We shall use a modified look-up table to reconstruct gray level images from halftone images. In the modified look-up table training phase, we shall use a sliding window to get halftone patterns and their corresponding gray-level lists. The modified look-up table can be obtained by...

The medical images have an important characteristic that the pixel-to-pixel correlation is very close. In order to preserve this characteristic, we propose a lossless medical image compression method in this paper. Our method builds the modified S-tree structure to make each block contain similar pixels. Therefore, our method can reduce the needed...

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 parti...

A new image hiding scheme is proposed that can embed color secret images into color host images. The secret image to be embedded is first color quantized using a palette previously sorted by the principal component analysis technique to generate the indexed color image. Then the concept of pixel difference is employed to process both the host image...

The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaust...

In this paper, we shall propose a new method for the copyright protection of digital im- ages. To embed the watermark, our new method partitions the original image into blocks and uses the PCA function to project these blocks onto a linear subspace. There is a watermark table, which is computed from projection points, kept in our new method. When e...

We propose a lossless image compression method, in which we compress an image by saving the differences between the encoding pixels and their adjacent pixels. To deal with a pixel, we refer to not only its up pixel but also its left pixel and replace the value of the pixel itself with the value of difference. The experimental results show that the...

In this paper, we shall propose a color image retrieval method. Among the methods of color image retrieval, the histogram technique only captures the global properties so that it cannot effectively characterize an image. To overcome this drawback, we propose a scheme to capture local properties so that it can do retrieval more accurately. In our me...