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.

Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles

Abstract: This paper studies the problem of intelligence optimization, a fundamental problem in analyzing the optimal solution in a wide spectrum of applications such as transportation and wireless sensor network (WSN). To achieve better optimization capability, we propose a multigroup Multistrategy Compact Sine Cosine Algorithm (MCSCA) by using the compact strategy and grouping strategy, which makes the initialized randomly generated value no longer an individual in the population and avoids falling into the local optimum. New evolution formulas are proposed for the intergroup communication strategy. Performance studies on the CEC2013 benchmark demonstrate the effectiveness of our new approach regarding convergence speed and accuracy. Finally, we apply MCSCA to solve the dispatch system of public transit vehicles. Experimental results show that MCSCA can achieve better optimization.

An extensible particles swarm optimization for energy-effective cluster management of underwater sensor networks

Abstract: Acoustic communication networks in underwater environment are the key technology to explore global ocean. There are major challenges including (1) lack of stable and sufficient power supply, (2) disable of radio frequency signal and (3) no communication protocol designed for underwater environment. Thus, acoustic so far is the only media suitable to operate for underwater communication. In this paper, we study the technology of underwater acoustic communication to support underwater sensor networks. Toward the energy-effective goal, a cluster-based sensor network is assumed. The energy-dissipation of sensor nodes is optimized by biological computing such as Particle Swarm Optimization (PSO). The objective function of sensor node clustering is formulized to constraint on the network coverage and energy dissipation. The problem of dual-objective optimization is solved by the proposed extensible PSO (ePSO). ePSOis an innovation from traditional PSO. The major innovation is to offer an extensible particle structure and to enable more flexible search for optimal solutions in space. The experimental results demonstrate that the proposed ePSO effectively and fast tackles multi-objective optimization problem. The application of ePSO on underwater acoustic communication systems shows the feasibility in real world.

A novel VQ-based watermarking scheme with genetic codebook partition

Abstract: A novel watermarking scheme based on vector quantisation (VQ) for digital still images is presented. This scheme begins with the procedure of partitioning the original codebook into two sub-codebooks. To achieve this, two strategies are proposed. The first one requires no complex algorithm and gives the users full freedom for partitioning. The second one is a genetic codebook partition procedure, which has the ability to improve the perfonmance of tile proposed watermarking scheme. After that, the information of codebook partition is served as a secret key and is used in the proposed watermarking scheme. In the embedding procedure, according to the watermark bit to be embedded a sub-codebook is chosen. The traditional VQ nearest codeword search is then performed to obtain the nearest codeword for the input vector. In the extracting procedure, the traditional VQ table lookup procedure is executed. With the same secret key, the hidden watermark bit can be determined by examining which same-codebook the corresponding codeword is belonging to. It is denaonstated that the proposed watermarking scheme provides better quality in watermarked images, stronger robustness under some common attacks, faster encoding time, and effective methods for partitioning codebooks.

Novel Non-Contact Control System for Medical Healthcare of Disabled Patients

Abstract: When limb-disabled patients want to activate the nurse emergency call system, adjust the temperature on air-conditioners, switch on or off lights, watch television, or have other urgent needs, and require assistance from other people, their needs cannot be readily met if there is no one around All above devices need to be operated manually or with a remote control Thus, disabled patients cannot operate by themselves, and this also increases the burden of the nursing assistants In order to improve the above issue, a novel non-contact control system is designed to allow disabled patients activating the nurse emergency call system and adjusting other appliances Disabled patients can stare at the control icons of a visual stimulus generator, which accompanies a wearable electroencephalogram (EEG) acquisition device with non-contact dry electrode for monitoring patients’ EEG signals and converting the EEG signals into relevant control commands via the signal processing system, to achieve the function of nurse calling and the effect of controlling the devices in a hospital The result shows that the proposed system could effectively monitor and convert EEG signals and achieve the control effects for which disabled a patient desires in a hospital Therefore, the non-contact control system provides a new control framework for the facilities in a hospital, which significantly assist patients with limb disability

Improved binary pigeon-inspired optimization and its application for feature selection

Abstract: The Pigeon-Inspired Optimization (PIO) algorithm is an intelligent algorithm inspired by the behavior of pigeons returned to the nest. The binary pigeon-inspired optimization (BPIO) algorithm is a binary version of the PIO algorithm, it can be used to optimize binary application problems. The transfer function plays a very important part in the BPIO algorithm. To improve the solution quality of the BPIO algorithm, this paper proposes four new transfer function, an improved speed update scheme, and a second-stage position update method. The original BPIO algorithm is easier to fall into the local optimal, so a new speed update equation is proposed. In the simulation experiment, the improved BPIO is compared with binary particle swarm optimization (BPSO) and binary grey wolf optimizer (BGWO). In addition, the benchmark test function, statistical analysis, Friedman’s test and Wilcoxon rank-sum test are used to prove that the improved algorithm is quite effective, and it also verifies how to set the speed of dynamic movement. Finally, feature selection was successfully implemented in the UCI data set, and higher classification results were obtained with fewer feature numbers.

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.