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

Temporal median filter is one of most popular background subtraction methods. However, median operation is very time-consuming which limits its applications. This paper presents a fast algorithm to reduce the computation time of the temporal median operation. By utilizing the characteristics of high correlation of adjacent frames, the fast algorithm designs a simple mechanism to check whether the median of the current frame is equal to that of the previous frame. The proposed algorithm reduces the computing frequency of median operations significantly, and the experimental results indicate it is much faster than the existing algorithms.

Speed Up Temporal Median Filter for Background Subtraction

Intelligent Watermarking Techniques (Innovative Intelligence)

Distribution network reconfiguration with distributed generation based on parallel slime mould algorithm

This paper presents a novel feature point based image watermarking scheme to achieve high capacity information hiding and generalized watermark robustness. The key idea is to embed a binary watermark image into multi-scale feature point based local characteristic regions in transform domain. Watermark synchronization is first achieved by the characteristic regions, which can be extracted using the scale-invariant feature transform and image normalization. Then the watermark image is embedded in a content-based manner by modifying the wavelet transform coefficients. In the detector, the watermark can be extracted from the distorted image directly. Experimental results on Stirmark benchmark 4.0 show that the proposed scheme can resist both traditional signal processing attacks and geometric attacks. Comparisons also demonstrate the advantages of the scheme.

Characteristic region based watermark embedding with RST invariance and high capacity

In this paper, we propose Fish Migration Optimization (FMO) method based on a verified equation of the fish swim in the fish biology for solving numerical optimization problems. Inspired by the fish migration, the migration and the swim model are integrated into the optimization process. Four benchmark functions are used to test the convergence, the accuracy and the speed of FMO, and the experimental results are compared with PSO. The experimental result indicates that the proposed FMO presents higher accuracy and convergence speed.

Jeng-Shyang Pan

Papers

Speed Up Temporal Median Filter for Background Subtraction

Intelligent Watermarking Techniques (Innovative Intelligence)

Distribution network reconfiguration with distributed generation based on parallel slime mould algorithm

Characteristic region based watermark embedding with RST invariance and high capacity

Fish Migration Optimization Based on the Fishy Biology