SEAGLE: Robust Computational Imaging under Multiple Scattering

Similar documents
arxiv: v1 [cs.lg] 11 Mar 2016

A Recursive Born Approach to Nonlinear Inverse Scattering

arxiv: v1 [cs.cv] 5 May 2017

Minimizing Isotropic Total Variation without Subiterations

Learning MMSE Optimal Thresholds for FISTA

Versatile reconstruction framework for diffraction tomography with intensity measurements and multiple scattering

High resolution tomographic diffraction microscopy

Non-negative Matrix Factor Deconvolution; Extraction of Multiple Sound Sources from Monophonic Inputs

A Comparison Between Polynomial and Locally Weighted Regression for Fault Detection and Diagnosis of HVAC Equipment

Activity Mining in Sensor Networks

An Investigation of 3D Dual-Tree Wavelet Transform for Video Coding

Converting DCT Coefficients to H.264/AVC

Modified 2 gradient method and modified Born method for solving a two-dimensional inverse scattering problem

Conjugate gradient acceleration of non-linear smoothing filters

UWB Geolocation Techniques for IEEE a Personal Area Networks

Multi-Layer Terahertz Imaging of Non-Overlapping Contents

UNIVERSITY OF TRENTO MULTISCALING RECONSTRUCTION OF METALLIC TARGETS FROM TE. R. Azaro, M. Donelli, D. Franceschini, and A.Massa.

Estimation of Performance Loss Due to Delay in Channel Feedback in MIMO Systems

A Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization

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

The Gamma Variate with Random Shape Parameter and Some Applications

Deconvolution of Overlapping HPLC Aromatic Hydrocarbons Peaks Using Independent Component Analysis ICA

DNNs for Sparse Coding and Dictionary Learning

Deep convolutional framelets:

A FISTA-like scheme to accelerate GISTA?

The Theory of Diffraction Tomography

Inverse Transport Problems and Applications. II. Optical Tomography and Clear Layers. Guillaume Bal

MMSE Denoising of 2-D Signals Using Consistent Cycle Spinning Algorithm

The Factorization Method for Inverse Scattering Problems Part I

Adaptive beamforming for uniform linear arrays with unknown mutual coupling. IEEE Antennas and Wireless Propagation Letters.

Novel method for ultrashort laser pulse-width measurement based on the self-diffraction effect

One Mirror Descent Algorithm for Convex Constrained Optimization Problems with Non-Standard Growth Properties

arxiv: v1 [physics.geo-ph] 23 Dec 2017

Robust License Plate Detection Using Covariance Descriptor in a Neural Network Framework

Comparative Study of Restoration Algorithms ISTA and IISTA

IN THE reconstruction of material shapes and properties, we

Quantitative Microwave Imaging Based on a Huber regularization

A memory gradient algorithm for l 2 -l 0 regularization with applications to image restoration

A New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces

Optimization. Benjamin Recht University of California, Berkeley Stephen Wright University of Wisconsin-Madison

Dynamic On-resistance and Tunneling Based De-trapping in GaN HEMT

Relaxed linearized algorithms for faster X-ray CT image reconstruction

Continuous State MRF s

COMPRESSIVE OPTICAL DEFLECTOMETRIC TOMOGRAPHY

Sparse and Shift-Invariant Feature Extraction From Non-Negative Data

ECE G: Special Topics in Signal Processing: Sparsity, Structure, and Inference

FIBER Bragg gratings are important elements in optical

Proximal Gradient Descent and Acceleration. Ryan Tibshirani Convex Optimization /36-725

Master 2 MathBigData. 3 novembre CMAP - Ecole Polytechnique

Modeling microlenses by use of vectorial field rays and diffraction integrals

Inside-out electromagnetic cloaking

Experimental validation of a transport-based imaging method in highly scattering environments

Mueller Matrix Polarimetry: A Powerful Tool for Nanostructure Metrology

arxiv: v3 [physics.optics] 26 Mar 2012

Fundamentals on light scattering, absorption and thermal radiation, and its relation to the vector radiative transfer equation

In collaboration with J.-C. Pesquet A. Repetti EC (UPE) IFPEN 16 Dec / 29

Conjugate gradient acceleration of non-linear smoothing filters Iterated edge-preserving smoothing

Preconditioning for continuation model predictive control

Coherent imaging without phases

Inverse problem and optimization

Lecture 8: February 9

Dual methods for the minimization of the total variation

Optimal mass transport as a distance measure between images

