scispace - formally typeset
Search or ask a question

Showing papers by "Jeng-Shyang Pan published in 2007"


Journal ArticleDOI
TL;DR: An innovative watermarking scheme based on progressive transmission with genetic algorithms (GAs) is proposed, which is directly applicable to scalable coding of multimedia, such as MPEG-4 scalable video coding.
Abstract: An innovative watermarking scheme based on progressive transmission with genetic algorithms (GAs) is proposed. We implement the watermarking embedding and extraction systems in the transform domain, and apply the JPEG spectral selection mode for scalable transmission of the watermarked image. By employing a GA with a proper fitness function into the watermarking system, both the watermark imperceptibility and watermark robustness requirements are considered and optimized. The number of embedded bits, or the watermark capacity, is much larger than that in other existing algorithms in the literature. Also, the watermark capacity in the proposed algorithm lies within the theoretical limit. In addition, the embedded watermark can be partly extracted at the receiver side even when the watermarked image is being transmitted. Simulation results show both the robustness and the effectiveness of progressive transmission under different attacking schemes and different bandwidth variations. The proposed scheme is directly applicable to scalable coding of multimedia, such as MPEG-4 scalable video coding.

57 citations


Book
27 Jun 2007
TL;DR: This book presents the latest research in the area of multimedia data hiding paradigms including steganography, secret sharing and watermarking and includes practical applications of intelligent multimedia signal processing and data hiding systems.
Abstract: This book presents the latest research in the area of multimedia data hiding paradigms. The book is divided into four parts and an appendix. The first part introduces multimedia signal processing and information hiding techniques. It includes multimedia representation, need for multimedia, digital watermarking fundamentals and requirements of watermarking. The second part describes the recent advances in multimedia signal processing. The third part presents information hiding techniques including steganography, secret sharing and watermarking. The final part of this book includes practical applications of intelligent multimedia signal processing and data hiding systems. Appendix includes source codes and/or executables related to the topics in some chapters. Interested readers are invited to use these programs.

49 citations


Journal ArticleDOI
TL;DR: In this paper, a vector quantization (VQ) system with watermarking ability is presented, which modifies the VQ indices to carry watermark bits, and a genetic codebook partition (GCP) procedure is employed to find a better way to split the codebook.

47 citations


Proceedings ArticleDOI
05 Sep 2007
TL;DR: Experimental results indicate that the new combined model, bacterial-GA foraging, performs much better performance than applying any of these two algorithms singly.
Abstract: In this paper, we proposed a novel optimization model, which combines bacterial foraging with genetic algorithm. Though these two well-known optimization algorithms have their own good points, they also have their own drawbacks respectively. In our work, a combined evolutional model, bacterial-GA foraging, is proposed. Via applying this new model, experimental results indicate that the new combined model performs much better performance than applying any of these two algorithms singly.

43 citations


Proceedings ArticleDOI
12 Nov 2007
TL;DR: A novel reversible data hiding scheme based on an integer transform that exploits the correlations among four pixels in a quad and introduces the companding technique into the embedding process so as to further increase hiding capacity.
Abstract: A novel reversible data hiding scheme based on an integer transform is presented in this paper. The invertible integer transform exploits the correlations among four pixels in a quad. Data embedding is carried out by expanding the differences between one pixel and each of its three neighboring pixels. However, the high hiding capacity can not be achieved only by difference expansion, so the companding technique is introduced into the embedding process so as to further increase hiding capacity. A series of experiments are conducted to verify the feasibility and effectiveness of the proposed approach.

42 citations


Journal ArticleDOI
TL;DR: A new watermarking scheme having the ability of sharing secret with multi-users is proposed, which splits the original watermark into two shares and embeds one share into the cover image to increase the security.

40 citations


Proceedings ArticleDOI
26 Nov 2007
TL;DR: The optimization technology of genetic algorithm is applied to the new adaptive cluster validity index, which is called the gene index (GI), and results show the proposed algorithm can give higher performance and accurately estimate the original cluster number of real datasets compared with the current cluster validity indices.
Abstract: The partitioning or clustering method is an important research branch in data mining area, and it partitions the dataset into an arbitrary number k of clusters according to the correlation attribute of all elements of the dataset. Most datasets have the original clusters number, which is estimated with cluster validity index. But most current cluster validity index methods give the error estimation for most real datasets. In order to solve this problem, this paper applies the optimization technology of genetic algorithm to the new adaptive cluster validity index, which is called the gene index (GI). The algorithm applies genetic algorithm to adjust the weight value of the valuation function of adaptive cluster validity index to train an optimal cluster validity index. The algorithm is tested with many real datasets, and results show the proposed algorithm can give higher performance and accurately estimate the original cluster number of real datasets compared with the current cluster validity index methods.

