Mitigating the Effect of Noise in Iterative Projection Phase Retrieval

Size: px
Start display at page:

Download "Mitigating the Effect of Noise in Iterative Projection Phase Retrieval"

Transcription

1 Mitigating the Effect of Noise in Iterative Projection Phase Retrieval & David Hyland Imaging and Applied Optics: Optics and Photonics Congress

2 Introduction Filtering Results Conclusion Outline Introduction Iterative projection phase retrieval 2d projection visualization method Filtering of Modulus Noise Noise model Observed error behavior Theoretical effects New Fourier Domain Projection Resulting Performance 2d projection visualization examples Low SNR example Conclusion

3 Introduction Filtering Results Conclusion Phase Retrieval Problem Statement Objective is to recover the image g x, y which has the discrete Fourier transform G u, v. Given the measured Fourier modulus G u, v, estimate the phase of G u, v so it can inverted to recover g x, y. At each iteration perform several projections onto constrained domains. Historically, there is not much attention paid to noise in the measured Fourier modulus noise. Can it be filtered? R. Trahan and D. Hyland, "Mitigating the effect of noise in the hybrid input-output method of phase retrieval." Applied Optics, Vol. 52, Issue 13, pp (213)

4 Introduction Filtering Results Conclusion Typical Projection Operators Fourier domain projection preserves phase and constrains modulus to F u, v P m g x, y = FT 1 F u, v exp iφ FT g x, y Image domain projection preserves pixel value magnitudes within foreground and zeros others P s g x, y = g x, y, x, y γ x, y, otherwise Reflections are defined as R 2P I.

5 Introduction Filtering Results Conclusion Phase Retrieval Methods Algorithm Error Reduction (ER) Solvent Flipping (SF) Hybrid Input-Output (HIO) Iteration g k+1 = P s P m g k g k+1 = R s P m g k P g k+1 = m g k, I βp m g k, x, y γ x, y otherwise Difference Map (DM) Averaged Successive Reflection (ASR) Hybrid Projection Reflection (HPR) Random Averaged Alternating Reflector (RAAR) Levi-Stark method (LS) g k+1 = I + βp s 1 + γ s P m γ s I βp m 1 + γ m P s γ m I g k g k+1 = 1 2 R sr m + I g k g k+1 = 1 2 R s R m + β 1 P m g k+1 = 1 2 β R sr m + I + 1 β P m G k+1 = 1 λ G k + FT λp s P m g k + I + 1 β P m g k g k

6 Introduction Filtering Results Conclusion Domain Intersection Analog Each projection imposes a constraint. Image resides in the Support Domain (S) Image Fourier modulus resides in the Fourier modulus domain (M) Upon convergence none of the constraints affect the data, i.e. the image is a member of both domains simultaneously. Phase retrieval problem has an analog: find the intersection of two non-convex domains. The analog can be formulated as a two dimensional problem for easy analysis.

7 Introduction Filtering Results Conclusion 2D Visualization Method 2 1 M ER SF HIO DM ASR HPR RAAR g S

8 Noise Model Introduction Filtering Results Conclusion Noise can be modeled as F ±u, ±v = F True u, v 1 + N, σ + N, σ i Here the quantity σ is called the Noise-To-Signal Level. Model is borrowed from intensity interferometry theory. Any other noise model can be considered without changing the rest of this analysis.

9 Introduction Filtering Results Conclusion Effect of Noise on the HIO Oscillation occurs in both image and modulus constraint violations. Oscillations tend to be out of phase. Alternation in semi-satisfied constraint. Mod. Constr. Violation Support Error Image Constraint Violation Modulus Constraint Violation 2.5 x Iteration x 14 Iteration Iteration Iteration

10 Introduction Filtering Results Conclusion Analysis of the Effect of Noise Consider the simple Error-Reduction method, g k+1 = P s P m g k. Let each u, v pixel have a variation Δ from its proper value. Noisy modulus is G u, v = F True u, v + a,b Δ a, b δ u a, v b By linearity of the DFT, gain insight by looking at one noise component, i.e. G u, v = Δδ u a, v b. By going through a phase retrieval iteration, the effect of Δ should be eliminated.

11 Introduction Filtering Results Conclusion Analysis of the Effect of Noise (2) Start G k abs( g' k ) arg( g' k ) u a) Initial Fourier modulus Initial Fourier Modulus x b) Unconstrained Image.25 Unconstrained Image.8.2 Finish G k g k u d) Final Fourier modulus Constrained Fourier Modulus x c) Constrained Image Constrained Image

12 Introduction Filtering Results Conclusion Analysis of the Effect of Noise (3) After one iteration Maximum: G = Δ M 2A Frobeniun norm: Σ M 1 u= G u 2 = Δ M 2A M Filtering is proportional to oversampling. M This leads to the idea that the modulus should be constrained to a mix of the previous iteration s modulus and the measured modulus.

