Skip to content

kalpeshdusane/Reducing-Basis-Mismatch-using-Alternating-Convex-Search

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 

Repository files navigation

Inferring Basis Mismatch in image representations

Objective is to reduce problem of Basis mismatch using Alternating Convex Search.

Build Status

Research Problem

In theory of compressive sensing,

equation

where eq And eq

Here we have to determine original signal/image z from Sensing matrix \Phi and measured signal/image y. For M < N$ , $y = \Phi z becomes under-determined and does not have a closed form solution for z(infinite many z's maps to same y).

But compressive sensing theory says we can uniquely estimate z from \Phi and y, given z should be sparse in some basis matrix say \Psi(commonly DFT, DCT or wavelet) which is theoretically known and \Phi should be incoherent with \Psi.

So equation becomes,

eq

where \Psi \in \R^{N\text{x}N} and x \in \R^{N}.

In practice, even small deviation from exact signal can cause drastic increase in estimation error. This is called Basis Mismatch problem.

Note- Basis mismatch always exists because of noise or discrete representation of bases as the sensed signal is almost never going to lay on the exact grid of \Psi. So sparse signals w.r.t. sparsifying matrix \Psi could become non-sparse or less sparse under another matrix say \Psi' , such that \Psi \Psi' \neq I.

Therefore it remained the predominant question of how to reduce the Basis Mismatch effect?

Solution Approaches

Previous Approaches:

  • Oversample the frequency space i.e. \Psi \in \R^{N\text{x}QN} contain sinusoids with frequencies 1 / QN apart instead of 1 / N apart.
  • Treat both the model coefficients and the associated frequency as unknown which need to be solved. Isolates the unknown frequencies in separate, non-overlapping bins and then solves for their location and amplitude.
  • Both frequency locations and amplitudes can be estimated by solving the constrained Atomic Norm Minimization by semi-definite programming. Also Atomic Norm Minimization constrain can be solved by greedy forward-backward (GFB) algorithm.

Proposed Approaches- Alternating Convex Search (ACS): This method is implemented as shown in this paper. Here, we solve the basis mismatch problem using Alternating Convex Search (ACS) which is trying to estimate both frequency bases matrix and coefficients.

eq

This method uses standard l_1 to find out the signal model coefficients i.e. x by keeping frequency parameter \theta fixed. Then using this coefficients find out the signal model using component-wise minimization like coordinate descent on the frequency parameter. These steps are repeated this until convergence criteria is met.

Dependencies

MATLAB

References

About

This is my course project for CS 754 Advanced Image Processing.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages