A robust quasi-newton adaptive filtering algorithm for impulse noise suppression

This paper studies the problem of robust adaptive filtering in impulse noise environment using the Quasi-Newton (QN) adaptive filtering algorithm. An M-estimate based cost function is minimized instead of the commonly used mean square error (MSE) to suppress the adverse effect of the impulse noise on the filter coefficients. In particular, a new robust quasi-Newton (R-QN) algorithm using the self-scaling variable metric (SSV) method for unconstrained optimization is studied in details. Simulation results show that the R-QN algorithm is more robust to impulse noise in the desired signal than the RLS algorithm and other QN algorithm considered. Its initial convergence speed and tracking ability to sudden system change are also superior to those of the quasi-Newton algorithm proposed in [1].published_or_final_versio

A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation

Stochastic approximation techniques play an important role in solving many problems encountered in machine learning or adaptive signal processing. In these contexts, the statistics of the data are often unknown a priori or their direct computation is too intensive, and they have thus to be estimated online from the observed signals. For batch optimization of an objective function being the sum of a data fidelity term and a penalization (e.g. a sparsity promoting function), Majorize-Minimize (MM) methods have recently attracted much interest since they are fast, highly flexible, and effective in ensuring convergence. The goal of this paper is to show how these methods can be successfully extended to the case when the data fidelity term corresponds to a least squares criterion and the cost function is replaced by a sequence of stochastic approximations of it. In this context, we propose an online version of an MM subspace algorithm and we study its convergence by using suitable probabilistic tools. Simulation results illustrate the good practical performance of the proposed algorithm associated with a memory gradient subspace, when applied to both non-adaptive and adaptive filter identification problems

Generalized Kernel-based Visual Tracking

In this work we generalize the plain MS trackers and attempt to overcome standard mean shift trackers' two limitations. It is well known that modeling and maintaining a representation of a target object is an important component of a successful visual tracker. However, little work has been done on building a robust template model for kernel-based MS tracking. In contrast to building a template from a single frame, we train a robust object representation model from a large amount of data. Tracking is viewed as a binary classification problem, and a discriminative classification rule is learned to distinguish between the object and background. We adopt a support vector machine (SVM) for training. The tracker is then implemented by maximizing the classification score. An iterative optimization scheme very similar to MS is derived for this purpose.Comment: 12 page

Positioning and trajectory following tasks in microsystems using model free visual servoing

In this paper, we explore model free visual servoing algorithms by experimentally evaluating their performances for various tasks performed on a microassembly workstation developed in our lab. Model free or so called uncalibrated visual servoing does not need the system calibration (microscope-camera-micromanipulator) and the model of the observed scene. It is robust to parameter changes and disturbances. We tested its performance in point-to-point positioning and various trajectory following tasks. Experimental results validate the utility of model free visual servoing in microassembly tasks

Optimized Anisotropic Rotational Invariant Diffusion Scheme on Cone-Beam CT

Cone-beam computed tomography (CBCT) is an important image modality for dental surgery planning, with high resolution images at a relative low radiation dose. In these scans the mandibular canal is hardly visible, this is a problem for implant surgery planning. We use anisotropic diffusion filtering to remove noise and enhance the mandibular canal in CBCT scans. For the diffusion tensor we use hybrid diffusion with a continuous switch (HDCS), suitable for filtering both tubular as planar image structures. We focus in this paper on the diffusion discretization schemes. The standard scheme shows good isotropic filtering behavior but is not rotational invariant, the diffusion scheme of Weickert is rotational invariant but suffers from checkerboard artifacts. We introduce a new scheme, in which we numerically optimize the image derivatives. This scheme is rotational invariant and shows good isotropic filtering properties on both synthetic as real CBCT data