Adaptive Regularized FOCUSS Algorithm

The sparse solutions obtained via the regularized version of FOCUSS (focal underdetermined system solver) are governed by the choice of a proper regularization parameter. Based on the principle of adaptive regularization algorithm (ARA) and regularized FOCUSS (R-FOCUSS) algorithm, this paper proposes an adaptive regularized FOCUSS (AR-FOCUSS) algorithm for solving an underdetermined linear system. Simulation results show that AR-FOCUSS is less sensitive to the choice of regularization parameter than R-FOCUSS, and the former outperforms the latter under the same conditions.

[1]  Dmitry M. Malioutov,et al.  A sparse signal reconstruction perspective for source localization with sensor arrays , 2005, IEEE Transactions on Signal Processing.

[2]  Bhaskar D. Rao,et al.  An affine scaling methodology for best basis selection , 1999, IEEE Trans. Signal Process..

[3]  Bhaskar D. Rao,et al.  Subset selection in noise based on diversity measure minimization , 2003, IEEE Trans. Signal Process..

[4]  S. Liu,et al.  Novel method for super-resolution in radar range domain , 1999 .

[5]  Bhaskar D. Rao,et al.  Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.

[6]  B. Rao.  Analysis and extensions of the FOCUSS algorithm , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[7]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[8]  Peter R. Johnston,et al.  Selecting the corner in the L-curve approach to Tikhonov regularization , 2000, IEEE Transactions on Biomedical Engineering.

[9]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.