Strategies for Inverse Profiling of Two Dimensional Dielectric Scatterers Using Electromagnetic Illumination

Electromagnetic tomography has been applied to problems in nondestructive evolution, ground-penetrating radar, synthetic aperture radar, target identification, electrical well logging, medical imaging etc. The problem of electromagnetic tomography involves the estimation of cross sectional distribution dielectric permittivity, conductivity etc based on measurement of the scattered fields. The inverse scattering problem of electromagnetic imaging is highly non linear and ill posed, and is liable to get trapped in local minima. The iterative solution techniques employed for computing the inverse scattering problem of electromagnetic imaging are highly computation intensive. Thus the solution to electromagnetic imaging problem is beset with convergence and computational issues. The attempt of this thesis is to develop methods suitable for improving the convergence and reduce the total computations for tomographic imaging of two dimensional dielectric cylinders illuminated by TM polarized waves, where the scattering problem is defmed using scalar equations. A multi resolution frequency hopping approach was proposed as opposed to the conventional frequency hopping approach employed to image large inhomogeneous scatterers. The strategy was tested on both synthetic and experimental data and gave results that were better localized and also accelerated the iterative procedure employed for the imaging. A Degree of Symmetry formulation was introduced to locate the scatterer in the investigation domain when the scatterer cross section was circular. The investigation domain could thus be reduced which reduced the degrees of freedom of the inverse scattering process. Thus the entire measured scattered data was available for the optimization of fewer numbers of pixels. This resulted in better and more robust reconstructions of the scatterer cross sectional profile. The Degree of Symmetry formulation could also be applied to the practical problem of limited angle tomography, as in the case of a buried pipeline, where the ill posedness is much larger. The formulation was also tested using experimental data generated from an experimental setup that was designed. The experimental results confirmed the practical applicability of the formulation.

A direct D-bar reconstruction algorithm for recovering a complex conductivity in 2D

A direct reconstruction algorithm for complex conductivities in W-2,W-infinity(Omega), where Omega is a bounded, simply connected Lipschitz domain in R-2, is presented. The framework is based on the uniqueness proof by Francini (2000 Inverse Problems 6 107-19), but equations relating the Dirichlet-to-Neumann to the scattering transform and the exponentially growing solutions are not present in that work, and are derived here. The algorithm constitutes the first D-bar method for the reconstruction of conductivities and permittivities in two dimensions. Reconstructions of numerically simulated chest phantoms with discontinuities at the organ boundaries are included.

A sampling method for detecting buried objects using electromagnetic scattering

We consider a simple (but fully three-dimensional) mathematical model for the electromagnetic exploration of buried, perfect electrically conducting objects within the soil underground. Moving an electric device parallel to the ground at constant height in order to generate a magnetic field, we measure the induced magnetic field within the device, and factor the underlying mathematics into a product of three operations which correspond to the primary excitation, some kind of reflection on the surface of the buried object(s) and the corresponding secondary excitation, respectively. Using this factorization we are able to give a justification of the so-called sampling method from inverse scattering theory for this particular set-up.

Shift, scaling and derivative properties for the discrete cosine transform

A set of DCT domain properties for shifting and scaling by real amounts, and taking linear operations such as differentiation is described. The DCT coefficients of a sampled signal are subjected to a linear transform, which returns the DCT coefficients of the shifted, scaled and/or differentiated signal. The properties are derived by considering the inverse discrete transform as a cosine series expansion of the original continuous signal, assuming sampling in accordance with the Nyquist criterion. This approach can be applied in the signal domain, to give, for example, DCT based interpolation or derivatives. The same approach can be taken in decoding from the DCT to give, for example, derivatives in the signal domain. The techniques may prove useful in compressed domain processing applications, and are interesting because they allow operations from the continuous domain such as differentiation to be implemented in the discrete domain. An image matching algorithm illustrates the use of the properties, with improvements in computation time and matching quality.

An approximate method for the solution of an influence function foil rolling model

