Volume 17, 2013
|Page(s)||485 - 499|
|Published online||03 June 2013|
Adaptive hard-thresholding for linear inverse problems
Institut de Mathématiques de Toulouse, Université Paul Sabatier
Toulouse III, 118 route de
Received: 2 May 2011
Revised: 9 November 2011
A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. These filter methods are generally restricted to monotonic transformations, e.g. the Tikhonov regularization or the spectral cut-off. However, in several cases, non-monotonic sequences of filters may appear more appropriate. In this paper, we study a hard-thresholding regularization method that extends the spectral cut-off procedure to non-monotonic sequences. We provide several oracle inequalities, showing the method to be nearly optimal under mild assumptions. Contrary to similar methods discussed in the literature, we use here a non-linear threshold that appears to be adaptive to all degrees of irregularity, whether the problem is mildly or severely ill-posed. Finally, we extend the method to inverse problems with noisy operator and provide efficiency results in a conditional framework.
Mathematics Subject Classification: 62G08 / 62J02
Key words: Inverse problems / singular value decomposition / hard-thresholding
© EDP Sciences, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.