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: This letter presents an improved visible watermarking scheme for halftone images that incorporates watermark embedding into ordered dither halftoning by threshold modulation and is content adaptive because it takes local intensity information of the host image into account.
Abstract: This letter presents an improved visible watermarking scheme for halftone images. It incorporates watermark embedding into ordered dither halftoning by threshold modulation. The input images include a continuous-tone host image (e.g. an 8-bit gray level image) and a binary watermark image, and the output is a halftone image with a visible watermark. Our method is content adaptive because it takes local intensity information of the host image into account. Experimental results demonstrate effectiveness of the proposed technique. It can be used in practical applications for halftone images, such as commercial advertisement, content annotation, copyright announcement, etc.

6 citations

20 Aug 2010
TL;DR: In this article, the optimal economic dispatch (ED) through Cat Swarm Optimization (CSO) algorithm is studied for wind generator capacity integration into an isolated power system, and the CSO is also extended to coordinate wind and thermal dispatch and to minimize total generation cost.
Abstract: The aim of this research is to study the optimal economic dispatch (ED) through Cat Swarm Optimization (CSO) algorithm. Several techniques are applied to determine the proportion of wind generator capacity that can be integrated into an isolated system. The CSO is also extended to coordinate wind and thermal dispatch and to minimize total generation cost. Numerical experiments are included to demonstrate various constraints in production cost analysis and to provide valuable information for both operational and planning problems in the Taiwan power system.

6 citations

Book ChapterDOI
26 Nov 2018
TL;DR: The proposed Module Expansion (ME) based method for embedding message into QR code can be used in QR code applications such as the anti-counterfeiting for encoded message of a printed QR code, and others for which message sharing is needed.
Abstract: With the development of the Internet and smart terminals, Quick Response (QR) code and its related applications become increasingly popular. Though there are plenty of advantages for the usage of QR code, but its security issue is always a problem that can not be overlooked. Aiming for embedding message into QR code, a Module Expansion (ME) based method is proposed in this paper. The core idea of ME is to expand a module to its neighbor if these two modules are in different colors. Experimental results show that (1) our capacity for embedding is about half of that for encoding of the same QR code, which is much higher comparing to the state-of-the-art methods, (2) for the QR codes of versions under 20, the average time cost for embedding and extraction is around 51 ms and 59 ms respectively, (3) the success ratio of message extraction under noise attack and print-and-scan process are both higher than 80%. The proposed method can be used in QR code applications such as the anti-counterfeiting for encoded message of a printed QR code, and others for which message sharing is needed.

6 citations

01 Jan 2018
TL;DR: It is found chosen-plaintext attack can break the scheme, and an improvement method is made for overcome the drawback.
Abstract: In this paper, we make cryptanalysis on an image encryption scheme based on chaotic Tent map proposed by Li et al. [5]. We find chosen-plaintext attack can break the scheme. And we successfully carry out the chosen-plaintext attack. Last, we make an improvement method for overcome the drawback.

6 citations

BookDOI
01 Jan 2014
TL;DR: A Lagrangian relaxation approach is adopted to developing efficient multi-agent learning algorithm for solving the WDP in combinatorial double auctions and results indicate the agent learning approach is more efficient than the centralized approach.
Abstract: The winner determination problem (WDP) in combinatorial double auctions suffers from computation complexity. In this paper, we attempt to solve the WDP in combinatorial double auctions based on an agent learning approach. Instead of finding the exact solution, we will set up a fictitious market based on multi-agent system architecture and develop a multi-agent learning algorithm to determine the winning bids in the fictitious market to reduce the computational complexity in solving the WDP in combinatorial double auctions. In the fictitious market, each buyer and each seller is represented by an agent. There is a mediator agent that represents the mediator. The issue is to develop learning algorithms for all the agents in the system to collectively solve the winner determination problem for combinatorial double auctions. In this paper, we adopt a Lagrangian relaxation approach to developing efficient multi-agent learning algorithm for solving the WDP in combinatorial double auctions. Numerical results indicate our agent learning approach is more efficient than the centralized approach.

6 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