2015Unpublished venueRequires access

Image Adaptive Reconstruction Based on Compressive Sensing via CoSaMP

Lin Zhang

Open publisher page 7 citations

Abstract

Compressive Sampling Matching Pursuit (CoSaMP) is a new iterative recovery algorithm which has splendid theoretical guarantees for convergence and delivers the same guarantees as the best optimization-based approaches. In this paper, we propose a new signal recovery framework which combines the CoSaMP and the genetic algorithm (GA) for better performance. In classic CoSaMP, the number of iterations is fixed. We discuss a new stopping rule to halting the algorithm in this paper. In addition, the choice of several adjustable parameters in the algorithm such as the number of measurements and the sparse level of the signal also will impact the performance. So we gain above parameters via the GA and a large number of experiments. The experiment shows that the new method not only has better recovery quality and higher PSNRs, but also can effectively avoid the premature convergence problem and achieve optimization steadily.

About this research paper

What this paper is about

Compressive Sampling Matching Pursuit (CoSaMP) is a new iterative recovery algorithm which has splendid theoretical guarantees for convergence and delivers the same guarantees as the best optimization-based approaches. In this paper, we propose a new signal recovery framework which combines the CoSaMP and the genetic algorithm (GA) for better performance. In classic CoSaMP, the number of iterations is fixed. We discuss a new stopping rule to halting the algorithm in this paper. In addition, the choice of several adjustable parameters in the algorithm such as the number of measurements and the sparse level of the signal also will impact the performance. So we gain above parameters via the GA and a large number of experiments. The experiment shows that the new method not only has better recovery quality and higher PSNRs, but also can effectively avoid the premature convergence problem and achieve optimization steadily.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Compressive Sampling Matching Pursuit (CoSaMP) is a new iterative recovery algorithm which has splendid theoretical guarantees for convergence and delivers the same guarantees as the best optimization-based approaches. In this paper, we propose a new signal recovery framework which combines the CoSaMP and the genetic algorithm (GA) for better performance. In classic CoSaMP, the number of iterations is fixed. We discuss a new stopping rule to halting the algorithm in this paper. In addition, the choice of several adjustable parameters in the algorithm such as the number of measurements and the sparse level of the signal also will impact the performance. So we gain above parameters via the GA and a large number of experiments. The experiment shows that the new method not only has better recovery quality and higher PSNRs, but also can effectively avoid the premature convergence problem and achieve optimization steadily.

Key concepts: Compressed sensing, Matching pursuit, Signal recovery, Convergence (economics), Computer science, Stopping rule, SIGNAL (programming language), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Image Adaptive Reconstruction Based on Compressive Sensing via CoSaMP — Research Paper | ScholarLens