Partially Coherent Ambiguity Functions for Depth-Variant Point Spread Function Design Roarke Horstmeyer 1 Se Baek Oh 2 Otkrist Gupta 1 Ramesh Raskar 1.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Nonnegative Matrix Factorization with Sparseness Constraints S. Race MA591R.
Fast & Furious: a potential wavefront reconstructor for extreme adaptive optics at ELTs Visa Korkiakoski and Christoph U. Keller Leiden Observatory Niek.
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
3D Modeling from a photograph
December 04, 2000A.J. Devaney--Mitre presentation1 Detection and Estimation of Buried Objects Using GPR A.J. Devaney Department of Electrical and Computer.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
B.Macukow 1 Lecture 12 Neural Networks. B.Macukow 2 Neural Networks for Matrix Algebra Problems.
Computer vision: models, learning and inference
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
Bayesian Robust Principal Component Analysis Presenter: Raghu Ranganathan ECE / CMR Tennessee Technological University January 21, 2011 Reading Group (Xinghao.
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Last Time Pinhole camera model, projection
Spacecraft Attitude Determination Using GPS Signals C1C Andrea Johnson United States Air Force Academy.
Analyse de la cohérence en présence de lumière partiellement polarisée François Goudail Laboratoire Charles Fabry de l’Institut d’Optique, Palaiseau (France)
CSE 291 Seminar Presentation Andrew Cosand ECE CVRR
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Uncalibrated Geometry & Stratification Sastry and Yang
Multiple-view Reconstruction from Points and Lines
Static Image Mosaicing
The plan for today Camera matrix
On Signal Reconstruction from Fourier Magnitude Gil Michael Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000,
Nanoparticle Polarizability Determination Using Coherent Confocal Microscopy Brynmor J. Davis and P. Scott Carney University of Illinois at Urbana-Champaign.
MERL, MIT Media Lab Reinterpretable Imager Agrawal, Veeraraghavan & Raskar Amit Agrawal, Ashok Veeraraghavan and Ramesh Raskar Mitsubishi Electric Research.
Tomo-gravity Yin ZhangMatthew Roughan Nick DuffieldAlbert Greenberg “A Northern NJ Research Lab” ACM.
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
10/17/97Optical Diffraction Tomography1 A.J. Devaney Department of Electrical Engineering Northeastern University Boston, MA USA
Non Negative Matrix Factorization
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
3D SLAM for Omni-directional Camera
Y. Moses 11 Combining Photometric and Geometric Constraints Yael Moses IDC, Herzliya Joint work with Ilan Shimshoni and Michael Lindenbaum, the Technion.
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
Yu-Wing Tai, Hao Du, Michael S. Brown, Stephen Lin CVPR’08 (Longer Version in Revision at IEEE Trans PAMI) Google Search: Video Deblurring Spatially Varying.
The Media Lab Designing Aperture Masks in Phase Space Roarke Horstmeyer 1, Se Baek Oh 2, and Ramesh Raskar 1 1 MIT Media Lab 2 MIT Dept. of Mechanical.
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
Visual SLAM Visual SLAM SPL Seminar (Fri) Young Ki Baik Computer Vision Lab.
EG 2011 | Computational Plenoptic Imaging STAR | VI. High Speed Imaging1 Computational Plenoptic Imaging Gordon Wetzstein 1 Ivo Ihrke 2 Douglas Lanman.
Computational Time-reversal Imaging
1 Fraunhofer Diffraction: Single, multiple slit(s) & Circular aperture Fri. Nov. 22, 2002.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Motion Estimation I What affects the induced image motion?
Ultrasound Computed Tomography 何祚明 陳彥甫 2002/06/12.
Part 2: Phase structure function, spatial coherence and r 0.
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
Date of download: 6/6/2016 Copyright © 2016 SPIE. All rights reserved. System overview for direct optical fringe writing in PRP. The direct fringe writing.
Date of download: 6/29/2016 Copyright © 2016 SPIE. All rights reserved. Potential imaging modes. (a) Each detector in a focal plane array measures the.
CSE 554 Lecture 8: Alignment
Learning to Align: a Statistical Approach
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Multiplicative updates for L1-regularized regression
Experiment and Results
Epipolar geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
GPI Astrometric Calibration
Uncalibrated Geometry & Stratification
An Adaptive Middleware for Supporting Time-Critical Event Response
Light Fields in Ray and Wave Optics
Wireless Mesh Networks
The European Conference on e-learing ,2017/10
Connecting Data with Domain Knowledge in Neural Networks -- Use Deep learning in Conventional problems Lizhong Zheng.
Synthesis of Motion from Simple Animations
Structure from motion Input: Output: (Tomasi and Kanade)
Non-Negative Matrix Factorization
Multiple DAGs Learning with Non-negative Matrix Factorization
Theoretical Background Challenges and Significance
LAB MEETING Speaker : Cheolsun Kim
Presentation transcript:

Partially Coherent Ambiguity Functions for Depth-Variant Point Spread Function Design Roarke Horstmeyer 1 Se Baek Oh 2 Otkrist Gupta 1 Ramesh Raskar 1 PIERS Marrakesh, 3/20/11 1 MIT Media Lab 2 MIT Department of Mechanical Engineering

Conventional camera PSF measurement: Conventional PSF Blur defocus Circular Aperture I(z 0 )I(z 1 )I(z 2 ) z0z0 z1z1 z2z2 f Pt. Source Problem Statement

Design apertures for specific imaging tasks Determine mask Aperture mask: amplitude/phase defocus Desired set of PSFs I(z 0 ), I(z 1 ), I(z 2 ) z0z0 z1z1 z2z2 3 Problem Statement

Examples Defocus PSFs:Depth-InvariantRotatingArbitrary Cubic phase Gauss-Laguerre modes Iterative Design ?

PSF Design Similar to Phase Recovery d z0z0 z1z1 z2z2 Diffractive Element f z0z0 z1z1 z2z2 Aperture Element 3D PSF Design Measurement for phase recovery I(z 0 ), I(z 1 ), I(z 2 ) General Goal: Find (A, ϕ ) from multiple intensities (A,ϕ)(A,ϕ) (A,ϕ)(A,ϕ) Similar to Models: Fresnel propagation, k-space, light fields, phase space

I(x 1,z 1 )I(x 0,z 0 ) U(A, ϕ ) (a) Phase Retrieval iterative I(x n,z n ) I(x 0,z 0 ) … (c) Phase Space Tomography U(A, ϕ ) simultaneous I(x 1,z 1 )I(x 0,z 0 ) (d) Mode Selective (proposed) U(A, ϕ ) simultaneous iterative Overview of 3D Design Techniques I(x 1,z 1 )I(x 0,z 0 ) (b) Transport of Intensity U(A, ϕ ) simultaneous

I(x 1,z 1 )I(x 0,z 0 ) U(A, ϕ ) (a) Phase Retrieval iterative I(x n,z n ) I(x 0,z 0 ) … (c) Phase Space Tomography U(A, ϕ ) simultaneous I(x 1,z 1 )I(x 0,z 0 ) U(A, ϕ ) simultaneous iterative I(x 1,z 1 )I(x 0,z 0 ) U(A, ϕ ) simultaneous Phase space extends nicely to partially coherent design (b) Transport of Intensity Overview of 3D Design Techniques (d) Mode Selective (proposed)

Phase Space Functions Wigner Distribution (WDF) Ambiguity Function (AF) AF “easier” than WDF Tu, Tamura, Phys. Rev. E 55, 1997 OTF(z 1 ) OTF(z 0 ) OTF(-z 1 ) F-slice PSF(z 0 ) PSF(-z 1 ) PSF(z 1 ) WDF Projections: PSFs x u u x' AF Slices: OTFs

z0z0 z1z1 f x U(x) Phase Space Camera Model r Δz z0z0 I xʹxʹ I xʹxʹ z1z1 OTFs Aperture mask

z0z0 z1z1 f x U(x) tan(θ 0 )=0 u xʹxʹ Phase Space Camera Model Why AF is useful: z0z0 I xʹxʹ I xʹxʹ z1z1 tan(θ 1 )=(W 20 k/π) OTFs r Δz 1. Polar display of the OTF z0z0 z1z1 Aperture mask

z0z0 z1z1 f x U(x) tan(θ 0 )=0 u xʹxʹ Phase Space Camera Model Why AF is useful: z0z0 I xʹxʹ I xʹxʹ z1z1 tan(θ 1 )=(W 20 k/π) OTFs r Δz 2. Convert AF to Mutual Intensity: inverse FT, 45° rotation, scale by 2 3. Recovery of U(x) from AF (up to constant Δ ϕ ) z0z0 z1z1 1. Polar display of the OTF

OTF(z 1 ) OTF(z 0 ) PSF OTF Inputs Output: Desired Aperture Mask, 1D (1) AF Population (2) One-time AF Interpolation OTF(z 2 ) θnθn (5) Optimized AF xʹxʹ xʹxʹ u 1 0 xʹxʹ u xʹxʹ u x2x2 x1x1 x1x1 x2x2 (3) Mutual Intensity J Rank Constraint (4) Optimized J Error Check Iterate &

Rank-constraint on Mutual Intensity, J = λ 1 + λ 2 +…+ λ 3 x1x1 x2x2 x1x1 x2x2 Represent J with coherent mode decomposition 1 Coherent, orthogonal modes from singular value decomposition J = UΛV T = Σ λ i U i (x 1 )U i * (x 2 ) Imperfect J guess: Many coherent modes Assume: J symmetric, nxn λ i = Singluar Values U i orthogonal to U j for all i≠j i=1 n J 1 E. Wolf, JOSA 72 (3), 1982

= λ 1 + λ 2 +…+ λ 3 1 st Mode: Coherent x1x1 x2x2 x1x1 x2x2 PSF = response to a point source: restricted to 1 mode Rank-constraint on Mutual Intensity, J J est = λ 1 U 1 (x 1 )U 1 * (x 2 ) J Represent J with coherent mode decomposition 1 Coherent, orthogonal modes from singular value decomposition 1 E. Wolf, JOSA 72 (3), 1982

Ground Truth AFReconstructed AF Computed Phase Mask Ground Truth and Reconstructed OTFs W 20 =0W 20 =λ/2W 20 =λ -π-π +π+π xʹxʹ u xʹxʹ xʹxʹ xʹxʹ xʹxʹ u Reconstruction Example: Cubic Phase Mask Example aperture mask function: exp(jαx 3 ), α=40, 20 iterations

Simulation Experiment Amplitude One (fixed) mask Simple Example: Arbitrary Input Input z 1 =50mm z 2 =50.1mm Rank-1 constraint 25μ – resolution, 1cm 2 binary mask in 50mm f/1.8 Nikkor, 200μ z=4m z 3 =50.2mm 50μ

-π-π +π+π No Constraints on (A, ϕ ) Phase (rad.) x (cm) Amplitude (AU) Amplitude-only constraint Phase-only constraint Constrained Decompositions In Experiment: Amplitude-only or Phase-only required MSE vs. # iterations MSE # of iterations Aperture mask constraints: -Varied performance -Algorithm still converges

Keeping More than One Mode = λ 1 + λ 2 +…+ λ 3 Several Modes: Partially Coherent x1x1 x2x2 x1x1 x2x2 -More accurate estimate found with n > 1 modes J n = 3: (J - Σ λ i U i (x 1 )U i (x 2 )) 2 = global minimum Eckert-Young Thm.: 1 st n-modes of SVD(J) = optimal rank-n estimate SVD = Optimal estimate (L 2 norm, no prior knowledge) i=1 3

Simulating Partial Coherence = λ 1 + λ 2 +…+ λ 3 x1x1 x2x2 x1x1 x2x2 -More accurate estimate found with n > 1 modes Multiple modes can be multiplexed over time 1,2 J Several Modes: Partially Coherent 1 P. De Santis, JOSA 3 (8), 1986, 2 Z. Zhang, private communication, 2011 Spatial Light Modulator: Vary over time CPU

Simulation Example: Benefit of Several Modes Input MSE improvement ~100x (modes contain both A and ϕ ) 12 3 Display 3 Optimal masks z 1 =50mm z 2 =50.1mm z 3 =50.2mm 50μ 1cm 2 masks Rank-3 constraint Experimentally: A, ϕ over time = hard “Weights”:

Adding a Constraint to Several Modes SVD & constrain in separate operations: No convergence = μ 1 + μ 2 +μ3+μ3 x1x1 x2x2 On(J)On(J) x1x1 x2x2 General solution: convex optimization e.g.: amplitude-only, phase-only, spatial 1 and coherence constraints min || J – Σ μ i W i W i * || 2 subject to constraints on W, given n i=1 n 1 Flewett et al., Optics Letters 34 (14) 2010 W 1 =?W 2 =?W 3 =? Operation O n (J) = find closest n rank-1 outer-products, constrained

Example Constraint: Amplitude-only Problem: n optimal coherent modes that are real, positive min || J – WW T || 2 W ≥ 0, real (J = kxk, W=kxn)

Example Constraint: Amplitude-only Problem: n optimal coherent modes that are real, positive min || J – WW T || 2 W ≥ 0, real (J = kxk, W=kxn) Solution: Non-negative matrix factorization 1 -e.g. Netflix challenge: low-rank rep. of 0-5 star movie scores Symmetric NMF: add to update rules (solve for W &H, W≈H) Note: Optimal “Coherent modes” are no longer orthogonal Update Rules: Add line 1 δ=tiny value, error ~2-5% 1. H=W T 2. W=W.*(H T J)./((HH T )H+δ) 3. H=H.*(W T J) T./H(WW)+δ) 1 Lee and Seung, Nature 401, 2001