31 citations


Book ChapterDOI
03 Jun 2007
TL;DR: The experimental results suggest that the proposed common subfaces approach provides a better representation of individual common feature and achieves a higher recognition rate in the face recognition from a single image per person compared with the traditional methods.
Abstract: In this paper, we propose a face recognition method from a single image per person, called the common subfaces, to solve the "one sample per person" problem. Firstly the single image per person is divided into multiple sub-images, which are regarded as the training samples for feature extraction. Then we propose a novel formulation of common vector analysis from the space isomorphic mapping view for feature extraction. In the procedure of recognition, the common vector of the subfaces from the test face image is derived with the similar procedure to the common vector, which is then compared with the common vector of each class to predict the class label of query face. The experimental results suggest that the proposed common subfaces approach provides a better representation of individual common feature and achieves a higher recognition rate in the face recognition from a single image per person compared with the traditional methods.

22 citations


Journal ArticleDOI
TL;DR: This paper proposes a reversible data hiding method for error diffused halftone images that employs statistics feature of pixel block patterns to embed data, and utilizes the HVS characteristics to reduce the introduced visual distortion.
Abstract: This paper proposes a reversible data hiding method for error diffused halftone images. It employs statistics feature of pixel block patterns to embed data, and utilizes the HVS characteristics to reduce the introduced visual distortion. The watermarked halftone image can be perfectly recovered if it is intact, only a secret key is required. The method is suitable for the applications where the content accuracy of the original halftone image must be guaranteed, and it is easily extended to the field of halftone image authentication.

21 citations


Journal Article
TL;DR: A novel matrix norm based Gaussian kernel is created which views images as matrices for facial feature extraction, which is the basic kernel for the data-dependent kernel.
Abstract: In this paper, we propose a novel kernel named Adaptive Data-dependent Matrix Norm Based Gaussian Kernel (ADM-Gaussian kernel) for facial feature extrac- tion. As a popular facial feature extraction method for face recognition, the current kernel method endures some problems. Firstly, the face image must be transformed to the vector, which leads to the large storage requirements and the large computational effort, and sec- ondly since the different geometrical structures lead to the different class discrimination of the data in the feature space, the performance of the kernel method is influenced when kernels are inappropriately selected. In order to solve these problems, firstly we create a novel matrix norm based Gaussian kernel which views images as matrices for facial feature extraction, which is the basic kernel for the data-dependent kernel. Secondly we apply a novel maximum margin criterion to seek the adaptive expansion coefficients of the data-dependent kernel, which leads to the largest class discrimination of the data in the feature space. Experiments on ORL and Yale databases demonstrate the effectiveness of the proposed algorithm. Keywords: Kernel method, Gaussian kernel, Matrix norm based Gaussian kernel, Adaptive matrix norm based Gaussian kernel, Data-dependent kernel

20 citations


Proceedings ArticleDOI
26 Nov 2007
TL;DR: This paper proposes a reversible data hiding scheme for 3D vertex, where last few digits of vertices coordinate value should be perceptually invisible and classify them base on some previous conditions to embed data.
Abstract: Watermarking is a very active research field and its application to 2D still images and audio signals have been widely used also, but watermarking of 3D mesh object has not been heavily researched, reversible 3D watermarking especially. This paper proposes a reversible data hiding scheme for 3D vertex. We first select last few digits of vertices coordinate value which should be perceptually invisible and classify them base on some previous conditions. Then we find the proper coordinate to embed data. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where high accuracy of the original model must be guaranteed.

Proceedings ArticleDOI
26 Nov 2007
TL;DR: A new generalized discrete fractional Hadamard transform (GDFHaT) is proposed, which has multi-order parameters and it is shown that this method performs well when applied to the image encryption.
Abstract: Discrete fractional Hadamard transform (DFHaT) is a generalization of discrete Hadamard transform. It has been widely used in signal processing. Different from only having one order parameter, in this paper, a new generalized discrete fractional Hadamard transform (GDFHaT) is proposed, which has multi-order parameters. This kind of GDFHaT shares most properties with DFHaT. The GDFHaT becomes DFHaT when all of its order parameters are the same. Then we apply it to the image encryption. Results show this method performs well.

