Git Product home page Git Product logo

00_separation-free-super-resolution's Introduction

This file provides overall picture of separation-free super-resolution project.

Created by JYI, 01/27/2021

------------------------------
ToDos
- clean codes and data
- experimental results demonstration of HMC and ANM
  with noiseless observations: (1) under different frequency separations; 
  (2) different sampling patterns; (3) different number of atoms; 
  (4) different sampling complexity; (5) different types of atoms
- experimental results demonstration of HMC and ANM 
  with noisy observations: (0) under different noise levels; 
  (1) under different frequency separations; 
  (2) different sampling patterns; (3) different number of atoms; 
  (4) different sampling complexity; (5) different types of atoms
- experimental results demonstration of HMC and ANM in phase transition figures:
  (0) under different noise levels; 
  (1) under different frequency separations; 
  (2) different sampling patterns; (3) different number of atoms; 
  (4) different sampling complexity; (5) different types of atoms
- 
- experimental results demonstration for successful recovery rate wrt separation
- experimental results demonstration for theorems

experimental results demonstration for atom separation lower bound 
  in [Xu et al., 2017] and [Tang et al., 2015]
- generate a sequence of frequencies ==> get atoms
- directly calculate atom distance by using the atoms corresponding 
  to the closest two frequencies
- directly calculate atom distance by using formula in Theorem 4


Reviewer's comments 1st round
- frequency separation in [Tang et al., 2015] is 2/((2N-2)*2pi) or 1/(N-1)
- In uniform sample at integer indices case, 
  why the frequency separation is 0.167 instead of 1/3 when 2N-2=2?
- The computation for frequency from atom separation can be problematic
- For calculating the bound from [Tang et al., 2015]: (1) directly set the 
  two frequencies to be apart by frequency separation df; 
  (2) construct two atoms, and calculate the atom distance
- For calculating the bound from [Xu et al., 2017]: (1) set the 
  frequencies to be on the grid; (2) for the atom set and construct the matrix;
  (3) calculate the atom bound from Theorem 4; (4) use interpolation relation between
  atom separation and frequency separation to estimate the frequency separation;
- When obtaining the interpolation relation: (1) one of the frequency should be fixed as 0
- why does Theorem 4 always give atom lower bound of 2?
- In non-uniform sampling (with missing samples) at integer indices, is the frequency separation
  lower bound 2/(N_max*2*pi) or 2/N_max?
- give details about how the bounds are computed


software development
- 

------------------------------


------------------------------


------------------------------

00_separation-free-super-resolution's People

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.