A Coupled Helmholtz Machine for PCA

Direction-Adaptive Transforms for Coding Prediction Residuals

Electrodynamics Qualifier Examination

Inexact Alternating Direction Method of Multipliers for Separable Convex Optimization

arxiv: v1 [cs.mm] 2 Feb 2017 Abstract

ELECTROMAGNETIC SCATTERING FROM A CHIRAL- COATED NIHILITY CYLINDER

Photonic nanojet enhancement of backscattering of light by nanoparticles: a potential novel visible-light ultramicroscopy technique

Reconstruction of the refractive index by near- eld phaseless imaging

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

Non-negative Quadratic Programming Total Variation Regularization for Poisson Vector-Valued Image Restoration

Assessing light scattering of intracellular organelles in single intact living cells

Quantized Iterative Hard Thresholding:

Learning with stochastic proximal gradient

PROCEEDINGS OF SPIE. FDTD method and models in optical education. Xiaogang Lin, Nan Wan, Lingdong Weng, Hao Zhu, Jihe Du

Kirchhoff, Fresnel, Fraunhofer, Born approximation and more

Robust Sparse Recovery via Non-Convex Optimization

Light Propagation in Free Space

Variational Image Restoration

Supplementary Figure 1 Comparison between normalized and unnormalized reflectivity of

Fast proximal gradient methods

SIAM Conference on Imaging Science, Bologna, Italy, Adaptive FISTA. Peter Ochs Saarland University

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

Deep NMF for Speech Separation

New Scaling Factors of 2-D Isotropic-Dispersion Finite Difference Time Domain (ID-FDTD) Algorithm for Lossy Media

A far-field based T-matrix method for three dimensional acoustic scattering

Frequency Selective Surface Design Based on Iterative Inversion of Neural Networks

EXTENSION OF NESTED ARRAYS WITH THE FOURTH-ORDER DIFFERENCE CO-ARRAY ENHANCEMENT

MCMC Sampling for Bayesian Inference using L1-type Priors

Copyright 1972, by the author(s). All rights reserved.

FAST METHODS FOR EVALUATING THE ELECTRIC FIELD LEVEL IN 2D-INDOOR ENVIRONMENTS

Motion Estimation (I) Ce Liu Microsoft Research New England

Linear Systems. : object : image. Describes the output of a linear system. input. output. Impulse response function

Motion Estimation (I)

APPLICATION OF THE MAGNETIC FIELD INTEGRAL EQUATION TO DIFFRACTION AND REFLECTION BY A CONDUCTING SHEET

Comparing Realtime Energy-Optimizing Controllers for Heat Pumps

Scaled gradient projection methods in image deblurring and denoising

Stable Implicit Scheme for TM Transient Scattering from 2D Conducting Objects Using TD-EFIE

Transcription:

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com SEAGLE: Robust Computational Imaging under Multiple Scattering Liu, H.-Y.; Liu, D.; Mansour, H.; Boufounos, P.T.; Waller, L.; Kamilov, U. TR217-81 June 217 Abstract Multiple scattering of light as it passes through an object is a fundamental problem limiting the performance of imaging systems. We describe a new technique for robust imaging under multiple scattering based on a nonlinear scattering model and sparse-regularization. OSA Imaging and Applied Optics Congress This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c Mitsubishi Electric Research Laboratories, Inc., 217 21 Broadway, Cambridge, Massachusetts 2139