Patent
04 Dec 2007
TL;DR: In this article, a data encryption method using discrete fractional Hadamard transformation (DFHT) is proposed. But the method requires a set of integers to define numerators and denominators of fractions, which represent the eigen values of the hadamard matrix.
Abstract: A data encryption method using discrete fractional Hadamard transformation includes the steps of: providing a set of data; processing the data with discrete fractional Hadamard transformation to generate at least one Hadamard matrix, the Hadamard matrix having eigen vectors corresponding to eigen values; selecting order parameters from order vectors of the Hadamard matrix; designating the order parameters as a private key in data encryption. In an embodiment, a set of integers is designated to define numerators and denominators of fractions which represent the eigen values of the Hadamard matrix.

Proceedings ArticleDOI
20 Oct 2007
TL;DR: Experimental results demonstrate the two transparency authentication schemes used in visual cryptography, which are based on watermarking techniques, are effective and practical.
Abstract: This paper proposes two transparency authentication schemes used in visual cryptography, which are based on watermarking techniques. In the first scheme, a secret image can be perceptible when stacking two transparencies. In addition, another watermark image is visible when shifting one transparency to an appropriate position and stacking it with the other transparency. In the second scheme, both the secret image and the watermark are of the same size, while in the first scheme, the watermark is half of the size of the secret image. No computer aid is needed in decryption in the first scheme while simple computation is required in the second one. The secret image and the watermark are encrypted at the same time in the two schemes. Experimental results demonstrate the two schemes are effective and practical.

Proceedings ArticleDOI
26 Nov 2007
TL;DR: Experimental results demonstrate the scheme to hide multiple watermarks in transparencies of visual cryptography is effective and practical and can be applied to hide some affiliated information of the secret image.
Abstract: This paper proposes a scheme to hide multiple watermarks in transparencies of visual cryptography. On one hand, the main properties of the traditional visual cryptography are still maintained. On the other hand, not only the encrypted image can be visible when stacking the transparencies, but also two extra watermarks can be extracted with simple computations. The scheme can be applied to hide some affiliated information of the secret image. Experimental results demonstrate the scheme is effective and practical.

Proceedings ArticleDOI
02 Jul 2007
TL;DR: A novel reversible data hiding scheme is proposed, where each pixel is predicted by its right neighboring pixel in scan order to get its prediction-error and a companding technique is introduced so as to largely increase the number of prediction-errors available for embedding.
Abstract: A novel reversible data hiding scheme is proposed in this article. Each pixel is predicted by its right neighboring pixel in scan order to get its prediction-error. Then, a companding technique is introduced so as to largely increase the number of prediction-errors available for embedding. Accordingly, a location map recording available positions can be compressed into a short bitstream. By largely decreasing the capacity consumed by the compressed location map, the high hiding capacity is achieved. A series of experiments are conducted to verify the feasibility and effectiveness of the proposed approach.

Proceedings ArticleDOI
26 Nov 2007
TL;DR: This work designed an improved watermarking system that will obtain the reasonable quality, acceptable survivability, and practical capacity and presents the practical implementation of the proposed algorithm.
Abstract: Research of robust watermarking algorithms is one of the major branches in digital rights management (DRM) systems. It is generally agreed that the quality of watermarked contents, the survivability of extracted watermark, and the number of bits embedded, need to be considered to evaluate how well the algorithm and hence the system is. However, these three metrics conflict with each other. Some previous works aimed at finding the tradeoff between quality and survivability by fixing embedded bits a constant. Besides quality and survivability, we take the number of embedded bits into account. With genetic algorithm, we designed an improved watermarking system that will obtain the reasonable quality, acceptable survivability, and practical capacity. Simulation results present the practical implementation of the proposed algorithm.

Journal ArticleDOI
TL;DR: This letter presents an improved visible watermarking scheme for halftone images that incorporates watermark embedding into ordered dither halftoning by threshold modulation and is content adaptive because it takes local intensity information of the host image into account.
Abstract: This letter presents an improved visible watermarking scheme for halftone images. It incorporates watermark embedding into ordered dither halftoning by threshold modulation. The input images include a continuous-tone host image (e.g. an 8-bit gray level image) and a binary watermark image, and the output is a halftone image with a visible watermark. Our method is content adaptive because it takes local intensity information of the host image into account. Experimental results demonstrate effectiveness of the proposed technique. It can be used in practical applications for halftone images, such as commercial advertisement, content annotation, copyright announcement, etc.

