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 2014
TL;DR: The famous paired living habit of sleepy lizards is verified based on the proposed algorithm and some common population characteristics of the lizards are introduced by using the traditional social net work algorithms.
Abstract: The K-Nearest Neighbor algorithm is one of the commonly used methods for classification in machine learning and computational intelligence. A new research method and its improvement for the sleepy lizards based on the K-Nearest Neighbor algorithm and the traditional social network algorithms are proposed in this chapter. The famous paired living habit of sleepy lizards is verified based on our proposed algorithm. In addition, some common population characteristics of the lizards are also introduced by using the traditional social net work algorithms. Good performance of the experimental results shows efficiency of the new research method.

1 citations

Proceedings ArticleDOI
13 Aug 2011
TL;DR: This work uses Karush-Kuhn-Tucker Theorem to minimize the difference between the original and the modified coefficients of low-frequency amplitude, so that the watermarked audio has strong robustness under sufficient watermarked-audio quality and high embedding capacity.
Abstract: Based on Karush-Kuhn-Tucker Theorem, a new blind digital audio watermarking scheme is proposed. In order to guarantee the robustness of watermarks, this scheme embeds information into low-frequency coefficients of discrete wavelet transform. For the modification of low-frequency amplitude, this work uses Karush-Kuhn-Tucker Theorem to minimize the difference between the original and the modified coefficients. Consequently, the watermarked audio has strong robustness under sufficient watermarked-audio quality and high embedding capacity. In addition, the system can extract the hidden data without the knowledge of original audio signal. Experimental results indicate that the performance of proposed system is mostly better than other amplitude modification method.

1 citations

Book ChapterDOI
01 Jan 2014
TL;DR: An improved classifier based on the concept of feature line space, called as adaptively nearest feature point classifier (ANFP) is proposed for face recognition, which gain better performance than NFL classifier and some others classifiers based on featureline space.
Abstract: In this paper, an improved classifier based on the concept of feature line space, called as adaptively nearest feature point classifier (ANFP) is proposed for face recognition. ANFP classifier uses the new metric, called as adaptively feature point metric, which is different from metrics of NFL and the other classifiers. ANFP gain better performance than NFL classifier and some others classifiers based on feature line space, which is proved by the experiment result on Yale face database.

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