A Nonlinear Reconstruction Algorithm from Absolute Value of Frame Coefficients for Low Redundancy Fr...
Download
1 / 12

Radu Balan University of Maryland College Park, MD 208742 email: rvbalan@math.umd - PowerPoint PPT Presentation


  • 79 Views
  • Uploaded on
  • Presentation posted in: General

A Nonlinear Reconstruction Algorithm from Absolute Value of Frame Coefficients for Low Redundancy Frames. Radu Balan University of Maryland College Park, MD 208742 email: rvbalan@math.umd.edu SampTA 2009 - Marseille, France. Statement of the Problem. H=E n , where E= R or E= C

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha

Download Presentationdownload

Radu Balan University of Maryland College Park, MD 208742 email: rvbalan@math.umd

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Radu balan university of maryland college park md 208742 email rvbalan math umd

A Nonlinear Reconstruction Algorithm from Absolute Value of Frame Coefficients for Low Redundancy Frames

Radu Balan

University of Maryland

College Park, MD 208742

email: rvbalan@math.umd.edu

SampTA 2009 - Marseille, France


Statement of the problem

Statement of the Problem

  • H=En , where E=R or E=C

  • F={f1,f2,...,fm} a spanning set of m>n vectors

  • Assume the map:

    is injective up to a constant phase factor ambiguity

  • The Problem: Given c=N(x) construct a vector y equivalent to x (that is, invert N up to a constant phase factor)


Where is this problem relevant

Where is this problem relevant?

X-Ray Crystallography

Very thin layer, so that r is 2-D

Problem:

Given I(k) , estimate R(r).


What is known

What is known?

Theorem [R.B.,Casazza, Edidin, ACHA(2006)]

  • For E = R , m  2n-1, and a generic frame set F, then N is injective.

  • For E = C , m  4n-2, and a generic frame set F, then N is injective.


But how to invert

But how to invert?

  • Observation [R.B.,Bodman, Casazza, Edidin, SPIE(2007)/JFAA(2009)]

  • Algorithm: Assume {Kfk} is spanning in M(En)

  • Compute the dual set { } to {Kfk}

  • Compute

  • Compute

    Then y~x


Radu balan university of maryland college park md 208742 email rvbalan math umd

  • The algorithm is quasi-linear, but has a drawback: it requires a high redundancy.

  • Specifically: it requires m=O(n2)

    whereas we know that m=O(n) should be sufficient.

    This paper presents a novel algorithm that interpolates between O(n) and O(n2) keeping similar properties to the previous algorithm.


Nonlinear embedding

Nonlinear Embedding

  • Generalize xKx to (d,d) tensors:

  • and embed the frame set F into s.lin func.


Geometry

(En)

P

x

P

Geometry

En

Key Observation:


Dimension condition for linear reconstruction

Dimension Condition for Linear Reconstruction

Necessary Condition for Linear Reconstruction:


Radu balan university of maryland college park md 208742 email rvbalan math umd

Real Case: E=R

The condition:

is satisfied for

Note the critical case

m=2n-1 !!


Radu balan university of maryland college park md 208742 email rvbalan math umd

Complex Case: E=C

The condition:

is satisfied by the following (suboptimal) choice

Note m=O(n)

but larger than 4n-2


Is this enough

Is this enough?

  • We obtained a necessary condition for the set to be spanning in Ed.

  • However this is not a guarantee that this happens!

  • In our experimental testing the set is spanning in Ed.

  • Open Problem/Conjecture:

    is generically spanning in Ed.


ad
  • Login