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 ChapterDOI
13 Sep 2014
TL;DR: The pre Large concept is adopted to maintain and update the built FUSP tree with sequence deletion when the number of deleted customers is smaller than the safety bound of the prelarge concept, the original database is unnecessary to be rescanned but the sequential patterns can still be actually maintained and updated.
Abstract: Among various data mining techniques, sequential-pattern mining is used to discover the frequent subsequences from a sequence database. Most research handles the static database in batch mode to discover the desired sequential patterns. Transactions or customer sequences are, however, dynamically changed in real-world applications. In the past, the FUSP tree was designed to maintain and update the discovered information based on Fast UPdated (FUP) approach with sequence insertion and sequence deletion. The original customer sequences is still required to be rescanned if it is necessary. In this paper, the prelarge concept is adopted to maintain and update the built FUSP tree with sequence deletion. When the number of deleted customers is smaller than the safety bound of the prelarge concept, the original database is unnecessary to be rescanned but the sequential patterns can still be actually maintained and updated. Experiments are also conducted to show the performance of the proposed algorithm in terms of execution time and number of tree nodes.
Proceedings ArticleDOI
18 Dec 2006
TL;DR: Experimental results show that the proposed subsampling and quantization based watermarking scheme can resist not only the permutation attack but also some common image processing attacks.
Abstract: The paper proposed a subsampling and quantization based watermarking scheme to resist the permutation attack. The subsampling based watermarking schemes have drawn great attention for its convenience and effectiveness recently, but this kind of watermarking schemes is very vulnerable to the permutation attack. In this paper, the watermark information is embedded into the average values of the 3-level DWT coefficients to resist the permutation attack. Experimental results show that the proposed scheme can resist not only the permutation attack but also some common image processing attacks.
DOI
01 Jan 2022
TL;DR: In this paper, the authors assume that WSN uses routing algorithm assumptions in the protocol, and start from the node position and direction information, and consider the dynamic evolution of the network.
Abstract: The WSN uses wireless communication to realize its information transmission. WSN is a network data system composed of a large number of wireless data collectors with sensing functions. In the WSN-based sensing function structure, the size should be small, more power saving, low price, and can achieve design goals. This study first assumes that WSN uses routing algorithm assumptions in the protocol, and starts from the node position and direction information, and considers the dynamic evolution of the network. Each public node has random mobility, and the WSN node can help determine the location information of the public node, and then use the node location information to have effective routing performance and effective. However, the experimental results also strongly support the energy saving ability of this research. In the overall system energy saving and power consumption reduction, the actual electric energy hazard is greatly reduced, so in the spirit of ISD strategies, if the WSN system is installed in a high-risk and explosive atmosphere, it can significantly improve the safety level.
Book ChapterDOI
10 Nov 2010
TL;DR: The embedding process in Lin's method is modified to keep the third pixel of a pixel block unaltered in the proposed method, so that the embedding rate can reach to 1 bpp for a singleembedding process.
Abstract: In Lin's method [1], images are divided into non-overlapping three-pixel blocks. Each pixel block contains two pairs composed of two neighboring pixels. Absolute differences between pairs are calculated. And meanwhile, the absolute difference having the highest occurrence rate is obtained. 1-bit watermark is embedded into a pixel pair whose absolute difference is equal to this obtained value. Since each pixel block contains two differences, Lin's method achieves embedding rate of at most 2/3 bpp (bit per pixel) for a single embedding process. With the aim of further increasing embedding rate, we modify the embedding process in Lin's method to keep the third pixel of a pixel block unaltered in the proposed method. Then, this unchanged pixel is used again to reform into a new pixel block with its two neighboring pixels. As a result, the embedding rate can reach to 1 bpp for a single embedding process.
01 Jan 2019
TL;DR: Experimental results demonstrate that the proposed algorithm is superior to the reference method in terms of high storage capacity and resistance to P&S process.
Abstract: Aiming at increasing the capacity of Quick Response (QR) codes that are resistant to print-and-scan(P&S) process, this paper proposes a two-level QR code that replaces the black and white modules in the standard QR code with specially designed modules. First, at the encoder side, during the generation of two-level QR code, error correction code (ECC) and stream encryption are used for the second-level message to ensure security. Then, taking the second-level message into consideration, the black and white modules in the standard QR code are replaced with the specific modules designed. At the decoder side, the first-level message can be decoded and recognized by the standard QR code scanner. The second-level message can be extracted with the help of demodulator and secret key. Finally, considering the impact of the P&S process on two-level QR code images, four low-pass textured patterns are designed for white and black modules. Experimental results demonstrate that the proposed algorithm is superior to the reference method in terms of high storage capacity and resistance to P&S process.

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