..
Suche

Personensuche
Veranstaltungssuche
Katalog der UB Siegen

RFMP

  RFMP - Regularized Functional Matching Pursuit

Today, many different systems of trial functions are available for handling geoscientific problems or - mathematically formulated - for approximating functions on the sphere or the ball based on direct or indirect measurements. Spherical harmonics are a classical system of global trial functions with well-known possibilities of a physical interpretation but also with documented drawbracks e.g. in the case of heterogeneities in the data (with respect to the data quality or the data grid). On the other hand, numerous alternatives of localized trial functions have been constructed on the sphere and the ball  within the last three decades like Gaussian functions, Haar functions, Slepian functions, splines, and (multiple versions of) wavelets. They all have their intrinsic advantages and disadvantages.

The Regularized Functional Matching Pursuit (RFMP) is a novel algorithm that is able to combine different basis systems for solving an ill-posed inverse problem (e.g. in the geosciences). It is based on the Matching Pursuit (MP) by Mallat and Zhang (1993) and Vincent and Bengio (2002). The RFMP extends this algorithm in several aspects: (1) inverse problems can be handled, i.e. one can incorporate an equation which has to be solved, and the data and the solution need not be elements of the same space; (2) a regularization is included to treat ill-posed problems; (3) implementations for problems on non-Euclidean domains like a sphere or a ball have been realized.

The algorithm produces a sequence of approximations which converges to the regularized normal equation. Numerical experiments show that the RFMP produces a sparse representation of the solution, i.e. it needs essentially less trial functions for achieving the same accuracy of the result than considered alternative approaches. This sparsity is achieved because the algorithm is able to combine different kinds of trial functions and because it chooses only those trial functions (out of a large overcomplete set called a dictionary) which are the best choice to reduce the (regularized) data misfit fast.

The Regularized Orthogonal Functional Matching Pursuit (ROFMP) is an enhancement of the RFMP in the sense that it yields a representation of the solution in essentially less trial functions in comparison to the RFMP. This is achieved by a particular projection procedure which compensates for redundancies in the trial functions due to their non-orthogonality. Numerical tests for a scenario of the (severely ill-posed) downward continuation of noisy gravity data from a satellite orbit to the Earth's surface demonstrated the applicability of the ROFMP and its particular features and advantages. 

 

References: