Sorry, you need to enable JavaScript to visit this website.

The power of particle filters in tracking the state of non-linear and non-Gaussian systems stems not only from their simple numerical implementation but also from their optimality and convergence properties. In particle filtering, the posterior distribution of the state is approximated by a discrete mass of samples, called particles, that stochastically evolve in time according to the dynamics of the model and the observations. Particle filters have been shown to converge almost surely toward the optimal filter as the number of particles increases.


The QR (Quick Response) code is a two-dimensional barcode, which was designed for storage information and high speed reading applications. Being cheap to produce and fast to read, it becomes actually a popular solution for product labeling.
Ones try to make QR code a solution against counterfeiting. We present a novel technique that permits to create a secure printed QR code which is robust


The sequential analysis of the problem of joint signal detection and signal-to-noise ratio (SNR) estimation for a linear Gaussian observation model is considered. The problem is posed as an optimization setup where the goal is to minimize the number of samples required to achieve the desired (i) type I and type II error probabilities and (ii) mean squared error performance.


State filtering is a key problem in many signal processing applications. From a series of noisy measurement, one would like to estimate the state of some dynamic system. Existing techniques usually adopt a Gaussian noise assumption which may result in a major degradation in performance when the measurements are with the presence of outliers. A robust algorithm immune to the presence of outliers is desirable.


One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this paper, we propose AMOS, an automated model order selection algorithm for SGC.


In this work, we propose a new regularization approach for linear least-squares problems with random matrices. In
the proposed constrained perturbation regularization approach, an artificial perturbation matrix with a bounded norm is forced
into the system model matrix. This perturbation is introduced to improve the singular-value structure of the model matrix and,


The ability to obtain accurate estimators from a set of measurements is a key factor in science and engineering. Typically, there is an inherent assumption that the measurements were taken in a sequential order, be it in space or time. However, data is increasingly irregular so this assumption of sequentially obtained measurements no longer holds. By leveraging notions of graph signal processing to account for these irregular domains, we propose an unbiased estimator for the mean of a wide sense stationary graph process based on the diffusion of a single realization.