Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This paper deals with the important problem of parameter estimation in the presence of bounded data uncertainties. Its recent closed-form solution in leads to more meaningful results than alternative methods (e.g., total least-squares and robust estimation), when a priori bounds about the uncertainties are available.The derivation in requires the computation of the SVD of thedata matrix and the determination of the unique positive root of a non-linear equation.This paper establishes the existence of a fundamental contraction mapping and uses this observation to propose an approximate recursive algorithm that avoids the need for explicit SVDs and for the solution of the nonlinear equation. Simulation results are included to demonstrate the good performance of the recursive scheme.
Alexandre Caboussat, Dimitrios Gourzoulidis
Thomas Alois Weber, Philipp Schneider