13 Introduction Filtering Results Conclusion New Fourier Modulus Projection Modulus should be constrained to a mix of the measured and previous iteration s modulus. New projection operator: P m g x, y = FT 1 F u, v exp iφ FT g x, y F u, v = 1 λ F u, v Typical relaxation parameter values: To mitigate constraint oscillation:.1 To filter noise:.9 + λ FT g x, y

14 Introduction Filtering Results Conclusion Intersection / No Relaxation ER SF HIO DM ASR HPR RAAR 2 1 S M

15 Introduction Filtering Results Conclusion Relaxation after Iteration ER SF HIO DM ASR HPR RAAR 2 1 S No Spiral M

16 Introduction Filtering Results Conclusion No Intersection / No Relaxation ER SF HIO DM ASR HPR RAAR 2 1 S M

17 Introduction Filtering Results Conclusion Relaxation after Iteration No Divergence ER SF HIO DM ASR HPR RAAR 2 1 S M

18 HIO+Relaxation Introduction Filtering Results Conclusion a) True Image a) True Image a) True Image b) Estimate, Iteration 5 b) Estimate, Iteration 5 b) Estimate, Iteration 5 c) Estimate, Iteration 1 c) Estimate, Iteration 1 c) Estimate, Iteration 1 True Image Iteration 5 No relaxation yet Iteration 1 Relaxed Modulus Constraint

19 Modulus Error Support Error Mod. Constr. Violation Introduction Filtering Results Conclusion HIO+Relaxation Error Metrics 2.5 x 19 5 x 14 Image Constraint Violation Modulus Constraint Violation Iteration Iteration 3.5 x Iteration Iteration Fourier Modulus Error % Reduction Iteration Iteration

20 Conclusion Introduction Filtering Results Conclusion Phase retrieval methods have problem with convergence given low SNR data. Performed an analysis on how the noise affects the phase retrieval operators. Developed a new operator with a filtering rationale. Results show up to 75% noise is filtered in various examples with ~2x oversampling.

21

22 Analysis of the Effect of Noise G u, v = Δδ u a, v b g x, y = Δ ax exp i2π + by MN M N Apply P s g x, y = Δ MN 1, A m M 1 A & B n N 1, otherwise G u, v = Δ MN sin M 2A M πu sin πu M sin N 2B N πv sin πv N After one ER iteration, the Fourier modulus has less contribution from Δ.

Mitigating the effect of noise in the hybrid input output method of phase retrieval

Mitigating the effect of noise in the hybrid input output method of phase retrieval Mitigating the effect of noise in the hybrid input output method of phase retrieval Russell Trahan III* and David Hyland Department of Aerospace Engineering, Texas A&M University, HRBB 70, Ross Street,

More information

Hybrid projection reflection method for phase retrieval

Hybrid projection reflection method for phase retrieval Bauschke et al. Vol. 20, No. 6/June 2003/J. Opt. Soc. Am. A 1025 Hybrid projection reflection method for phase retrieval Heinz H. Bauschke Department of Mathematics and Statistics, University of Guelph,

More information

PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION. A Thesis MELTEM APAYDIN

PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION. A Thesis MELTEM APAYDIN PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION A Thesis by MELTEM APAYDIN Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the

More information

Fast and Robust Phase Retrieval

Fast and Robust Phase Retrieval Fast and Robust Phase Retrieval Aditya Viswanathan aditya@math.msu.edu CCAM Lunch Seminar Purdue University April 18 2014 0 / 27 Joint work with Yang Wang Mark Iwen Research supported in part by National

More information

Statistical Issues in Searches: Photon Science Response. Rebecca Willett, Duke University

Statistical Issues in Searches: Photon Science Response. Rebecca Willett, Duke University Statistical Issues in Searches: Photon Science Response Rebecca Willett, Duke University 1 / 34 Photon science seen this week Applications tomography ptychography nanochrystalography coherent diffraction

More information

Gauge optimization and duality

Gauge optimization and duality 1 / 54 Gauge optimization and duality Junfeng Yang Department of Mathematics Nanjing University Joint with Shiqian Ma, CUHK September, 2015 2 / 54 Outline Introduction Duality Lagrange duality Fenchel

More information

Super-resolution via Convex Programming

Super-resolution via Convex Programming Super-resolution via Convex Programming Carlos Fernandez-Granda (Joint work with Emmanuel Candès) Structure and Randomness in System Identication and Learning, IPAM 1/17/2013 1/17/2013 1 / 44 Index 1 Motivation

More information

8 Queens, Sudoku, and Projection Methods

8 Queens, Sudoku, and Projection Methods 8 Queens, Sudoku, and Projection Methods Heinz Bauschke Mathematics, UBC Okanagan Research supported by NSERC and CRC Program heinz.bauschke@ubc.ca The Mathematical Interests of Peter Borwein The IRMACS

More information

Constrained optimization

Constrained optimization Constrained optimization DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Compressed sensing Convex constrained

More information

