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
Journal ArticleDOI
TL;DR: In this paper, a vector quantization (VQ) system with watermarking ability is presented, which modifies the VQ indices to carry watermark bits, and a genetic codebook partition (GCP) procedure is employed to find a better way to split the codebook.

47 citations

Journal ArticleDOI
TL;DR: Simulation results not only demonstrate effective transmission of the watermarked image, but reveal the robustness of the extracted watermark.
Abstract: An innovative scheme for watermarking based on vector quantisation for transmitting over noisy channels is proposed. By modifying multiple description vector quantisation for watermark embedding and extraction, simulation results not only demonstrate effective transmission of the watermarked image, but reveal the robustness of the extracted watermark.

46 citations

Journal ArticleDOI
TL;DR: Two rotation invariant watermark embedding schemes in the non-subsampled contourlet transform (NSCT) domain based on the scale-adapted local regions are presented and can efficiently resist both signal processing attacks and geometric attacks.

44 citations

Journal ArticleDOI
TL;DR: Numerical experiments show that this steganography algorithm has provided a novel data embedding domain and high security of information and high perceived quality of the stego-image can be guaranteed.
Abstract: A new image steganography algorithm combining compressive sensing with subsampling is proposed, which can hide secret message into an innovative embedding domain. Considering that natural image tends to be compressible in a transform domain, the characteristics of compressive sensing (CS), dimensional reduction and random projection, are utilized to insert secret message into the compressive sensing transform domain of the sparse image and the measurement matrix which is generated by using a secret key is shared between sender and receiver. Then, stego-image is reconstructed approximately via Total Variation (TV) minimization algorithm. Through adopting different transform coefficients in sub-images gained by subsampling, high perceived quality of the stego-image can be guaranteed. Bit Correction Rate (BCR) between original secret message and extracted message are used to calculate the accuracy of this method. Numerical experiments show that this steganography algorithm has provided a novel data embedding domain and high security of information.

44 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