Fleck and Johnson (Int. J. Mech. Sci. 29 (1987) 507) and Fleck et al. (Proc. Inst. Mech. Eng. 206 (1992) 119) have developed foil rolling models which allow for large deformations in the roll profile, including the possibility that the rolls flatten completely. However, these models require computationally expensive iterative solution techniques. A new approach to the approximate solution of the Fleck et al. (1992) Influence Function Model has been developed using both analytic and approximation techniques. The numerical difficulties arising from solving an integral equation in the flattened region have been reduced by applying an Inverse Hilbert Transform to get an analytic expression for the pressure. The method described in this paper is applicable to cases where there is or there is not a flat region.

Image reconstruction from incomplete projections data: A multiresolution modeling approach

Computerized tomography is an imaging technique which produces cross sectional map of an object from its line integrals. Image reconstruction algorithms require collection of line integrals covering the whole measurement range. However, in many practical situations part of projection data is inaccurately measured or not measured at all. In such incomplete projection data situations, conventional image reconstruction algorithms like the convolution back projection algorithm (CBP) and the Fourier reconstruction algorithm, assuming the projection data to be complete, produce degraded images. In this paper, a multiresolution multiscale modeling using the wavelet transform coefficients of projections is proposed for projection completion. The missing coefficients are then predicted based on these models at each scale followed by inverse wavelet transform to obtain the estimated projection data.

Super-Resolution Reconstruction in Frequency-Domain Optical-Coherence Tomography Using the Finite-Rate-of-Innovation Principle