Fast Angular Synchronization for Phase Retrieval via Incomplete Information

Fast Angular Synchronization for Phase Retrieval via Incomplete Information Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department

More information

Phase Retrieval from Local Measurements: Deterministic Measurement Constructions and Efficient Recovery Algorithms

Phase Retrieval from Local Measurements: Deterministic Measurement Constructions and Efficient Recovery Algorithms Phase Retrieval from Local Measurements: Deterministic Measurement Constructions and Efficient Recovery Algorithms Aditya Viswanathan Department of Mathematics and Statistics adityavv@umich.edu www-personal.umich.edu/

More information

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement to the material discussed in

More information

Introduction to Sparsity in Signal Processing

Introduction to Sparsity in Signal Processing 1 Introduction to Sparsity in Signal Processing Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York selesi@poly.edu 212 2 Under-determined linear equations Consider a system

More information

5. Orthogonal matrices

5. Orthogonal matrices L Vandenberghe EE133A (Spring 2017) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal

More information

ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis

ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Lecture 3: Sparse signal recovery: A RIPless analysis of l 1 minimization Yuejie Chi The Ohio State University Page 1 Outline

More information

Towards a Mathematical Theory of Super-resolution

Towards a Mathematical Theory of Super-resolution Towards a Mathematical Theory of Super-resolution Carlos Fernandez-Granda www.stanford.edu/~cfgranda/ Information Theory Forum, Information Systems Laboratory, Stanford 10/18/2013 Acknowledgements This

More information

Optimization-based sparse recovery: Compressed sensing vs. super-resolution

Optimization-based sparse recovery: Compressed sensing vs. super-resolution Optimization-based sparse recovery: Compressed sensing vs. super-resolution Carlos Fernandez-Granda, Google Computational Photography and Intelligent Cameras, IPAM 2/5/2014 This work was supported by a

More information

Chirp images in 2-D fractional Fourier transform domain. Presenter: Ming-Feng Lu Beijing Institute of Technology July 20, 2016

Chirp images in 2-D fractional Fourier transform domain. Presenter: Ming-Feng Lu Beijing Institute of Technology July 20, 2016 Chirp images in -D fractional Fourier transform domain Presenter: Ming-Feng Lu lumingfeng@bit.edu.cn Beijing Institute of Technology July 0, 016 目录 Introduction of chirp images Chirp images in FRFT domain

More information

Introduction to Sparsity in Signal Processing

Introduction to Sparsity in Signal Processing 1 Introduction to Sparsity in Signal Processing Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York selesi@poly.edu 212 2 Under-determined linear equations Consider a system

More information

Self-Calibration and Biconvex Compressive Sensing

Self-Calibration and Biconvex Compressive Sensing Self-Calibration and Biconvex Compressive Sensing Shuyang Ling Department of Mathematics, UC Davis July 12, 2017 Shuyang Ling (UC Davis) SIAM Annual Meeting, 2017, Pittsburgh July 12, 2017 1 / 22 Acknowledgements

More information

Large-Scale L1-Related Minimization in Compressive Sensing and Beyond

Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Arizona State University March

More information

PHYSICS 304 QUANTUM PHYSICS II (2005) Assignment 1 Solutions

PHYSICS 304 QUANTUM PHYSICS II (2005) Assignment 1 Solutions PHYSICS 04 QUANTUM PHYSICS II 200 Assignment Solutions. The general state of a spin half particle with spin component S n = S n = be shown to be given by 2 h can S n = 2 h = cos 2 θ S z = 2 h + eiφ sin

More information

A Riemannian Framework for Denoising Diffusion Tensor Images

A Riemannian Framework for Denoising Diffusion Tensor Images A Riemannian Framework for Denoising Diffusion Tensor Images Manasi Datar No Institute Given Abstract. Diffusion Tensor Imaging (DTI) is a relatively new imaging modality that has been extensively used

More information

Data-driven signal processing

Data-driven signal processing 1 / 35 Data-driven signal processing Ivan Markovsky 2 / 35 Modern signal processing is model-based 1. system identification prior information model structure 2. model-based design identification data parameter

More information

Methoden moderner Röntgenphysik I. Coherence based techniques II. Christian Gutt DESY, Hamburg

Methoden moderner Röntgenphysik I. Coherence based techniques II. Christian Gutt DESY, Hamburg Methoden moderner Röntgenphysik I Coherence based techniques II Christian Gutt DESY Hamburg christian.gutt@desy.de 8. January 009 Outline 18.1. 008 Introduction to Coherence 8.01. 009 Structure determination

More information

Feasible Sets. L. D. Marks Northwestern University

Feasible Sets. L. D. Marks Northwestern University Feasible Sets L. D. Marks Northwestern University Electron Crystallography is the branch of science that uses electron scattering and imaging to study the structure of matter What is the science? Why determine

More information

Phase retrieval by iterated projections