A Simple Example: Multiple Amplitude Modes cm 2 masks Amplitude-only, 3 masks Amp-only masks: Sym. NMF “Weights”: Simulation Input MSE improvement ~7x (vs. 1 Amp. mode) Buildup of a baseline bias… z 1 =50mm z 2 =50.1mm z 3 =50.2mm 50μ

Conclusion & Future Work -Phase space functions = intuitive window into 3D PSF design -Multiple modes (partially coherent) = increased flexibility -Constrained searches can be achieved w/ convex methods -Amplitude-only: Symmetric NMF -Other constraints: Phase-only (another convex implementation), coherence length (weighted SVD) -Subtracting modes: J=U 1 U 1 * ± U 2 U 2 * ±… (take 2 images) -Current: Initial Experimental tests using an SLM -Next Step: Find a nice application Thanks! Questions?

J pc (x 1,x 2 ) AF pc (x',u) x 1 (cm) x2x2 u.5 3 Coherent Modes 1cm Mask x'(cm -1 ) 5e4-5e x(cm) u x2x2 Partially Coherent Reconstruction: 3 Modes x 1 (cm) x'(cm -1 ) 5e4-5e4 Ground TruthReconstructed

Constraining Several Modes Apply Constraint: Amplitude-only, Phase-only, prior knowledge, etc. = λ 1 + λ 2 +… + λ 3 x1x1 x2x2 Sum=No longer optimal (localized constraints will not converge) individual constraint x1x1 x2x2 x1x1 x2x2 + λ 2 + λ 3 λ1λ1 SVD(J) amplitude-only Example: Amplitude-only mask individual constraint individual constraint

A Simple Example: Prior Knowledge A B C 3 modes hitting unknown structure (A=.4, B=.5, C=.7) + SVD(J) = 2 orthogonal modes x SVD(J) = x2x2 x1x1 Negative values = phase U 1 U 1 * ε (0,.9) U 2 U 2 * ε (-.1,.4)

A Simple Example: Prior Knowledge A B C 3 modes hitting unknown structure (A=.4, B=.5, C=.7) + SNMF(J) SVD(J) = 2 orthogonal modes = x x2x2 x1x1 Symmetric NMF: Assume no phase change - 3 modes>0, more info about structure ++ U 1 U 1 * ε (0,.47) U 2 U 2 * ε (0,.6) U 3 U 3 * ε (0,.6) Negative

Keeping More than One Mode = λ 1 + λ 2 +…+ λ 3 Several Modes: Partially Coherent x1x1 x2x2 x1x1 x2x2 -More accurate estimate with n>1 mutual intensity modes -J est = Σ J i AF est = Σ AF i = Σ L(J i ) 1,2 (L=linear transformation) -If J est more accurate, then AF est more accurate J Multiple Modes can be: a. Multiplexed over time (Desantis, Zheng) b. Could also multiplex over space and/or angle 1 M. Bastiaans, JOSA 3(8) 1986, 2 Lohmann and Rhodes, Appl. Opt. 17, 1978