The standard approach to signal reconstruction in frequency-domain optical-coherence tomography (FDOCT) is to apply the inverse Fourier transform to the measurements. This technique offers limited resolution (due to Heisenberg's uncertainty principle). We propose a new super-resolution reconstruction method based on a parametric representation. We consider multilayer specimens, wherein each layer has a constant refractive index and show that the backscattered signal from such a specimen fits accurately in to the framework of finite-rate-of-innovation (FRI) signal model and is represented by a finite number of free parameters. We deploy the high-resolution Prony method and show that high-quality, super-resolved reconstruction is possible with fewer measurements (about one-fourth of the number required for the standard Fourier technique). To further improve robustness to noise in practical scenarios, we take advantage of an iterated singular-value decomposition algorithm (Cadzow denoiser). We present results of Monte Carlo analyses, and assess statistical efficiency of the reconstruction techniques by comparing their performance against the Cramer-Rao bound. Reconstruction results on experimental data obtained from technical as well as biological specimens show a distinct improvement in resolution and signal-to-reconstruction noise offered by the proposed method in comparison with the standard approach.

I. Exact solution of some nonlinear evolution equations. II. The similarity solution for the Korteweg-De Vries equation and the related Painleve Transcendent

In Part I, a method for finding solutions of certain diffusive dispersive nonlinear evolution equations is introduced. The method consists of a straightforward iteration procedure, applied to the equation as it stands (in most cases), which can be carried out to all terms, followed by a summation of the resulting infinite series, sometimes directly and other times in terms of traces of inverses of operators in an appropriate space.

We first illustrate our method with Burgers' and Thomas' equations, and show how it quickly leads to the Cole-Hopft transformation, which is known to linearize these equations.

We also apply this method to the Korteweg and de Vries, nonlinear (cubic) Schrödinger, Sine-Gordon, modified KdV and Boussinesq equations. In all these cases the multisoliton solutions are easily obtained and new expressions for some of them follow. More generally we show that the Marcenko integral equations, together with the inverse problem that originates them, follow naturally from our expressions.

Only solutions that are small in some sense (i.e., they tend to zero as the independent variable goes to ∞) are covered by our methods. However, by the study of the effect of writing the initial iterate u_1 = u_(1)(x,t) as a sum u_1 = ^∼/u_1 + ^≈/u_1 when we know the solution which results if u_1 = ^∼/u_1, we are led to expressions that describe the interaction of two arbitrary solutions, only one of which is small. This should not be confused with Backlund transformations and is more in the direction of performing the inverse scattering over an arbitrary “base” solution. Thus we are able to write expressions for the interaction of a cnoidal wave with a multisoliton in the case of the KdV equation; these expressions are somewhat different from the ones obtained by Wahlquist (1976). Similarly, we find multi-dark-pulse solutions and solutions describing the interaction of envelope-solitons with a uniform wave train in the case of the Schrodinger equation.

Other equations tractable by our method are presented. These include the following equations: Self-induced transparency, reduced Maxwell-Bloch, and a two-dimensional nonlinear Schrodinger. Higher order and matrix-valued equations with nonscalar dispersion functions are also presented.

In Part II, the second Painleve transcendent is treated in conjunction with the similarity solutions of the Korteweg-de Vries equat ion and the modified Korteweg-de Vries equation.

Dynamic full-range Fourier-domain optical coherence tomography using sinusoidal phase-modulating interferometry

We propose a technique for dynamic full-range Fourier-domain optical coherence tomography by using sinusoidal phase-modulating interferometry, where both the full-range structural information and depth-resolved dynamic information are obtained. A novel frequency-domain filtering algorithm is proposed to reconstruct a time-dependent complex spectral interferogram from the sinusoidally phase-modulated interferogram detected with a high-rate CCD camera. By taking the amplitude and phase of the inverse Fourier transform of the complex spectral interferogram, a time-dependent full-range cross-sectional image and depth-resolved displacement are obtained. Displacement of a sinusoidally vibrating glass cover slip behind a fixed glass cover slip is measured with subwavelength sensitivity to demonstrate the depth-resolved dynamic imaging capability of our system. (c) 2007 Society of Photo-Optical Instrumentation Engineers.

Dynamic full-range Fourier-domain optical coherence tomography using sinusoidal phase-modulating interferometry

We propose a technique for dynamic full-range Fourier-domain optical coherence tomography by using sinusoidal phase-modulating interferometry, where both the full-range structural information and depth-resolved dynamic information are obtained. A novel frequency-domain filtering algorithm is proposed to reconstruct a time-dependent complex spectral interferogram from the sinusoidally phase-modulated interferogram detected with a high-rate CCD camera. By taking the amplitude and phase of the inverse Fourier transform of the complex spectral interferogram, a time-dependent full-range cross-sectional image and depth-resolved displacement are obtained. Displacement of a sinusoidally vibrating glass cover slip behind a fixed glass cover slip is measured with subwavelength sensitivity to demonstrate the depth-resolved dynamic imaging capability of our system. (c) 2007 Society of Photo-Optical Instrumentation Engineers.

正弦相位调制的频域光学相干层析成像

提出一种基于正弦相位调制的频域光学相干层析成像,利用正弦相位调制干涉术探测复频域干涉条纹的实部和虚部,重建复频域干涉条纹。对该复频域干涉条纹作逆傅里叶变换后,消除了频域光学相干层析成像中存在的复共轭镜像以及直流背景和自相干噪声。对玻璃片样品进行了层析成像实验。实验结果表明,采用正弦相位调制的频域光学相干层析成像,将可利用的成像深度范围扩大到原来的2倍,实现了全深度探测的频域光学相干层析成像。

基于多特征模糊聚类的图像融合方法

首先利用模糊C-均值聚类算法在多特征形成的特征空间上对图像进行区域分割,并在此基础上对区域进行多尺度小波分解;然后利用柯西函数构造区域的模糊相似度,应用模糊相似度及区域信息量构造加权因子,从而得到融合图像的小波系数;最后利用小波逆变换得到融合图像·采用均方根误差、峰值信噪比、熵、交叉熵和互信息5种准则评价融合算法的性能·实验结果表明,文中方法具有良好的融合特性·

基于波动方程的层间多次波预测方法研究

In exploration geophysics，velocity analysis and migration methods except reverse time migration are based on ray theory or one-way wave-equation. So multiples are regarded as noise and required to be attenuated. It is very important to attenuate multiples for structure imaging, amplitude preserving migration. So it is an interesting research in theory and application about how to predict and attenuate internal multiples effectively. There are two methods based on wave-equation to predict internal multiples for pre-stack data. One is common focus point method. Another is inverse scattering series method. After comparison of the two methods, we found that there are four problems in common focus point method: 1. dependence of velocity model; 2. only internal multiples related to a layer can be predicted every time; 3. computing procedure is complex; 4. it is difficult to apply it in complex media. In order to overcome these problems, we adopt inverse scattering series method. However, inverse scattering series method also has some problems: 1. computing cost is high; 2. it is difficult to predict internal multiples in the far offset; 3. it is not able to predict internal multiples in complex media. Among those problems, high computing cost is the biggest barrier in field seismic processing. So I present 1D and 1.5D improved algorithms for reducing computing time. In addition, I proposed a new algorithm to solve the problem which exists in subtraction, especially for surface related to multiples. The creative results of my research are following: 1. derived an improved inverse scattering series prediction algorithm for 1D. The algorithm has very high computing efficiency. It is faster than old algorithm about twelve times in theory and faster about eighty times for lower spatial complexity in practice; 2. derived an improved inverse scattering series prediction algorithm for 1.5D. The new algorithm changes the computing domain from pseudo-depth wavenumber domain to TX domain for predicting multiples. The improved algorithm demonstrated that the approach has some merits such as higher computing efficiency, feasibility to many kinds of geometries, lower predictive noise and independence to wavelet； 3. proposed a new subtraction algorithm. The new subtraction algorithm is not used to overcome nonorthogonality, but utilize the nonorthogonality's distribution in TX domain to estimate the true wavelet with filtering method. The method has excellent effectiveness in model testing. Improved 1D and 1.5D inverse scattering series algorithms can predict internal multiples. After filtering and subtracting among seismic traces in a window time, internal multiples can be attenuated in some degree. The proposed 1D and 1.5D algorithms have demonstrated that they are effective to the numerical and field data. In addition, the new subtraction algorithm is effective to the complex theoretic models.

表面相关多次波衰减方法与应用研究

The function of seismic data in prospecting and exploring oil and gas has exceeded ascertaining structural configuration early. In order to determine the advantageous target area more exactly, we need exactly image the subsurface media. So prestack migration imaging especially prestack depth migration has been used increasingly widely. Currently, seismic migration imaging methods are mainly based on primary energy and most of migration methods use one-way wave equation. Multiple will mask primary and sometimes will be regarded as primary and interferes with the imaging of primary, so multiple elimination is still a very important research subject. At present there are three different wavefield prediction and subtraction methods: wavefield extrapolation; feedback loop; and inverse-scattering series. I mainly do research on feedback loop method in this paper. Feedback loop method includs prediction and subtraction.Currently this method has some problems as follows. Firstly, feedback loop method requires the seismic data used to predict multiple is full wavefield data, but usually the original seismic data don’t meet this assumption, so seismic data must be regularized. Secondly, Multiple predicted through feedback loop method usually can’t match the real multiple in seismic data and they are different in amplitude, phase and arrrival time. So we need match the predicted multiple and that in seismic data through estimating filtering factors and subtract multiple from seismic data. It is the key for multiple elimination how to select a correct matching filtering method. There are many matching filtering methods and I put emphasis on Least-square adaptive matching filtering and L1-norm minimizing adaptive matching filtering methods. Least-square adaptive matching filtering method is computationally very fast, but it has two assumptions: the signal has minimum energy and is orthogonal to the noise. When seismic data don’t meet the two assumptions, this method can’t get good matching results and then can’t attenuate multiple correctly. L1-norm adaptive matching filtering methods can avoid these two assumptions and then get good matching results, but this method is computationally a little slow. The results of my research are as follows: 1. Proposed a method that interpolates seismic traces based on F-K migration and demigration. The main advantage of this method is that it can interpolate seismic traces in any offsets. It shows this method is valid through a simple model. 2. Comparing different Least-square adaptive matching filtering methods. The results show that equipose multi-channel adaptive matching filtering methods can get better results of multiple elimination than other matcing methods through three model data and two field data. 3. Proposed equipose multi-channel L1-norm adaptive matching filtering method. Because L1-norm is robust to large amplitude differences, there are no assumption on the signal has minimum energy and orthogonality, this method can get better results of multiple elimination. 4. Research on multiple elimination in inverse data space. The method is a new multiple elimination method and it is different from those methods mentioned above.The advantages of this method is that it is simple in theory and no need for the adaptive subtraction and computationally very fast. The disadvantage of this method is that it is not stabilized in its solution. The results show that equipose multi-channel and equipose pesudo-multi-channel least-square matching filtering and equipose multi-channel and equipose pesudo-multi-channel L1-norm matching filtering methods can get better results of multiple elimination than other matcing methods through three model data and many field data.

A distributed algorithm for European options with nonlinear volatility

A distributed algorithm is developed to solve nonlinear Black-Scholes equations in the hedging of portfolios. The algorithm is based on an approximate inverse Laplace transform and is particularly suitable for problems that do not require detailed knowledge of each intermediate time steps.