Proceedings ArticleDOI
05 Sep 2007
TL;DR: Experimental results show that the proposed watermarking method can resist not only cropping attack, but also some common signal processing attacks, such as JPEG compression, Gaussian noise, and filtering etc.
Abstract: In this paper, we proposed a parity modulation based digital image watermarking scheme in DWT domain, focusing on resisting cropping attack. The watermark embedded the LI3, subband coefficients of DWT by the parity modulation method. Experimental results show that the proposed watermarking method can resist not only cropping attack, but also some common signal processing attacks, such as JPEG compression, Gaussian noise, and filtering etc.

Book ChapterDOI
08 May 2007
TL;DR: This paper presents a probabilistic simulation of the response of the solar wind turbine to high-energy particles and shows how the wind turbine’s response to low-frequency radio signals varies greatly in both the horizontal and the vertical.
Abstract: 1 Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan, R.O.C. huang.hc@gmail.com 2 Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, R.O.C. jspan@cc.kuas.edu.tw 3 California Institute of Technology & NASA’s Jet Propulsion Lab, Pasadena, CA, USA wai-chi.fang@jpl.nasa.gov 4 University of South Australia, Adelaide, Australia Lakhmi.Jain@unisa.edu.au

Journal ArticleDOI
TL;DR: A visible watermarking scheme for halftone images that exploits HVS filtering to transform the image in binary domain into continuous-tone domain for watermark embedding and a codeword search operation converts the watermarked continuous-tones into binary domain.
Abstract: This letter proposes a visible watermarking scheme for halftone images. It exploits HVS filtering to transform the image in binary domain into continuous-tone domain for watermark embedding. Then a codeword search operation converts the watermarked continuous-tone image into binary domain. The scheme is flexible for two weighting factors are involved to adjust the watermark embedding strength and the average intensity of the watermarked image. Moreover, it can be used in some applications where original continuous-tone images are not available and the halftoning method is unknown.

Journal ArticleDOI
TL;DR: A phase perturbation attack to the Discrete Fourier Transform and Phase Shift Keying based watermarking scheme, when some noise is added on the phase of the DFT coefficients, the watermark can't be correctly extracted anymore, while the quality degradation of the attacked watermarked image is visually acceptable.
Abstract: The letter describes a phase perturbation attack to the Discrete Fourier Transform (DFT) and Phase Shift Keying (PSK) based watermarking scheme which is proposed in [3] In that paper the watermark information is embedded in the phase of the DFT coefficients But this kind of PSK based watermarking scheme is very vulnerable to the phase perturbation attack, when some noise is added on the phase of the DFT coefficients, the watermark can't be correctly extracted anymore, while the quality degradation of the attacked watermarked image is visually acceptable

Journal ArticleDOI
TL;DR: A reversible data hiding scheme based on the companding technique and the difference expansion of triplets is proposed and the experimental results reveal that high hiding capacity can be achieved at low embedding distortion.
Abstract: A reversible data hiding scheme based on the companding technique and the difference expansion (DE) of triplets is proposed in this paper. The companding technique is employed to increase the number of the expandable triplets. The capacity consumed by the location map recording the expanded positions is largely decreased. As a result, the hiding capacity is considerably increased. The experimental results reveal that high hiding capacity can be achieved at low embedding distortion.

Proceedings ArticleDOI
05 Sep 2007
TL;DR: This paper proposes a method to combine both the visible watermarking algorithm for copyright annotation, and reversible data hiding for recovering the original.
Abstract: We propose a copyright annotation scheme with both the visible watermarking and reversible data hiding algorithms in this paper. It is commonly encountered that visible watermarks are embedded on purpose in one corner of an image or video clips to annotate the copyright owner of such a medium. It is usually asked by the buyer to remove the visible watermark to return to its original form who obtains such an image or video. In this paper, we propose a method to combine both the visible watermarking algorithm for copyright annotation, and reversible data hiding for recovering the original. Simulation results demonstrate the effectiveness and feasibility of our algorithm.

