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.

Wavelet-Based Quantization Watermarking for ECG Signals

Abstract: In this article, we use a self-synchronized watermark technology [7], to achieve the purpose of protection of electrocardiogram (ECG) signal. A Harr wavelet transform with 7 levels decomposition is adopted to transform the ECG signal and the synchronization code, combined with watermark, are quantized embedded in the low-frequency sub-band of level 7. The signal to noise ratio (SNR) between the embedded ECG and original one is greater than 30 such that the difference between these two ECG signals is very small and negligible in general. To test the robustness under the network transfer of ECG data, a white noise attack with various strengths is simulated that the bit error rate is quite small unless the SNR of the noise is very large. This study confirms the use of wavelet-based quantization watermarking scheme on ECG signal for patient protection is adequate.

Driving Behavior Analysis of Multiple Information Fusion Based on AdaBoost

Abstract: With the increase in the number of private cars as well as the non-professional drivers, the current traffic environment is in urgent need of driving assist equipment to timely reminder and to rectify the incorrect driving behavior. In order to meet this requirement, this paper proposes an innovative algorithm of driving behavior analysis based on AdaBoost with a variety of driving operation and traffic information. The proposed driving behavior analysis algorithm will mainly monitor driver’s driving operation behavior, including steering wheel angle, brake force, and throttle position. To increase the accuracy of driving behavior analysis, the proposed algorithm also takes road conditions into account. The proposed will make use of AdaBoost to create a driving behavior classification model in various different road conditions, and then could determine whether the current driving behavior belongs to safe driving. Experimental results show the correctness of the proposed driving behavior analysis algorithm can achieve average 80% accuracy in various driving simulations. The proposed algorithm has the potential of applying to real-world driver assistance system.

Reversible Data Hiding for 3D Point Cloud Model

Abstract: This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.

Towards Time-Bound Hierarchical Key Management in Cloud Computing

Abstract: Nowadays, data outsourcing in the cloud is used widely and popularly by people. It also arises several security problems. To control access of outsourced data with different priority becomes an important research issue. Recently, Chen et al. proposed the first hierarchical access control scheme in cloud computing. However, they did not concern with the time-bound property. In some applications such as Pay-TV, the time-bound property is necessary because subscriber may subscribe some channels during one month. In this paper, we propose the first time-bound hierarchical key management scheme in cloud computing without tamper-resistant devices. The security analysis demonstrates that the proposed scheme is provably secure against outsider and insider attacks.

Reversible data hiding based on the local smoothness estimator and optional embedding strategy in four prediction modes

Abstract: Four new prediction modes are proposed in this paper, each of which is a three-step process for all to-be-embedded pixels (nearly three-fourths of all the pixels). By designing each mode reasonably, all to-be-embedded pixels can be predicted with high accuracy, and thus, the number of embeddable pixels can be increased largely. In each step, a local smoothness estimator is utilized to determine if one embeddable pixel is located in a smooth or complex region, which is defined as the variance of the total neighbors of this pixel. In fact, the correlation evaluated by using the total neighbors, instead of a part, can reflect the complexity of the region more accurately. In this paper, an optional embedding strategy is introduced so as to select a low-distortion reversible data hiding (RDH) method according to the desired embedding rate (ER). Specifically, when the required ER is low, difference expansion (DE) is used to process those pixels in smooth regions while leaving the rest unaltered. With ER largely increased, adaptive embedding is used to embed 2-bit into these pixels with low local variance by DE while 1-bit into the remaining ones. The experimental results also demonstrate the proposed method is effective.

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.