Phase retrieval by iterated projections 40 J. Opt. Soc. Am. A/ Vol. 20, No. 1/ January 2003 Veit Elser Phase retrieval by iterated projections Veit Elser Department of Physics, Cornell University, Ithaca, New York 14853-2501 Received March 22,

More information

This is a topic I encountered a number of years ago while at LBNL, when I came across the following statement [1]:

This is a topic I encountered a number of years ago while at LBNL, when I came across the following statement [1]: Equivalent signal to noise in diffraction vs. bright-field experiments Charles Sindelar January 2010 SUMMARY This is a topic I encountered a number of years ago while at LBNL, when I came across the following

More information

Fourier phase retrieval with random phase illumination

Fourier phase retrieval with random phase illumination Fourier phase retrieval with random phase illumination Wenjing Liao School of Mathematics Georgia Institute of Technology Albert Fannjiang Department of Mathematics, UC Davis. IMA August 5, 27 Classical

More information

Image restoration. An example in astronomy

Image restoration. An example in astronomy Image restoration Convex approaches: penalties and constraints An example in astronomy Jean-François Giovannelli Groupe Signal Image Laboratoire de l Intégration du Matériau au Système Univ. Bordeaux CNRS

More information

SIGNAL AND IMAGE RESTORATION: SOLVING

SIGNAL AND IMAGE RESTORATION: SOLVING 1 / 55 SIGNAL AND IMAGE RESTORATION: SOLVING ILL-POSED INVERSE PROBLEMS - ESTIMATING PARAMETERS Rosemary Renaut http://math.asu.edu/ rosie CORNELL MAY 10, 2013 2 / 55 Outline Background Parameter Estimation

More information

Eric G. Johnson: Diffractive and Micro-Optical Systems. Justin Coleman. College of Optical Sciences. The University of Arizona

Eric G. Johnson: Diffractive and Micro-Optical Systems. Justin Coleman. College of Optical Sciences. The University of Arizona Eric G. Johnson: Diffractive and Micro-Optical Systems Justin Coleman College of Optical Sciences The University of Arizona jcoleman@email.arizona.edu Abstract The material discussed in this paper relates

More information

Author s Accepted Manuscript

Author s Accepted Manuscript Author s Accepted Manuscript Combining ptychographical algorithms with the Hybrid Input-Output (HIO) algorithm A.P. Konijnenberg, W.M.J. Coene, S.F. Pereira, H.P. Urbach www.elsevier.com/locate/ultramic

More information

Introduction to Compressed Sensing

Introduction to Compressed Sensing Introduction to Compressed Sensing Alejandro Parada, Gonzalo Arce University of Delaware August 25, 2016 Motivation: Classical Sampling 1 Motivation: Classical Sampling Issues Some applications Radar Spectral

More information

2.1 Optimization formulation of k-means

2.1 Optimization formulation of k-means MGMT 69000: Topics in High-dimensional Data Analysis Falll 2016 Lecture 2: k-means Clustering Lecturer: Jiaming Xu Scribe: Jiaming Xu, September 2, 2016 Outline Optimization formulation of k-means Convergence

More information

arxiv: v1 [cs.it] 26 Oct 2015

arxiv: v1 [cs.it] 26 Oct 2015 Phase Retrieval: An Overview of Recent Developments Kishore Jaganathan Yonina C. Eldar Babak Hassibi Department of Electrical Engineering, Caltech Department of Electrical Engineering, Technion, Israel

More information

Pullbacks, Isometries & Conformal Maps

Pullbacks, Isometries & Conformal Maps Pullbacks, Isometries & Conformal Maps Outline 1. Pullbacks Let V and W be vector spaces, and let T : V W be an injective linear transformation. Given an inner product, on W, the pullback of, is the inner

More information

DIGITAL signal processing applications are often concerned

DIGITAL signal processing applications are often concerned 5874 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 56, NO 12, DECEMBER 2008 Nonlinear and Nonideal Sampling: Theory and Methods Tsvi G Dvorkind, Yonina C Eldar, Senior Member, IEEE, and Ewa Matusiak Abstract

More information

COMPUTATION OF FOURIER TRANSFORMS FOR NOISY B FOR NOISY BANDLIMITED SIGNALS

COMPUTATION OF FOURIER TRANSFORMS FOR NOISY B FOR NOISY BANDLIMITED SIGNALS COMPUTATION OF FOURIER TRANSFORMS FOR NOISY BANDLIMITED SIGNALS October 22, 2011 I. Introduction Definition of Fourier transform: F [f ](ω) := ˆf (ω) := + f (t)e iωt dt, ω R (1) I. Introduction Definition

More information

Phase recovery with PhaseCut and the wavelet transform case

Phase recovery with PhaseCut and the wavelet transform case Phase recovery with PhaseCut and the wavelet transform case Irène Waldspurger Joint work with Alexandre d Aspremont and Stéphane Mallat Introduction 2 / 35 Goal : Solve the non-linear inverse problem Reconstruct

More information

DS-GA 1002 Lecture notes 10 November 23, Linear models

