2008
DOI: 10.1109/tsp.2008.928160
|View full text |Cite
|
Sign up to set email alerts
|

Improved M-FOCUSS Algorithm With Overlapping Blocks for Locally Smooth Sparse Signals

Abstract: Abstract-The FOCal Underdetermined System Solver (FO-CUSS) algorithm has already found many applications in signal processing and data analysis, whereas the regularized M-FOCUSS algorithm has been recently proposed by Cotter et al. for finding sparse solutions to an underdetermined system of linear equations with multiple measurement vectors. In this paper, we propose three modifications to the M-FOCUSS algorithm to make it more efficient for sparse and locally smooth solutions. First, motivated by the simulta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 55 publications
(39 citation statements)
references
References 85 publications
0
39
0
Order By: Relevance
“…However, smoothness is a special kind of correlation structures. It is not helpful when adjacent regression coefficients are not smooth (but still correlated), as shown in [20] in the comparison between the T-MSBL algorithm [20] and a smoothness constrained sparse algorithm in [51]. More general correlation structures were studied in [10], [20], [21], which did not constrain the smoothness in regression coefficients.…”
Section: Discussionmentioning
confidence: 99%
“…However, smoothness is a special kind of correlation structures. It is not helpful when adjacent regression coefficients are not smooth (but still correlated), as shown in [20] in the comparison between the T-MSBL algorithm [20] and a smoothness constrained sparse algorithm in [51]. More general correlation structures were studied in [10], [20], [21], which did not constrain the smoothness in regression coefficients.…”
Section: Discussionmentioning
confidence: 99%
“…The FOCUSS algorithm is based on the iteratively reweighted least squares algorithm, and enforces a certain degree of sparsity [28]. The sparsity is determined by λ (the sparsity of u increases with λ), and λ balances between sparsity and the residual error.…”
Section: Methodsmentioning
confidence: 99%
“…The GCV-FOCUSS+ algorithm is based on FOCUSS+ [20] that solves for nonnegative u such that u has a certain maximum sparsity n (i.e., n = 22 for the HPA axis), and uses the generalized cross-validation (GCV) technique [9] for estimating the regularization parameter. In particular, GCV-FOCUSS+ is closely related to a version of the FOCUSS algorithm by Zdunek et al [28], which uses the GCV technique for updating the regularization parameter λ. Choosing a λ value that balances between the noise and sparsity is important in detecting the sparsity level.…”
Section: Methodsmentioning
confidence: 99%
“…Based on the "sparsity" assumption, the compressed sensing techniques are suitable for such situations by estimating the angular spectrum from underdetermined system of equations. In particular, the MFOCUSS [5] algorithm is used. The simulation example in Figure 9 again assumes the array antenna pattern based on the single subarray in Figure 1.…”
Section: Compressive Sensing Solutionmentioning
confidence: 99%