2020
DOI: 10.1016/j.dsp.2020.102761
|View full text |Cite
|
Sign up to set email alerts
|

ℓ2,-correlation and robust matching pursuit for sparse approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…In recent years, people have invested a lot of energy in researching high-resolution technology to estimate the angle of arrival of sources on linear arrays in wireless communications, including astronomy, radar, smart grid, and sonar [1][2][3][4][5][6][7]. Algorithms like MUSIC [8] and ESPRIT [9] are based on subspace decomposition to solve uncorrelated signals with good performance.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, people have invested a lot of energy in researching high-resolution technology to estimate the angle of arrival of sources on linear arrays in wireless communications, including astronomy, radar, smart grid, and sonar [1][2][3][4][5][6][7]. Algorithms like MUSIC [8] and ESPRIT [9] are based on subspace decomposition to solve uncorrelated signals with good performance.…”
Section: Introductionmentioning
confidence: 99%
“…As shown above, the existing works either define a capped norm directly as a loss or apply the capped operation on elements or vectors. In fact, in [51], the authors defined a capped l 2,1 -norm of a matrix. In this paper, we introduce a general capped norm of a matrix, named capped l p,q -norm.…”
Section: Introductionmentioning
confidence: 99%