DS-GA 1002 Lecture notes 10 November 23, Linear models DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.

More information

Compressive Sensing and Beyond

Compressive Sensing and Beyond Compressive Sensing and Beyond Sohail Bahmani Gerorgia Tech. Signal Processing Compressed Sensing Signal Models Classics: bandlimited The Sampling Theorem Any signal with bandwidth B can be recovered

More information

Numerical Methods. Rafał Zdunek Underdetermined problems (2h.) Applications) (FOCUSS, M-FOCUSS,

Numerical Methods. Rafał Zdunek Underdetermined problems (2h.) Applications) (FOCUSS, M-FOCUSS, Numerical Methods Rafał Zdunek Underdetermined problems (h.) (FOCUSS, M-FOCUSS, M Applications) Introduction Solutions to underdetermined linear systems, Morphological constraints, FOCUSS algorithm, M-FOCUSS

More information

Compressed Sensing: Extending CLEAN and NNLS

Compressed Sensing: Extending CLEAN and NNLS Compressed Sensing: Extending CLEAN and NNLS Ludwig Schwardt SKA South Africa (KAT Project) Calibration & Imaging Workshop Socorro, NM, USA 31 March 2009 Outline 1 Compressed Sensing (CS) Introduction

More information

Minimizing the Difference of L 1 and L 2 Norms with Applications

Minimizing the Difference of L 1 and L 2 Norms with Applications 1/36 Minimizing the Difference of L 1 and L 2 Norms with Department of Mathematical Sciences University of Texas Dallas May 31, 2017 Partially supported by NSF DMS 1522786 2/36 Outline 1 A nonconvex approach:

More information

EE 381V: Large Scale Optimization Fall Lecture 24 April 11

EE 381V: Large Scale Optimization Fall Lecture 24 April 11 EE 381V: Large Scale Optimization Fall 2012 Lecture 24 April 11 Lecturer: Caramanis & Sanghavi Scribe: Tao Huang 24.1 Review In past classes, we studied the problem of sparsity. Sparsity problem is that

More information

Recent developments on sparse representation

Recent developments on sparse representation Recent developments on sparse representation Zeng Tieyong Department of Mathematics, Hong Kong Baptist University Email: zeng@hkbu.edu.hk Hong Kong Baptist University Dec. 8, 2008 First Previous Next Last

More information

Recovery of Sparse Signals from Noisy Measurements Using an l p -Regularized Least-Squares Algorithm

Recovery of Sparse Signals from Noisy Measurements Using an l p -Regularized Least-Squares Algorithm Recovery of Sparse Signals from Noisy Measurements Using an l p -Regularized Least-Squares Algorithm J. K. Pant, W.-S. Lu, and A. Antoniou University of Victoria August 25, 2011 Compressive Sensing 1 University

More information

Lecture 9. PMTs and Laser Noise. Lecture 9. Photon Counting. Photomultiplier Tubes (PMTs) Laser Phase Noise. Relative Intensity

Lecture 9. PMTs and Laser Noise. Lecture 9. Photon Counting. Photomultiplier Tubes (PMTs) Laser Phase Noise. Relative Intensity s and Laser Phase Phase Density ECE 185 Lasers and Modulators Lab - Spring 2018 1 Detectors Continuous Output Internal Photoelectron Flux Thermal Filtered External Current w(t) Sensor i(t) External System

More information

Convex Optimization Algorithms for Machine Learning in 10 Slides

Convex Optimization Algorithms for Machine Learning in 10 Slides Convex Optimization Algorithms for Machine Learning in 10 Slides Presenter: Jul. 15. 2015 Outline 1 Quadratic Problem Linear System 2 Smooth Problem Newton-CG 3 Composite Problem Proximal-Newton-CD 4 Non-smooth,

More information

Some of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e

Some of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e Transform methods Some of the different forms of a signal, obtained by transformations, are shown in the figure. X(s) X(t) L - L F - F jw s s jw X(jw) X*(t) F - F X*(jw) jwt e z jwt z e X(nT) Z - Z X(z)

More information

Tutorial 9 The Discrete Fourier Transform (DFT) SIPC , Spring 2017 Technion, CS Department

Tutorial 9 The Discrete Fourier Transform (DFT) SIPC , Spring 2017 Technion, CS Department Tutorial 9 The Discrete Fourier Transform (DFT) SIPC 236327, Spring 2017 Technion, CS Department The DFT Matrix The DFT matrix of size M M is defined as DFT = 1 M W 0 0 W 0 W 0 W where W = e i2π M i =

More information

LINEARIZED BREGMAN ITERATIONS FOR FRAME-BASED IMAGE DEBLURRING

LINEARIZED BREGMAN ITERATIONS FOR FRAME-BASED IMAGE DEBLURRING LINEARIZED BREGMAN ITERATIONS FOR FRAME-BASED IMAGE DEBLURRING JIAN-FENG CAI, STANLEY OSHER, AND ZUOWEI SHEN Abstract. Real images usually have sparse approximations under some tight frame systems derived

More information

10. Unconstrained minimization

10. Unconstrained minimization Convex Optimization Boyd & Vandenberghe 10. Unconstrained minimization terminology and assumptions gradient descent method steepest descent method Newton s method self-concordant functions implementation

More information

Reconstruction from Digital Holograms by Statistical Methods

Reconstruction from Digital Holograms by Statistical Methods Reconstruction from Digital Holograms by Statistical Methods Saowapak Sotthivirat Jeffrey A. Fessler EECS Department The University of Michigan 2003 Asilomar Nov. 12, 2003 Acknowledgements: Brian Athey,

More information

Blind Deconvolution Using Convex Programming. Jiaming Cao

Blind Deconvolution Using Convex Programming. Jiaming Cao Blind Deconvolution Using Convex Programming Jiaming Cao Problem Statement The basic problem Consider that the received signal is the circular convolution of two vectors w and x, both of length L. How

More information

Figure measurement of a large optical flat with a Fizeau interferometer and stitching technique

Figure measurement of a large optical flat with a Fizeau interferometer and stitching technique Figure measurement of a large optical flat with a Fizeau interferometer and stitching technique Chunyu Zhao a, Robert A. Sprowl a, Michael Bray b, James H. Burge a a College of Optical Sciences, the University

More information

Nonlinear Analysis with Frames. Part III: Algorithms

Nonlinear Analysis with Frames. Part III: Algorithms Nonlinear Analysis with Frames. Part III: Algorithms Radu Balan Department of Mathematics, AMSC, CSCAMM and NWC University of Maryland, College Park, MD July 28-30, 2015 Modern Harmonic Analysis and Applications

More information

2 Regularized Image Reconstruction for Compressive Imaging and Beyond

2 Regularized Image Reconstruction for Compressive Imaging and Beyond EE 367 / CS 448I Computational Imaging and Display Notes: Compressive Imaging and Regularized Image Reconstruction (lecture ) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement

More information

Accelerated Dual Gradient-Based Methods for Total Variation Image Denoising/Deblurring Problems (and other Inverse Problems)

Accelerated Dual Gradient-Based Methods for Total Variation Image Denoising/Deblurring Problems (and other Inverse Problems) Accelerated Dual Gradient-Based Methods for Total Variation Image Denoising/Deblurring Problems (and other Inverse Problems) Donghwan Kim and Jeffrey A. Fessler EECS Department, University of Michigan

More information

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITK Filters Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITCS 6010:Biomedical Imaging and Visualization 1 ITK Filters:

More information

L-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise

L-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise L-statistics based Modification of Reconstruction Algorithms for Compressive Sensing in the Presence of Impulse Noise Srdjan Stanković, Irena Orović and Moeness Amin 1 Abstract- A modification of standard

More information

8. Least squares. ˆ Review of linear equations. ˆ Least squares. ˆ Example: curve-fitting. ˆ Vector norms. ˆ Geometrical intuition

8. Least squares. ˆ Review of linear equations. ˆ Least squares. ˆ Example: curve-fitting. ˆ Vector norms. ˆ Geometrical intuition CS/ECE/ISyE 54 Introduction to Optimization Spring 017 18 8. Least squares ˆ Review of linear equations ˆ Least squares ˆ Eample: curve-fitting ˆ Vector norms ˆ Geometrical intuition Laurent Lessard (www.laurentlessard.com)

More information

Lecture 5 : Sparse Models

Lecture 5 : Sparse Models Lecture 5 : Sparse Models Homework 3 discussion (Nima) Sparse Models Lecture - Reading : Murphy, Chapter 13.1, 13.3, 13.6.1 - Reading : Peter Knee, Chapter 2 Paolo Gabriel (TA) : Neural Brain Control After

More information

Numerical Methods in TEM Convolution and Deconvolution

Numerical Methods in TEM Convolution and Deconvolution Numerical Methods in TEM Convolution and Deconvolution Christoph T. Koch Max Planck Institut für Metallforschung http://hrem.mpi-stuttgart.mpg.de/koch/vorlesung Applications of Convolution in TEM Smoothing

More information

Recent progress in SR interferometer

Recent progress in SR interferometer Recent progress in SR interferometer -for small beam size measurement- T. Mitsuhashi, KEK Agenda 1. Brief introduction of beam size measurement through SR interferometry. 2. Theoretical resolution of interferometry

More information

Sparse Phase Retrieval Using Partial Nested Fourier Samplers

Sparse Phase Retrieval Using Partial Nested Fourier Samplers Sparse Phase Retrieval Using Partial Nested Fourier Samplers Heng Qiao Piya Pal University of Maryland qiaoheng@umd.edu November 14, 2015 Heng Qiao, Piya Pal (UMD) Phase Retrieval with PNFS November 14,

More information

INVERSE PROBLEMS IN X-RAY SCIENCE STEFANO MARCHESINI

INVERSE PROBLEMS IN X-RAY SCIENCE STEFANO MARCHESINI INVERSE PROBLEMS IN X-RAY SCIENCE STEFANO MARCHESINI overview of photon science inverse problems linear (under-determined): tomography non-linear: diffraction methods Inverse problems and the data deluge

More information

INVERSION OF ELECTROCHEMICAL IMPEDANCE SPECTROSCOPIC MEASUREMENTS

INVERSION OF ELECTROCHEMICAL IMPEDANCE SPECTROSCOPIC MEASUREMENTS BIOFUEL CELL POLARIZATION ESTIMATION INVERSION OF ELECTROCHEMICAL IMPEDANCE SPECTROSCOPIC MEASUREMENTS IMPORTANCE OF MODEL FORMULATION Rosemary Renaut, Mathematics, ASU Jakob Hansen, Jarom Hogue and Grant

More information

Stimulated Emission. Electrons can absorb photons from medium. Accelerated electrons emit light to return their ground state

Stimulated Emission. Electrons can absorb photons from medium. Accelerated electrons emit light to return their ground state Lecture 15 Stimulated Emission Devices- Lasers Stimulated emission and light amplification Einstein coefficients Optical fiber amplifiers Gas laser and He-Ne Laser The output spectrum of a gas laser Laser

More information

Algorithms for phase retrieval problems

Algorithms for phase retrieval problems Algorithms for phase retrieval problems Part I Irène Waldspurger CNRS et CEREMADE (Université Paris Dauphine) Équipe MOKAPLAN (INRIA) 11 décembre 2017 Journées de géométrie algorithmique Aussois Introduction

More information

An Introduction to Sparse Approximation

An Introduction to Sparse Approximation An Introduction to Sparse Approximation Anna C. Gilbert Department of Mathematics University of Michigan Basic image/signal/data compression: transform coding Approximate signals sparsely Compress images,

More information

Conjugate Gradient algorithm. Storage: fixed, independent of number of steps.

Conjugate Gradient algorithm. Storage: fixed, independent of number of steps. Conjugate Gradient algorithm Need: A symmetric positive definite; Cost: 1 matrix-vector product per step; Storage: fixed, independent of number of steps. The CG method minimizes the A norm of the error,

More information

IE 5531: Engineering Optimization I

IE 5531: Engineering Optimization I IE 5531: Engineering Optimization I Lecture 15: Nonlinear optimization Prof. John Gunnar Carlsson November 1, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I November 1, 2010 1 / 24

More information

Oversampled A/D Conversion using Alternate Projections

Oversampled A/D Conversion using Alternate Projections Oversampled A/D Conversion using Alternate Projections Nguyen T.Thao and Martin Vetterli Department of Electrical Engineering and Center for Telecommunications Research Columbia University, New York, NY

More information

Lagrange duality. The Lagrangian. We consider an optimization program of the form

Lagrange duality. The Lagrangian. We consider an optimization program of the form Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization

More information

1 The linear algebra of linear programs (March 15 and 22, 2015)

1 The linear algebra of linear programs (March 15 and 22, 2015) 1 The linear algebra of linear programs (March 15 and 22, 2015) Many optimization problems can be formulated as linear programs. The main features of a linear program are the following: Variables are real

More information

Polarization algebra: decomposition of depolarizing Mueller matrices

Polarization algebra: decomposition of depolarizing Mueller matrices Polarization algebra: decomposition of depolarizing Mueller matrices Razvigor OSSIKOVSKI LPICM, Ecole Polytechnique, CNRS 928 Palaiseau, France razvigor.ossikovski@polytechnique.edu The challenges of experimental

More information

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding 13 Why image enhancement? Image enhancement Example of artifacts caused by image encoding Computer Vision, Lecture 14 Michael Felsberg Computer Vision Laboratory Department of Electrical Engineering 12

More information

MLCC 2018 Variable Selection and Sparsity. Lorenzo Rosasco UNIGE-MIT-IIT

MLCC 2018 Variable Selection and Sparsity. Lorenzo Rosasco UNIGE-MIT-IIT MLCC 2018 Variable Selection and Sparsity Lorenzo Rosasco UNIGE-MIT-IIT Outline Variable Selection Subset Selection Greedy Methods: (Orthogonal) Matching Pursuit Convex Relaxation: LASSO & Elastic Net

More information

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain 10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial

More information

Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces

Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces (Recap) Announcement Room change: On Thursday, April 26th, room 024 is occupied. The lecture will be moved to room 021, E1 4 (the

More information

Nonconvex Methods for Phase Retrieval

Nonconvex Methods for Phase Retrieval Nonconvex Methods for Phase Retrieval Vince Monardo Carnegie Mellon University March 28, 2018 Vince Monardo (CMU) 18.898 Midterm March 28, 2018 1 / 43 Paper Choice Main reference paper: Solving Random

More information

IMAGE ENHANCEMENT II (CONVOLUTION)

IMAGE ENHANCEMENT II (CONVOLUTION) MOTIVATION Recorded images often exhibit problems such as: blurry noisy Image enhancement aims to improve visual quality Cosmetic processing Usually empirical techniques, with ad hoc parameters ( whatever

More information

Constrained Optimization and Lagrangian Duality

Constrained Optimization and Lagrangian Duality CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may

More information

Three-Dimensional Electron Microscopy of Macromolecular Assemblies

Three-Dimensional Electron Microscopy of Macromolecular Assemblies Three-Dimensional Electron Microscopy of Macromolecular Assemblies Joachim Frank Wadsworth Center for Laboratories and Research State of New York Department of Health The Governor Nelson A. Rockefeller

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 7: More on Householder Reflectors; Least Squares Problems Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 15 Outline

More information

arxiv: v1 [physics.optics] 5 Mar 2012

arxiv: v1 [physics.optics] 5 Mar 2012 Designing and using prior knowledge for phase retrieval Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh arxiv:1203.0879v1 [physics.optics] 5 Mar 2012 Computer Science Department, Technion Israel

More information

Fourier Methods in Array Processing

Fourier Methods in Array Processing Cambridge, Massachusetts! Fourier Methods in Array Processing Petros Boufounos MERL 2/8/23 Array Processing Problem Sources Sensors MERL 2/8/23 A number of sensors are sensing a scene. A number of sources

More information

EE Camera & Image Formation

EE Camera & Image Formation Electric Electronic Engineering Bogazici University February 21, 2018 Introduction Introduction Camera models Goal: To understand the image acquisition process. Function of the camera Similar to that of

More information

Coherent imaging without phases

Coherent imaging without phases Coherent imaging without phases Miguel Moscoso Joint work with Alexei Novikov Chrysoula Tsogka and George Papanicolaou Waves and Imaging in Random Media, September 2017 Outline 1 The phase retrieval problem

More information

Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization

Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization Shuyang Ling Department of Mathematics, UC Davis Oct.18th, 2016 Shuyang Ling (UC Davis) 16w5136, Oaxaca, Mexico Oct.18th, 2016

More information

Stochastic Analogues to Deterministic Optimizers

Stochastic Analogues to Deterministic Optimizers Stochastic Analogues to Deterministic Optimizers ISMP 2018 Bordeaux, France Vivak Patel Presented by: Mihai Anitescu July 6, 2018 1 Apology I apologize for not being here to give this talk myself. I injured

More information

4TE3/6TE3. Algorithms for. Continuous Optimization

4TE3/6TE3. Algorithms for. Continuous Optimization 4TE3/6TE3 Algorithms for Continuous Optimization (Algorithms for Constrained Nonlinear Optimization Problems) Tamás TERLAKY Computing and Software McMaster University Hamilton, November 2005 terlaky@mcmaster.ca

More information

Statistical Geometry Processing Winter Semester 2011/2012

Statistical Geometry Processing Winter Semester 2011/2012 Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian

More information

FIR filter design is one of the most basic and important

FIR filter design is one of the most basic and important 1 Nyquist Filter Design using POCS Methods: Including Constraints in Design Sanjeel Parekh and Pratik Shah arxiv:135.3446v3 [cs.it] 1 Jul 13 Abstract The problem of constrained finite impulse response

More information

Structured matrix factorizations. Example: Eigenfaces

Structured matrix factorizations. Example: Eigenfaces Structured matrix factorizations Example: Eigenfaces An extremely large variety of interesting and important problems in machine learning can be formulated as: Given a matrix, find a matrix and a matrix

More information

Phase Retrieval with Random Illumination

Phase Retrieval with Random Illumination Phase Retrieval with Random Illumination Albert Fannjiang, UC Davis Collaborator: Wenjing Liao NCTU, July 212 1 Phase retrieval Problem Reconstruct the object f from the Fourier magnitude Φf. Why do we

More information

550 XU Hai-Bo, WANG Guang-Rui, and CHEN Shi-Gang Vol. 37 the denition of the domain. The map is a generalization of the standard map for which (J) = J

550 XU Hai-Bo, WANG Guang-Rui, and CHEN Shi-Gang Vol. 37 the denition of the domain. The map is a generalization of the standard map for which (J) = J Commun. Theor. Phys. (Beijing, China) 37 (2002) pp 549{556 c International Academic Publishers Vol. 37, No. 5, May 15, 2002 Controlling Strong Chaos by an Aperiodic Perturbation in Area Preserving Maps

More information

arxiv: v1 [cs.it] 21 Feb 2013

arxiv: v1 [cs.it] 21 Feb 2013 q-ary Compressive Sensing arxiv:30.568v [cs.it] Feb 03 Youssef Mroueh,, Lorenzo Rosasco, CBCL, CSAIL, Massachusetts Institute of Technology LCSL, Istituto Italiano di Tecnologia and IIT@MIT lab, Istituto

More information