pith. sign in

arxiv: 1302.1094 · v2 · pith:55IDBRPGnew · submitted 2013-02-05 · 💻 cs.IT · math.IT

Analysis Based Blind Compressive Sensing

classification 💻 cs.IT math.IT
keywords analysismodelnoiseoperatorproblemadaptivelyaddressalgorithm
0
0 comments X
read the original abstract

In this work we address the problem of blindly reconstructing compressively sensed signals by exploiting the co-sparse analysis model. In the analysis model it is assumed that a signal multiplied by an analysis operator results in a sparse vector. We propose an algorithm that learns the operator adaptively during the reconstruction process. The arising optimization problem is tackled via a geometric conjugate gradient approach. Different types of sampling noise are handled by simply exchanging the data fidelity term. Numerical experiments are performed for measurements corrupted with Gaussian as well as impulsive noise to show the effectiveness of our method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.