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
01 Jan 2009
TL;DR: The following topics are dealt with: innovation management; information network; e-learning; image recognition; information retrieval; intelligent system; artificial intelligence; data mining; and motor control.
Abstract: The following topics are dealt with: innovation management; information network; e-learning; image recognition; information retrieval; intelligent system; artificial intelligence; data mining; and motor control

36 citations

Journal ArticleDOI
23 Sep 2019-Sensors
TL;DR: Analysis results of the applied adaptation multi-group quasi-affine transformation evolutionary for node localization in wireless sensor networks showed that the proposed method produces higher localization accuracy than the other competing algorithms.
Abstract: Developing metaheuristic algorithms has been paid more recent attention from researchers and scholars to address the optimization problems in many fields of studies. This paper proposes a novel adaptation of the multi-group quasi-affine transformation evolutionary algorithm for global optimization. Enhanced population diversity for adaptation multi-group quasi-affine transformation evolutionary algorithm is implemented by randomly dividing its population into three groups. Each group adopts a mutation strategy differently for improving the efficiency of the algorithm. The scale factor F of mutations is updated adaptively during the search process with the different policies along with proper parameter to make a better trade-off between exploration and exploitation capability. In the experimental section, the CEC2013 test suite and the node localization in wireless sensor networks were used to verify the performance of the proposed algorithm. The experimental results are compared results with three quasi-affine transformation evolutionary algorithm variants, two different evolution variants, and two particle swarm optimization variants show that the proposed adaptation multi-group quasi-affine transformation evolutionary algorithm outperforms the competition algorithms. Moreover, analyzed results of the applied adaptation multi-group quasi-affine transformation evolutionary for node localization in wireless sensor networks showed that the proposed method produces higher localization accuracy than the other competing algorithms.

36 citations

Journal ArticleDOI
TL;DR: In order to repair shortcomings existing in Chen et al.
Abstract: Recently, the sport of mountaineering is a popular leisure activity and many people may injure while mountaineering. In the year of 2014, Chen et al. suggested a cloud-based emergency response and SOS system for mountaineering travelers when they encounter dangers. Chen et al. claimed that their proposed system is secure against various known attacks and the executive performance of the system is reasonable when the protocol is implemented on the traveler’s mobile device. However, in this paper, we discover that Chen et al. ’s scheme is unable to protect the privacy of mountaineering travelers and the vulnerability allows a malicious attacker to spy on the electronic medical records of all mountaineering travelers by launching eavesdropping attacks. Moreover, Chen et al. ’s scheme is vulnerable to off-line password guessing attack when the mobile device of the mountaineering traveler is lost or stolen by an attacker. In order to repair these shortcomings existing in Chen et al. ’s scheme, we suggest an improved version of their scheme, which is provably secure in the random oracle model under the DDH and CDH problems.

35 citations

01 Jan 2016
TL;DR: The multi-objective firefly algorithm for estimating the located nodes in a network is proposed to solve the localization issues in WSNs and produces the considerable improvement in terms of localization accuracy and convergence rate.
Abstract: Specifying the located nodes of a network plays an important role in the success of many wireless sensor network (WSN) applications including object tracking, detecting, monitoring, etc. In this paper, the multi-objective firefly algorithm for estimating the located nodes in a network is proposed to solve the localization issues in WSNs. Objective functions of estimating the locations of all the nodes of WSN are considered based on two criteria including the distance of nodes, and the geometric topology constraint. The simulation results are compared with other methods in the literature show that the proposed method produces the considerable improvement in terms of localization accuracy and convergence rate.

35 citations

Book
15 Oct 2009
TL;DR: This book introduces a number of digital watermarking techniques and is divided into four parts and introduces the importance of watermarked techniques and intelligent technology.
Abstract: Information security and copyright protection are more important today than before. Digital watermarking is one of the widely used techniques used in the world in the area of information security. This book introduces a number of digital watermarking techniques and is divided into four parts. The first part introduces the importance of watermarking techniques and intelligent technology. The second part includes a number of watermarking techniques. The third part includes the hybrid watermarking techniques and the final part presents conclusions. This book is directed to students, professors, researchers and application engineers who are interested in the area of information security.

35 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