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.

Mean shift: a robust approach toward feature space analysis

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.

Digital Watermarking

/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

A morphable model for the synthesis of 3D faces

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.

PORs: Proofs of Retrievability for Large Files

The letter proposes a novel subsampling-based digital image watermarking scheme resisting the permutation attack. The subsampling-based watermarking schemes have drawn great attention for their convenience and effectiveness in recent years, but the traditional subsampling-based watermarking schemes are very vulnerable to the permutation attack. In this letter, the watermark information is embedded in the average values of the 1-level DWT coefficients to resist the permutation attack. The concrete embedding process is achieved by the quantization-based method. Experimental results show that the proposed scheme can resist not only the permutation attack but also some common image processing attacks.

A Subsampling-Based Digital Image Watermarking Scheme Resistant to Permutation Attack

Antlion Optimization Algorithm (ALO) is a promising bionic swarm intelligence algorithm, which has good robustness and convergence, but there are still many areas to be improved and modified. Aiming at the fact that the ALO algorithm is more likely to fall into the local optimum, proposes three strategies to improve the classic ALO algorithm in this paper. First of all, we adopt a parallel idea in the algorithm, through the communication strategy between groups based on Quantum-Behaved to enhance the diversity of the population. Secondly, we adopted two strategies, Opposition Learning, and Gaussian Mutation, to balance the performance of exploration and exploitation during the execution of the algorithm, further formed the MSALO algorithm. The CEC2013 Benchmark function is selected as the standard, and MSALO is compared with other intelligent optimization algorithms. The experimental results show that MSALO has stronger optimization performance compared with other intelligent algorithms. Besides, we applied MSALO to the practical scenarios of feature selection, and use SVM classifiers as training evaluators to improve the accuracy of feature extraction from high-dimensional data.

Multi-strategy improved parallel antlion algorithm and applied to feature selection

This study suggests a new metaheuristic algorithm for global optimization, based on parallel hybridizing the swarm optimization (PSO) and Gravitational search algorithm (GSA). Subgroups of the population are formed by dividing the swarm’s community. Communication between the subsets can be developed by adding strategies for the mutation. Twenty-three benchmark functions are used to test its performance to verify the feasibility of the proposed algorithm. Compared with the PSO, GSA, and parallel PSO (PPSO), the findings of the proposed algorithm reveal that the proposed PPSOGSA achieves higher precision than other competitor algorithms.

Jeng-Shyang Pan

Papers

A Subsampling-Based Digital Image Watermarking Scheme Resistant to Permutation Attack

Multi-strategy improved parallel antlion algorithm and applied to feature selection

A New Optimization Based on Parallelizing Hybrid PSOGSA Algorithm

A novel quantum image watermarking scheme for tamper localization and self-recovery

FPGA demonstration for WLAN-OFDM baseband receiver