Guide for inversion of noisy magnetic field using FFT

Similar documents
1. Techniques for ill-posed least squares problems. We write throughout this lecture = 2. Consider the following least squares problems:

26257 Nonlinear Inverse Modeling of Magnetic Anomalies due to Thin Sheets and Cylinders Using Occam s Method

CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT

Spatial Enhancement Definition

Filtering Images. Contents

IMAGE DE-NOISING IN WAVELET DOMAIN

Estimation of Tikhonov Regularization Parameter for Image Reconstruction in Electromagnetic Geotomography

Reconstructing Images of Bar Codes for Construction Site Object Recognition 1

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Haar Wavelet Image Compression

arxiv: v3 [math.na] 14 Jun 2018

Deconvolution with curvelet-domain sparsity Vishal Kumar, EOS-UBC and Felix J. Herrmann, EOS-UBC

arxiv: v1 [cs.cv] 27 Oct 2016

Monocular Human Motion Capture with a Mixture of Regressors. Ankur Agarwal and Bill Triggs GRAVIR-INRIA-CNRS, Grenoble, France

Bindel, Spring 2015 Numerical Analysis (CS 4220) Figure 1: A blurred mystery photo taken at the Ithaca SPCA. Proj 2: Where Are My Glasses?

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.

A Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods

Note Set 4: Finite Mixture Models and the EM Algorithm

2.161 Signal Processing: Continuous and Discrete Fall 2008

Recognition and Measurement of Small Defects in ICT Testing

Blur Space Iterative De-blurring

CSE152 Introduction to Computer Vision Assignment 3 (SP15) Instructor: Ben Ochoa Maximum Points : 85 Deadline : 11:59 p.m., Friday, 29-May-2015

RAYLEIGH-SOMMERFELD DIFFRACTION INTEGRAL OF THE FIRST KIND TRIANGULAR APERTURES

A Lagrange method based L-curve for image restoration

Algebraic Iterative Methods for Computed Tomography

Assignment 3: Edge Detection

Image Sampling and Quantisation

Image Sampling & Quantisation

Nuts & Bolts of Advanced Imaging. Image Reconstruction Parallel Imaging

DCT image denoising: a simple and effective image denoising algorithm

Image Processing: Final Exam November 10, :30 10:30

Efficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest.

Tomographic reconstruction of shock layer flows

All images are degraded

Tutorial: Using Tina Vision s Quantitative Pattern Recognition Tool.

Digital Image Processing Laboratory: MAP Image Restoration

Locally Weighted Least Squares Regression for Image Denoising, Reconstruction and Up-sampling

Algebraic Iterative Methods for Computed Tomography

Image processing in frequency Domain

Image Deconvolution.

Problem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation

A Coupled 3D/2D Axisymmetric Method for Simulating Magnetic Metal Forming Processes in LS-DYNA

Super-Resolution from Image Sequences A Review

ENHANCED RADAR IMAGING VIA SPARSITY REGULARIZED 2D LINEAR PREDICTION

Illustration of SIR for CETB

CS 195-5: Machine Learning Problem Set 5

ANALYSIS OF GEOPHYSICAL POTENTIAL FIELDS A Digital Signal Processing Approach

Capturing, Modeling, Rendering 3D Structures

Bandwidth Selection for Kernel Density Estimation Using Total Variation with Fourier Domain Constraints

Issues During the Inversion of Crosshole Radar Data: Can We Have Confidence in the Outcome?

Total variation tomographic inversion via the Alternating Direction Method of Multipliers

Laboratorio di Problemi Inversi Esercitazione 3: regolarizzazione iterativa, metodo di Landweber

Single Particle Reconstruction Techniques

METRIC PLANE RECTIFICATION USING SYMMETRIC VANISHING POINTS

The 2D Fourier transform & image filtering

P257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies

Machine-learning Based Automated Fault Detection in Seismic Traces

Surfaces, meshes, and topology

Color Restoration Techniques for Faded Colors of Old Photos, Printings and Paintings

