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 tradeoff 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.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Visualization, Selection, and Analysis of Traffic FlowsABSTRACT:Visualization of the trajectories of moving objects results in dense and cluttered images, that hinders exploration and understanding. It also hinders
PROJECT TITLE :A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data - 2013ABSTRACT:Feature selection involves identifying a subset of the most useful features that produces compatible results as
PROJECT TITLE :Projection-Based Augmented Reality in Disney Theme ParksABSTRACT:Walt Disney Imagineering and Disney Analysis Zürich are building a projector- camera toolbox to help create spatially augmented 3D objects and

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry