scispace - formally typeset
Search or ask a question
Author

Jeng-Shyang Pan

Bio: Jeng-Shyang Pan is an academic researcher from Shandong University of Science and Technology. The author has contributed to research in topics: Digital watermarking & Watermark. The author has an hindex of 50, co-authored 789 publications receiving 11645 citations. Previous affiliations of Jeng-Shyang Pan include National Kaohsiung Normal University & Technical University of Ostrava.


Papers
More filters
Book ChapterDOI
01 Jan 2015
TL;DR: A dual watermarking scheme based on subsampling and Compressive Sensing Theory is proposed and extensive experimental results demonstrate the validity of the proposed scheme and high security of security information.
Abstract: This paper proposes a dual watermarking scheme based on subsampling and Compressive Sensing Theory. In this scheme, one robust watermark is embedded into the DCT domain of two sub-images and another watermark is embedded into the CS domain. Bit Correction Rate (BCR) between original secret message and extracted message are used to calculate the accuracy of this method. Extensive experimental results demonstrate the validity of the proposed scheme and high security of security information.

1 citations

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.

1 citations

Proceedings ArticleDOI
01 Nov 2017
TL;DR: A new efficient architecture of the transform have been proposed which support a various operand size and a variant constant geometry architecture is used which the forward and backward sub-stage used the same computation pattern.
Abstract: Number theoretic transform with the modular arithmetic operations can perform convolution efficiently in a ring without round-off errors. In this paper, a new efficient architecture of the transform have been proposed which support a various operand size. To have a balanced trade-off between area and latency, a variant constant geometry architecture is used which the forward and backward sub-stage used the same computation pattern. In addition, a XOR-based multi-ported RAM is adopted to accelerate the memory access which allow multiple simultaneous reads and writes efficiently. As a result, the developed accelerator can achieve lower area-latency FPGA compared to other designs.

1 citations

Proceedings Article
01 Jan 2016
TL;DR: The evolved bat algorithm is improved by replacing the fixed maximum searching step size, which is determined by the media, with a continuously level increasing trigonometric function, and the cosine signal and a level increasing direct current signal are employed in the design.
Abstract: Swarm intelligence algorithms utilize large amount of artificial agents to discover solutions in the solution space. Thus, the diversity in a group of artificial agents plays the major role that directly influences the searching result and the exploration capacity. However, an over-high exploration capacity is not helpful for pinpointing the near best solution in the searching domains. It implies that a good swarm intelligence algorithm for solving optimization problems should be capable to balance the abilities to explore and to exploit the solution space. Answering to the criteria of swarm intelligence algorithms, the evolved bat algorithm is improved by replacing the fixed maximum searching step size, which is determined by the media, with a continuously level increasing trigonometric function. The cosine signal and a level increasing direct current signal are employed in our design for improving the searching capacity of the evolved bat algorithm. In order to verify the performance and the searching accuracy of our proposed method, three test functions with known global optimum values are used in the experiments. In addition, every test function is tested with four different dimensional conditions, which include 10, 30, 50, and 100 dimensional test environments. The experimental results indicate that our proposed method improves the searching accuracy of the evolved bat algorithm about 30.171%, 50.737%, 47.454%, and 47.96%, respectively for different dimensional environments, in average.

1 citations

Book ChapterDOI
01 Nov 2019
TL;DR: The simulation analysis of experimental data shown that the new method had more diagnostic accuracy, convenience and operability compared with the traditional IEC ratio method.
Abstract: The three ratios method of power transformer faults diagnosis based on decision tree with fuzzy logic propose in this study. The two major problems in the application of the IEC ratio method in transformer fault diagnosis are the lack of coding and the clear ratio range. Used the decision tree algorithm to solve the lack of coding problem. The fuzzy logic deals with the clear ratio range while ratio range displaced by the membership function. The simulation analysis of experimental data shown that the new method had more diagnostic accuracy, convenience and operability compared with the traditional IEC ratio method.

1 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: It is proved the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density.
Abstract: A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure: the mean shift. For discrete data, we prove the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density. The relation of the mean shift procedure to the Nadaraya-Watson estimator from kernel regression and the robust M-estimators; of location is also established. Algorithms for two low-level vision tasks discontinuity-preserving smoothing and image segmentation - are described as applications. In these algorithms, the only user-set parameter is the resolution of the analysis, and either gray-level or color images are accepted as input. Extensive experimental results illustrate their excellent performance.

11,727 citations

Book
24 Oct 2001
TL;DR: Digital Watermarking covers the crucial research findings in the field and explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied.
Abstract: Digital watermarking is a key ingredient to copyright protection. It provides a solution to illegal copying of digital material and has many other useful applications such as broadcast monitoring and the recording of electronic transactions. Now, for the first time, there is a book that focuses exclusively on this exciting technology. Digital Watermarking covers the crucial research findings in the field: it explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied. As a result, additional groundwork is laid for future developments in this field, helping the reader understand and anticipate new approaches and applications.

2,849 citations

Proceedings Article
01 Jan 1999

2,010 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

1,783 citations