Computer Science – Systems and Control
Scientific paper
2011-11-08
Computer Science
Systems and Control
sparsity, compressive sensing; IEEE Trans on Signal Processing 2012
Scientific paper
10.1109/TSP.2011.2173682
In this paper, we improve iterative greedy search algorithms in which atoms are selected serially over iterations, i.e., one-by-one over iterations. For serial atom selection, we devise two new schemes to select an atom from a set of potential atoms in each iteration. The two new schemes lead to two new algorithms. For both the algorithms, in each iteration, the set of potential atoms is found using a standard matched filter. In case of the first scheme, we propose an orthogonal projection strategy that selects an atom from the set of potential atoms. Then, for the second scheme, we propose a look ahead strategy such that the selection of an atom in the current iteration has an effect on the future iterations. The use of look ahead strategy requires a higher computational resource. To achieve a trade-off between performance and complexity, we use the two new schemes in cascade and develop a third new algorithm. Through experimental evaluations, we compare the proposed algorithms with existing greedy search and convex relaxation algorithms.
Chatterjee Saikat
Skoglund Mikael
Sundman Dennis
Vehkaperä Mikko
No associations
LandOfFree
Projection-Based and Look Ahead Strategies for Atom Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Projection-Based and Look Ahead Strategies for Atom Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projection-Based and Look Ahead Strategies for Atom Selection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-54347