scispace - formally typeset
Search or ask a question
Author

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.


Papers
More filters
Book
01 Oct 2014
TL;DR: This volume of Advances in Intelligent Systems and Computing contains accepted papers presented at ICGEC 2014, the 8th International Conference on Genetic and Evolutionary Computing, held from 18-20 October 2014 in Nanchang, China.
Abstract: This volume of Advances in Intelligent Systems and Computing contains accepted papers presented at ICGEC 2014, the 8th International Conference on Genetic and Evolutionary Computing. The conference this year was technically co-sponsored by Nanchang Institute of Technology in China, Kaohsiung University of Applied Science in Taiwan, and VSB-Technical University of Ostrava. ICGEC 2014 is held from 18-20 October 2014 in Nanchang, China. Nanchang is one of is the capital of Jiangxi Province in southeastern China, located in the north-central portion of the province. As it is bounded on the west by the Jiuling Mountains, and on the east by Poyang Lake, it is famous for its scenery, rich history and cultural sites. Because of its central location relative to the Yangtze and Pearl River Delta regions, it is a major railroad hub in Southern China. The conference is intended as an international forum for the researchers and professionals in all areas of genetic and evolutionary computing.

3 citations

Book ChapterDOI
14 Sep 2005
TL;DR: A spread spectrum technique was introduced to image watermarking which can be applied to print and generation copy and Experimental results show that the scheme can resist print, generation copies and scan process.
Abstract: After a watermarked image is printed, copied several times and scanned, the watermark usually cannot be extracted rightly, as well as distorted by noise In this paper, a spread spectrum technique was introduced to image watermarking which can be applied to print and generation copy The watermarking message is modulated by the key-dependent pseudo-random sequences to produce a spread spectrum signal The watermark is embedded into the cover image by modifying the gray value of each pixel The cover image is not needed when the watermark is detected The watermark is estimated exploiting the properties of HVS(Human Visual System) and extracted through the same key-dependent 2D sequences Experimental results show that the scheme can resist print, generation copy and scan process

3 citations

Proceedings ArticleDOI
16 Oct 2013
TL;DR: A method of fast building panoramic video and output frames in real-time and a new method is developed to eliminate matching mistakes in this work.
Abstract: The technology of panoramic image construction is widely used in many conditions. As the increasingly demand of monitoring system application, the attribute of real-time is more important during the panoramic construction. This paper describes a method of fast building panoramic video and output frames in real-time. SURF algorithm is employed to extract features and a new method is developed to eliminate matching mistakes in this work. As traditional transform method use only one homography matrix, the stitch error in detail is obvious. In this paper the modified dual-homography is proposed to improve the stitch performance. Ghosting effect is a universal problem in image stitching and difficult to avoid. This topic use image subtraction and smooth transition blending method to avoid ghost. Since this topic skips the seam finding process, so the time consumption is low and the method can achieve real-time requirement.

3 citations

Journal ArticleDOI
TL;DR: An adaptive unified data embedding and scrambling technique for 3D mesh models (3D-AUES) is proposed, which can embed external data and scramble3D mesh simultaneously, and has a high embedding rate, scalable scrambling quality and scalable recovery quality.
Abstract: Traditionally, unified data embedding and scrambling techniques have been designed for grayscale images, which cannot be applied directly to a three-dimensional (3D) mesh. Recently, the universal use of 3D technology inspired us to innovate in this field. In this paper, an adaptive unified data embedding and scrambling technique for 3D mesh models (3D-AUES) is proposed, which can embed external data and scramble 3D mesh simultaneously. First, a vertex coordinate prediction method called cross prediction is adopted to accurately predict half of the vertices from the other half. The predicted vertices are used to embed external data. We further increase the embedding rate by bit replacement embedding. Then, to improve security, we propose an adaptive threshold to select vertices for embedding. To ensure lossless scrambling, the thresholds and prediction errors are embedded as side information with secret information into the vertices. By adopting an adaptive threshold and multilayer embedding, scalable scrambling quality can be achieved. On the decoder side, with the help of losslessly embedded side information, external data can be successfully extracted, and the original mesh can be restored to predetermined distortion levels, from lossless recovery to partial recovery. Experiments show that 3D-AUES has a high embedding rate, scalable scrambling quality and scalable recovery quality.

3 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: It is proved 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.
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.

11,727 citations

Book
24 Oct 2001
TL;DR: Digital Watermarking covers the crucial research findings in the field and 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.
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.

2,849 citations

Proceedings Article
01 Jan 1999

2,010 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user 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.
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.

1,783 citations