Abstract
Compressive sensing (CS) is a new sampling theory used in many signal processing applications due to its simplicity and efficiency. However, signal reconstruction is considered as one of the biggest challenge faced by the CS method. Therefore in this paper, we aim to address this challenge by proposing an Adaptive Iterative Forward–Backward Greedy Algorithm (AFB). AFB algorithm is different from all other reconstruction algorithms, as it depends on solving the least squares problem in the forward phase, which increases the probability of selecting the correct columns better than other reconstruction algorithms. In addition, AFB improves the selection process by removing the incorrect columns selected in the previous step. To evaluate the AFB’s reconstruction performance, we used two types of data: computer-generated data and real data set (Intel Berkeley data set). The simulation results show that AFB outperforms Forward–Backward Pursuit, Subspace Pursuit, Orthogonal Matching Pursuit, and Regularized OMP in terms of reducing reconstruction error.