SEAGLE: Robust Computational Imaging under Multiple Scattering H.-Y. Liu1, D. Liu2, H. Mansour2, P. T. Boufounos2, L. Waller1, and U. S. Kamilov2, * 1 Department of Electrical Engineering and Computer Sciences, University of California, Berkley, CA, USA 2 Mitsubishi Electric Research Laboratories (MERL), Cambridge, MA, USA. Email: kamilov@merl.com. Abstract: Multiple scattering of light as it passes through an object is a fundamental problem limiting the performance of imaging systems. We describe a new technique for robust imaging under multiple scattering based on a nonlinear scattering model and sparse-regularization. OCIS codes: (11.1758) Computational Imaging; (29.421) Multiple Scattering; (1.32) Inverse Scattering. 1. Introduction Estimation of the spatial permittivity distribution of an unknown object from the measurements of the scattered lightfield is common in numerous imaging applications such as tomographic microscopy [1] and digital holography [2]. Traditionally, this inverse scattering problem is approximately solved by linearizing the relationship between the permittivity distribution and the measured light. A linear forward model can be obtained by assuming a straight-ray propagation of light, or by adopting more refined scattering models based on the first Born or Rytov approximations [3]. Linear scattering models assume weakly scattering objects, making corresponding imaging methods inherently inaccurate for many applications. This places fundamental limits in terms of resolution, penetration, and quality on the imaging systems relying on such models. Increasingly, however, inverse scattering approaches are being formulated as large-scale optimization problems, combining nonlinear scattering models with regularizers that can increase the robustness to noise and limited-data artifacts [4 7]. In this paper, we discuss an extension of the prior work by a new nonlinear scattering model and a total variation (TV) regularized inversion algorithm [8]. The key aspect of the proposed method called Series Expansion with Accelerated Gradient Descent on Lippmann-Schwinger Equation (SEAGLE) is its efficiency and stability, even for objects with large permittivity contrasts. This makes it suitable for robust imaging under multiple scattering. Here, we experimentally validated SEAGLE on the dataset [9], which contains measurements of strongly scattering objects at microwave frequencies. 2. Method Consider the scattering problem (Fig. 1) where an object of the permittivity distribution ε(xx) in the bounded domain Ω is immersed into a background medium of permittivity εb and illuminated with the incident electric field uin (xx). We assume that the incident field is monochromatic and coherent, and it is known inside Ω and at the locations of the sensors. The result of object-light interaction is measured at the location of the sensors as a scattered field usc (xx). The a. y b. uin f (x) x uin (x) image domain sensor domain f (x) image domain Fig. 1. Schematic representation of scattering scenarios in two and three dimensions. An object of a scattering potential f (xx) is illuminated with an input wave uin, which interacts with the object and leads to the scattered wave usc at the sensors.

multiple scattering of light can be accurately described by the Lippmann-Schwinger equation inside the image domain u(x) = u in (x) + g(x x ) f (x )u(x )dx, (x Ω) (1) Ω where u(x) = u in (x)+u sc (x) is the total electric field, f (x) k 2 (ε(x) ε b ) is the scattering potential, which is assumed to be real, and k = 2π/λ is the wavenumber in vacuum. The function g(x) is the Green s function defined as j 4 H(1) (k b x l2 ) in 2D g(x) e jk b x l2 in 3D, 4π x l2 where k b k ε b is the wavenumber of background medium and H (1) is the zero-order Hankel function of the first kind. Note that the knowledge of the total-field u inside the image domain Ω enables the prediction of the scattered field at the sensor domain u sc (x) = g(x x ) f (x )u(x )dx. (x Γ) (3) Ω The discretization and combination of (1) and (3) leads to the following matrix-vector description of the scattering problem (2) y = H(u f) + e u = u in + G(u f), (4a) (4b) where f R N is the discretized scattering potential f, y C M is the measured scattered field u sc at Γ, u in C N is the input field u in inside Ω, H C M N is the discretization of the Green s function at Γ, G C N N is the discretization of the Green s function inside Ω, denotes a component-wise multiplication between two vectors, and e C M models the random noise at the measurements. Using the shorthand notation A I Gdiag{f}, where I R N N is the identity matrix and diag{ } is an operator that forms a diagonal matrix from its argument, we can represent the forward scattering in (4b) as a minimization problem û(f) argmin u C N {S (u)} with S (u) 1 2 Au u in 2 l 2. (5) The gradient of S can be computed as S (u) = A H (Au u in ), which allows us to compute the total field û iteratively using the Nesterov s accelerated gradient method [1] q t 1 ( ) 1 + 1 + qt 1 2 (6a) 2 s t u t + ((q t 1 1)/q t )(u t u t 1 ) u t s t νa H (As t u in ), (6b) (6c) for t = 1,2,...,T, where u 1 = u = u in, q = 1, and ν > is the step-size. We finally set the predicted scattered field to z(f) = H(û(f) f) with û(f) = u T. It is worth noting that the final z returned by our forward scattering model is a function of f, which leads to the following formulation of the inverse scattering problem where f = argmin {D(f) + R(f)}, (7) f C N D(f) 1 2 y z(f) 2 l 2 and R(f) τ N n=1 [Df] n l2. (8) Here, D is the data-fidelity term that measures the discrepancy between the actual measurements y and the ones predicted by our scattering model z. The functional R is the isotropic TV regularizer with the parameter τ > controlling

