compsense.problems.problemBase

class compsense.problems.problemBase(name, noseed=False)[source]

Base class for all CS problems. The problems follow the quation below:

A x = b
A = M B

where A is an operator acting on a sparse signal x and b is the observation vector. A can be factored into M which represents the system response and B basis that sparsifies the signal.

Attributes :

name : string

Name of problem.

A : Instance of a subclass of opBase

The A matrix of the problem.

M : Instance of a subclass of opBase

M, sampling matrix of the problem.

B : Instance of a subclass of opBase

B, sparsifying basis matrix of the problem.

b : array of arbitrary shape

:math:’b’, observation array.

signal : array of arbitrary shape

Signal in original basis (Not in the sparsifying basis)

signal_shape : tuple of integers

:math:’b’, Shape of the signal in the sparsifying basis.

Methods :

reconstruct : Reconstruct signal from sparse coefficients.

Parameters :

name : str

Name of the problem

noseed: Boolean, optional (default=False) :

When False, the random seed is reset to 0.

Attributes

A Response of the problem
B Base matrix
M Sampling matrix
b Observation vector
name Name of the problem
signal Signal (Not in sparsifying basis)
signal_shape Shape of the signal
x0 Solution to problem

Previous topic

compsense.operators.op3DStack

Next topic

compsense.problems.problemBase.reconstruct

This Page