Iterative aperture mask design in phase space using a rank constraint | Zendy

Roarke Horstmeyer | Zendy; Se Baek Oh | Zendy; Ramesh Raskar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Iterative aperture mask design in phase space using a rank constraint

Author(s) -

Roarke Horstmeyer,

Se Baek Oh,

Ramesh Raskar

Publication year - 2010

Publication title -

optics express

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.394

H-Index - 271

ISSN - 1094-4087

DOI - 10.1364/oe.18.022545

Subject(s) - computer science , phase retrieval , aperture (computer memory) , optics , ambiguity , flexibility (engineering) , rank (graph theory) , algorithm , convergence (economics) , iterative method , point spread function , process (computing) , constraint (computer aided design) , phase (matter) , function (biology) , set (abstract data type) , computer vision , mathematics , fourier transform , physics , mathematical analysis , statistics , geometry , combinatorics , quantum mechanics , evolutionary biology , acoustics , economics , biology , programming language , economic growth , operating system

We present an iterative camera aperture design procedure, which determines an optimal mask pattern based on a sparse set of desired intensity distributions at different focal depths. This iterative method uses the ambiguity function as a tool to shape the camera's response to defocus, and shares conceptual similarities with phase retrieval procedures. An analysis of algorithm convergence is presented, and experimental examples are shown to demonstrate the flexibility of the design process. This algorithm potentially ties together previous disjointed PSF design approaches under a common framework, and offers new insights for the creation of future application-specific imaging systems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research