(x, y, z) m 2. (x, y, z) ...] T. m 2. m = [m 1. m 3. Φ = r T V 1 r + λ 1. m T Wm. m T L T Lm + λ 2. m T Hm + λ 3. t(x, y, z) = m 1

Computational Foundations of Cognitive Science. Inverse. Inverse. Inverse Determinant

Histograms. h(r k ) = n k. p(r k )= n k /NM. Histogram: number of times intensity level rk appears in the image

Practical Image and Video Processing Using MATLAB

Closing the Loop via Scenario Modeling in a Time-Lapse Study of an EOR Target in Oman

SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.

CE890 / ENE801 Lecture 1 Introduction to MATLAB

Digital Image Processing

Spatial Outlier Detection

Mostafa Naghizadeh and Mauricio D. Sacchi

Lab 4: Automatical thresholding and simple OCR

Fourier transforms and convolution

SD 372 Pattern Recognition

EE795: Computer Vision and Intelligent Systems

Digital Image Processing. Image Enhancement - Filtering

l ealgorithms for Image Registration

TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis

Image deconvolution using a characterization of sharp images in wavelet domain

Programming assignment 3 Mean-shift

Performance Evaluation of Monitoring System Using IP Camera Networks

Non-Rigid Image Registration III

Robust Shape Retrieval Using Maximum Likelihood Theory

Bagging for One-Class Learning

Inf2B assignment 2. Natural images classification. Hiroshi Shimodaira and Pol Moreno. Submission due: 4pm, Wednesday 30 March 2016.

Morphological Image Processing

Lecture 2.2 Cubic Splines

Announcements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10

Conforming Vector Interpolation Functions for Polyhedral Meshes

Machine Learning / Jan 27, 2010

Adaptive Wavelet Image Denoising Based on the Entropy of Homogenus Regions

Appendix 1: Manual for Fovea Software

Short Survey on Static Hand Gesture Recognition

Analysis of a silicon piezoresistive pressure sensor

Compressed Point Cloud Visualizations

Chapter 3: Functions and Files

Tracking Trajectories of Migrating Birds Around a Skyscraper

Three-Dimensional Motion Tracking using Clustering

l1 ls: A Matlab Solver for Large-Scale l 1 -Regularized Least Squares Problems

EECS 442: Final Project

Bio inspired, Invariant Image Reconstruction from Irregularly Placed Samples

Computer Vision I Name : CSE 252A, Fall 2012 Student ID : David Kriegman Assignment #1. (Due date: 10/23/2012) x P. = z

Transcription:

Guide for inversion of noisy magnetic field using FFT Eitan Levin Alexander Y. Meltzer August 29, 216 In this note, we explain how to use the code packages MagInverter2D and MagInverter1D to invert noisy measurements of the magnetic field to obtain the underlying current density. For the theory behind the method, see [3]. In what follows, we assume that we are given: d - the thickness of the sample, h - an estimate of the height above the surface of the sample, px - the pixel size in px as a length-2 vector with px(1) being the pixel size along the first dimension and px(2), along the second dimension. If the pixels are squares (px(1)=px(2)), the value in px can be a scalar. B - the noisy measurement of the normal component of the magnetic field, mu_ - the value of the permeability of free space. Note that this value sets the units for the lengths, the magnetic field, and the current density. lambdaarr - an array of values for the Tikhonov regularization parameter λ. To choose an appropriate value for λ, we minimize some function by first sampling it on a relatively sparse grid given by lambdaarr and then applying the fminbnd solver on intervals containing each local minimum on the grid to refine their value, finally choosing the global minimum. For the purposes of the examples used in [3] and the demonstrations shown in this note, we assume lengths (h, 1

d, px) are given in microns, magnetic fields (B) are given in Guass, the current density is given in ma/µm 2 and mu_= 4π. 1 Reconstruction of two-dimensional measurements using the direct and stream function methods To reconstruct currents using the FFT-based methods, we use the functions reconstructcurrentsfft direct and reconstructcurrentsfft stream for the direct and stream function methods, respectively. Their syntax is identical apart from the function name: [jx,jy] = reconstructcurrentsfft_direct(mu_,h,d,px,data,lambdaarr,plotf,imposerefbc,p); where we have three options: plotf - a boolean option to plot the projected SURE function sampled on lambdaarr. Note that since it was shown in [3] that the projected SURE method consistently either outperforms or performs similarly to GCV, only the projected SURE method is used in this function. imposerefbc - a boolean option specifying whether or not to impose reflections. If the underlying current distribution is known to be fully contained in the measurement window (i.e., the field was measured on a window larger than the sample and contains its entirety), boundary conditions are not needed and the user should set imposerefbc=. If, however, the current distribution extends beyond the measurement window (as is usually the case), boundary conditions are essential and the user should set imposerefbc=1. p - a layer of width ceil(p*size(data)) adjacent to the boundary to be excluded from the projected SURE parameter-choice method to preclude potential edge effects. The default value if p is not supplied or if p is left empty is p=.1. To demonstrate the above code, we use the function generateexamplesfft which generates the examples used in [3] by using: 2

[JxN,JyN,dataC] = generateexamplesfft(flag,mu_,h,d,px); where flag {1, 2, 3} is the example number from [3], the output JxN, JyN are matrices representing the true x and y current densities and datac represents the clean data. Specifically, we generate the second example used in [3] at a height h = 1 µm above a sample of width d =.5 µm and square pixels with side length 1 µm by setting in the above code flag=2; mu_=4*pi; h=1; d=.5; px=1. We then add white Gaussian noise to the clean data of variance σ 2 = 1 2 max B to generate the noisy measurement as data = datac + 1e-2*max(abs(dataC(:)))*randn(size(dataC));. A view from above of the clean and noisy data is presented in Fig. 1. We then set lambdaarr = logspace(-12,3,1e3) to be our sparse λ array and reconstruct the currents using the direct method, impose boundary conditions by setting imposerefbc=1 and use p=.1 to reconstruct the currents. The resulting reconstruction along with the true current density, is given in Fig. 2, with the produced error being MSD = j x; true j x 2 + j y; true j y 2 j x; true 2 + j y; true 2 =.124. We also show the projected SURE function used to estimate the regularization parameter in Fig. 3, generated by setting the plot option plotf=1. If we are interested in comparing the MSD values of the solution obtained by the GCV and projected SURE parameter-choice methods against the optimal one, we can use the functions reconstructcurrentsfft direct MSD and reconstructcurrentsfft stream MSD for the direct and stream function methods, respectively, with the syntax [Gmin,GPmin,Mmin,alphaG,alphaGP,alphaM]... = reconstructcurrentsfft_direct_msd(mu_,h,d,px,data,lambdaarr,plotf,imposerefbc,p,jxn,jyn) where the additional inputs are the true x and y current densities, and the outputs are: Gmin,GPmin - the MSD value obtained by using the GCV and projected SURE parameter-choice methods, respectively. Mmin - the minimal MSD value. 3

(a) (b) 8.1 8.1 6.5 6.5 4 4 2 -.5 2 -.5 2 4 6 8 2 4 6 8 Figure 1: Normal component of the magnetic field for second example (a) without noise, (b) with noise of variance σ 2 = 1 2 max B z. lambdag,lambdagp,lambdam - the values of λ found by GCV, projected SURE and the one minimizing the MSD, respectively. The same syntax applies also to reconstructcurrentsfft stream MSD that uses the stream function method. Note that setting plotf=1 here will generate plots of GCV, P-SURE and MSD versus λ, with appropriate labels for the y-axis to distinguish between them. Note also that here, we must specify p and cannot leave it empty. For the example in Fig. 1, we got Gmin=.123, GPmin =.124, Mmin=.123. 4

(a) (b) 8.6 8.6 6 4.4 6 4.4 2.2 2.2 2 4 6 8 Figure 2: Absolute value of the current densities J = j 2 x + j 2 y 2 4 6 8 for (a) the true distribution, (b) the distribution reconstructed from the noisy data Fig. 1..1.8 P-SURE(λ).6.4.2 1-1 1-5 1 λ Figure 3: Projected SURE method for the noisy data in Fig. 1. 5

2 Reconstruction of one-dimensional current distributions from one-dimensional measurements For a one dimensional problem, we assume that there is only current flowing in the x direction J = j x (y) x in the thin film, and that we have a noisy measurement of the z component of the field on a portion of the y axis B z = B z (y). Note that we have to assume the current is degenerate along the x axis for the continuity equation J = jx x can be written as the convolution = to hold, and that since j x is degenerate along x, so is B z. In such a case, the field B z (y) = K 1 (x, y, z, d) j x (y)dx = W 1 (y, z, d) j x (y), where the kernel K 1 (x, y, z, d) is defined in Eq.(3.3) in [3] while its x integral is given by [ ( ) ( )] W 1 (y, z, d) = µ 2π sign(y) y y arccos arccos. y2 + (z + d/2) 2 y2 + (z d/2) 2 If we use the concept of surface currents as in [3], the resulting one-dimensional kernel would be Z 1 (y, z) = µ y 2π y 2 + z 2. For one dimensional problems we do not use FFT because the small scale of the problem and the fact that the continuity equation is automatically satisfied and does constrain our solution enables us to directly solve the equation without assuming any boundary conditions on the problem (such as the periodic boundary conditions imposed by FFT or the reflexive ones used in [3]). The theory behind the algorithms used here is described in [2]. To invert a noisy measurement we use: [lambda,j,fm] = reconstructcurrents1d(mu_,h,d,px,b,lambdaarr,imposerefbc,plotf,method); where the variable names have identical interpretation to the 2D case. The additional input method can take on four value - SS, DFA, GCV, SURE - and specifies the parameter-choice method to be used for the reconstruction. If method is left unspecified or empty, the default method is SS. As an example of a 1D problem, consider the current distribution and its clean and noisy field shown in Fig. 4. To generate this example, we took the true current density to be the true solution of the shaw test problem from 6

.6 (a).6 (b).4.4 Btrue(y).2 B(y).2 -.2 -.2 -.4 2 4 6 8 1 y -.4 2 4 6 8 1 y Figure 4: (a) Clean and (b) noisy magnetic fields for one-dimensional example. Hnasen s Regularization Toolbox in [1] such that [~,~,j_true] = shaw(1e3);. We then generate the coefficient matrix A as A = generatetomomatrix1d(mu_,h,d,px,length(j_true),); and compute the true data as b_true = A*j_true;. Finally, we contaminate the data with white Gaussian noise of variance σ 2 = 1 2 max b true as b = b_true + sqrt(1e-2)*max(abs(b_true))*randn(size(b_true));. Using the same parameter values as before, we reconstruct the currents without boundary conditions and with the default method. The solution is shown in Fig. 5b along with the relative error the solution produced of j true j λ 2 / j true 2 =8.414e-4. References [1] P. C. Hansen, REGULARIZATION TOOLS: a Matlab package for analysis and solution of discrete ill-posed problems, Numer. Algorithms, 6 (1994), pp. 1 35, doi:1.17/bf2149761, http://dx.doi. org/1.17/bf2149761. [2] E. Levin and A. Meltzer, Estimation of the regularization parameter in linear discrete ill-posed problems using the Picard parameter, Submitted, (216), http://arxiv.org/abs/167.938, arxiv:167.938. [3] A. Meltzer, E. Levin, and E. Zeldov, Reconstruction of two-dimensional currents in a thin film from magnetic field measurement, Preprint. 7

6 4 2.5 2 j x;true j x;λ SS(λ) 2-2 j x (y) 1.5 1.5 1 1 5 λ (a) 2 4 6 8 1 y (b) Figure 5: (a) The minimum value of the SS function versus height values λ for the data in Fig. 4. (b) True and reconstructed solution for the data in Fig. 4. 8