the strength of the regularization. The image formation can then be done iteratively, using the proximal-gradient method f i prox γr ( f i 1 γ D(f i 1 ) ), (9) for i = 1,2,3,..., where γ > is a step-size. The operator prox γr for isotropic TV can be efficiently evaluated [11]. The gradient is given by D(f) = Re{r }, where r is computed using the following iteration T t diag { G H (As t u in ) } H + diag{s t } H G H A q t 1 (1 µ t )Sq t + µ t+1 Sq t+1 r t 1 r t + νt t q t, (1a) (1b) (1c) for t = T,T 1,...,1, where s t is from (6b), q T +1 =, q T = diag{f} H H H (z y) and r T = diag{û} H H H (z y). Here, we use the definitions S I νa H A and µ t (1 q t 1 )/q t. The remarkable aspect of this backpropagation algorithm is that it allows for an explicit differentiation of a nonlinear scattering model with respect to the scattering potential, which in turn enables efficient large-scale computational imaging. 3. Results To validate the algorithm, we consider experimental measuremnts of the object FoamDielExtTM from a dataset [9]. The object consists of two cylinders on a rim of radius of 1.67 m, and a measurement set-up is similar to that in Fig. 1(a). The image domain has size 15 cm 15 cm. There are 9 transmitters and 24 detectors for each transmitter, all equally spaced on the rim. Our results in Fig. 2 use the data only at 3 GHz, and highlight the remarkable performance of SEAGLE on this strongly scattering object. ground truth 2.3 Rytov.3 proposed 2.3 error data fit 1 2 FB & Rytov Re.2 1-2 proposed 1-4 2 -.2 1 2 Im.2.5 2 -.2 1 iterations 4 6 receiver angle 3 Fig. 2. Experimental validation of the proposed method on the highly scattering object FoamDielExtTM. The first three columns show from left to right, the ground truth, reconstruction using the Rytov approximation, and using SEAGLE, respectively. The fourth column shows the evolution of the normalized data-fit (top) and the normalized reconstruction error (bottom). The last column shows the true and predicted measurements for the transmission angle zero. The scale bar is equal to the wavelength λ at 3 GHz. References 1. W. Choi, C. Fang-Yen, K. Badizadegan, S. Oh, N. Lue, R. R. Dasari, and M. S. Feld, Tomographic phase microscopy, Nat. Methods, vol. 4, pp. 717 719, September 27. 2. D. J. Brady, K. Choi, D. L. Marks, R. Horisaki, and S. Lim, Compressive holography, Opt. Express, vol. 17, no. 15, pp. 134 1349, 29. 3. A. C. Kak and M. Slaney, Principles of Computerized Tomographic Imaging. IEEE, 1988. 4. L. Tian and L. Waller, 3D intensity and phase imaging from light field measurements in an LED array microscope, Optica, vol. 2, pp. 14 111, 215. 5. U. S. Kamilov, I. N. Papadopoulos, M. H. Shoreh, A. Goy, C. Vonesch, M. Unser, and D. Psaltis, Learning approach to optical tomography, Optica, vol. 2, pp. 517 522, June 215. 6. T. Zhang, C. Godavarthi, P. C. Chaumet, G. Maire, H. Giovannini, A. Talneau, M. Allain, K. Belkebir, and A. Sentenac, Far-field diffraction microscopy at λ/1 resolution, Optica, vol. 3, pp. 69 612, June 216. 7. U. S. Kamilov, D. Liu, H. Mansour, and P. T. Boufounos, A recursive Born approach to nonlinear inverse scattering, IEEE Signal Process. Lett., vol. 23, pp. 152 156, August 216. 8. H.-Y. Liu, U. S. Kamilov, D. Liu, H. Mansour, and P. T. Boufounos, Compressive imaging with iterative forward models, in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Process. (ICASSP 217), (New Orleans, LA, USA), March 5-9, 217. 9. J.-M. Geffrin, P. Sabouroux, and C. Eyraud, Free space experimental scattering database continuation: experimental set-up and measurement precision, Inv. Probl., vol. 21, no. 6, pp. S117 S13, 25. 1. Y. E. Nesterov, A method for solving the convex programming problem with convergence rate O(1/k 2 ), Dokl. Akad. Nauk SSSR, vol. 269, pp. 543 547, 1983. (in Russian). 11. A. Beck and M. Teboulle, Fast gradient-based algorithm for constrained total variation image denoising and deblurring problems, IEEE Trans. Image Process., vol. 18, pp. 2419 2434, November 29.