
Continuous Inverse Theory and Backus-Gilbert Application
Explore the application of Backus-Gilbert theory in solving continuous inverse problems, conversion to discrete problems, and solving the Radon's Problem in tomography. Understand the challenges of determining estimates of a model function and the importance of localized averages.
Download Presentation

Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Lecture 19 Continuous Problems: Backus-Gilbert Theory and Radon s Problem
Syllabus Lecture 01 Lecture 02 Lecture 03 Lecture 04 Lecture 05 Lecture 06 Lecture 07 Lecture 08 Lecture 09 Lecture 10 Lecture 11 Lecture 12 Lecture 13 Lecture 14 Lecture 15 Lecture 16 Lecture 17 Lecture 18 Lecture 19 Lecture 20 Lecture 21 Lecture 22 Lecture 23 Lecture 24 Describing Inverse Problems Probability and Measurement Error, Part 1 Probability and Measurement Error, Part 2 The L2 Norm and Simple Least Squares A Priori Information and Weighted Least Squared Resolution and Generalized Inverses Backus-Gilbert Inverse and the Trade Off of Resolution and Variance The Principle of Maximum Likelihood Inexact Theories Nonuniqueness and Localized Averages Vector Spaces and Singular Value Decomposition Equality and Inequality Constraints L1 , L Norm Problems and Linear Programming Nonlinear Problems: Grid and Monte Carlo Searches Nonlinear Problems: Newton s Method Nonlinear Problems: Simulated Annealing and Bootstrap Confidence Intervals Factor Analysis Varimax Factors, Empircal Orthogonal Functions Backus-Gilbert Theory for Continuous Problems; Radon s Problem Linear Operators and Their Adjoints Fr chet Derivatives Exemplary Inverse Problems, incl. Filter Design Exemplary Inverse Problems, incl. Earthquake Location Exemplary Inverse Problems, incl. Vibrational Problems
Purpose of the Lecture Extend Backus-Gilbert theory to continuous problems Discuss the conversion of continuous inverse problems to discrete problems Solve Radon s Problem the simplest tomography problem
Part 1 Backus-Gilbert Theory
Continuous Inverse Theory the data are discrete but the model parameter is a continuous function
One or several dimensions data model function
hopeless to try to determine estimates of model function at a particular depth m(z0) = ? localized average is the only way to go
hopeless to try to determine estimates of model function at a particular depth m(z0) = ? the problem is that an integral, such as the data kernel integral, does not depend upon the value of m(z) at a single point z0 localized average is the only way to go continuous version of resolution matrix
lets retain the idea that the solution depends linearly on the data
lets retain the idea that the solution depends linearly on the data continuous version of generalized inverse
comparison to discrete case <m m>=G G-gd d d d=Gm Gm <m m>=Rm Rm R R=G G-gG G
fine generalized inverse that minimizes the spread J with the constraint that = 1
J J has exactly the same form as the discrete case only the definition of S S is different
Hence the solution is the same as in the discrete case where
furthermore, just as we did in the discrete case, we can add the size of the covariance where
as before this just changes the definition of S S and leads to a trade-off of resolution and variance =1 size of variance =0 spread of resolution
Part 2 Approximating a Continuous Problem as a Discrete Problem
approximation using finite number of known functions
approximation using finite number of known functions known functions continuous function unknown coefficients = discrete model parameters
posssible fj(x)s voxels (and their lower dimension equivalents) polynomials splines Fourier (and similar) series and many others
does the choice of fj(x) matter? Yes! The choice implements prior information about the properties of the solution The solution will be different depending upon the choice
conversion to discrete Gm Gm=d d
special case of voxels 1 if x x inside Vi 0 otherwise fi(x) = size controlled by the scale of variation of m(x) integral over voxel j
approximation when Gi(x x) slowly varying center of voxel j size controlled by the scale of variation of Gi(x) more stringent condition than scale of variation of m(x)
Part 3 Tomography
Greek Root tomos a cut, cutting, slice, section
tomography as it is used in geophysics data are line integrals of the model function curve i
you can force this into the form if you want Gi(x x) but the Dirac delta function is not square- integrable, which leads to problems
Radons Problem straight line rays data d treated as a continuous variable
(u,) coordinate system for Radon Transform y s integrate over this line u x
Radon Transform m(x,y) d(u, )
(A) m(x,y) (B) d(u, ) x true image Radon transform reconstructed image -1 -1 -1 -0.5 -0.5 -0.5 u 0 0 0 u x x 0.5 0.5 0.5 1 1 1 y -1 -0.5 0 y 0.5 1 -1 -0.5 0 0.5 1 -1 -0.5 0 y 0.5 1 theta
Inverse Problem findm(x,y) given d(u, )
Solution via Fourier Transforms x kx kx x
now Fourier transform u ku now change variables (u, ) (x,y)
now Fourier transform u ku now change variables (s,u) (x,y) J=1, by the way Fourier transform of d(u, ) Fourier transform of m(x,y) evaluated on a line of slope
y ky ^^ m(x,y) m(kx,ky) u 0 0 x kx FT
Learned two things 1. Proof that solution exists and unique, based on well-known properties of Fourier Transform 2. Recipe how to invert a Radon transform using Fourier transforms
(A) (B) (C) true image Radon transform reconstructed image -1 -1 -1 -0.5 -0.5 -0.5 u u x x x x 0 0 0 0.5 0.5 0.5 1 1 1 -1 -0.5 0 y y 0.5 1 -1 -0.5 0 0.5 1 -1 -0.5 0 y y 0.5 1 theta