CLEAR: Covariant LEAst-square Re-fitting with applications to image restoration

In this paper, we propose a new framework to remove parts of the systematic errors affecting popular restoration algorithms, with a special focus for image processing tasks. Generalizing ideas that emerged for $\ell_1$ regularization, we develop an approach re-fitting the results of standard methods towards the input data. Total variation regularizations and non-local means are special cases of interest. We identify important covariant information that should be preserved by the re-fitting method, and emphasize the importance of preserving the Jacobian (w.r.t. the observed signal) of the original estimator. Then, we provide an approach that has a "twicing" flavor and allows re-fitting the restored signal by adding back a local affine transformation of the residual term. We illustrate the benefits of our method on numerical simulations for image restoration tasks

Robust adaptive filtering algorithms for system identification and array signal processing in non-Gaussian environment

This dissertation proposes four new algorithms based on fractionally lower order statistics for adaptive filtering in a non-Gaussian interference environment. One is the affine projection sign algorithm (APSA) based on L₁ norm minimization, which combines the ability of decorrelating colored input and suppressing divergence when an outlier occurs. The second one is the variable-step-size normalized sign algorithm (VSS-NSA), which adjusts its step size automatically by matching the L₁ norm of the a posteriori error to that of noise. The third one adopts the same variable-step-size scheme but extends L₁ minimization to Lp minimization and the variable step-size normalized fractionally lower-order moment (VSS-NFLOM) algorithms are generalized. Instead of variable step size, the variable order is another trial to facilitate adaptive algorithms where no a priori statistics are available, which leads to the variable-order least mean pth norm (VO-LMP) algorithm, as the fourth one. These algorithms are applied to system identification for impulsive interference suppression, echo cancelation, and noise reduction. They are also applied to a phased array radar system with space-time adaptive processing (beamforming) to combat heavy-tailed non-Gaussian clutters. The proposed algorithms are tested by extensive computer simulations. The results demonstrate significant performance improvements in terms of convergence rate, steady-state error, computational simplicity, and robustness against impulsive noise and interference --Abstract, page iv

A technique for improved stability of adaptive feedforward controllers without detailed uncertainty measurements

Model errors in adaptive controllers for reduction of broadband noise and vibrations may lead to unstable systems or increased error signals. Previous work has shown that the addition of a low-authority controller that increases damping in the system may lead to improved performance of an adaptive, high-authority controller. Other researchers have suggested to use frequency dependent regularization based on measured uncertainties. In this paper an alternative method is presented that avoids the disadvantages of these methods namely the additional complex hardware, and the need to obtain detailed information of the uncertainties. An analysis is made of an active noise control system in which a difference exists between the secondary path and the model as used in the controller. The real parts of the eigenvalues that determine the stability of the system are expressed in terms of the amount of uncertainty and the singular values of the secondary path. Based on these expressions, modifications of the feedforward control scheme are suggested that aim to improved performance without requiring detailed uncertainty measurements. For an active noise control system in a room it is shown that the technique leads to improved performance in terms of robustness and the amount of reduction of the error signals

Fast exact variable order affine projection algorithm

Variable order affine projection algorithms have been recently presented to be used when not only the convergence speed of the algorithm has to be adjusted but also its computational cost and its final residual error. These kind of affine projection (AP) algorithms improve the standard AP algorithm performance at steady state by reducing the residual mean square error. Furthermore these algorithms optimize computational cost by dynamically adjusting their projection order to convergence speed requirements. The main cost of the standard AP algorithm is due to the matrix inversion that appears in the coefficient update equation. Most efforts to decrease the computational cost of these algorithms have focused on the optimization of this matrix inversion. This paper deals with optimization of the computational cost of variable order AP algorithms by recursive calculation of the inverse signal matrix. Thus, a fast exact variable order AP algorithm is proposed. Exact iterative expressions to calculate the inverse matrix when the algorithm projection order either increases or decreases are incorporated into a variable order AP algorithm leading to a reduced complexity implementation. The simulation results show the proposed algorithm performs similarly to the variable order AP algorithms and it has a lower computational complexity. © 2012 Elsevier B.V. All rights reserved.Partially supported by TEC2009-13741, PROMETEO 2009/0013, GV/ 2010/027, ACOMP/2010/006 and UPV PAID-06-09.Ferrer Contreras, M.; Gonzalez, A.; Diego Antón, MD.; Piñero Sipán, MG. (2012). Fast exact variable order affine projection algorithm. Signal Processing. 92(9):2308-2314. https://doi.org/10.1016/j.sigpro.2012.03.007S2308231492