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
Journal ArticleDOI
TL;DR: In this paper, the tabu search approach is applied to codevector index assignment for noisy channels for the purpose of minimising the distortion due to bit errors without introducing any redundancy, and the robustness of this approach compared with the standard parallel genetic algorithm and the binary switching algorithm is demonstrated.
Abstract: The tabu search approach is applied to codevector index assignment for noisy channels for the purpose of minimising the distortion due to bit errors without introducing any redundancy. Experimental results demonstrate the robustness of this approach compared with the standard parallel genetic algorithm and the binary switching algorithm.

12 citations

01 Jan 2019
TL;DR: The results compared with the other approaches in the literature shows that the proposed approach can provide the effectively improving convergence speed and coverage rate of nodes, so leading to whole network coverage effect and prolonging network lifetime.
Abstract: This paper proposes a novel coverage strategy approach based on Ions Motion Optimization (IMO) for optimal coverage problem in the wireless sensor networks (WSN). In specific arear, how to reasonably arrange the sensor nodes to achieve the best coverage is the key to improving whole network performance. The node-coverage of the monitored area is modeled for objective function by the probability of each node to pixel and the joint coverage of each pixel point into the region for a whole network coverage optimization. Simulations of the coverage strategy are implemented in different scenario densities for optimal coverage. The results compared with the other approaches in the literature shows that the proposed approach can provide the effectively improving convergence speed and coverage rate of nodes, so leading to whole network coverage effect and prolonging network lifetime.

12 citations

Journal ArticleDOI
TL;DR: A novel dual watermarking algorithm is proposed based on the Fractional Fourier Transform (FRFT) and the digitalWatermarking techniques in this paper, which shows good performance both in robustness and in fragile in the experiments.
Abstract: A novel dual watermarking algorithm is proposed based on the Fractional Fourier Transform (FRFT) and the digital watermarking techniques in this paper The 0, 1 sequence is mapped into two different random sequences to realize the robust watermarking process The gray relational analysis method, the easy blocking method and the hierarchical embedding method are used here Good performance both in robustness and in fragile in the experiments shows the efficiency of our proposed method Future research orientations are mentioned in the conclusion

12 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