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 Robust Audio Watermarking Algorithm Based on DCT and Vector Quantization

Abstract: In this paper, a novel robust audio watermarking algorithm based on discrete cosine transform (DCT) and vector quantization (VQ) is proposed. The original audio signal is first segmented into frames. The embedding process for each frame is as follows. First, the original frame is DCT transformed, and several middle-frequency coefficients are composed of a vector to be modified. Then the labeled-codeword based VQ is used to quantize this vector according to the watermark bit to be embedded. Finally, the modified middle-frequency coefficients together with the untouched coefficients are inversely DCT transformed to get the watermarked frame. Experimental results show that the proposed watermarking algorithm has strong robustness to not only most of the attacks in stir mark benchmark for audio but also the cropping attack.

A Guidable Bat Algorithm Based on Doppler Effect to Improve Solving Efficiency for Optimization Problems

Abstract: A new guidable bat algorithm (GBA) based on Doppler Effect is proposed to improve problem-solving efficiency of optimization problems. Three searching polices and three exploration strategies are designed in the proposed GBA. The bats governed by GBA are enabled the ability of guidance by frequency shift based on Doppler Effect so that the bats are able to rapidly fly toward the current best bat in guidable search. Both refined search and divers search is employed to explore the better position near the current best bat and develop new searching area. These searching polices benefit discover the eligible position to upgrade the quality of position with the current best bat in a short time. In addition, next-generation evolutionary computing (EC 2.0) is created to breaks the bottleneck of traditional ECs to create the new paradigm in ECs. In EC 2.0, conflict theory is introduced to help the efficiency of solution discovery. Conflict between individuals is healthful behavior for population evolution. Constructive conflict promotes the overall quality of population. Conflict, competition and cooperation are the three pillars of collective effects investigated in this study. The context-awareness property is another feature of EC 2.0. The context-awareness indicates that the individuals are able to perceive the environmental information by physic laws.

The QUasi-Affine TRansformation Evolution (QUATRE) Algorithm: An Overview

Abstract: QUasi-Affine TRansformation Evolution (QUATRE) algorithm is a new simple but powerful stochastic optimization algorithm proposed recently. The QUATRE algorithm aims to tackle the representational/positional bias inborn with DE algorithm and secures an overall better performance on commonly used Conference of Evolutionary Computation (CEC) benchmark functions. Recently, several QUATRE variants have been already proposed since its inception in 2016 and performed very well on many benchmark functions. In this paper, we mainly have a brief overview of all these proposed QUATRE variants first and then make simple contrasts between these QUATRE variants and several state-of-the-art DE variants under CEC2013 test suites for real-parameter single objective optimization benchmark functions. Experiment results show that the movement trajectory of individuals in the QUATRE structure is much more efficient than DE structure on most of the tested benchmark functions.

Data Encryption Method Using Discrete Fractional Hadamard Transformation

Abstract: A data encryption method using discrete fractional Hadamard transformation includes the steps of: providing a set of data; processing the data with discrete fractional Hadamard transformation to generate at least one Hadamard matrix, the Hadamard matrix having eigen vectors corresponding to eigen values; selecting order parameters from order vectors of the Hadamard matrix; designating the order parameters as a private key in data encryption. In an embodiment, a set of integers is designated to define numerators and denominators of fractions which represent the eigen values of the Hadamard matrix.

An Improved Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems

Abstract: This paper presents an improved particle swarm optimization algorithm with feasibility- based rules (FRIPSO) to solve mixed-variable constrained optimization problems. Different kinds of variables are dealt in different ways in FRIPSO algorithm. Constraint handling is based on simple feasibility-based rules without the use of a penalty function which is frequently cumbersome to parameterize, nor need it to guarantee the particles be in the feasible region at all time which turn out to cost much time sometimes. In order to improve the convergence speed of FRIPSO with the iteration growing and to find global optimum, the standard PSO is used to find a better position for the best history position of the swarm on the condition that the discrete value are same with those of Gbest in each iteration. Two practical benchmark mixed-variable optimization problems are tested by our FRIPSO algorithm to demonstrate the effectiveness and robustness of the proposed approach.

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.