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-latency digit-serial dual basis multiplier for lightweight cryptosystems

Abstract: Various cryptosystems, such as elliptic curve and pairing-based cryptosystems, in resource-constrained security applications rely on finite field multiplication. For applications such as these, a digit-serial multiplier has the potential features to achieve a trade-off between space and time complexities. The authors propose an efficient decomposition of the multiplication into four independent sub-multiplication units to facilitate parallel processing, which is additionally facilitated by the systolic structures of the sub-multiplication units. The proposed architecture uses a four-bit scheme to construct a novel processing element, instead of using only one bit as is currently used in similar multipliers. The results of the synthesis show that the proposed digit-serial dual basis multiplier eliminates up to 96% of the critical path delay.

Power Reduction of Wireless Sensor Networks Using Ant Colony Optimization

Abstract: Power consumption is one of the most important problems for wireless sensor networks because of the battery limitation in each sensor. This paper presents an ant colony optimization- (ACO-) based routing algorithm to reduce power consumption. First, a grade table is built and referred to generate several possible routing paths. Then, the ACO explores these paths to reduce the power consumption of the nodes. The simulations indicate that the proposed algorithm obtains more balanced transmission among the nodes and reduces the power consumption of the routing.

Remote sensing image object recognition based on convolutional neural network

Abstract: The development of space remote sensing technology brings a lot of remote sensing image data. The traditional target detection method is difficult to adapt to the large amount of high-resolution remote sensing image data. It is necessary to find a way to automatically learn the most effective features from the image data, and to fully recover the correlation between the data. Based on the recognition of the typical targets in remote sensing image data, this paper proposes a method of remote sensing target recognition based on deep learning. In this paper, the pre-train method is introduced to improve the simulation of the model. The experiment of the test set proves the validity of the method.

Adaptive reversible data hiding based on a local smoothness estimator

Abstract: A novel reversible watermarking (RW) scheme based on a local smoothness estimator and multi-step embedding strategy is proposed in this paper. All the pixels are divided into four equal parts. Correspondingly, the watermark embedding process is separated into four independent steps. Thus each step is performed to embed watermark information into its corresponding image part. In each step, for each to-be-embedded pixel, a local smoothness estimator defined as the variance of its total neighbors is presented to estimate its local smoothness. An obvious advantage of introducing this estimator is that it can determine those pixels in smooth regions accurately. In fact, accurate determination means the decrease in embedding distortion. At the low embedding rate (ER), modifications induced by difference expansion (DE) are done only to those pixels located in smooth regions. Hence, the proposed method can obtain high embedding capacity while maintaining good visual quality. With ER gradually increased, adaptive embedding is employed. In adaptive embedding, for one to-be-embedded pixel, 1 or 2 bits are adaptively embedded according to the strength of relationship among all the pixels surrounding it. The experimental results demonstrate that the proposed method is effective.

Self Embedding Watermarking Scheme Using Halftone Image

Abstract: Self embedding watermarking is a technique used for tamper detection, localization and recovery. This letter proposes a novel self embedding scheme, in which the halftone version of the host image is exploited as a watermark, instead of a JPEG-compressed version used in most existing methods. Our scheme employs a pixel-wise permuted and embedded mechanism and thus overcomes some common drawbacks of the previous methods. Experimental results demonstrate our technique is effective and practical.

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.