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.

A Power Consumption Balancing Algorithm Based on Evolved Bat Algorithm for Wireless Sensor Network

Abstract: It is known that sensor nodes equipped with limited battery power in wireless sensor network, the sensor network will paralyze if sensor node run out of its energy. Therefore energy awareness is an essential consideration for wireless sensor network. Recent advances in wireless sensor networks have led to many new protocols specifically for saving sensor node’s energy. A new scheme for predetermining the optimized routing path is proposed based on the evolved bat algorithm (EBA) in this paper. This is the first leading precedent that the EBA is employed to provide the routing scheme for the WSN. A simulation is given and the results obtained by the EBA are compared with the AODV, the LD method based on ACO. The simulation results indicate that our proposed method shows good performance on average power consumption.

Adaptive Weighted Nearest Feature Space Analysis and Its Application to Feature Extraction

Abstract: In this paper, a new feature extraction algorithm named Adaptive Weighted Nearest Feature Space Analysis (AWNFSA) is proposed AWNFSA is a Nearest Feature Space (NFS) based subspace learning approach In Discriminant Nearest Feature Space Analysis (DNFSA) algorithm based on NFS, it may lead the result into misclassification when the between class scatter is very big or within class scatter is very small Different from DNFSA, AWNFSA evaluates the effect of two scatter for classification through choosing their weights adaptively The proposed AWNFSA is applied to image classification on ORL face Database The experimental results demonstrate the efficiency of the proposed AWNFSA

A Parallel Optimization Algorithm Based on Communication Strategy of Pollens and Agents

Abstract: Unwanted convergence to a local optimum, rather than global optimum, is possible to take place in practical multimodal optimization problems. Communication between artificial agents in the stochastic algorithms is one of the solutions to this issue. This paper proposes a novel parallel optimization algorithm, namely FDA, based on the communication of the pollen in Flower pollination algorithm (FPA) with the agents in Differential evolution algorithm (DEA) to solve the optimization problems. A communication strategy for Pollens and Agents is to take advantages of the strength points of each algorithm to explore and exploit the diversity solutions in avoiding of dropping to a local optimum. A set of benchmark functions is used to test the quality performance of the proposed algorithm. Simulation results show that the proposed algorithm in-creases the accuracy more than the existing algorithms.

Novel Visual Secret Sharing Scheme for the QR Code with Meaningful Shares

Abstract: Visual secret sharing (VSS) scheme can share the secret image with several shares. Shares are performed by the decoding operation to restore the secret image. VSS scheme is mainly used for the secure transmission of images. Quick response (QR) code is often used by people on the Internet. It can be encrypted by the VSS scheme to enhance the security of its transmission. The share is meaningless that will arouse the suspicion of the attacker. The security of the VSS scheme is decreased. This paper proposes a novel VSS scheme for the QR code with meaningful images to solve this problem. Two continue tone images are converted to halftone images. The halftone image is modified to generate the share. Every share is meaningful, not meaningless. Two shares are performed the decoding operation to restore the secret QR code. The restored QR code can be correctly decoded by the general decoder. Experimental results prove that the proposed scheme is feasible.

A genetic algorithm with elite mutation to optimize cruise area of mobile sinks in hierarchical wireless sensor networks

Abstract: In this paper, a new genetic algorithm with elite mutation is proposed for optimization problems. The proposed elite mutation scheme (EM) improves traditional genetic algorithms with a better ability to locate and to approach fast to optimal solutions, even in cases of huge data set. The proposed EM is to select elite chromosomes and mutate according to the similarity between elite chromosomes and selected chromosomes. The designed similarity guides effectively the search toward optimal solutions with less generation. The proposed EM is applied to optimize the cruise area of mobile sinks in hierarchical wireless sensor networks (WSNs). Numeric results show that (1) the proposed EM benefits the discovery of optimal solutions in a large solution space; (2) the approach to optimal solutions is more stable and faster; (3) the search guidance derived from the chromosome similarity is critical to the improvements of optimal solution discovery. Besides, the minimization of cruise are been proved to have the advantages of energy-saving, time-saving and reliable data collection in WSNs.

Mean shift: a robust approach toward feature space analysis

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.

Digital Watermarking

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.

PORs: Proofs of Retrievability for Large Files

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.