Proceedings ArticleDOI
26 Nov 2007
TL;DR: Experiments implemented on two real datasets show that 2D(PC)2A method is an efficient and practical approach for face recognition.
Abstract: In the real-world application of face recognition system, owing to the difficulties of collecting samples or storage space of systems, only one sample image per person is stored in the system, which is so-called one sample per person problem. In this paper, we propose a novel algorithm, called 2D(PC)2A, to solve this problem. The procedure of 2D(PC)2A can be divided into the three stages: 1) creating the combined image from the original image 2) performing 2DPCA on the combined images; 3) classifying a new face based on assembled matrix distance (AMD). Experiments implemented on two real datasets show that 2D(PC)2A method is an efficient and practical approach for face recognition.

Proceedings ArticleDOI
26 Nov 2007
TL;DR: With this scheme, confidential information in an image can be protected, and then adaptively hidden, based on the characteristics of original image, with reversible data hiding techniques.
Abstract: We propose an effective scheme for protecting and recovering sensitive information based on reversible data hiding techniques in this paper. It is commonly seen that confidential information within an image is deliberately removed, marked or mosaicked before being delivered to the public, including displaying the marked images on the TV screens or newspapers. However, in some cases such as the plate number of VIP's car, the information need be retained by some means. With our scheme, confidential information in an image can be protected, and then adaptively hidden, based on the characteristics of original image, with reversible data hiding techniques. It is done by first mosaicking the region with confidential information, and then delivering the modified image to the public. Only those who have the right to view the confidential information can recover original image with the secret key. Simulation results demonstrate their applicability and usefulness.

Proceedings ArticleDOI
26 Dec 2007
TL;DR: This paper proposes a scheme to hide two watermarks in visual secret sharing of a gray level image that is embedded during secret image halftoning and hidden during the halftone image encryption.
Abstract: This paper proposes a scheme to hide two watermarks in visual secret sharing of a gray level image. One watermark is embedded during secret image halftoning, and the other watermark is hidden during the halftone image encryption. A non-expansion visual secret sharing model is used to encrypt the halftone image. In data extraction, only exclusive-OR operation is needed. Experimental results show the effectiveness of our scheme.


Proceedings ArticleDOI
23 May 2007
TL;DR: This paper formulates Cevikalp's discriminative common vector (DCV) method from space isomorphic mapping view in the kernel-inducing feature space and develops a two-phase algorithm: whitened kernel principal component analysis (KPCA) plus DCV.
Abstract: A novel face recognition method based on facial texture feature with common vector analysis is presented in this paper. The novelty of this paper comes from (1) facial texture feature characterized by spatial frequency, spatial locality and orientation selectivity to cope with the variations in illumination and facial expressions is extracted by Gabor wavelet, which improves the recognition performance; (2) This paper formulates Cevikalp's discriminative common vector (DCV) method from space isomorphic mapping view in the kernel-inducing feature space and develops a two-phase algorithm: whitened kernel principal component analysis (KPCA) plus DCV. KPCA spheres data and makes the data structure become as linearly separable as possible by virtue of an implicit nonlinear mapping determined by kernel. Based on the above ideas, we propose a novel face recognition method, namely kernel common Gaborfaces method, by extracting the facial texture feature using Gabor wavelet and classification using the proposed kernel common vector analysis algorithm, whose effectiveness is tested on ORL and Yale face databases.

Book ChapterDOI
06 Aug 2007
TL;DR: A novel kernel optimization method based on maximum margin criterion is proposed, which can solve the problem of Xiong's work that the optimal solution can be solved by iteration update algorithm owing to the singular problem of matrix.
Abstract: A novel criterion, namely Maximum Margin Criterion (MMC), is proposed for learning the data-dependent kernel for classification. Different kernels create the different geometrical structures of the data in the feature space, and lead to different class discrimination. Selection of kernel influences greatly the performance of kernel learning. Optimizing kernel is an effective method to improve the classification performance. In this paper, we propose a novel kernel optimization method based on maximum margin criterion, which can solve the problem of Xiong's work [1] that the optimal solution can be solved by iteration update algorithm owing to the singular problem of matrix. Our method can obtain a unique optimal solution by solving an eigenvalue problem, and the performance is enhanced while time consuming is decreased. Experimental results show that the proposed algorithm gives a better performance and a lower time consuming compared with Xiong's work.