2015 Fifth International Conference on Advances in Computing and Communications (ICACC) 2015
DOI: 10.1109/icacc.2015.22
|View full text |Cite
|
Sign up to set email alerts
|

CS Based Acoustic Source Localization and Sparse Reconstruction Using Greedy Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…A sparse solution modelling the locations of targets was then reconstructed by the basis pursuit (BP) algorithm [13] with high computational complexity. To reduce computational cost, the orthogonal matching pursuit (OMP) algorithm [14] in a greedy manner was applied to estimate the locations of targets by l0-norm minimization. Another greedy matching pursuit (GMP) algorithm [15] tried to select an optimal 1-sparse vector at each iteration (i.e., the location of a target), which inevitably led to much localization time.…”
Section: Introductionmentioning
confidence: 99%
“…A sparse solution modelling the locations of targets was then reconstructed by the basis pursuit (BP) algorithm [13] with high computational complexity. To reduce computational cost, the orthogonal matching pursuit (OMP) algorithm [14] in a greedy manner was applied to estimate the locations of targets by l0-norm minimization. Another greedy matching pursuit (GMP) algorithm [15] tried to select an optimal 1-sparse vector at each iteration (i.e., the location of a target), which inevitably led to much localization time.…”
Section: Introductionmentioning
confidence: 99%