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.

Low Space Complexity Multiplier for Even-Type Gaussian Normal Basis over GF(2m)

Abstract: Gaussian normal basis in multiplier design perform excellent, matrix-vector decomposition is most important part in multiplication algorithm. In this paper, we proposed a symmetric matrix-vector product method, theoretical analysis shows that the proposed scheme is less space complexity comparing to the traditional TMVP approach. The main advantage of the proposed multiplier is can be designed and implementationin in a smaller size and we can reduce a large number of AND gates.

A novel statistical automaton for network cloud traffic classification

Abstract: Traffic classification is crucial in many network and cloud applications, they are from QoS enforcement, network monitoring to security and firewalls. In recent years, all the classification with deep packet inspection (DPI) are using the exact matching with the existing policy semantics. However, if the policy semantics is changed, then the DPI classifier is no longer able to be a workable traffic classification. We proposed a new statistical automaton for the traffic classification. The applications are marked by many multiple signatures during a flow training process, and then it classifies the applications when their statistical results are reached. In the experiment, we evaluate the proposed method with 5 applications which proves our idea is feasible for the network and cloud traffic classification.

Research on effect of rings on coupling vibration in a rigid-disk rotor

Abstract: This paper uses new deductions of the equation of motion and obtains new modes of change that differ from the authors’ previous research. The blade-bending, shaft-torsion and ring-bending coupled vibration influence of a single-disk rotor whose blade subsystem was coated with a ring is investigated. In the last two years, the authors adopted two methods, the assumed mode method and finite element method, and compared both parties results. This article continues that work. In this paper, the phenomena of ring joint coupling vibrations are different and interesting. The authors defined two new types, the shaft-blade-ring (SBR) and blade-ring (BR) modes. These two coupling modes can be mutually affected by the shaft, blade, and ring, and no single subsystem predominates. The new change rules of natural frequencies of rotors with two to 15 blades and those of mode shapes are discussed. The influence of the ring thickness and rotational speed are also studied in this paper.

A fast image coding algorithm using variable-rate mean-match correlation vector quantization

Abstract: A variable-rate mean-match correlation vector quantizer, MMCVQ, is presented as an alternative vector quantizer of side-match vector quantizer (SMVQ) for fast image encoding. Before encoding, the mean values of all codewords are computed, then a sorted codebook is obtained according to the ascending order of the mean values of codewords. During the encoding stage, high correlation of the adjacent image blocks and mean values of the current processing vector and codewords are considered to obtain the state-codebook of the current processing vector. The experimental result shows: (1) the encoding time of MMCVQ is almost 7 times faster than that of full-search VQ and almost 42 times faster than that of SMVQ, and (2) compared with SMVQ, the encoding quality will increase more than 1 dB in PSNR, and (3) the bit rate of MMCVQ is smaller than that of SMVQ by 0.03-0.05 b/pixel.

A multistage VQ based watermarking technique with fake watermarks

Abstract: Digital watermarking is a technology proposed to help address the concern of copyright protection for digital content. To facilitate tracing of copyright violators, different watermarks carrying information about the transaction or content recipient can be embedded into multimedia content before distribution. Such form of "personalised" watermark is called "fingerprint". A powerful attack against digital fingerprinting is the collusion attack, in which different fingerprinted copies of same host data are jointly processed to remove the fingerprints or hinder their detection. This paper first studies a number of existing collusion attack schemes against image fingerprinting. A new collusion attack scheme is then proposed and evaluated, both analytically and empirically. Attack performance in terms of fingerprint detectability and visual quality degradation after attack is assessed. Results obtained from spread spectrum fingerprinting experiments show that the proposed attack can impede fingerprint detection using as few as three fingerprinted images without introducing noticeable visual degradation, hence it is more powerful than those reported in literature. It is also found that increasing the fingerprint embedding strength and spreading factor do not help resist such malicious attacks.

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.