WorldWideScience

Sample records for cgls inversion algorithm

  1. Nonlinear Microwave Imaging for Breast-Cancer Screening Using Gauss–Newton's Method and the CGLS Inversion Algorithm

    DEFF Research Database (Denmark)

    Rubæk, Tonny; Meaney, P. M.; Meincke, Peter;

    2007-01-01

    Breast-cancer screening using microwave imaging is emerging as a new promising technique as a supplement to X-ray mammography. To create tomographic images from microwave measurements, it is necessary to solve a nonlinear inversion problem, for which an algorithm based on the iterative Gauss-Newton...... method has been developed at Dartmouth College. This algorithm determines the update values at each iteration by solving the set of normal equations of the problem using the Tikhonov algorithm. In this paper, a new algorithm for determining the iteration update values in the Gauss-Newton algorithm...... algorithm is compared to the Gauss-Newton algorithm with Tikhonov regularization and is shown to reconstruct images of similar quality using fewer iterations....

  2. Inverse Computation and the Universal Resolving Algorithm

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We survey fundamental concepts for inverse programming and thenpresent the Uni v ersal Resolving Algorithm, an algorithm for inverse computation in a first-orde r , functional programming language. We discuss the key concepts of the algorithm, including a three-step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples of inverse computation.

  3. An inversion algorithm for general tridiagonal matrix

    Institute of Scientific and Technical Information of China (English)

    Rui-sheng RAN; Ting-zhu HUANG; Xing-ping LIU; Tong-xiang GU

    2009-01-01

    An algorithm for the inverse of a general tridiagonal matrix is presented. For a tridiagonal matrix having the Doolittle factorization, an inversion algorithm is established.The algorithm is then generalized to deal with a general tridiagonal matrix without any restriction. Comparison with other methods is provided, indicating low computational complexity of the proposed algorithm, and its applicability to general tridiagonal matrices.

  4. New recursive algorithm for matrix inversion

    Institute of Scientific and Technical Information of China (English)

    Cao Jianshu; Wang Xuegang

    2008-01-01

    To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms (called algorithms Ⅰ and Ⅱ, respectively)are presented. Algorithm Ⅰ is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm Ⅱ, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm Ⅰ. The implementation, for algorithm Ⅱ or Ⅰ, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.

  5. An algorithm for constructing minimal order inverses

    Science.gov (United States)

    Patel, R. V.

    1976-01-01

    In this paper an algorithm is presented for constructing minimal order inverses of linear, time invariant, controllable and observable, multivariable systems. By means of simple matrix operations, a 'state-overdescribed' system is first constructed which is an inverse of the given multivariable system. A simple Gauss-Jordan type reduction procedure is then used to remove the redundancy in the state vector of the inverse system to obtain a minimal order inverse. When the given multivariable system is not invertible, the algorithm enables a minimal order inverse of an invertible subsystem to be constructed. Numerical examples are given to illustrate the use of the algorithm.

  6. Reverse Universal Resolving Algorithm and inverse driving

    DEFF Research Database (Denmark)

    Pécseli, Thomas

    2012-01-01

    variant of the Universal Resolving Algorithm for inverse interpretation. The new variant outperforms the original algorithm in several cases, e.g., when unpacking a list using inverse interpretation of a pack program. It uses inverse driving as its main technique, which has not been described in detail......Inverse interpretation is a semantics based, non-standard interpretation of programs. Given a program and a value, an inverse interpreter finds all or one of the inputs, that would yield the given value as output with normal forward evaluation. The Reverse Universal Resolving Algorithm is a new...

  7. Parallel Algorithm in Surface Wave Waveform Inversion

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In Surface wave waveform inversion, we want to reconstruct 3Dshear wav e velocity structure, which calculation beyond the capability of the powerful pr esent day personal computer or even workstation. So we designed a high parallele d algorithm and carried out the inversion on Parallel computer based on the part itioned waveform inversion (PWI). It partitions the large scale optimization pro blem into a number of independent small scale problems and reduces the computati onal effort by several orders of magnitude. We adopted surface waveform inversio n with a equal block(2°×2°) discretization.

  8. Diagonally loaded SMI algorithm based on inverse matrix recursion

    Institute of Scientific and Technical Information of China (English)

    Cao Jianshu; Wang Xuegang

    2007-01-01

    The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e. LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, acorresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings.Simulations show that the LSMI-IMR algorithm is valid.

  9. Algorithms for Finding the Inverses of Factor Block Circulant Matrices

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    In this paper, algorithms for finding the inverse of a factor block circulant matrix,a factor block retrocirculant matrix and partitioned matrix with factor block circulant blocks over the complex field are presented respectively. In addition, two algorithms for the inverse of a factor block circulant matrix over the quaternion division algebra are proposed.

  10. An iterative algorithm in potential-field inversion

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    The problem of potential-field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regularized method is one of the best algorithms. But there is a shortcoming in application with the regularized method, viz. the optimum regularized parameter must be determined by experience, so it is difficulty to obtain an optimum solution. In this paper, an iterative algorithm for solving any system of linear equations is discussed, and a sufficient and necessary condition of the algorithm convergence is presented and proved. The algorithm is convergent for any starting point, and the optimum solution can be obtained, in particular, there is no need to calculate the inverse matrix in the algorithm. The typical practical example shows the iterative algorithm is simple and practicable, and the inversion effect is better than that of regularized method.

  11. ALGORITHMS FOR IMPLEMENTATION OF GENERAL LIMIT REPRESENTATIONS OF GENERALIZED INVERSES

    Institute of Scientific and Technical Information of China (English)

    Predarg S.Stanimirovic

    2001-01-01

    In this paper we investigate three various algorithms for computation of generalized inverses which are contained in the limit expressions and These algorithms are extensions of the algorithms developed by various authors in [2], [3-4], [7-9], [16-18].

  12. The Inverse Bagging Algorithm: Anomaly Detection by Inverse Bootstrap Aggregating

    CERN Document Server

    Vischia, Pietro

    2016-01-01

    For data sets populated by a very well modeled process and by another process of unknown probability density function (PDF), a desired feature when manipulating the fraction of the unknown process (either for enhancing it or suppressing it) consists in avoiding to modify the kinematic distributions of the well modeled one. A bootstrap technique is used to identify sub-samples rich in the well modeled process, and classify each event according to the frequency of it being part of such sub-samples. Comparisons with general MVA algorithms will be shown, as well as a study of the asymptotic properties of the method, making use of a public domain data set that models a typical search for new physics as performed at hadronic colliders such as the Large Hadron Collider (LHC).

  13. Anti-Jamming with Adaptive Arrays Utilizing Power Inversion Algorithm

    Institute of Scientific and Technical Information of China (English)

    MENG Dawei; FENG Zhenming; LU Mingquan

    2008-01-01

    The convergence rate of the power inversion (PI) algorithm is quite sensitive to the power of the interference with the used fixed parameters in the PI algorithm leading to degradation of its ability to handle interference. This paper presents a normalized PI algorithm that traces the stochastic characteristics of the interference. The algorithm adaptively adjusts the recursive step size to determine the constrained optimized parameters for the Iowpass filter. Simulations show that the normalized PI algorithm achieves faster con-vergence and produces deeper nulls. The algorithm makes GPS receivers more robust in environments with large variations in the interference strength.

  14. Inverse synthetic aperture radar imaging principles, algorithms and applications

    CERN Document Server

    Chen , Victor C

    2014-01-01

    Inverse Synthetic Aperture Radar Imaging: Principles, Algorithms and Applications is based on the latest research on ISAR imaging of moving targets and non-cooperative target recognition (NCTR). With a focus on the advances and applications, this book will provide readers with a working knowledge on various algorithms of ISAR imaging of targets and implementation with MATLAB. These MATLAB algorithms will prove useful in order to visualize and manipulate some simulated ISAR images.

  15. Modular Inverse Algorithms Without Multiplications for Cryptographic Applications

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available Hardware and algorithmic optimization techniques are presented to the left-shift, right-shift, and the traditional Euclidean-modular inverse algorithms. Theoretical arguments and extensive simulations determined the resulting expected running time. On many computational platforms these turn out to be the fastest known algorithms for moderate operand lengths. They are based on variants of Euclidean-type extended GCD algorithms. On the considered computational platforms for operand lengths used in cryptography, the fastest presented modular inverse algorithms need about twice the time of modular multiplications, or even less. Consequently, in elliptic curve cryptography delaying modular divisions is slower (affine coordinates are the best and the RSA and ElGamal cryptosystems can be accelerated.

  16. Modular Inverse Algorithms Without Multiplications for Cryptographic Applications

    Directory of Open Access Journals (Sweden)

    Laszlo Hars

    2006-03-01

    Full Text Available Hardware and algorithmic optimization techniques are presented to the left-shift, right-shift, and the traditional Euclidean-modular inverse algorithms. Theoretical arguments and extensive simulations determined the resulting expected running time. On many computational platforms these turn out to be the fastest known algorithms for moderate operand lengths. They are based on variants of Euclidean-type extended GCD algorithms. On the considered computational platforms for operand lengths used in cryptography, the fastest presented modular inverse algorithms need about twice the time of modular multiplications, or even less. Consequently, in elliptic curve cryptography delaying modular divisions is slower (affine coordinates are the best and the RSA and ElGamal cryptosystems can be accelerated.

  17. Underground water quality model inversion of genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    MA Ruijie; LI Xin

    2009-01-01

    The underground water quality model with non-linear inversion problem is ill-posed, and boils down to solving the minimum of nonlinear function. Genetic algorithms are adopted in a number of individuals of groups by iterative search to find the optimal solution of the problem, the encoding strings as its operational objective, and achieving the iterative calculations by the genetic operators. It is an effective method of inverse problems of groundwater, with incomparable advantages and practical significances.

  18. A Convergent Iterative Algorithm for Solving Elastic Waveform Inversion

    Institute of Scientific and Technical Information of China (English)

    张剑锋

    1994-01-01

    The numerical method for elastic waveform inversion is studied and a convergent iterative algorithm is achieved by designing vinual source and altering objective function of the optimization solution in the computational process, which enables the solutions to converge to the real values and improves the convergence rate by changing the property of curved surface of the objective function, thus opening a new way for further developing the optimization solution of inverse problems.

  19. Modified Landweber Algorithm for Solving the Inverse Problem in EIT

    Institute of Scientific and Technical Information of China (English)

    WANGChao; WANGHuaxiang

    2005-01-01

    This paper analyses the Landweber iteration method and demonstrates that Landweber method is a modified of the generalized inverse constructed using the iteration solution. The phenomenon is explained that the image reconstructed using Landweber iteration algorithm through a large numbers of iteration steps is similar tothe minimum norm solution of the generalized inverse. A new reconstruction algorithm called the modified Landweber method is proposed, which divides the image reconstruction process into two steps, off-line pre-iteration and on-line one-step reconstruction. The reconstruction speed is markedly improved.

  20. The ε-Algorithm and η-Algorithm for Generalized Inverse Rectangular Matrix Pade Approximants

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    An axiomatic definition for the generalized inverse matrix Pade approximation (GMPA) is introduced. The matrix rational approximants are of the form of the matrix-valued numerator and the scalar denominator. By means of generalized inverse for matrices, the ε-algorithm for the computation of GMPA is established. The well-known Wynn identity for GMPA is proved on the basis of ε-algorithm. The η-algorithm is defined in a similar way. The equivalence relation between ε-algorithm and η-algorithm is proposed. Some common examples and a numerical example are given to illustrate the methods in this paper.

  1. Rayleigh wave inversion using heat-bath simulated annealing algorithm

    Science.gov (United States)

    Lu, Yongxu; Peng, Suping; Du, Wenfeng; Zhang, Xiaoyang; Ma, Zhenyuan; Lin, Peng

    2016-11-01

    The dispersion of Rayleigh waves can be used to obtain near-surface shear (S)-wave velocity profiles. This is performed mainly by inversion of the phase velocity dispersion curves, which has been proven to be a highly nonlinear and multimodal problem, and it is unsuitable to use local search methods (LSMs) as the inversion algorithm. In this study, a new strategy is proposed based on a variant of simulated annealing (SA) algorithm. SA, which simulates the annealing procedure of crystalline solids in nature, is one of the global search methods (GSMs). There are many variants of SA, most of which contain two steps: the perturbation of model and the Metropolis-criterion-based acceptance of the new model. In this paper we propose a one-step SA variant known as heat-bath SA. To test the performance of the heat-bath SA, two models are created. Both noise-free and noisy synthetic data are generated. Levenberg-Marquardt (LM) algorithm and a variant of SA, known as the fast simulated annealing (FSA) algorithm, are also adopted for comparison. The inverted results of the synthetic data show that the heat-bath SA algorithm is a reasonable choice for Rayleigh wave dispersion curve inversion. Finally, a real-world inversion example from a coal mine in northwestern China is shown, which proves that the scheme we propose is applicable.

  2. A comparative analysis of algorithms for the magnetoencephalography inverse problem

    Energy Technology Data Exchange (ETDEWEB)

    Sorrentino, A [CNR-INFM LAMIA, Genova (Italy); Pascarella, A; Piana, M [Dipartimento di Informatica, Universita di Verona, Ca Vignal 2, Strada le Grazie 15, 37134, Verona (Italy); Campi, C [Dipartimento di Matematica, Universita di Genova, via Dodecaneso 35, 16146, Genova (Italy)], E-mail: sorrentino@fisica.unige.it

    2008-11-01

    We present a comparison of three methods for the solution of the magnetoencephalography inverse problem. The methods are: an eigenspace projected beamformer, an algorithm implementing multiple signal classification with recursively applied projection and a particle filter for Bayesian tracking. Synthetic data with neurophysiological significance are analyzed by the three methods to recover position and amplitude time course of the active sources.

  3. Multi-resolution inversion algorithm for the attenuated radon transform

    KAUST Repository

    Barbano, Paolo Emilio

    2011-09-01

    We present a FAST implementation of the Inverse Attenuated Radon Transform which incorporates accurate collimator response, as well as artifact rejection due to statistical noise and data corruption. This new reconstruction procedure is performed by combining a memory-efficient implementation of the analytical inversion formula (AIF [1], [2]) with a wavelet-based version of a recently discovered regularization technique [3]. The paper introduces all the main aspects of the new AIF, as well numerical experiments on real and simulated data. Those display a substantial improvement in reconstruction quality when compared to linear or iterative algorithms. © 2011 IEEE.

  4. Application of SAGE III inversion algorithm to SALOMON measurements

    Science.gov (United States)

    Bazureau, A.; Brogniez, Colette; Renard, J.-B.

    2001-01-01

    The SAGE II, whose first flight is planned to be launched in Winter 2000-2001 on the polar orbit spacecraft METEOR 3M, is a part of NASA's Earth Observing Systems (EOS). A preliminary outcome for the LOA inversion has been obtained for resolved channel for the retrieval of daytime and nighttime constituents such as O3, NO2, NO3, OCIO and aerosols, with good quality, from simulated transmission profiles. An opportunity for testing the inversion algorithm on real measurements is offered by the SALOMON team of the LPCE to validate the method. The purpose of this paper is to present the LOA inversion of SALOMON real measurements, performed in February 2000 from Kiruna, Sweden. The retrieved gas densities and aerosol extinction profiles are compared to the corresponding retrieved values by the SALOMON team.

  5. Performance comparison of several optimization algorithms in matched field inversion

    Institute of Scientific and Technical Information of China (English)

    ZOU Shixin; YANG Kunde; MA Yuanliang

    2004-01-01

    Optimization efficiencies and mechanisms of simulated annealing, genetic algorithm, differential evolution and downhill simplex differential evolution are compared and analyzed. Simulated annealing and genetic algorithm use a directed random process to search the parameter space for an optimal solution. They include the ability to avoid local minima, but as no gradient information is used, searches may be relatively inefficient. Differential evolution uses information from a distance and azimuth between individuals of a population to search the parameter space, the initial search is effective, but the search speed decreases quickly because differential information between the individuals of population vanishes. Local downhill simplex and global differential evolution methods are developed separately, and combined to produce a hybrid downhill simplex differential evolution algorithm. The hybrid algorithm is sensitive to gradients of the object function and search of the parameter space is effective. These algorithms are applied to the matched field inversion with synthetic data. Optimal values of the parameters, the final values of object function and inversion time is presented and compared.

  6. Magnetic Flux Leakage Signal Inversion of Corrosive Flaws Based on Modified Genetic Local Search Algorithm

    Institute of Scientific and Technical Information of China (English)

    HAN Wen-hua; FANG Ping; XIA Fei; XUE Fang

    2009-01-01

    In this paper, a modified genetic local search algorithm (MGLSA) is proposed. The proposed algorithm is resulted from employing the simulated annealing technique to regulate the variance of the Gaussian mutation of the genetic local search algorithm (GLSA). Then, an MGLSA-based inverse algorithm is proposed for magnetic flux leakage (MFL) signal inversion of corrosive flaws, in which the MGLSA is used to solve the optimization problem in the MFL inverse problem. Experimental results demonstrate that the MGLSA-based inverse algorithm is more robust than GLSA-based inverse algorithm in the presence of noise in the measured MFL signals.

  7. MINIMAL INVERSION AND ITS ALGORITHMS OF DISCRETE-TIME NONLINEAR SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    ZHENG Yufan

    2005-01-01

    The left-inverse system with minimal order and its algorithms of discrete-time nonlinear systems are studied in a linear algebraic framework. The general structure of left-inverse system is described and computed in symbolic algorithm. Two algorithms are given for constructing left-inverse systems with minimal order.

  8. A fast algorithm for sparse matrix computations related to inversion

    Science.gov (United States)

    Li, S.; Wu, W.; Darve, E.

    2013-06-01

    We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green's functions Gr and Gcost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

  9. The Genetic Algorithm: A Robust Method for Stress Inversion

    Science.gov (United States)

    Thakur, P.; Srivastava, D. C.; Gupta, P. K.

    2016-12-01

    The knowledge of stress states in Earth`s crust is a fundamental objective in many tectonic, seismological and engineering geological studies. Geologists and geophysicists routinely practice methods for determination of the stress tensor from inversion of observations on the stress indicators, such as faults, earthquakes and calcite twin lamellae. While the stress inversion is essentially a nonlinear problem, it is commonly solved by linearization, under some assumptions, in most existing methods. These algorithms not only oversimplify the problem but are also vulnerable to entrapment of the solution in a local optimum. We propose a nonlinear heuristic technique, the genetic algorithm method, that searches the global optimum without making any linearizing assumption or simplification. The method mimics the natural evolutionary process of selection, crossover, mutation, and minimises the composite misfit function for searching the global optimum, the fittest stress tensor. The validity of the method is successfully tested on synthetic fault-slip observations in different tectonic settings and also in situations where the observations contain noisy data. These results are compared with those obtained from the other common methods. The genetic algorithm method is superior to other common methods, in particular, in the oblique tectonic settings where none of the principal stresses is directed vertically.

  10. Inverse problem of HIV cell dynamics using Genetic Algorithms

    Science.gov (United States)

    González, J. A.; Guzmán, F. S.

    2017-01-01

    In order to describe the cell dynamics of T-cells in a patient infected with HIV, we use a flavour of Perelson's model. This is a non-linear system of Ordinary Differential Equations that describes the evolution of healthy, latently infected, infected T-cell concentrations and the free viral cells. Different parameters in the equations give different dynamics. Considering the concentration of these types of cells is known for a particular patient, the inverse problem consists in estimating the parameters in the model. We solve this inverse problem using a Genetic Algorithm (GA) that minimizes the error between the solutions of the model and the data from the patient. These errors depend on the parameters of the GA, like mutation rate and population, although a detailed analysis of this dependence will be described elsewhere.

  11. The genetic algorithm: A robust method for stress inversion

    Science.gov (United States)

    Thakur, Prithvi; Srivastava, Deepak C.; Gupta, Pravin K.

    2017-01-01

    The stress inversion of geological or geophysical observations is a nonlinear problem. In most existing methods, it is solved by linearization, under certain assumptions. These linear algorithms not only oversimplify the problem but also are vulnerable to entrapment of the solution in a local optimum. We propose the use of a nonlinear heuristic technique, the genetic algorithm, which searches the global optimum without making any linearizing assumption or simplification. The algorithm mimics the natural evolutionary processes of selection, crossover and mutation and, minimizes a composite misfit function for searching the global optimum, the fittest stress tensor. The validity and efficacy of the algorithm are demonstrated by a series of tests on synthetic and natural fault-slip observations in different tectonic settings and also in situations where the observations are noisy. It is shown that the genetic algorithm is superior to other commonly practised methods, in particular, in those tectonic settings where none of the principal stresses is directed vertically and/or the given data set is noisy.

  12. A hybrid algorithm for solving inverse problems in elasticity

    Directory of Open Access Journals (Sweden)

    Barabasz Barbara

    2014-12-01

    Full Text Available The paper offers a new approach to handling difficult parametric inverse problems in elasticity and thermo-elasticity, formulated as global optimization ones. The proposed strategy is composed of two phases. In the first, global phase, the stochastic hp-HGS algorithm recognizes the basins of attraction of various objective minima. In the second phase, the local objective minimizers are closer approached by steepest descent processes executed singly in each basin of attraction. The proposed complex strategy is especially dedicated to ill-posed problems with multimodal objective functionals. The strategy offers comparatively low computational and memory costs resulting from a double-adaptive technique in both forward and inverse problem domains. We provide a result on the Lipschitz continuity of the objective functional composed of the elastic energy and the boundary displacement misfits with respect to the unknown constitutive parameters. It allows common scaling of the accuracy of solving forward and inverse problems, which is the core of the introduced double-adaptive technique. The capability of the proposed method of finding multiple solutions is illustrated by a computational example which consists in restoring all feasible Young modulus distributions minimizing an objective functional in a 3D domain of a photo polymer template obtained during step and flash imprint lithography.

  13. An Algorithm for image removals and decompositions without inverse matrices

    Science.gov (United States)

    Yi, Dokkyun

    2009-03-01

    Partial Differential Equation (PDE) based methods in image processing have been actively studied in the past few years. One of the effective methods is the method based on a total variation introduced by Rudin, Oshera and Fatemi (ROF) [L.I. Rudin, S. Osher, E. Fatemi, Nonlinear total variation based noise removal algorithms, Physica D 60 (1992) 259-268]. This method is a well known edge preserving model and an useful tool for image removals and decompositions. Unfortunately, this method has a nonlinear term in the equation which may yield an inaccurate numerical solution. To overcome the nonlinearity, a fixed point iteration method has been widely used. The nonlinear system based on the total variation is induced from the ROF model and the fixed point iteration method to solve the ROF model is introduced by Dobson and Vogel [D.C. Dobson, C.R. Vogel, Convergence of an iterative method for total variation denoising, SIAM J. Numer. Anal. 34 (5) (1997) 1779-1791]. However, some methods had to compute inverse matrices which led to roundoff error. To address this problem, we developed an efficient method for solving the ROF model. We make a sequence like Richardson's method by using a fixed point iteration to evade the nonlinear equation. This approach does not require the computation of inverse matrices. The main idea is to make a direction vector for reducing the error at each iteration step. In other words, we make the next iteration to reduce the error from the computed error and the direction vector. We describe that our method works well in theory. In numerical experiments, we show the results of the proposed method and compare them with the results by D. Dobson and C. Vogel and then we confirm the superiority of our method.

  14. A recursive algorithm for computing the inverse of the Vandermonde matrix

    Directory of Open Access Journals (Sweden)

    Youness Aliyari Ghassabeh

    2016-12-01

    Full Text Available The inverse of a Vandermonde matrix has been used for signal processing, polynomial interpolation, curve fitting, wireless communication, and system identification. In this paper, we propose a novel fast recursive algorithm to compute the inverse of a Vandermonde matrix. The algorithm computes the inverse of a higher order Vandermonde matrix using the available lower order inverse matrix with a computational cost of $ O(n^2 $. The proposed algorithm is given in a matrix form, which makes it appropriate for hardware implementation. The running time of the proposed algorithm to find the inverse of a Vandermonde matrix using a lower order Vandermonde matrix is compared with the running time of the matrix inversion function implemented in MATLAB.

  15. Full tensor gravity gradiometry data inversion: Performance analysis of parallel computing algorithms

    Science.gov (United States)

    Hou, Zhen-Long; Wei, Xiao-Hui; Huang, Da-Nian; Sun, Xu

    2015-09-01

    We apply reweighted inversion focusing to full tensor gravity gradiometry data using message-passing interface (MPI) and compute unified device architecture (CUDA) parallel computing algorithms, and then combine MPI with CUDA to formulate a hybrid algorithm. Parallel computing performance metrics are introduced to analyze and compare the performance of the algorithms. We summarize the rules for the performance evaluation of parallel algorithms. We use model and real data from the Vinton salt dome to test the algorithms. We find good match between model and real density data, and verify the high efficiency and feasibility of parallel computing algorithms in the inversion of full tensor gravity gradiometry data.

  16. Inversion Free Algorithms for Computing the Principal Square Root of a Matrix

    Directory of Open Access Journals (Sweden)

    Nicholas Assimakis

    2014-01-01

    Full Text Available New algorithms are presented about the principal square root of an n×n matrix A. In particular, all the classical iterative algorithms require matrix inversion at every iteration. The proposed inversion free iterative algorithms are based on the Schulz iteration or the Bernoulli substitution as a special case of the continuous time Riccati equation. It is certified that the proposed algorithms are equivalent to the classical Newton method. An inversion free algebraic method, which is based on applying the Bernoulli substitution to a special case of the continuous time Riccati equation, is also proposed.

  17. Modelling and genetic algorithm based optimisation of inverse supply chain

    Science.gov (United States)

    Bányai, T.

    2009-04-01

    (Recycling of household appliances with emphasis on reuse options). The purpose of this paper is the presentation of a possible method for avoiding the unnecessary environmental risk and landscape use through unprovoked large supply chain of collection systems of recycling processes. In the first part of the paper the author presents the mathematical model of recycling related collection systems (applied especially for wastes of electric and electronic products) and in the second part of the work a genetic algorithm based optimisation method will be demonstrated, by the aid of which it is possible to determine the optimal structure of the inverse supply chain from the point of view economical, ecological and logistic objective functions. The model of the inverse supply chain is based on a multi-level, hierarchical collection system. In case of this static model it is assumed that technical conditions are permanent. The total costs consist of three parts: total infrastructure costs, total material handling costs and environmental risk costs. The infrastructure-related costs are dependent only on the specific fixed costs and the specific unit costs of the operation points (collection, pre-treatment, treatment, recycling and reuse plants). The costs of warehousing and transportation are represented by the material handling related costs. The most important factors determining the level of environmental risk cost are the number of out of time recycled (treated or reused) products, the number of supply chain objects and the length of transportation routes. The objective function is the minimization of the total cost taking into consideration the constraints. However a lot of research work discussed the design of supply chain [8], but most of them concentrate on linear cost functions. In the case of this model non-linear cost functions were used. The non-linear cost functions and the possible high number of objects of the inverse supply chain leaded to the problem of choosing a

  18. Index Theory-Based Algorithm for the Gradiometer Inverse Problem

    Science.gov (United States)

    2015-03-28

    field generated by the positive eigenvector of the gradiometer tensor to the closeness of fit of the proposed inverse solution to the mass and...line field generated by the positive eigenvector of the gradiometer tensor to the closeness of fit of the proposed inverse solution to the mass and...2015). The inverse source problem for the gradiometer tensor can be stated generally as follows: given a gradiometer tensor field, extract

  19. GENERALIZED CONJUGATE-GRADIENT ALGORITHM AND ITS APPLICATIONS TO SEISMIC TRACE INVERSION

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    A novel generalized conjugate-gradient algorithm for complicated equations of seismic trace inverse problems, which is based on classical conjugate-gradient algorithm, has been put forward so as to improve the stability of seismic trace inversion, and to reduce inversion computation and memory resources needed. The algorithm brings high accuracy, fast operation speed and good ability of resisting ill-condition. In addition, by analysing sensitivity matrix according to the specific problem of seismic trace inversion, a new recursive algorithm which needs no sensitivity matrix is developed to save memory greatly. Furthermore, in the new algorithm, sensitivity matrix operation can be converted into convolution and correlation operations to make the whole recursion to be implemented completely by vector operation, which thus speeds recursion operation greatly.

  20. CUDA Parallel Algorithms for Forward and Inverse Structural Gravity Problems

    OpenAIRE

    2015-01-01

    This paper describes usage of CUDA parallelization scheme for forward and inverse gravity problems for structural boundaries. Forward problem is calculated using the finite elements approach. This means that the whole calculation volume is split into parallelepipeds and then the gravity effect of each is calculated using known formula. Inverse problem solution is found using iteration local corrections method. This method requires only forward problem calculation on each iteration and does no...

  1. Quantum algorithm to solve function inversion with time-space trade-off

    Science.gov (United States)

    Wu, WanQing; Zhang, HuanGuo

    2017-07-01

    In general, it is a difficult problem to solve the inverse of any function. With the inverse implication operation, we present a quantum algorithm for solving the inversion of function via using time-space trade-off in this paper. The details are as follows. Let function f(x)=y have k solutions, where x\\in {0, 1}n, y\\in {0, 1}m for any integers n, m. We show that an iterative algorithm can be used to solve the inverse of function f( x) with successful probability 1-( 1-k/2n) L for L\\in Z+. The space complexity of proposed quantum iterative algorithm is O( Ln), where L is the number of iterations. The paper concludes that, via using time-space trade-off strategy, we improve the successful probability of algorithm.

  2. Preliminary Study of the Feasibility of Inverse Problem Algorithms Used for Arc Magnetic Measurement Method

    Science.gov (United States)

    Wang, Qian; Li, Xingwen; Song, Haoyong; Rong, Mingzhe

    2010-04-01

    Non-contact magnetic measurement method is an effective way to study the air arc behavior experimentally One of the crucial techniques is to solve an inverse problem for the electromagnetic field. This study is devoted to investigating different algorithms for this kind of inverse problem preliminarily, including the preconditioned conjugate gradient method, penalty function method and genetic algorithm. The feasibility of each algorithm is analyzed. It is shown that the preconditioned conjugate gradient method is valid only for few arc segments, the estimation accuracy of the penalty function method is dependent on the initial conditions, and the convergence of genetic algorithm should be studied further for more segments in an arc current.

  3. Trial mountain climbing algorithm for solving the inverse kinematics of redundant manipulator

    Institute of Scientific and Technical Information of China (English)

    周友行; 何清华; 邓伯禄

    2002-01-01

    Trial mountain climbing algorithm to solve the inverse kinematics problem of redundant manipulator is introduced, and a method of describing a numeral with a special numeration system is given to define the changed step of the trail mountain climbing algorithm. The results show that a likelihood solution can be found quickly in the infinite groups of likelihood solutions within the limited search times, and need not calculate the anti-trigonometric function and the inverse matrix. In addition, this algorithm has many good qualities such as concise algorithm, tiny computation, fast convergence velocity, good stability and extensive adaptability.

  4. Genetic algorithms and smoothing filters in solving the geophysical inversion problem

    Directory of Open Access Journals (Sweden)

    Šešum Vesna

    2002-01-01

    Full Text Available The combination of genetic algorithms, smoothing filters and geophysical tomography is used in solving the geophysical inversion problem. This hybrid technique is developed to improve the results obtained by using genetic algorithm sonly. The application of smoothing filters can improve the performance of GA implementation for solving the geophysical inversion problem. Some test-examples and the obtained comparative results are presented.

  5. Advancing x-ray scattering metrology using inverse genetic algorithms

    Science.gov (United States)

    Hannon, Adam F.; Sunday, Daniel F.; Windover, Donald; Joseph Kline, R.

    2016-07-01

    We compare the speed and effectiveness of two genetic optimization algorithms to the results of statistical sampling via a Markov chain Monte Carlo algorithm to find which is the most robust method for determining real-space structure in periodic gratings measured using critical dimension small-angle x-ray scattering. Both a covariance matrix adaptation evolutionary strategy and differential evolution algorithm are implemented and compared using various objective functions. The algorithms and objective functions are used to minimize differences between diffraction simulations and measured diffraction data. These simulations are parameterized with an electron density model known to roughly correspond to the real-space structure of our nanogratings. The study shows that for x-ray scattering data, the covariance matrix adaptation coupled with a mean-absolute error log objective function is the most efficient combination of algorithm and goodness of fit criterion for finding structures with little foreknowledge about the underlying fine scale structure features of the nanograting.

  6. Design and implementation of adaptive inverse control algorithm for a micro-hand control system

    Directory of Open Access Journals (Sweden)

    Wan-Cheng Wang

    2014-01-01

    Full Text Available The Letter proposes an online tuned adaptive inverse position control algorithm for a micro-hand. First, the configuration of the micro-hand is discussed. Next, a kinematic analysis of the micro-hand is investigated and then the relationship between the rotor position of micro-permanent magnet synchronous motor and the tip of the micro-finger is derived. After that, an online tuned adaptive inverse control algorithm, which includes an adaptive inverse model and an adaptive inverse control, is designed. The online tuned adaptive inverse control algorithm has better performance than the proportional–integral control algorithm does. In addition, to avoid damaging the object during the grasping process, an online force control algorithm is proposed here as well. An embedded micro-computer, cRIO-9024, is used to realise the whole position control algorithm and the force control algorithm by using software. As a result, the hardware circuit is very simple. Experimental results show that the proposed system can provide fast transient responses, good load disturbance responses, good tracking responses and satisfactory grasping responses.

  7. THE APPLICATION OF GENETIC ALGORITHM IN NON-LINEAR INVERSION OF ROCK MECHANICS PARAMETERS

    Institute of Scientific and Technical Information of China (English)

    赵晓东

    1998-01-01

    The non-linear inversion of rock mechanics parameters based on genetic algorithm ispresented. The principle and step of genetic algorithm is also given. A brief discussion of thismethod and an application example is presented at the end of this paper. From the satisfied re-sult, quick, convenient and practical new approach is developed to solve this kind of problems.

  8. Algorithms for Finding Inverse of Two Patterned Matrices over Zp

    Directory of Open Access Journals (Sweden)

    Xiaoyu Jiang

    2014-01-01

    Full Text Available Circulant matrix families have become an important tool in network engineering. In this paper, two new patterned matrices over Zp which include row skew first-plus-last right circulant matrix and row first-plus-last left circulant matrix are presented. Their basic properties are discussed. Based on Newton-Hensel lifting and Chinese remaindering, two different algorithms are obtained. Moreover, the cost in terms of bit operations for each algorithm is given.

  9. [Two Data Inversion Algorithms of Aerosol Horizontal Distributiol Detected by MPL and Error Analysis].

    Science.gov (United States)

    Lü, Li-hui; Liu, Wen-qing; Zhang, Tian-shu; Lu, Yi-huai; Dong, Yun-sheng; Chen, Zhen-yi; Fan, Guang-qiang; Qi, Shao-shuai

    2015-07-01

    Atmospheric aerosols have important impacts on human health, the environment and the climate system. Micro Pulse Lidar (MPL) is a new effective tool for detecting atmosphere aerosol horizontal distribution. And the extinction coefficient inversion and error analysis are important aspects of data processing. In order to detect the horizontal distribution of atmospheric aerosol near the ground, slope and Fernald algorithms were both used to invert horizontal MPL data and then the results were compared. The error analysis showed that the error of the slope algorithm and Fernald algorithm were mainly from theoretical model and some assumptions respectively. Though there still some problems exist in those two horizontal extinction coefficient inversions, they can present the spatial and temporal distribution of aerosol particles accurately, and the correlations with the forward-scattering visibility sensor are both high with the value of 95%. Furthermore relatively speaking, Fernald algorithm is more suitable for the inversion of horizontal extinction coefficient.

  10. A Numerical Approach to Solving an Inverse Heat Conduction Problem Using the Levenberg-Marquardt Algorithm

    OpenAIRE

    Tao Min; Xing Chen; Yao Sun; Qiang Huang

    2014-01-01

    This paper is intended to provide a numerical algorithm involving the combined use of the Levenberg-Marquardt algorithm and the Galerkin finite element method for estimating the diffusion coefficient in an inverse heat conduction problem (IHCP). In the present study, the functional form of the diffusion coefficient is unknown a priori. The unknown diffusion coefficient is approximated by the polynomial form and the present numerical algorithm is employed to find the solution. Numerical experi...

  11. Zoning Modulus Inversion Method for Concrete Dams Based on Chaos Genetic Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Hao Gu

    2015-01-01

    Full Text Available For dams and rock foundations of ages, the actual mechanical parameters sometimes differed from the design and the experimental values. Therefore, it is necessary to carry out the inversion analysis on main physical and mechanical parameters of dams and rock foundations. However, only the integrated deformation modulus can be inversed by utilizing the conventional inversion method, and it does not meet the actual situation. Therefore, a new method is developed in this paper to inverse the actual initial zoning deformation modulus and to determine the inversion objective function for the actual zoning deformation modulus, based on the dam displacement measured data and finite element calculation results. Furthermore, based on the chaos genetic optimization algorithm, the inversion method for zoning deformation modulus of dam, dam foundation and, reservoir basin is proposed. Combined with the project case, the feasibility and validity of the proposed method are verified.

  12. Nonlinear Inversion of Potential-Field Data Using an Improved Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    Feng Gangding; Chen Chao

    2004-01-01

    The genetic algorithm is useful for solving an inversion of complex nonlinear geophysical equations. The multi-point search of the genetic algorithm makes it easier to find a globally optimal solution and avoid falling into a local extremum. The search efficiency of the genetic algorithm is a key to producing successful solutions in a huge multi-parameter model space. The encoding mechanism of the genetic algorithm affects the searching processes in the evolution. Not all genetic operations perform perfectly in a search under either a binary or decimal encoding system. As such, a standard genetic algorithm (SGA) is sometimes unable to resolve an optimization problem such as a simple geophysical inversion. With the binary encoding system the operation of the crossover may produce more new individuals. The decimal encoding system, on the other hand, makes the mutation generate more new genes. This paper discusses approaches of exploiting the search potentials of genetic operations with different encoding systems and presents a hybrid-encoding mechanism for the genetic algorithm. This is referred to as the hybrid-encoding genetic algorithm (HEGA). The method is based on the routine in which the mutation operation is executed in decimal code and other operations in binary code. HEGA guarantees the birth of better genes by mutation processing with a high probability, so that it is beneficial for resolving the inversions of complicated problems. Synthetic and real-world examples demonstrate the advantages of using HEGA in the inversion of potential-field data.

  13. Time domain electromagnetic 1D inversion using genetic algorithm and particle swarm optimization

    Science.gov (United States)

    Yogi, Ida Bagus Suananda; Widodo

    2017-07-01

    Most of geophysical data needs to be inverted, so that the inversion results can be interpreted further. There are two mayor methods to approach inversion calculation, they are least square methods with its derivative, and global optimization methods. The global optimization methods have two advantages over least square methods and its derivative; the inversion result are not sensitive to the starting model and this method can get results from global minimum instead of local minimum. These advantages make the global optimization methods give better results when priori data is unavailable. In this research we tried to implement genetic algorithm (GA) and particle swarm optimization (PSO) to do inversion of time domain electromagnetic (TDEM) 1D data with central loop configuration. The inversions were applied for synthetic. The starting models were varied from the closest to the furthest from the real synthetic models. After that, the results and the processes from the two global optimization methods were compared. This comparison results showed that the results and the performance were not much different. Both inversion results give similar models with the synthetic models. At the end of the research, the global optimizations methods were applied to TDEM real data from Volvi Basin, Greece. The inversion results of real data showed that there are two mayor resistivity layers for three layers model inversion and four resistivity layers for four and five layers model inversion. Overall PSO and GA gave similar results. However, PSO gave easier adjustment for the inversion process than the GA.

  14. A New Digital Watermarking Algorithm Using Combination of Least Significant Bit (LSB) and Inverse Bit

    CERN Document Server

    Bamatraf, Abdullah; Salleh, Mohd Najib Mohd

    2011-01-01

    In this paper, we introduce a new digital watermarking algorithm using least significant bit (LSB). LSB is used because of its little effect on the image. This new algorithm is using LSB by inversing the binary values of the watermark text and shifting the watermark according to the odd or even number of pixel coordinates of image before embedding the watermark. The proposed algorithm is flexible depending on the length of the watermark text. If the length of the watermark text is more than ((MxN)/8)-2 the proposed algorithm will also embed the extra of the watermark text in the second LSB. We compare our proposed algorithm with the 1-LSB algorithm and Lee's algorithm using Peak signal-to-noise ratio (PSNR). This new algorithm improved its quality of the watermarked image. We also attack the watermarked image by using cropping and adding noise and we got good results as well.

  15. Application of Large-Scale Inversion Algorithms to Hydraulic Tomography in an Alluvial Aquifer.

    Science.gov (United States)

    Fischer, P; Jardani, A; Soueid Ahmed, A; Abbas, M; Wang, X; Jourde, H; Lecoq, N

    2017-03-01

    Large-scale inversion methods have been recently developed and permitted now to considerably reduce the computation time and memory needed for inversions of models with a large amount of parameters and data. In this work, we have applied a deterministic geostatistical inversion algorithm to a hydraulic tomography investigation conducted in an experimental field site situated within an alluvial aquifer in Southern France. This application aims to achieve a 2-D large-scale modeling of the spatial transmissivity distribution of the site. The inversion algorithm uses a quasi-Newton iterative process based on a Bayesian approach. We compared the results obtained by using three different methodologies for sensitivity analysis: an adjoint-state method, a finite-difference method, and a principal component geostatistical approach (PCGA). The PCGA is a large-scale adapted method which was developed for inversions with a large number of parameters by using an approximation of the covariance matrix, and by avoiding the calculation of the full Jacobian sensitivity matrix. We reconstructed high-resolution transmissivity fields (composed of up to 25,600 cells) which generated good correlations between the measured and computed hydraulic heads. In particular, we show that, by combining the PCGA inversion method and the hydraulic tomography method, we are able to substantially reduce the computation time of the inversions, while still producing high-quality inversion results as those obtained from the other sensitivity analysis methodologies.

  16. An Algorithm of Inverse Kinematics for the Automated Fiber Placement Robotic Manipulator

    Directory of Open Access Journals (Sweden)

    G.E. Xin-Feng

    2012-08-01

    Full Text Available To solve inverse kinematics of the automated fiber placement robotic manipulator, an algorithm based on the position vector and posture transformation matrix is proposed. According to the structural characteristics of three revolute joint axes of the automated fiber placement robotic manipulator intersect at one point, three displacement joint variables and three revolute joint variables are calculated, respectively using the position vector and posture transformation matrix. Compared with the general iterative algorithm, the algorithm proposed in this paper reduces the number of solving inverse matrices, increases solving speed and is expressed more simply. The algorithm is verified by simulation and the simulation result shows that the proposed algorithm in this study is correct.

  17. MCMC-based inversion algorithm dedicated to NEMS mass Spectrometry

    Science.gov (United States)

    Pérenon, R.; Mohammad-Djafari, A.; Sage, E.; Duraffourg, L.; Hentz, S.; Brenac, A.; Morel, R.; Grangeat, P.

    2013-08-01

    Nano Electro Mechanical Systems (NEMS) provide new perspectives in the mass spectrometry field. This new generation of sensors is sensitive enough to detect a single molecule. Thus, it is possible to estimate a concentration profile in a counting-mode which brings a reduced noise and a higher sensitivity. In this paper, first, we briefly describe the measurement system. Then we propose a probabilistic model of the acquisition system in the form of an input-output system from which we can deduce the likelihood of the unknowns in the data and a Bayesian inference approach with a hierarchical Bernoulli-Gamma prior model. To do the computation we propose the use of a Multiple-Try Metropolis Monte-Carlo Markov-Chain algorithm. Multiple-Try Metropolis proposal functions are adapted to the model, especially to the discrete nature of the problem. Our approach provides an automatic robust estimation of mass spectra. We test the proposed algorithm both on experimental and on simulated data. We discuss the performances of the algorithm and the robustness of the estimation.

  18. Genetic algorithm in seismic waveform inversion and its application in deep seismic sounding data interpretation

    Institute of Scientific and Technical Information of China (English)

    WANG Fu-yun; ZHANG Xian-kang

    2006-01-01

    A genetic algorithm of body waveform inversion is presented for better understanding of crustal and upper mantle structures with deep seismic sounding (DSS) waveform data. General reflection and transmission synthetic seismogram algorithm, which is capable of calculating the response of thin alternating high and low velocity layers, is applied as a solution for forward modeling, and the genetic algorithm is used to find the optimal solution of the inverse problem. Numerical tests suggest that the method has the capability of resolving low-velocity layers, thin alternating high and low velocity layers, and noise suppression. Waveform inversion using P-wave records from Zeku, Xiahe and Lintao shots in the seismic wide-angle reflection/refraction survey along northeastern Qinghai-Xizang (Tibeteau) Plateau has revealed fine structures of the bottom of the upper crust and alternating layers in the middle/lower crust and topmost upper mantle.

  19. Performance evaluation for intelligent optimization algorithms in self-potential data inversion

    Institute of Scientific and Technical Information of China (English)

    崔益安; 朱肖雄; 陈志学; 刘嘉文; 柳建新

    2016-01-01

    The self-potential method is widely used in environmental and engineering geophysics. Four intelligent optimization algorithms are adopted to design the inversion to interpret self-potential data more accurately and efficiently: simulated annealing, genetic, particle swarm optimization, and ant colony optimization. Using both noise-free and noise-added synthetic data, it is demonstrated that all four intelligent algorithms can perform self-potential data inversion effectively. During the numerical experiments, the model distribution in search space, the relative errors of model parameters, and the elapsed time are recorded to evaluate the performance of the inversion. The results indicate that all the intelligent algorithms have good precision and tolerance to noise. Particle swarm optimization has the fastest convergence during iteration because of its good balanced searching capability between global and local minimisation.

  20. A Computationally Efficient Parallel Levenberg-Marquardt Algorithm for Large-Scale Big-Data Inversion

    Science.gov (United States)

    Lin, Y.; O'Malley, D.; Vesselinov, V. V.

    2015-12-01

    Inverse modeling seeks model parameters given a set of observed state variables. However, for many practical problems due to the facts that the observed data sets are often large and model parameters are often numerous, conventional methods for solving the inverse modeling can be computationally expensive. We have developed a new, computationally-efficient Levenberg-Marquardt method for solving large-scale inverse modeling. Levenberg-Marquardt methods require the solution of a dense linear system of equations which can be prohibitively expensive to compute for large-scale inverse problems. Our novel method projects the original large-scale linear problem down to a Krylov subspace, such that the dimensionality of the measurements can be significantly reduced. Furthermore, instead of solving the linear system for every Levenberg-Marquardt damping parameter, we store the Krylov subspace computed when solving the first damping parameter and recycle it for all the following damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved by using these computational techniques. We apply this new inverse modeling method to invert for a random transitivity field. Our algorithm is fast enough to solve for the distributed model parameters (transitivity) at each computational node in the model domain. The inversion is also aided by the use regularization techniques. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). Julia is an advanced high-level scientific programing language that allows for efficient memory management and utilization of high-performance computational resources. By comparing with a Levenberg-Marquardt method using standard linear inversion techniques, our Levenberg-Marquardt method yields speed-up ratio of 15 in a multi-core computational environment and a speed-up ratio of 45 in a single-core computational environment. Therefore, our new inverse modeling method is a

  1. VES/TEM 1D joint inversion by using Controlled Random Search (CRS) algorithm

    Science.gov (United States)

    Bortolozo, Cassiano Antonio; Porsani, Jorge Luís; Santos, Fernando Acácio Monteiro dos; Almeida, Emerson Rodrigo

    2015-01-01

    Electrical (DC) and Transient Electromagnetic (TEM) soundings are used in a great number of environmental, hydrological, and mining exploration studies. Usually, data interpretation is accomplished by individual 1D models resulting often in ambiguous models. This fact can be explained by the way as the two different methodologies sample the medium beneath surface. Vertical Electrical Sounding (VES) is good in marking resistive structures, while Transient Electromagnetic sounding (TEM) is very sensitive to conductive structures. Another difference is VES is better to detect shallow structures, while TEM soundings can reach deeper layers. A Matlab program for 1D joint inversion of VES and TEM soundings was developed aiming at exploring the best of both methods. The program uses CRS - Controlled Random Search - algorithm for both single and 1D joint inversions. Usually inversion programs use Marquadt type algorithms but for electrical and electromagnetic methods, these algorithms may find a local minimum or not converge. Initially, the algorithm was tested with synthetic data, and then it was used to invert experimental data from two places in Paraná sedimentary basin (Bebedouro and Pirassununga cities), both located in São Paulo State, Brazil. Geoelectric model obtained from VES and TEM data 1D joint inversion is similar to the real geological condition, and ambiguities were minimized. Results with synthetic and real data show that 1D VES/TEM joint inversion better recovers simulated models and shows a great potential in geological studies, especially in hydrogeological studies.

  2. An automatization of Barnsley's algorithm for the inverse problem of iterated function systems.

    Science.gov (United States)

    Wadströmer, Niclas

    2003-01-01

    We present an automatization of Barnsley's manual algorithm for the solution of the inverse problem of iterated function systems (IFSs). The problem is to retrieve the number of mappings and the parameters of an IFS from a digital binary image approximating the attractor induced by the IFS. M.F. Barnsley et al. described a way to solve manually the inverse problem by identifying the fragments of which the collage is composed, and then computing the parameters of the mappings (Barnsley et al., Proc. Nat. Acad. Sci. USA, vol.83, p.1975-7, 1986; Barnsley, "Fractals Everywhere", Academic, 1988; Barnsley and Hurd, L., "Fractal Image Compression", A.K. Peters, 1992). The automatic algorithm searches through a finite set of points in the parameter space determining a set of affine mappings. The algorithm uses the collage theorem and the Hausdorff metric. The inverse problem of IFSs is related to the image coding of binary images. If the number of mappings and the parameters of an IFS, with not too many mappings, could be obtained from a binary image, then this would give an efficient representation of the image. It is shown that the inverse problem solved by the automatic algorithm has a solution and some experiments show that the automatic algorithm is able to retrieve an IFS, including the number of mappings, from a digital binary image approximating the attractor induced by the IFS.

  3. An implementation of differential search algorithm (DSA) for inversion of surface wave data

    Science.gov (United States)

    Song, Xianhai; Li, Lei; Zhang, Xueqiang; Shi, Xinchun; Huang, Jianquan; Cai, Jianchao; Jin, Si; Ding, Jianping

    2014-12-01

    Surface wave dispersion analysis is widely used in geophysics to infer near-surface shear (S)-wave velocity profiles for a wide variety of applications. However, inversion of surface wave data is challenging for most local-search methods due to its high nonlinearity and to its multimodality. In this work, we proposed and implemented a new Rayleigh wave dispersion curve inversion scheme based on differential search algorithm (DSA), one of recently developed swarm intelligence-based algorithms. DSA is inspired from seasonal migration behavior of species of the living beings throughout the year for solving highly nonlinear, multivariable, and multimodal optimization problems. The proposed inverse procedure is applied to nonlinear inversion of fundamental-mode Rayleigh wave dispersion curves for near-surface S-wave velocity profiles. To evaluate calculation efficiency and stability of DSA, four noise-free and four noisy synthetic data sets are firstly inverted. Then, the performance of DSA is compared with that of genetic algorithms (GA) by two noise-free synthetic data sets. Finally, a real-world example from a waste disposal site in NE Italy is inverted to examine the applicability and robustness of the proposed approach on surface wave data. Furthermore, the performance of DSA is compared against that of GA by real data to further evaluate scores of the inverse procedure described here. Simulation results from both synthetic and actual field data demonstrate that differential search algorithm (DSA) applied to nonlinear inversion of surface wave data should be considered good not only in terms of the accuracy but also in terms of the convergence speed. The great advantages of DSA are that the algorithm is simple, robust and easy to implement. Also there are fewer control parameters to tune.

  4. Mixed-radix Algorithm for the Computation of Forward and Inverse MDCT.

    Science.gov (United States)

    Wu, Jiasong; Shu, Huazhong; Senhadji, Lotfi; Luo, Limin

    2008-08-12

    The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorithm, is obtained by decomposing an N-point MDCT into two MDCTs with the length N/2. The second algorithm, called the radix-3 decimation in time (DIT) algorithm, is obtained by decomposing an N-point MDCT into three MDCTs with the length N/3. Since the proposed MDCT algorithm is also expressed in the form of a simple sparse matrix factorization, the corresponding IMDCT algorithm can be easily derived by simply transposing the matrix factorization. Comparison of the proposed algorithm with some existing ones shows that our proposed algorithm is more suitable for parallel implementation and especially suitable for the layer III of MPEG-1 and MPEG-2 audio encoding and decoding. Moreover, the proposed algorithm can be easily extended to the multidimensional case by using the vector-radix method.

  5. Improved preconditioned conjugate gradient algorithm and application in 3D inversion of gravity-gradiometry data

    Science.gov (United States)

    Wang, Tai-Han; Huang, Da-Nian; Ma, Guo-Qing; Meng, Zhao-Hai; Li, Ye

    2017-06-01

    With the continuous development of full tensor gradiometer (FTG) measurement techniques, three-dimensional (3D) inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processing and interpretation of large-scale high-precision data, the use of the graphics processing unit process unit (GPU) and preconditioning methods are very important in the data inversion. In this paper, an improved preconditioned conjugate gradient algorithm is proposed by combining the symmetric successive over-relaxation (SSOR) technique and the incomplete Choleksy decomposition conjugate gradient algorithm (ICCG). Since preparing the preconditioner requires extra time, a parallel implement based on GPU is proposed. The improved method is then applied in the inversion of noisecontaminated synthetic data to prove its adaptability in the inversion of 3D FTG data. Results show that the parallel SSOR-ICCG algorithm based on NVIDIA Tesla C2050 GPU achieves a speedup of approximately 25 times that of a serial program using a 2.0 GHz Central Processing Unit (CPU). Real airborne gravity-gradiometry data from Vinton salt dome (southwest Louisiana, USA) are also considered. Good results are obtained, which verifies the efficiency and feasibility of the proposed parallel method in fast inversion of 3D FTG data.

  6. Joint inversion of multiple geophysical and petrophysical data using generalized fuzzy clustering algorithms

    Science.gov (United States)

    Sun, Jiajia; Li, Yaoguo

    2017-02-01

    Joint inversion that simultaneously inverts multiple geophysical data sets to recover a common Earth model is increasingly being applied to exploration problems. Petrophysical data can serve as an effective constraint to link different physical property models in such inversions. There are two challenges, among others, associated with the petrophysical approach to joint inversion. One is related to the multimodality of petrophysical data because there often exist more than one relationship between different physical properties in a region of study. The other challenge arises from the fact that petrophysical relationships have different characteristics and can exhibit point, linear, quadratic, or exponential forms in a crossplot. The fuzzy c-means (FCM) clustering technique is effective in tackling the first challenge and has been applied successfully. We focus on the second challenge in this paper and develop a joint inversion method based on variations of the FCM clustering technique. To account for the specific shapes of petrophysical relationships, we introduce several different fuzzy clustering algorithms that are capable of handling different shapes of petrophysical relationships. We present two synthetic and one field data examples and demonstrate that, by choosing appropriate distance measures for the clustering component in the joint inversion algorithm, the proposed joint inversion method provides an effective means of handling common petrophysical situations we encounter in practice. The jointly inverted models have both enhanced structural similarity and increased petrophysical correlation, and better represent the subsurface in the spatial domain and the parameter domain of physical properties.

  7. MPI Parallel Algorithm in Satellite Gravity Field Model Inversion on the Basis of Least Square Method

    Directory of Open Access Journals (Sweden)

    ZHOU Hao

    2015-08-01

    Full Text Available In order to solve the intensive computing tasks and high memory demand problem in satellite gravity field model inversion on the basis of huge amounts of satellite gravity observations, the parallel algorithm for high truncated order and degree satellite gravity field model inversion with least square method on the basis of MPI was introduced. After analyzing the time and space complexity of each step in the solving flow, the parallel I/O, block-organized storage and block-organized computation algorithm on the basis of MPI are introduced to design the parallel algorithm for building design matrix, establishing and solving normal equation, and the simulation results indicate that the parallel efficiency of building design matrix, establishing and solving normal equation can reach to 95%, 68%and 63% respectively. In addition, on the basis of GOCE simulated orbits and radial disturbance gravity gradient data(518 400 epochs in total, two earth gravity models truncated to degree and order 120, 240 are inversed, and the relative computation time and memory demand are only about 40 minutes and 7 hours, 290 MB and 1.57 GB respectively. Eventually, a simulation numerical calculation for earth gravity field model inversion with the simulation data, which has the equivalent noise level with GRACE and GOCE mission, is conducted. The accuracy of inversion model has a good consistent with current released model, and the combined mode can complement the spectral information of each individual mission, which indicates that the parallel algorithm in this paper can be applied to inverse the high truncated degree and order earth gravity model efficiently and stably.

  8. A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

    Science.gov (United States)

    Lin, Youzuo; O'Malley, Daniel; Vesselinov, Velimir V.

    2016-09-01

    Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2-D and a random hydraulic conductivity field in 3-D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ˜101 to ˜102 in a multicore computational environment. Therefore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate to large-scale problems.

  9. A Numerical Approach to Solving an Inverse Heat Conduction Problem Using the Levenberg-Marquardt Algorithm

    Directory of Open Access Journals (Sweden)

    Tao Min

    2014-01-01

    Full Text Available This paper is intended to provide a numerical algorithm involving the combined use of the Levenberg-Marquardt algorithm and the Galerkin finite element method for estimating the diffusion coefficient in an inverse heat conduction problem (IHCP. In the present study, the functional form of the diffusion coefficient is unknown a priori. The unknown diffusion coefficient is approximated by the polynomial form and the present numerical algorithm is employed to find the solution. Numerical experiments are presented to show the efficiency of the proposed method.

  10. Application of the finite-difference contrast-source inversion algorithm to seismic full-waveform data

    NARCIS (Netherlands)

    Abubakar, A.; Hu, W.; Habashy, T.M.; Van den Berg, P.M.

    2009-01-01

    We have applied the finite-difference contrast-source inversion (FDCSI) method to seismic full-waveform inversion problems. The FDCSI method is an iterative nonlinear inversion algorithm. However, unlike the nonlinear conjugate gradient method and the Gauss-Newton method, FDCSI does not solve any fu

  11. Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm

    Science.gov (United States)

    Chen, C.; Xia, J.; Liu, J.; Feng, G.

    2006-01-01

    Using a genetic algorithm to solve an inverse problem of complex nonlinear geophysical equations is advantageous because it does not require computer gradients of models or "good" initial models. The multi-point search of a genetic algorithm makes it easier to find the globally optimal solution while avoiding falling into a local extremum. As is the case in other optimization approaches, the search efficiency for a genetic algorithm is vital in finding desired solutions successfully in a multi-dimensional model space. A binary-encoding genetic algorithm is hardly ever used to resolve an optimization problem such as a simple geophysical inversion with only three unknowns. The encoding mechanism, genetic operators, and population size of the genetic algorithm greatly affect search processes in the evolution. It is clear that improved operators and proper population size promote the convergence. Nevertheless, not all genetic operations perform perfectly while searching under either a uniform binary or a decimal encoding system. With the binary encoding mechanism, the crossover scheme may produce more new individuals than with the decimal encoding. On the other hand, the mutation scheme in a decimal encoding system will create new genes larger in scope than those in the binary encoding. This paper discusses approaches of exploiting the search potential of genetic operations in the two encoding systems and presents an approach with a hybrid-encoding mechanism, multi-point crossover, and dynamic population size for geophysical inversion. We present a method that is based on the routine in which the mutation operation is conducted in the decimal code and multi-point crossover operation in the binary code. The mix-encoding algorithm is called the hybrid-encoding genetic algorithm (HEGA). HEGA provides better genes with a higher probability by a mutation operator and improves genetic algorithms in resolving complicated geophysical inverse problems. Another significant

  12. Advanced model of eddy-current NDE inverse problem with sparse grid algorithm

    Science.gov (United States)

    Zhou, Liming; Sabbagh, Harold A.; Sabbagh, Elias H.; Murphy, R. Kim; Bernacchi, William

    2017-02-01

    In model-based inverse problem, some unknown parameters need to be estimated. These parameters are used not only to characterize the physical properties of cracks, but also to describe the position of the probes (such as lift off and angles) in the calibration. After considering the effect of the position of the probes in the inverse problem, the accuracy of the inverse result will be improved. With increasing the number of the parameters in the inverse problems, the burden of calculations will increase exponentially in the traditional full grid method. The sparse grid algorithm, which was introduced by Sergey A. Smolyak, was used in our work. With this algorithm, we obtain a powerful interpolation method that requires significantly fewer support nodes than conventional interpolation on a full grid. In this work, we combined sparse grid toolbox TASMANIAN, which is produced by Oak Ridge National Laboratory, and professional eddy-current NDE software, VIC-3D R◯, to solve a specific inverse problem. An advanced model based on our previous one is used to estimate length and depth of the crack, lift off and two angles of the position of probes. Considering the calibration process, pseudorandom noise is considered in the model and statistical behavior is discussed.

  13. Parameters inversion of high central core rockfill dams based on a novel genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHOU Wei; LI ShaoLin; MA Gang; CHANG XiaoLin; MA Xing; ZHANG Chao

    2016-01-01

    Parameters identification of rockfill materials is a crucial issue for high rockfill dams.Because of the scale effect,random sampling and sample disturbance,it is difficult to obtain the actual mechanical properties of rockfill from laboratory tests.Parameters inversion based on in situ monitoring data has been proven to be an efficient method for identifying the exact parameters of the rockfill.In this paper,we propose a modified genetic algorithm to solve the high-dimension multimodal and nonlinear optimal parameters inversion problem.A novel crossover operator based on the sum of differences in gene fragments (SoDX) is proposed,inspired by the cloning of superior genes in genetic engineering.The crossover points are selected according to the difference in the gene fragments,defining the adaptive length.The crossover operator increases the speed and accuracy of algorithm convergence by reducing the inbreeding and enhancing the global search capability of the genetic algorithm.This algorithm is compared with two existing crossover operators.The modified genetic algorithm is then used in combination with radial basis function neural networks (RBFNN) to perform the parameters back analysis of a high central earth core rockfill dam.The settlements simulated using the identified parameters show good agreement with the monitoring data,illustrating that the back analysis is reasonable and accurate.The proposed genetic algorithm has considerable superiority for nonlinear multimodal parameter identification problems.

  14. CHAOS-REGULARIZATION HYBRID ALGORITHM FOR NONLINEAR TWO-DIMENSIONAL INVERSE HEAT CONDUCTION PROBLEM

    Institute of Scientific and Technical Information of China (English)

    王登刚; 刘迎曦; 李守巨

    2002-01-01

    A numerical model of nonlinear two-dimensional steady inverse heat conduction problem was established considering the thermal conductivity changing with temperature.Combining the chaos optimization algorithm with the gradient regularization method, a chaos-regularization hybrid algorithm was proposed to solve the established numerical model.The hybrid algorithm can give attention to both the advantages of chaotic optimization algorithm and those of gradient regularization method. The chaos optimization algorithm was used to help the gradient regalarization method to escape from local optima in the hybrid algorithm. Under the assumption of temperature-dependent thermal conductivity changing with temperature in linear rule, the thermal conductivity and the linear rule were estimated by using the present method with the aid of boundary temperature measurements. Numerical simulation results show that good estimation on the thermal conductivity and the linear function can be obtained with arbitrary initial guess values, and that the present hybrid algorithm is much more efficient than conventional genetic algorithm and chaos optimization algorithm.

  15. Variational Bayesian approximation with scale mixture prior for inverse problems: A numerical comparison between three algorithms

    Science.gov (United States)

    Gharsalli, Leila; Mohammad-Djafari, Ali; Fraysse, Aurélia; Rodet, Thomas

    2013-08-01

    Our aim is to solve a linear inverse problem using various methods based on the Variational Bayesian Approximation (VBA). We choose to take sparsity into account via a scale mixture prior, more precisely a student-t model. The joint posterior of the unknown and hidden variable of the mixtures is approximated via the VBA. To do this approximation, classically the alternate algorithm is used. But this method is not the most efficient. Recently other optimization algorithms have been proposed; indeed classical iterative algorithms of optimization such as the steepest descent method and the conjugate gradient have been studied in the space of the probability densities involved in the Bayesian methodology to treat this problem. The main object of this work is to present these three algorithms and a numerical comparison of their performances.

  16. Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes

    CERN Document Server

    Matsui, Hajime

    2007-01-01

    This paper proposes a novel algorithm for finding error-locators of algebraic-geometric codes that can eliminate the division-calculations of finite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-free algorithm provides full performance in correcting a certain class of errors, generic errors, which includes most errors, and can decode codes on algebraic curves without the determination of unknown syndromes. Moreover, we propose three different kinds of architectures that our algorithm can be applied to, and we represent the control operation of shift-registers and switches at each clock-timing with numerical simulations. We estimate the performance in comparison of the total running time and the numbers of multipliers and shift-registers in three architectures with those of the conventional ones for codes on algebraic curves.

  17. Integrated inversion of ground deformation and magnetic data at Etna volcano using a genetic algorithm technique

    Directory of Open Access Journals (Sweden)

    G. Ganci

    2007-06-01

    Full Text Available Geodetic and magnetic investigations have been playing an increasingly important role in studies on Mt. Etna eruptive processes. During ascent, magma interacts with surrounding rocks and fluids, and inevitably crustal deformation and disturbances in the local magnetic field are produced. These effects are generally interpreted separately from each other and consistency of interpretations obtained from different methods is qualitatively checked only a posteriori. In order to make the estimation of source parameters more robust we propose an integrated inversion from deformation and magnetic data that leads to the best possible understanding of the underlying geophysical process. The inversion problem was formulated following a global optimization approach based on the use of genetic algorithms. The proposed modeling inversion technique was applied on field data sets recorded during the onset of the 2002-2003 Etna flank eruption. The deformation pattern and the magnetic anomalies were consistent with a piezomagnetic effect caused by a dyke intrusion propagating along the NE direction.

  18. Modeling and inversion Matlab algorithms for resistivity, induced polarization and seismic data

    Science.gov (United States)

    Karaoulis, M.; Revil, A.; Minsley, B. J.; Werkema, D. D.

    2011-12-01

    M. Karaoulis (1), D.D. Werkema (3), A. Revil (1,2), A., B. Minsley (4), (1) Colorado School of Mines, Dept. of Geophysics, Golden, CO, USA. (2) ISTerre, CNRS, UMR 5559, Université de Savoie, Equipe Volcan, Le Bourget du Lac, France. (3) U.S. EPA, ORD, NERL, ESD, CMB, Las Vegas, Nevada, USA . (4) USGS, Federal Center, Lakewood, 10, 80225-0046, CO. Abstract We propose 2D and 3D forward modeling and inversion package for DC resistivity, time domain induced polarization (IP), frequency-domain IP, and seismic refraction data. For the resistivity and IP case, discretization is based on rectangular cells, where each cell has as unknown resistivity in the case of DC modelling, resistivity and chargeability in the time domain IP modelling, and complex resistivity in the spectral IP modelling. The governing partial-differential equations are solved with the finite element method, which can be applied to both real and complex variables that are solved for. For the seismic case, forward modeling is based on solving the eikonal equation using a second-order fast marching method. The wavepaths are materialized by Fresnel volumes rather than by conventional rays. This approach accounts for complicated velocity models and is advantageous because it considers frequency effects on the velocity resolution. The inversion can accommodate data at a single time step, or as a time-lapse dataset if the geophysical data are gathered for monitoring purposes. The aim of time-lapse inversion is to find the change in the velocities or resistivities of each model cell as a function of time. Different time-lapse algorithms can be applied such as independent inversion, difference inversion, 4D inversion, and 4D active time constraint inversion. The forward algorithms are benchmarked against analytical solutions and inversion results are compared with existing ones. The algorithms are packaged as Matlab codes with a simple Graphical User Interface. Although the code is parallelized for multi

  19. 3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics

    Science.gov (United States)

    Duindam, Vincent; Xu, Jijie; Alterovitz, Ron; Sastry, Shankar; Goldberg, Ken

    2010-01-01

    Steerable needles can be used in medical applications to reach targets behind sensitive or impenetrable areas. The kinematics of a steerable needle are nonholonomic and, in 2D, equivalent to a Dubins car with constant radius of curvature. In 3D, the needle can be interpreted as an airplane with constant speed and pitch rate, zero yaw, and controllable roll angle. We present a constant-time motion planning algorithm for steerable needles based on explicit geometric inverse kinematics similar to the classic Paden-Kahan subproblems. Reachability and path competitivity are analyzed using analytic comparisons with shortest path solutions for the Dubins car (for 2D) and numerical simulations (for 3D). We also present an algorithm for local path adaptation using null-space results from redundant manipulator theory. Finally, we discuss several ways to use and extend the inverse kinematics solution to generate needle paths that avoid obstacles. PMID:21359051

  20. PRECISE INTEGRAL ALGORITHM BASED SOLUTION FOR TRANSIENT INVERSE HEAT CONDUCTION PROBLEMS WITH MULTI-VARIABLES

    Institute of Scientific and Technical Information of China (English)

    WANG Yi-bo; YANG Hai-tian; WU Rui-feng

    2005-01-01

    By modeling direct transient heat conduction problems via finite element method (FEM) and precise integral algorithm, a new approach is presented to solve transient inverse heat conduction problems with multi-variables. Firstly, the spatial space and temporal domain are discretized by FEM and precise integral algorithm respectively. Then, the high accuracy semi-analytical solution of direct problem can be got. Finally, based on the solution, the computing model of inverse problem and expression of sensitivity analysis are established. Single variable and variables combined identifications including thermal parameters, boundary conditions and source-related terms etc. are given to validate the approach proposed in 1-D and 2-D cases. The effects of noise data and initial guess on the results are investigated. The numerical examples show the effectiveness of this approach.

  1. Metropolis-Hastings Algorithms in Function Space for Bayesian Inverse Problems

    KAUST Repository

    Ernst, Oliver

    2015-01-07

    We consider Markov Chain Monte Carlo methods adapted to a Hilbert space setting. Such algorithms occur in Bayesian inverse problems where the solution is a probability measure on a function space according to which one would like to integrate or sample. We focus on Metropolis-Hastings algorithms and, in particular, we introduce and analyze a generalization of the existing pCN-proposal. This new proposal allows to exploit the geometry or anisotropy of the target measure which in turn might improve the statistical efficiency of the corresponding MCMC method. Numerical experiments for a real-world problem confirm the improvement.

  2. Inverse log polar transformation algorithm based on sub-pixel interpolation

    Institute of Scientific and Technical Information of China (English)

    WANG Qi; LI Yan-jun; ZHANG Ke; XIONG Xian-ze

    2006-01-01

    Log polar transformation is an important algorithm of space-variant vision theory.It well depicts the retino-cortical mapping.Due to the logarithmic and the arctangent operation in the transformation,the log polar coordinate of an image is mostly a decimal fraction and the range is quite narrow.Aiming at solving these problems,this paper puts forward an inverse log polar transformation based on sub-pixel interpolation.The acquired log polar image of the new algorithm has no mosaic phenomenon,meanwhile it is a better simulation of retina-cortical mapping.

  3. Research on the Random Shock Vibration Test Based on the Filter-X LMS Adaptive Inverse Control Algorithm

    Directory of Open Access Journals (Sweden)

    Wang Wei

    2016-01-01

    Full Text Available The related theory and algorithm of adaptive inverse control were presented through the research which pointed out the adaptive inverse control strategy could effectively eliminate the noise influence on the system control. Proposed using a frequency domain filter-X LMS adaptive inverse control algorithm, and the control algorithm was applied to the two-exciter hydraulic vibration test system of random shock vibration control process and summarized the process of the adaptive inverse control strategies in the realization of the random shock vibration test. The self-closed-loop and field test show that using the frequency-domain filter-X LMS adaptive inverse control algorithm can realize high precision control of random shock vibration test.

  4. A cellular automata-based deterministic inversion algorithm for the characterization of linear structural heterogeneities

    Science.gov (United States)

    Fischer, P.; Jardani, A.; Lecoq, N.

    2017-03-01

    Inverse problem permits to map the subsurface properties from a few observed data. The inverse problem can be physically constrained by a priori information on the property distribution in order to limit the nonuniqueness of the solution. The geostatistical information is often chosen as a priori information; however, when the field properties present a spatial locally distributed high variability, the geostatistical approach becomes inefficient. Therefore, we propose a new method adapted for fields presenting linear structures (such as a fractured field). The Cellular Automata-based Deterministic Inversion (CADI) method is, as far as we know when this paper is produced, the first inversion method which permits a deterministic inversion based on a Bayesian approach and using a dynamic optimization to generate different linear structures iteratively. The model is partitioned in cellular automaton subspaces, each one controlling a different zone of the model. A cellular automata subspace structures the properties of the model in two units ("structure" and "background") and control their dispensing direction and their values. The partitioning of the model in subspaces permits to monitor a large-scale structural model with only a few pilot-parameters and to generate linear structures with local direction changes. Thereby, the algorithm can easily handle with large-scale structures, and a sensitivity analysis is possible on these structural pilot-parameters, which permits to considerably accelerate the optimization process in order to find the best structural geometry. The algorithm has been successfully tested on simple, to more complex, theoretical models with different inversion techniques by using seismic and hydraulic data.

  5. Sensitivity of a Lidar Inversion Algorithm to Parameters Relating Atmospheric Backscatter and Extinction.

    Science.gov (United States)

    1984-04-01

    AD-A141 565 SENSITVIT 0F A LDAR INVERSION ALGORITHM 0OI PARAMETERS RELATINO ATMOSPH..U) NAVAL OCEAN SYSTEMS CENER SANDIEGO CA HNGHUGHESEl AL APR 84...H. Stephens J. A. Ferguson April 1984 Final Report Prepared for Naval Air Systems Command (NAVAIR 330) Approved for public release; distribution...CLASS. (of AlmA. espot) Unclassified is. 0 C&ŕIPICATION/ DOWNGRADING If. DISTRIBUTlION STATEMENT (of this RepelS) Approved for public release

  6. Inverse Kinematics of a Humanoid Robot with Non-Spherical Hip: A Hybrid Algorithm Approach

    OpenAIRE

    2013-01-01

    This paper describes an approach to solve the inverse kinematics problem of humanoid robots whose construction shows a small but non negligible offset at the hip which prevents any purely analytical solution to be developed. Knowing that a purely numerical solution is not feasible due to variable efficiency problems, the proposed one first neglects the offset presence in order to obtain an approximate “solution” by means of an analytical algorithm based on screw theory, a...

  7. Two-dimensional inversion of spectral induced polarization data using MPI parallel algorithm in data space

    Institute of Scientific and Technical Information of China (English)

    Zhang Zhi-Yong; Tan Han-Dong; Wang Kun-Peng; Lin Chang-Hong; Zhang Bin; Xie Mao-Bi

    2016-01-01

    Traditional two-dimensional (2D) complex resistivity forward modeling is based on Poisson’s equation but spectral induced polarization (SIP) data are the coprod-ucts of the induced polarization (IP) and the electromagnetic induction (EMI) effects. This is especially true under high frequencies, where the EMI effect can exceed the IP effect. 2D inversion that only considers the IP effect reduces the reliability of the inver-sion data. In this paper, we derive differential equations using Maxwell’s equations. With the introduction of the Cole–Cole model, we use thefi nite-element method to conduct 2D SIP forward modeling that considers the EMI and IP effects simultaneously. The data-space Occam method, in which different constraints to the model smoothness and parametric boundaries are introduced, is then used to simultaneously obtain the four parameters of the Cole–Cole model using multi-array electricfi eld data. This approach not only improves the stability of the inversion but also signifi cantly reduces the solution ambiguity. To improve the computational effi ciency, message passing interface program-ming was used to accelerate the 2D SIP forward modeling and inversion. Synthetic da-tasets were tested using both serial and parallel algorithms, and the tests suggest that the proposed parallel algorithm is robust and effi cient.

  8. Two-dimensional inversion of spectral induced polarization data using MPI parallel algorithm in data space

    Science.gov (United States)

    Zhang, Zhi-Yong; Tan, Han-Dong; Wang, Kun-Peng; Lin, Chang-Hong; Zhang, Bin; Xie, Mao-Bi

    2016-03-01

    Traditional two-dimensional (2D) complex resistivity forward modeling is based on Poisson's equation but spectral induced polarization (SIP) data are the coproducts of the induced polarization (IP) and the electromagnetic induction (EMI) effects. This is especially true under high frequencies, where the EMI effect can exceed the IP effect. 2D inversion that only considers the IP effect reduces the reliability of the inversion data. In this paper, we derive differential equations using Maxwell's equations. With the introduction of the Cole-Cole model, we use the finite-element method to conduct 2D SIP forward modeling that considers the EMI and IP effects simultaneously. The data-space Occam method, in which different constraints to the model smoothness and parametric boundaries are introduced, is then used to simultaneously obtain the four parameters of the Cole—Cole model using multi-array electric field data. This approach not only improves the stability of the inversion but also significantly reduces the solution ambiguity. To improve the computational efficiency, message passing interface programming was used to accelerate the 2D SIP forward modeling and inversion. Synthetic datasets were tested using both serial and parallel algorithms, and the tests suggest that the proposed parallel algorithm is robust and efficient.

  9. Improved Inverse Kinematics Algorithm Using Screw Theory for a Six-DOF Robot Manipulator

    Directory of Open Access Journals (Sweden)

    Qingcheng Chen

    2015-10-01

    Full Text Available Based on screw theory, a novel improved inverse-kinematics approach for a type of six-DOF serial robot, “Qianjiang I”, is proposed in this paper. The common kinematics model of the robot is based on the Denavit-Hartenberg (DH notation method while its inverse kinematics has inefficient calculation and complicated solution, which cannot meet the demands of online real-time application. To solve this problem, this paper presents a new method to improve the efficiency of the inverse kinematics solution by introducing the screw theory. Unlike other methods, the proposed method only establishes two coordinates, namely the inertial coordinate and the tool coordinate; the screw motion of each link is carried out based on the inertial coordinate, ensuring definite geometric meaning. Furthermore, we adopt a new inverse kinematics algorithm, developing an improved sub-problem method along with Paden-Kahan sub-problems. This method has high efficiency and can be applied in real-time industrial operation. It is convenient to select the desired solutions directly from among multiple solutions by examining clear geometric meaning. Finally, the effectiveness and reliability performance of the new algorithm are analysed and verified in comparative experiments carried out on the six-DOF serial robot “Qianjiang I”.

  10. A Semianalytical Ocean Color Inversion Algorithm with Explicit Water Column Depth and Substrate Reflectance Parameterization

    Science.gov (United States)

    Mckinna, Lachlan I. W.; Werdell, P. Jeremy; Fearns, Peter R. C.; Weeks, Scarla J.; Reichstetter, Martina; Franz, Bryan A.; Shea, Donald M.; Feldman, Gene C.

    2015-01-01

    A semianalytical ocean color inversion algorithm was developed for improving retrievals of inherent optical properties (IOPs) in optically shallow waters. In clear, geometrically shallow waters, light reflected off the seafloor can contribute to the water-leaving radiance signal. This can have a confounding effect on ocean color algorithms developed for optically deep waters, leading to an overestimation of IOPs. The algorithm described here, the Shallow Water Inversion Model (SWIM), uses pre-existing knowledge of bathymetry and benthic substrate brightness to account for optically shallow effects. SWIM was incorporated into the NASA Ocean Biology Processing Group's L2GEN code and tested in waters of the Great Barrier Reef, Australia, using the Moderate Resolution Imaging Spectroradiometer (MODIS) Aqua time series (2002-2013). SWIM-derived values of the total non-water absorption coefficient at 443 nm, at(443), the particulate backscattering coefficient at 443 nm, bbp(443), and the diffuse attenuation coefficient at 488 nm, Kd(488), were compared with values derived using the Generalized Inherent Optical Properties algorithm (GIOP) and the Quasi-Analytical Algorithm (QAA). The results indicated that in clear, optically shallow waters SWIM-derived values of at(443), bbp(443), and Kd(443) were realistically lower than values derived using GIOP and QAA, in agreement with radiative transfer modeling. This signified that the benthic reflectance correction was performing as expected. However, in more optically complex waters, SWIM had difficulty converging to a solution, a likely consequence of internal IOP parameterizations. Whilst a comprehensive study of the SWIM algorithm's behavior was conducted, further work is needed to validate the algorithm using in situ data.

  11. A hybrid algorithm for solving the EEG inverse problem from spatio-temporal EEG data.

    Science.gov (United States)

    Crevecoeur, Guillaume; Hallez, Hans; Van Hese, Peter; D'Asseler, Yves; Dupré, Luc; Van de Walle, Rik

    2008-08-01

    Epilepsy is a neurological disorder caused by intense electrical activity in the brain. The electrical activity, which can be modelled through the superposition of several electrical dipoles, can be determined in a non-invasive way by analysing the electro-encephalogram. This source localization requires the solution of an inverse problem. Locally convergent optimization algorithms may be trapped in local solutions and when using global optimization techniques, the computational effort can become expensive. Fast recovery of the electrical sources becomes difficult that way. Therefore, there is a need to solve the inverse problem in an accurate and fast way. This paper performs the localization of multiple dipoles using a global-local hybrid algorithm. Global convergence is guaranteed by using space mapping techniques and independent component analysis in a computationally efficient way. The accuracy is locally obtained by using the Recursively Applied and Projected-MUltiple Signal Classification (RAP-MUSIC) algorithm. When using this hybrid algorithm, a four times faster solution is obtained.

  12. A new algorithm of inverse lithography technology for mask complexity reduction

    Institute of Scientific and Technical Information of China (English)

    Li Yanghuan; Shi Zheng; Geng Zhen; Yang Yiwei; Yan Xiaolang

    2012-01-01

    A new complexity penalty term called the global wavelet penalty is introduced,which evaluates the high-frequency components of masks more profoundly by applying four distinctive Haar wavelet transforms and choosing the optimal direction on which the highest frequency components of the mask will be removed.Then,a new gradient-based inverse lithography technology (ILT) algorithm is proposed,with the computation of the global wavelet penalty as the emphasis of its first phase for mask complexity reduction.Experiments with three typical 65 nm flash ROM patterns under existing 90 nm lithographic conditions show that compared with the gradientbased algorithm,which relies on the so-called local wavelet penalty,the total vertices of the three results created by the proposed algorithm can be reduced by 12.89%,12.63% and 12.64%,respectively,while the accuracy of the lithography results remains the same.

  13. Inverse Kinematics of a Humanoid Robot with Non-Spherical Hip: A Hybrid Algorithm Approach

    Directory of Open Access Journals (Sweden)

    Rafael Cisneros Limón

    2013-04-01

    Full Text Available This paper describes an approach to solve the inverse kinematics problem of humanoid robots whose construction shows a small but non negligible offset at the hip which prevents any purely analytical solution to be developed. Knowing that a purely numerical solution is not feasible due to variable efficiency problems, the proposed one first neglects the offset presence in order to obtain an approximate “solution” by means of an analytical algorithm based on screw theory, and then uses it as the initial condition of a numerical refining procedure based on the Levenberg‐Marquardt algorithm. In this way, few iterations are needed for any specified attitude, making it possible to implement the algorithm for real‐time applications. As a way to show the algorithm’s implementation, one case of study is considered throughout the paper, represented by the SILO2 humanoid robot.

  14. EPSILON—ALGORITHM AND ETA—ALGORITHM OF GENERALIZED INVERSE FUNCTION—VALUED PADE APPROXDIMANTS USING FOR SOLUTION OF INTEGRA EQAUATIONS

    Institute of Scientific and Technical Information of China (English)

    LIChun-jing; GUChuan-qing

    2003-01-01

    Two efficient recursive algorithms epsilon-algorithm and eta-algorithm are introduced to compute the generalized inverse function-valued Pade approximants.The approximants were used to accelearte the convergence of the power with function-valued coefficinets and to estimate characteristic value of the integra equations.Famous Wynn identitles of the Pade appraxlmants is also established by means of the connection of two algorithms.

  15. Comparative behaviour of the Dynamically Penalized Likelihood algorithm in inverse radiation therapy planning

    Energy Technology Data Exchange (ETDEWEB)

    Llacer, Jorge [EC Engineering Consultants, LLC, Los Gatos, CA (United States)]. E-mail: jllacer@home.com; Solberg, Timothy D. [Department of Radiation Oncology, University of California, Los Angeles, CA (United States)]. E-mail: Solberg@radonc.ucla.edu; Promberger, Claus [BrainLAB AG, Heimstetten (Germany)]. E-mail: promberg@brainlab.com

    2001-10-01

    This paper presents a description of tests carried out to compare the behaviour of five algorithms in inverse radiation therapy planning: (1) The Dynamically Penalized Likelihood (DPL), an algorithm based on statistical estimation theory; (2) an accelerated version of the same algorithm; (3) a new fast adaptive simulated annealing (ASA) algorithm; (4) a conjugate gradient method; and (5) a Newton gradient method. A three-dimensional mathematical phantom and two clinical cases have been studied in detail. The phantom consisted of a U-shaped tumour with a partially enclosed 'spinal cord'. The clinical examples were a cavernous sinus meningioma and a prostate case. The algorithms have been tested in carefully selected and controlled conditions so as to ensure fairness in the assessment of results. It has been found that all five methods can yield relatively similar optimizations, except when a very demanding optimization is carried out. For the easier cases, the differences are principally in robustness, ease of use and optimization speed. In the more demanding case, there are significant differences in the resulting dose distributions. The accelerated DPL emerges as possibly the algorithm of choice for clinical practice. An appendix describes the differences in behaviour between the new ASA method and the one based on a patent by the Nomos Corporation. (author)

  16. Comparative behaviour of the Dynamically Penalized Likelihood algorithm in inverse radiation therapy planning

    Science.gov (United States)

    Llacer, Jorge; Solberg, Timothy D.; Promberger, Claus

    2001-10-01

    This paper presents a description of tests carried out to compare the behaviour of five algorithms in inverse radiation therapy planning: (1) The Dynamically Penalized Likelihood (DPL), an algorithm based on statistical estimation theory; (2) an accelerated version of the same algorithm; (3) a new fast adaptive simulated annealing (ASA) algorithm; (4) a conjugate gradient method; and (5) a Newton gradient method. A three-dimensional mathematical phantom and two clinical cases have been studied in detail. The phantom consisted of a U-shaped tumour with a partially enclosed 'spinal cord'. The clinical examples were a cavernous sinus meningioma and a prostate case. The algorithms have been tested in carefully selected and controlled conditions so as to ensure fairness in the assessment of results. It has been found that all five methods can yield relatively similar optimizations, except when a very demanding optimization is carried out. For the easier cases, the differences are principally in robustness, ease of use and optimization speed. In the more demanding case, there are significant differences in the resulting dose distributions. The accelerated DPL emerges as possibly the algorithm of choice for clinical practice. An appendix describes the differences in behaviour between the new ASA method and the one based on a patent by the Nomos Corporation.

  17. Inversion of Land Surface Temperature (LST Using Terra ASTER Data: A Comparison of Three Algorithms

    Directory of Open Access Journals (Sweden)

    Milton Isaya Ndossi

    2016-12-01

    Full Text Available Land Surface Temperature (LST is an important measurement in studies related to the Earth surface’s processes. The Advanced Space-borne Thermal Emission and Reflection Radiometer (ASTER instrument onboard the Terra spacecraft is the currently available Thermal Infrared (TIR imaging sensor with the highest spatial resolution. This study involves the comparison of LSTs inverted from the sensor using the Split Window Algorithm (SWA, the Single Channel Algorithm (SCA and the Planck function. This study has used the National Oceanic and Atmospheric Administration’s (NOAA data to model and compare the results from the three algorithms. The data from the sensor have been processed by the Python programming language in a free and open source software package (QGIS to enable users to make use of the algorithms. The study revealed that the three algorithms are suitable for LST inversion, whereby the Planck function showed the highest level of accuracy, the SWA had moderate level of accuracy and the SCA had the least accuracy. The algorithms produced results with Root Mean Square Errors (RMSE of 2.29 K, 3.77 K and 2.88 K for the Planck function, the SCA and SWA respectively.

  18. Using Whole Annealing Genetic Algorithms for the Turbine Cascade Inverse Design Problem

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    Tubine cascade optimum design,the typical non-convex optimal problem,has long been a design challenge in the engineering fields.The new type hybrid Genetic Algorithms-whole annealing Genetic Algorithms have been developed in this paper,Simulated annealing selection and non-uniform mutation are adopted in the whole annealing Genetic Algorithms.Whole annealing Genetic Algorithms optimal performance have been tested through mathematical test functions.On this basis,turbine cascade inverse design using whole annealing Genetic Algorithms hae been presented.The B-Spline function is applied to represent the cascade shape,C-type grid and Godunov scheme are adopted to analysis the cascade aerodynamic performance.The optimal problem aims to obtain an cascade shape from different initial cascade through the given target pressure distribution.The optimum cascade shape is in well agreement with the target cascade shape.The numerical results show that the whole annealing Genetic Algorithms are the powerful optimum tools for turbine optimum design or other complex engineering design problems.

  19. Shift-and-inverse Lanczos algorithm for ideal MHD stability analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chen, J.; Nakajima, N.; Okamoto, M.

    1997-11-01

    CAS3D and TERPSICHORE have been designed to analyze the global ideal MHD stability of three dimensional equilibria. Their critical part is to obtain the smallest eigenvalue and its corresponding eigenvector of a large but sparse real symmetric band matrix. In CAS3D the inverse iteration have been applied to do this and the spectral shift is computed by EISPACK eigensolver. It has been shown that application of such kind of software becomes very expensive in the sense of computational time and storage when matrix order and bandwidth become very large. Here this problem is resolved by using the Lanczos algorithm which is economical in CPU time and storage and particularly suitable for very large scale problems. The version of CAS3D2MN with shift-and-inverse Lanczos algorithm is called CAS3D2MNv1. Practical calculations in CAS3D2MNv1 indicate that the shift-and-inverse Lanczos recursion needs only 15 - 20 steps to calculate the smallest eigenvalue. The computation is reliable and efficient. The storage is much smaller and CPU time is saved significantly by 50 - 100 times compared with EISPACK subroutine. Finally the ballooning mode in three dimensional MHD equilibria has been mentioned briefly. (author)

  20. An inverse finite element algorithm to identify constitutive properties using dumb-bell miniature specimen

    Science.gov (United States)

    Partheepan, G.; Sehgal, D. K.; Pandey, R. K.

    2006-12-01

    An inverse finite element algorithm is established to extract the tensile constitutive properties such as Young's modulus, yield strength and true stress-true strain diagram of a material in a virtually non-destructive manner. Standard test methods for predicting mechanical properties require the removal of large size material samples from the in-service component, which is impractical. To circumvent this situation, a new dumb-bell shaped miniature specimen has been designed and fabricated which can be used for evaluation of properties for a material or component. Also test fixtures were developed to perform a tension test on this proposed miniature specimen in a testing machine. The studies have been conducted in low carbon steel, die steel and medium carbon steel. The output from the miniature test, namely, load-elongation diagram, is obtained and used for the proposed inverse finite element algorithm to find the material properties. Inverse finite element modelling is carried out using a 2D plane stress analysis. The predicted results are found to be in good agreement with the experimental results.

  1. An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions

    Energy Technology Data Exchange (ETDEWEB)

    Li, Weixuan [Pacific Northwest National Laboratory, Richland, WA 99352 (United States); Lin, Guang, E-mail: guanglin@purdue.edu [Department of Mathematics and School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907 (United States)

    2015-08-01

    Parametric uncertainties are encountered in the simulations of many physical systems, and may be reduced by an inverse modeling procedure that calibrates the simulation results to observations on the real system being simulated. Following Bayes' rule, a general approach for inverse modeling problems is to sample from the posterior distribution of the uncertain model parameters given the observations. However, the large number of repetitive forward simulations required in the sampling process could pose a prohibitive computational burden. This difficulty is particularly challenging when the posterior is multimodal. We present in this paper an adaptive importance sampling algorithm to tackle these challenges. Two essential ingredients of the algorithm are: 1) a Gaussian mixture (GM) model adaptively constructed as the proposal distribution to approximate the possibly multimodal target posterior, and 2) a mixture of polynomial chaos (PC) expansions, built according to the GM proposal, as a surrogate model to alleviate the computational burden caused by computational-demanding forward model evaluations. In three illustrative examples, the proposed adaptive importance sampling algorithm demonstrates its capabilities of automatically finding a GM proposal with an appropriate number of modes for the specific problem under study, and obtaining a sample accurately and efficiently representing the posterior with limited number of forward simulations.

  2. Eight-Scale Image Contrast Enhancement Based on Adaptive Inverse Hyperbolic Tangent Algorithm

    Directory of Open Access Journals (Sweden)

    Cheng-Yi Yu

    2014-10-01

    Full Text Available The Eight-Scale parameter adjustment is a natural extension of Adaptive Inverse Hyperbolic Tangent (AIHT algorithm. It has long been known that the Human Vision System (HVS heavily depends on detail and edge in the understanding and perception of scenes. The main goal of this study is to produce a contrast enhancement technique to recover an image from blurring and darkness, and at the same time to improve visual quality. Eight-scale coefficient adjustments can provide a further local refinement in detail under the AIHT algorithm. The proposed Eight-Scale Adaptive Inverse Hyperbolic Tangent (8SAIHT method uses the sub-band to calculate the local mean and local variance before the AIHT algorithm is applied. This study also shows that this approach is convenient and effective in the enhancement processes for various types of images. The 8SAIHT is also capable of adaptively enhancing the local contrast of the original image while simultaneously extruding more on object details.

  3. An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Jianhui Mou

    2014-01-01

    Full Text Available The goal of the scheduling is to arrange operations on suitable machines with optimal sequence for corresponding objectives. In order to meet market requirements, scheduling systems must own enough flexibility against uncertain events. These events can change production status or processing parameters, even causing the original schedule to no longer be optimal or even to be infeasible. Traditional scheduling strategies, however, cannot cope with these cases. Therefore, a new idea of scheduling called inverse scheduling has been proposed. In this paper, the inverse scheduling with weighted completion time (SMISP is considered in a single-machine shop environment. In this paper, an improved genetic algorithm (IGA with a local searching strategy is proposed. To improve the performance of IGA, efficient encoding scheme, fitness evaluation mechanism, feasible initialization methods, and a local search procedure have been employed in the paper. Because of the local improving method, the proposed IGA can balance its exploration ability and exploitation ability. We adopt 27 instances to verify the effectiveness of the proposed algorithm. The experimental results illustrated that the proposed algorithm can generate satisfactory solutions. This approach also has been applied to solve the scheduling problem in the real Chinese shipyard and can bring some benefits.

  4. A nonlinear model reference adaptive inverse control algorithm with pre-compensator

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    In this paper, the reduced-order modeling (ROM)technology and its corresponding linear theory are expanded from the linear dynamic system to the nonlinear one, and H∞ control theory is employed in the frequency domain to design some nonlinear system' s pre-compensator in some special way. The adaptive model inverse control (AMIC)theory coping with nonlinear system is improved as well. Such is the model reference adaptive inverse control with pre-compensator (PCMRAIC). The aim of that algorithm is to construct a strategy of control as a whole. As a practical example of the application, the numerical simulation has been given on matlab software packages. The numerical result is given. The proposed strategy realizes the linearization control of nonlinear dynamic system. And it carries out a good performance to deal with the nonlinear system.

  5. Methods and Algorithms for Solving Inverse Problems for Fractional Advection-Dispersion Equations

    KAUST Repository

    Aldoghaither, Abeer

    2015-11-12

    Fractional calculus has been introduced as an e cient tool for modeling physical phenomena, thanks to its memory and hereditary properties. For example, fractional models have been successfully used to describe anomalous di↵usion processes such as contaminant transport in soil, oil flow in porous media, and groundwater flow. These models capture important features of particle transport such as particles with velocity variations and long-rest periods. Mathematical modeling of physical phenomena requires the identification of pa- rameters and variables from available measurements. This is referred to as an inverse problem. In this work, we are interested in studying theoretically and numerically inverse problems for space Fractional Advection-Dispersion Equation (FADE), which is used to model solute transport in porous media. Identifying parameters for such an equa- tion is important to understand how chemical or biological contaminants are trans- ported throughout surface aquifer systems. For instance, an estimate of the di↵eren- tiation order in groundwater contaminant transport model can provide information about soil properties, such as the heterogeneity of the medium. Our main contribution is to propose a novel e cient algorithm based on modulat-ing functions to estimate the coe cients and the di↵erentiation order for space FADE, which can be extended to general fractional Partial Di↵erential Equation (PDE). We also show how the method can be applied to the source inverse problem. This work is divided into two parts: In part I, the proposed method is described and studied through an extensive numerical analysis. The local convergence of the proposed two-stage algorithm is proven for 1D space FADE. The properties of this method are studied along with its limitations. Then, the algorithm is generalized to the 2D FADE. In part II, we analyze direct and inverse source problems for a space FADE. The problem consists of recovering the source term using final

  6. An Adaptive Observer-Based Algorithm for Solving Inverse Source Problem for the Wave Equation

    KAUST Repository

    Asiri, Sharefa M.

    2015-08-31

    Observers are well known in control theory. Originally designed to estimate the hidden states of dynamical systems given some measurements, the observers scope has been recently extended to the estimation of some unknowns, for systems governed by partial differential equations. In this paper, observers are used to solve inverse source problem for a one-dimensional wave equation. An adaptive observer is designed to estimate the state and source components for a fully discretized system. The effectiveness of the algorithm is emphasized in noise-free and noisy cases and an insight on the impact of measurements’ size and location is provided.

  7. A necessary condition for applying MUSIC algorithm in limited-view inverse scattering problem

    Science.gov (United States)

    Park, Taehoon; Park, Won-Kwang

    2015-09-01

    Throughout various results of numerical simulations, it is well-known that MUltiple SIgnal Classification (MUSIC) algorithm can be applied in the limited-view inverse scattering problems. However, the application is somehow heuristic. In this contribution, we identify a necessary condition of MUSIC for imaging of collection of small, perfectly conducting cracks. This is based on the fact that MUSIC imaging functional can be represented as an infinite series of Bessel function of integer order of the first kind. Numerical experiments from noisy synthetic data supports our investigation.

  8. The Application of Levenberg-Marquartb Algorithm in EEG Inverse Problem

    Institute of Scientific and Technical Information of China (English)

    ZOU Ling; MA Zheng-hua

    2005-01-01

    EEG inverse problem has great significance and importance for both clinical and research applications. It discusses EEG dipole source localization problems solved by nonlinear local optimization methods, such as Levenberg-Marquartb. This paper presents the relation between location errors and noise level on condition that the source number is known; if the source number is not known, the selected number in model may not equal to the actual one, and a computation is carried out and a corresponding discrimination criteria is proposed. Computer simulation demonstrates that Levenberg-Marquardt algorithm is better than global methods if the source number is small.

  9. Inversion of particle size distribution from light-scattering data using a modified regularization algorithm

    Institute of Scientific and Technical Information of China (English)

    Yanmin Wang; Guobiao Liang; Zhidong Pan

    2010-01-01

    A modified regularization algorithm with a more proper operator was proposed for the inversion of partide size distribution(PSD)from light-scattering data in a laser particle sizer based on the Mie scattering principle.The Generalized Cross-Validation(GCV)method and the L-curve method were used for determining the regularization parameter.The Successive Over-Relaxation(SOR)iterative method was used to increase the exactness and stability of the converged result.The simulated results based on the modified algorithm are in a good agreement with the experimental data measured for nine standard particulate samples,their mixtures as well as three natural particulate materials with irregular shapes,indicating that this modified regularization method is not only feasible but also effective for the simulation of PSD from corresponding light-scattering data.

  10. Thin-Sheet Inversion Modeling of Geomagnetic Deep Sounding Data Using MCMC Algorithm

    Directory of Open Access Journals (Sweden)

    Hendra Grandis

    2013-01-01

    Full Text Available The geomagnetic deep sounding (GDS method is one of electromagnetic (EM methods in geophysics that allows the estimation of the subsurface electrical conductivity distribution. This paper presents the inversion modeling of GDS data employing Markov Chain Monte Carlo (MCMC algorithm to evaluate the marginal posterior probability of the model parameters. We used thin-sheet model to represent quasi-3D conductivity variations in the heterogeneous subsurface. The algorithm was applied to invert field GDS data from the zone covering an area that spans from eastern margin of the Bohemian Massif to the West Carpathians in Europe. Conductivity anomalies obtained from this study confirm the well-known large-scale tectonic setting of the area.

  11. Simplified inverse filter tracking algorithm for estimating the mean trabecular bone spacing.

    Science.gov (United States)

    Huang, Kai; Ta, Dean; Wang, Weiqi; Le, L H

    2008-07-01

    Ultrasonic backscatter signals provide useful information relevant to bone tissue characterization. Trabecular bone microstructures have been considered as quasi-periodic tissues with a collection of regular and diffuse scatterers. This paper investigates the potential of a novel technique using a simplified inverse filter tracking (SIFT) algorithm to estimate mean trabecular bone spacing (MTBS) from ultrasonic backscatter signals. In contrast to other frequency-based methods, the SIFT algorithm is a time-based method and utilizes the amplitude and phase information of backscatter echoes, thus retaining the advantages of both the autocorrelation and the cepstral analysis techniques. The SIFT algorithm was applied to backscatter signals from simulations, phantoms, and bovine trabeculae in vitro. The estimated MTBS results were compared with those of the autoregressive (AR) cepstrum and quadratic transformation (QT) . The SIFT estimates are better than the AR cepstrum estimates and are comparable with the QT values. The study demonstrates that the SIFT algorithm has the potential to be a reliable and robust method for the estimation of MTBS in the presence of a small signal-to-noise ratio, a large spacing variation between regular scatterers, and a large scattering strength ratio of diffuse scatterers to regular ones.

  12. Microphysical particle properties derived from inversion algorithms developed in the framework of EARLINET

    Science.gov (United States)

    Müller, Detlef; Böckmann, Christine; Kolgotin, Alexei; Schneidenbach, Lars; Chemyakin, Eduard; Rosemann, Julia; Znak, Pavel; Romanov, Anton

    2016-10-01

    We present a summary on the current status of two inversion algorithms that are used in EARLINET (European Aerosol Research Lidar Network) for the inversion of data collected with EARLINET multiwavelength Raman lidars. These instruments measure backscatter coefficients at 355, 532, and 1064 nm, and extinction coefficients at 355 and 532 nm. Development of these two algorithms started in 2000 when EARLINET was founded. The algorithms are based on a manually controlled inversion of optical data which allows for detailed sensitivity studies. The algorithms allow us to derive particle effective radius as well as volume and surface area concentration with comparably high confidence. The retrieval of the real and imaginary parts of the complex refractive index still is a challenge in view of the accuracy required for these parameters in climate change studies in which light absorption needs to be known with high accuracy. It is an extreme challenge to retrieve the real part with an accuracy better than 0.05 and the imaginary part with accuracy better than 0.005-0.1 or ±50 %. Single-scattering albedo can be computed from the retrieved microphysical parameters and allows us to categorize aerosols into high- and low-absorbing aerosols. On the basis of a few exemplary simulations with synthetic optical data we discuss the current status of these manually operated algorithms, the potentially achievable accuracy of data products, and the goals for future work. One algorithm was used with the purpose of testing how well microphysical parameters can be derived if the real part of the complex refractive index is known to at least 0.05 or 0.1. The other algorithm was used to find out how well microphysical parameters can be derived if this constraint for the real part is not applied. The optical data used in our study cover a range of Ångström exponents and extinction-to-backscatter (lidar) ratios that are found from lidar measurements of various aerosol types. We also tested

  13. Genetic algorithms-based inversion of multimode guided waves for cortical bone characterization

    Science.gov (United States)

    Bochud, N.; Vallet, Q.; Bala, Y.; Follet, H.; Minonzio, J.-G.; Laugier, P.

    2016-10-01

    Recent progress in quantitative ultrasound has exploited the multimode waveguide response of long bones. Measurements of the guided modes, along with suitable waveguide modeling, have the potential to infer strength-related factors such as stiffness (mainly determined by cortical porosity) and cortical thickness. However, the development of such model-based approaches is challenging, in particular because of the multiparametric nature of the inverse problem. Current estimation methods in the bone field rely on a number of assumptions for pairing the incomplete experimental data with the theoretical guided modes (e.g. semi-automatic selection and classification of the data). The availability of an alternative inversion scheme that is user-independent is highly desirable. Thus, this paper introduces an efficient inversion method based on genetic algorithms using multimode guided waves, in which the mode-order is kept blind. Prior to its evaluation on bone, our proposal is validated using laboratory-controlled measurements on isotropic plates and bone-mimicking phantoms. The results show that the model parameters (i.e. cortical thickness and porosity) estimated from measurements on a few ex vivo human radii are in good agreement with the reference values derived from x-ray micro-computed tomography. Further, the cortical thickness estimated from in vivo measurements at the third from the distal end of the radius is in good agreement with the values delivered by site-matched high-resolution x-ray peripheral computed tomography.

  14. An improved pulse sequence and inversion algorithm of T2 spectrum

    Science.gov (United States)

    Ge, Xinmin; Chen, Hua; Fan, Yiren; Liu, Juntao; Cai, Jianchao; Liu, Jianyu

    2017-03-01

    The nuclear magnetic resonance transversal relaxation time is widely applied in geological prospecting, both in laboratory and downhole environments. However, current methods used for data acquisition and inversion should be reformed to characterize geological samples with complicated relaxation components and pore size distributions, such as samples of tight oil, gas shale, and carbonate. We present an improved pulse sequence to collect transversal relaxation signals based on the CPMG (Carr, Purcell, Meiboom, and Gill) pulse sequence. The echo spacing is not constant but varies in different windows, depending on prior knowledge or customer requirements. We use the entropy based truncated singular value decomposition (TSVD) to compress the ill-posed matrix and discard small singular values which cause the inversion instability. A hybrid algorithm combining the iterative TSVD and a simultaneous iterative reconstruction technique is implemented to reach the global convergence and stability of the inversion. Numerical simulations indicate that the improved pulse sequence leads to the same result as CPMG, but with lower echo numbers and computational time. The proposed method is a promising technique for geophysical prospecting and other related fields in future.

  15. A behavior-based inverse kinematics algorithm to predict arm prehension postures for computer-aided ergonomic evaluation.

    Science.gov (United States)

    Wang, X

    1999-05-01

    In this paper, the computational problem of inverse kinematics of arm prehension movements was investigated. How motions of each joint involved in arm movements can be used to control the end-effector (hand) position and orientation was first examined. It is shown that the inverse kinematics problem due to the kinematic redundancy in joint space is ill-posed only at the control of hand orientation but not at the control of hand position. Based upon this analysis, a previously proposed inverse kinematics algorithm (Wang et Verriest, 1998a) to predict arm reach postures was extended to a seven-DOF arm model to predict arm prehension postures using a separate control of hand position and orientation. The algorithm can be either in rule-based form or by optimization through appropriate choice of weight coefficients. Compared to the algebraic inverse kinematics algorithm, the proposed algorithm can handle the non-linearity of joint limits in a straightforward way. In addition, no matrix inverse calculation is needed, thus avoiding the stability and convergence problems often occurring near a singularity of the Jacobian. Since an end-effector motion-oriented method is used to describe joint movements, observed behaviors of arm movements can be easily implemented in the algorithm. The proposed algorithm provides a general frame for arm postural control and can be used as an efficient postural manipulation tool for computer-aided ergonomic evaluation.

  16. Design for a Crane Metallic Structure Based on Imperialist Competitive Algorithm and Inverse Reliability Strategy

    Science.gov (United States)

    Fan, Xiao-Ning; Zhi, Bo

    2017-07-01

    Uncertainties in parameters such as materials, loading, and geometry are inevitable in designing metallic structures for cranes. When considering these uncertainty factors, reliability-based design optimization (RBDO) offers a more reasonable design approach. However, existing RBDO methods for crane metallic structures are prone to low convergence speed and high computational cost. A unilevel RBDO method, combining a discrete imperialist competitive algorithm with an inverse reliability strategy based on the performance measure approach, is developed. Application of the imperialist competitive algorithm at the optimization level significantly improves the convergence speed of this RBDO method. At the reliability analysis level, the inverse reliability strategy is used to determine the feasibility of each probabilistic constraint at each design point by calculating its α-percentile performance, thereby avoiding convergence failure, calculation error, and disproportionate computational effort encountered using conventional moment and simulation methods. Application of the RBDO method to an actual crane structure shows that the developed RBDO realizes a design with the best tradeoff between economy and safety together with about one-third of the convergence speed and the computational cost of the existing method. This paper provides a scientific and effective design approach for the design of metallic structures of cranes.

  17. Inverse problems with Poisson data: statistical regularization theory, applications and algorithms

    Science.gov (United States)

    Hohage, Thorsten; Werner, Frank

    2016-09-01

    Inverse problems with Poisson data arise in many photonic imaging modalities in medicine, engineering and astronomy. The design of regularization methods and estimators for such problems has been studied intensively over the last two decades. In this review we give an overview of statistical regularization theory for such problems, the most important applications, and the most widely used algorithms. The focus is on variational regularization methods in the form of penalized maximum likelihood estimators, which can be analyzed in a general setup. Complementing a number of recent convergence rate results we will establish consistency results. Moreover, we discuss estimators based on a wavelet-vaguelette decomposition of the (necessarily linear) forward operator. As most prominent applications we briefly introduce Positron emission tomography, inverse problems in fluorescence microscopy, and phase retrieval problems. The computation of a penalized maximum likelihood estimator involves the solution of a (typically convex) minimization problem. We also review several efficient algorithms which have been proposed for such problems over the last five years.

  18. Solving inverse problem for Markov chain model of customer lifetime value using flower pollination algorithm

    Science.gov (United States)

    Al-Ma'shumah, Fathimah; Permana, Dony; Sidarto, Kuntjoro Adji

    2015-12-01

    Customer Lifetime Value is an important and useful concept in marketing. One of its benefits is to help a company for budgeting marketing expenditure for customer acquisition and customer retention. Many mathematical models have been introduced to calculate CLV considering the customer retention/migration classification scheme. A fairly new class of these models which will be described in this paper uses Markov Chain Models (MCM). This class of models has the major advantage for its flexibility to be modified to several different cases/classification schemes. In this model, the probabilities of customer retention and acquisition play an important role. From Pfeifer and Carraway, 2000, the final formula of CLV obtained from MCM usually contains nonlinear form of the transition probability matrix. This nonlinearity makes the inverse problem of CLV difficult to solve. This paper aims to solve this inverse problem, yielding the approximate transition probabilities for the customers, by applying metaheuristic optimization algorithm developed by Yang, 2013, Flower Pollination Algorithm. The major interpretation of obtaining the transition probabilities are to set goals for marketing teams in keeping the relative frequencies of customer acquisition and customer retention.

  19. Joint inversions of two VTEM surveys using quasi-3D TDEM and 3D magnetic inversion algorithms

    Science.gov (United States)

    Kaminski, Vlad; Di Massa, Domenico; Viezzoli, Andrea

    2016-05-01

    In the current paper, we present results of a joint quasi-three-dimensional (quasi-3D) inversion of two versatile time domain electromagnetic (VTEM) datasets, as well as a joint 3D inversion of associated aeromagnetic datasets, from two surveys flown six years apart from one another (2007 and 2013) over a volcanogenic massive sulphide gold (VMS-Au) prospect in northern Ontario, Canada. The time domain electromagnetic (TDEM) data were inverted jointly using the spatially constrained inversion (SCI) approach. In order to increase the coherency in the model space, a calibration parameter was added. This was followed by a joint inversion of the total magnetic intensity (TMI) data extracted from the two surveys. The results of the inversions have been studied and matched with the known geology, adding some new valuable information to the ongoing mineral exploration initiative.

  20. Comparison of IPSA and HIPO inverse planning optimization algorithms for prostate HDR brachytherapy.

    Science.gov (United States)

    Panettieri, Vanessa; Smith, Ryan L; Mason, Natasha J; Millar, Jeremy L

    2014-11-08

    Publications have reported the benefits of using high-dose-rate brachytherapy (HDRB) for the treatment of prostate cancer, since it provides similar biochemical control as other treatments while showing lowest long-term complications to the organs at risk (OAR). With the inclusion of anatomy-based inverse planning opti- mizers, HDRB has the advantage of potentially allowing dose escalation. Among the algorithms used, the Inverse Planning Simulated Annealing (IPSA) optimizer is widely employed since it provides adequate dose coverage, minimizing dose to the OAR, but it is known to generate large dwell times in particular positions of the catheter. As an alternative, the Hybrid Inverse treatment Planning Optimization (HIPO) algorithm was recently implemented in Oncentra Brachytherapy V. 4.3. The aim of this work was to compare, with the aid of radiobiological models, plans obtained with IPSA and HIPO to assess their use in our clinical practice. Thirty patients were calculated with IPSA and HIPO to achieve our department's clinical constraints. To evaluate their performance, dosimetric data were collected: Prostate PTV D90(%), V100(%), V150(%), and V200(%), Urethra D10(%), Rectum D2cc(%), and conformity indices. Additionally tumor control probability (TCP) and normal tissue complication probability (NTCP) were calculated with the BioSuite software. The HIPO optimization was performed firstly with Prostate PTV (HIPOPTV) and then with Urethra as priority 1 (HIPOurethra). Initial optimization constraints were then modified to see the effects on dosimetric parameters, TCPs, and NTCPs. HIPO optimizations could reduce TCPs up to 10%-20% for all PTVs lower than 74 cm3. For the urethra, IPSA and HIPOurethra provided similar NTCPs for the majority of volume sizes, whereas HIPOPTV resulted in large NTCP values. These findings were in agreement with dosimetric values. By increasing the PTV maximum dose constraints for HIPOurethra plans, TCPs were found to be in agreement with

  1. Controlled-Source Seismic Tomography with Wavelets: Inversion Algorithm and its Application to Vesuvius Volcano

    Science.gov (United States)

    Tikhotsky, S.; Achauer, U.; Fokin, I.

    2009-04-01

    A self-adaptive automated parameterisation approach is suggested for the inversion of controlled-source seismic tomography data. The velocities and interfaces are parameterized by their Haar wavelet expansion coefficients. Only those coefficients that are well constrained by the data, as measured by the number of rays that cross the corresponding wavelet function support area (hit counts) and their angular coverage, are inverted for, others are set to zero. The adequacy of the suggested empirical resolution measures are investigated on the 2D and 3D synthetic examples by the comparision with the corresponding diagonal elements of the resolution matrices. The rule for the optimal selection of algoritm parameters has been constructed. We show with the series of the synthetic tests that our approach leads to the reasonable distribution of resolution throughout the model even in cases of irregular ray coverage and helps to overcome the trade-off between different types of model parameters. The developed algorithm has been used for the construction of the Vesuvius volcano area velocity model based on the TOMOVES experiment data. The described algorithm allows to obtain the multi-resolution model that provide fine structure information in well-sampled areas and a smooth generalized pattern in other parts of the model. Layer-stripping as well as whole-model approaches were applied to the same data set in order to test the stability of the inversion results. Key features of the model (high-velocity body at depth's -1.2 - 1.0 km under the volcano edifice and a low-velocity volcano root in the carbonate basement, low-velocity basins at the volcano flanks and general position of the carbonate basement top at 1-2 km depth) remain stable regardless of the inversion approach used. Our model well agrees with the previous studies particularly in the structure of the upper volcano-sedimentary layer but provides more fine details and reveals additional structures at greater depth's.

  2. A New Inversion-Based Algorithm for Retrieval of Over-Water Rain Rate from SSM/I Multichannel Imagery

    Science.gov (United States)

    Petty, Grant W.; Stettner, David R.

    1994-01-01

    This paper discusses certain aspects of a new inversion based algorithm for the retrieval of rain rate over the open ocean from the special sensor microwave/imager (SSM/I) multichannel imagery. This algorithm takes a more detailed physical approach to the retrieval problem than previously discussed algorithms that perform explicit forward radiative transfer calculations based on detailed model hydrometer profiles and attempt to match the observations to the predicted brightness temperature.

  3. GUEST EDITORS' INTRODUCTION: Testing inversion algorithms against experimental data: inhomogeneous targets

    Science.gov (United States)

    Belkebir, Kamal; Saillard, Marc

    2005-12-01

    This special section deals with the reconstruction of scattering objects from experimental data. A few years ago, inspired by the Ipswich database [1 4], we started to build an experimental database in order to validate and test inversion algorithms against experimental data. In the special section entitled 'Testing inversion algorithms against experimental data' [5], preliminary results were reported through 11 contributions from several research teams. (The experimental data are free for scientific use and can be downloaded from the web site.) The success of this previous section has encouraged us to go further and to design new challenges for the inverse scattering community. Taking into account the remarks formulated by several colleagues, the new data sets deal with inhomogeneous cylindrical targets and transverse electric (TE) polarized incident fields have also been used. Among the four inhomogeneous targets, three are purely dielectric, while the last one is a `hybrid' target mixing dielectric and metallic cylinders. Data have been collected in the anechoic chamber of the Centre Commun de Ressources Micro-ondes in Marseille. The experimental setup as well as the layout of the files containing the measurements are presented in the contribution by J-M Geffrin, P Sabouroux and C Eyraud. The antennas did not change from the ones used previously [5], namely wide-band horn antennas. However, improvements have been achieved by refining the mechanical positioning devices. In order to enlarge the scope of applications, both TE and transverse magnetic (TM) polarizations have been carried out for all targets. Special care has been taken not to move the target under test when switching from TE to TM measurements, ensuring that TE and TM data are available for the same configuration. All data correspond to electric field measurements. In TE polarization the measured component is orthogonal to the axis of invariance. Contributions A Abubakar, P M van den Berg and T M

  4. Cardiac ablation catheter guidance by means of a single equivalent moving dipole inverse algorithm.

    Science.gov (United States)

    Lee, Kichang; Lv, Wener; Ter-Ovanesyan, Evgeny; Barley, Maya E; Voysey, Graham E; Galea, Anna M; Hirschman, Gordon B; Leroy, Kristen; Marini, Robert P; Barrett, Conor; Armoundas, Antonis A; Cohen, Richard J

    2013-07-01

    We developed and evaluated a novel system for guiding radiofrequency catheter ablation therapy of ventricular tachycardia. This guidance system employs an inverse solution guidance algorithm (ISGA) using a single equivalent moving dipole (SEMD) localization method. The method and system were evaluated in both a saline tank phantom model and in vivo animal (swine) experiments. A catheter with two platinum electrodes spaced 3 mm apart was used as the dipole source in the phantom study. A 40-Hz sinusoidal signal was applied to the electrode pair. In the animal study, four to eight electrodes were sutured onto the right ventricle. These electrodes were connected to a stimulus generator delivering 1-ms duration pacing pulses. Signals were recorded from 64 electrodes, located either on the inner surface of the saline tank or on the body surface of the pig, and then processed by the ISGA to localize the physical or bioelectrical SEMD. In the phantom studies, the guidance algorithm was used to advance a catheter tip to the location of the source dipole. The distance from the final position of the catheter tip to the position of the target dipole was 2.22 ± 0.78 mm in real space and 1.38 ± 0.78 mm in image space (computational space). The ISGA successfully tracked the locations of electrodes sutured on the ventricular myocardium and the movement of an endocardial catheter placed in the animal's right ventricle. In conclusion, we successfully demonstrated the feasibility of using an SEMD inverse algorithm to guide a cardiac ablation catheter. ©2013, The Authors. Journal compilation ©2013 Wiley Periodicals, Inc.

  5. Adaptive Inverse Hyperbolic Tangent Algorithm for Dynamic Contrast Adjustment in Displaying Scenes

    Directory of Open Access Journals (Sweden)

    Chein-I Chang

    2010-01-01

    Full Text Available Contrast has a great influence on the quality of an image in human visual perception. A poorly illuminated environment can significantly affect the contrast ratio, producing an unexpected image. This paper proposes an Adaptive Inverse Hyperbolic Tangent (AIHT algorithm to improve the display quality and contrast of a scene. Because digital cameras must maintain the shadow in a middle range of luminance that includes a main object such as a face, a gamma function is generally used for this purpose. However, this function has a severe weakness in that it decreases highlight contrast. To mitigate this problem, contrast enhancement algorithms have been designed to adjust contrast to tune human visual perception. The proposed AIHT determines the contrast levels of an original image as well as parameter space for different contrast types so that not only the original histogram shape features can be preserved, but also the contrast can be enhanced effectively. Experimental results show that the proposed algorithm is capable of enhancing the global contrast of the original image adaptively while extruding the details of objects simultaneously.

  6. Adaptive Inverse Hyperbolic Tangent Algorithm for Dynamic Contrast Adjustment in Displaying Scenes

    Directory of Open Access Journals (Sweden)

    Wang Chuin-Mu

    2010-01-01

    Full Text Available Abstract Contrast has a great influence on the quality of an image in human visual perception. A poorly illuminated environment can significantly affect the contrast ratio, producing an unexpected image. This paper proposes an Adaptive Inverse Hyperbolic Tangent (AIHT algorithm to improve the display quality and contrast of a scene. Because digital cameras must maintain the shadow in a middle range of luminance that includes a main object such as a face, a gamma function is generally used for this purpose. However, this function has a severe weakness in that it decreases highlight contrast. To mitigate this problem, contrast enhancement algorithms have been designed to adjust contrast to tune human visual perception. The proposed AIHT determines the contrast levels of an original image as well as parameter space for different contrast types so that not only the original histogram shape features can be preserved, but also the contrast can be enhanced effectively. Experimental results show that the proposed algorithm is capable of enhancing the global contrast of the original image adaptively while extruding the details of objects simultaneously.

  7. Intercomparison of Numerical Inversion Algorithms for Particle Size Determination of Polystyrene Suspensions Using Spectral Turbidimetry

    Directory of Open Access Journals (Sweden)

    Benjamin Glasse

    2015-01-01

    Full Text Available The continuous monitoring of the particle size distribution in particulate processes with suspensions or emulsions requires measurement techniques that can be used as in situ devices in contrast to ex situ or laboratory methods. In this context, for the evaluation of turbidimetric spectral measurements, the application of different numerical inversion algorithms is investigated with respect to the particle size distribution determination of polystyrene suspensions. A modified regularization concept consisting of a Twomey-Phillips-Regularization with an integrated nonnegative constraint and a modified L-curve criterion for the selection of the regularization parameter is used. The particle size (i.e., particle diameter of polystyrene suspensions in the range x=0.03–3 µm was validated via dynamic light scattering and differential centrifugal sedimentation and compared to the retrieved particle size distribution from the inverted turbidimetry measurements.

  8. Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses

    Energy Technology Data Exchange (ETDEWEB)

    Pinar, Ali; Chow, Edmond; Pothen, Alex

    2005-03-18

    This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.

  9. An Efficient Inverse Kinematic Algorithm for a PUMA560-Structured Robot Manipulator

    Directory of Open Access Journals (Sweden)

    Huashan Liu

    2013-05-01

    Full Text Available This paper presents an efficient inverse kinematics (IK approach which features fast computing performance for a PUMA560‐structured robot manipulator. By properties of the orthogonal matrix and block matrix, the complex IK matrix equations are transformed into eight pure algebraic equations that contain the six unknown joint angle variables, which makes the solving compact without computing the reverses of the 4×4 homogeneous transformation matrices. Moreover, the appropriate combination of related equations ensures that the solutions are free of extraneous roots in the solving process, and the wrist singularity problem of the robot is also addressed. Finally, a case study is given to show the effectiveness of the proposed algorithm.

  10. Study on inverse estimation of radiative properties from directional radiances by using statistical RPSO algorithm

    Science.gov (United States)

    Han, Kuk-Il; Kim, Do-Hwi; Choi, Jun-Hyuk; Kim, Tae-Kuk; Shin, Jong-Jin

    2016-09-01

    Infrared signals are widely used to discriminate objects against the background. Prediction of infrared signal from an object surface is essential in evaluating the detectability of the object. Appropriate and easy method of procurement of the radiative properties such as the surface emissivity, bidirectional reflectivity is important in estimating infrared signals. Direct measurement can be a good choice but a costly and time consuming way of obtaining the radiative properties for surfaces coated with many different newly developed paints. Especially measurement of the bidirectional reflectivity usually expressed by the bidirectional reflectance distribution function (BRDF) is the most costly job. In this paper we are presenting an inverse estimation method of the radiative properties by using the directional radiances from the surface of concern. The inverse estimation method used in this study is the statistical repulsive particle swarm optimization (RPSO) algorithm which uses the randomly picked directional radiance data emitted and reflected from the surface. In this paper, we test the proposed inverse method by considering the radiation from a steel plate surface coated with different paints at a clear sunny day condition. For convenience, the directional radiance data from the steel plate within a spectral band of concern are obtained from the simulation using the commercial software, RadthermIR, instead of the field measurement. A widely used BRDF model called as the Sandford-Robertson(S-R) model is considered and the RPSO process is then used to find the best fitted model parameters for the S-R model. The results obtained from this study show an excellent agreement with the reference property data used for the simulation for directional radiances. The proposed process can be a useful way of obtaining the radiative properties from field measured directional radiance data for surfaces coated with or without various kinds of paints of unknown radiative

  11. Efficient edge-guided full-waveform inversion by Canny edge detection and bilateral filtering algorithms

    Science.gov (United States)

    Xiang, Shiming; Zhang, Haijiang

    2016-11-01

    It is known full-waveform inversion (FWI) is generally ill-conditioned and various strategies including pre-conditioning and regularizing the inversion system have been proposed to obtain a reliable estimation of the velocity model. Here, we propose a new edge-guided strategy for FWI in frequency domain to efficiently and reliably estimate velocity models with structures of the size similar to the seismic wavelength. The edges of the velocity model at the current iteration are first detected by the Canny edge detection algorithm that is widely used in image processing. Then, the detected edges are used for guiding the calculation of FWI gradient as well as enforcing edge-preserving total variation (TV) regularization for next iteration of FWI. Bilateral filtering is further applied to remove noise but keep edges of the FWI gradient. The proposed edge-guided FWI in the frequency domain with edge-guided TV regularization and bilateral filtering is designed to preserve model edges that are recovered from previous iterations as well as from lower frequency waveforms when FWI is conducted from lower to higher frequencies. The new FWI method is validated using the complex Marmousi model that contains several steeply dipping fault zones and hundreds of horizons. Compared to FWI without edge guidance, our proposed edge-guided FWI recovers velocity model anomalies and edges much better. Unlike previous image-guided FWI or edge-guided TV regularization strategies, our method does not require migrating seismic data, thus is more efficient for real applications.

  12. Three-dimensional inverse modelling of magnetic anomaly sources based on a genetic algorithm

    Science.gov (United States)

    Montesinos, Fuensanta G.; Blanco-Montenegro, Isabel; Arnoso, José

    2016-04-01

    We present a modelling method to estimate the 3-D geometry and location of homogeneously magnetized sources from magnetic anomaly data. As input information, the procedure needs the parameters defining the magnetization vector (intensity, inclination and declination) and the Earth's magnetic field direction. When these two vectors are expected to be different in direction, we propose to estimate the magnetization direction from the magnetic map. Then, using this information, we apply an inversion approach based on a genetic algorithm which finds the geometry of the sources by seeking the optimum solution from an initial population of models in successive iterations through an evolutionary process. The evolution consists of three genetic operators (selection, crossover and mutation), which act on each generation, and a smoothing operator, which looks for the best fit to the observed data and a solution consisting of plausible compact sources. The method allows the use of non-gridded, non-planar and inaccurate anomaly data and non-regular subsurface partitions. In addition, neither constraints for the depth to the top of the sources nor an initial model are necessary, although previous models can be incorporated into the process. We show the results of a test using two complex synthetic anomalies to demonstrate the efficiency of our inversion method. The application to real data is illustrated with aeromagnetic data of the volcanic island of Gran Canaria (Canary Islands).

  13. Identify Structural Flaw Location and Type with an Inverse Algorithm of Resonance Inspection

    Energy Technology Data Exchange (ETDEWEB)

    Xu, Wei; Lai, Canhai; Sun, Xin

    2015-10-20

    To evaluate the fitness-for-service of a structural component and to quantify its remaining useful life, aging and service-induced structural flaws must be quantitatively determined in service or during scheduled maintenance shutdowns. Resonance inspection (RI), a non-destructive evaluation (NDE) technique, distinguishes the anomalous parts from the good parts based on changes in the natural frequency spectra. Known for its numerous advantages, i.e., low inspection cost, high testing speed, and broad applicability to complex structures, RI has been widely used in the automobile industry for quality inspection. However, compared to other contemporary direct visualization-based NDE methods, a more widespread application of RI faces a fundamental challenge because such technology is unable to quantify the flaw details, e.g. location, dimensions, and types. In this study, the applicability of a maximum correlation-based inverse RI algorithm developed by the authors is further studied for various flaw cases. It is demonstrated that a variety of common structural flaws, i.e. stiffness degradation, voids, and cracks, can be accurately retrieved by this algorithm even when multiple different types of flaws coexist. The quantitative relations between the damage identification results and the flaw characteristics are also developed to assist the evaluation of the actual state of health of the engineering structures.

  14. Evaluation of a Geothermal Prospect Using a Stochastic Joint Inversion Algorithm

    Science.gov (United States)

    Tompson, A. F.; Mellors, R. J.; Ramirez, A.; Dyer, K.; Yang, X.; Trainor-Guitton, W.; Wagoner, J. L.

    2013-12-01

    A stochastic joint inverse algorithm to analyze diverse geophysical and hydrologic data for a geothermal prospect is developed. The purpose is to improve prospect evaluation by finding an ensemble of hydrothermal flow models that are most consistent with multiple types of data sets. The staged approach combines Bayesian inference within a Markov Chain Monte Carlo (MCMC) global search algorithm. The method is highly flexible and capable of accommodating multiple and diverse datasets as a means to maximize the utility of all available data to understand system behavior. An initial application is made at a geothermal prospect located near Superstition Mountain in the western Salton Trough in California. Readily available data include three thermal gradient exploration boreholes, borehole resistivity logs, magnetotelluric and gravity geophysical surveys, surface heat flux measurements, and other nearby hydrologic and geologic information. Initial estimates of uncertainty in structural or parametric characteristics of the prospect are used to drive large numbers of simulations of hydrothermal fluid flow and related geophysical processes using random realizations of the conceptual geothermal system. Uncertainty in the results is represented within a ranked subset of model realizations that best match all available data within a specified norm or tolerance. Statistical (posterior) characteristics of these solutions reflect reductions in the perceived (prior) uncertainties. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. LLNL-ABS-641792.

  15. Fast inversion of gravity data using the symmetric successive over-relaxation (SSOR) preconditioned conjugate gradient algorithm

    Science.gov (United States)

    Meng, Zhaohai; Li, Fengting; Xu, Xuechun; Huang, Danian; Zhang, Dailei

    2017-02-01

    The subsurface three-dimensional (3D) model of density distribution is obtained by solving an under-determined linear equation that is established by gravity data. Here, we describe a new fast gravity inversion method to recover a 3D density model from gravity data. The subsurface will be divided into a large number of rectangular blocks, each with an unknown constant density. The gravity inversion method introduces a stabiliser model norm with a depth weighting function to produce smooth models. The depth weighting function is combined with the model norm to counteract the skin effect of the gravity potential field. As the numbers of density model parameters is NZ (the number of layers in the vertical subsurface domain) times greater than the observed gravity data parameters, the inverse density parameter is larger than the observed gravity data parameters. Solving the full set of gravity inversion equations is very time-consuming, and applying a new algorithm to estimate gravity inversion can significantly reduce the number of iterations and the computational time. In this paper, a new symmetric successive over-relaxation (SSOR) iterative conjugate gradient (CG) method is shown to be an appropriate algorithm to solve this Tikhonov cost function (gravity inversion equation). The new, faster method is applied on Gaussian noise-contaminated synthetic data to demonstrate its suitability for 3D gravity inversion. To demonstrate the performance of the new algorithm on actual gravity data, we provide a case study that includes ground-based measurement of residual Bouguer gravity anomalies over the Humble salt dome near Houston, Gulf Coast Basin, off the shore of Louisiana. A 3D distribution of salt rock concentration is used to evaluate the inversion results recovered by the new SSOR iterative method. In the test model, the density values in the constructed model coincide with the known location and depth of the salt dome.

  16. On the applicability of genetic algorithms to fast solar spectropolarimetric inversions for vector magnetography

    Science.gov (United States)

    Harker, Brian J.

    The measurement of vector magnetic fields on the sun is one of the most important diagnostic tools for characterizing solar activity. The ubiquitous solar wind is guided into interplanetary space by open magnetic field lines in the upper solar atmosphere. Highly-energetic solar flares and Coronal Mass Ejections (CMEs) are triggered in lower layers of the solar atmosphere by the driving forces at the visible "surface" of the sun, the photosphere. The driving forces there tangle and interweave the vector magnetic fields, ultimately leading to an unstable field topology with large excess magnetic energy, and this excess energy is suddenly and violently released by magnetic reconnection, emitting intense broadband radiation that spans the electromagnetic spectrum, accelerating billions of metric tons of plasma away from the sun, and finally relaxing the magnetic field to lower-energy states. These eruptive flaring events can have severe impacts on the near-Earth environment and the human technology that inhabits it. This dissertation presents a novel inversion method for inferring the properties of the vector magnetic field from telescopic measurements of the polarization states (Stokes vector) of the light received from the sun, in an effort to develop a method that is fast, accurate, and reliable. One of the long-term goals of this work is to develop such a method that is capable of rapidly-producing characterizations of the magnetic field from time-sequential data, such that near real-time projections of the complexity and flare- productivity of solar active regions can be made. This will be a boon to the field of solar flare forecasting, and should help mitigate the harmful effects of space weather on mankind's space-based endeavors. To this end, I have developed an inversion method based on genetic algorithms (GA) that have the potential for achieving such high-speed analysis.

  17. RNAiFOLD: a constraint programming algorithm for RNA inverse folding and molecular design.

    Science.gov (United States)

    Garcia-Martin, Juan Antonio; Clote, Peter; Dotu, Ivan

    2013-04-01

    Synthetic biology is a rapidly emerging discipline with long-term ramifications that range from single-molecule detection within cells to the creation of synthetic genomes and novel life forms. Truly phenomenal results have been obtained by pioneering groups--for instance, the combinatorial synthesis of genetic networks, genome synthesis using BioBricks, and hybridization chain reaction (HCR), in which stable DNA monomers assemble only upon exposure to a target DNA fragment, biomolecular self-assembly pathways, etc. Such work strongly suggests that nanotechnology and synthetic biology together seem poised to constitute the most transformative development of the 21st century. In this paper, we present a Constraint Programming (CP) approach to solve the RNA inverse folding problem. Given a target RNA secondary structure, we determine an RNA sequence which folds into the target structure; i.e. whose minimum free energy structure is the target structure. Our approach represents a step forward in RNA design--we produce the first complete RNA inverse folding approach which allows for the specification of a wide range of design constraints. We also introduce a Large Neighborhood Search approach which allows us to tackle larger instances at the cost of losing completeness, while retaining the advantages of meeting design constraints (motif, GC-content, etc.). Results demonstrate that our software, RNAiFold, performs as well or better than all state-of-the-art approaches; nevertheless, our approach is unique in terms of completeness, flexibility, and the support of various design constraints. The algorithms presented in this paper are publicly available via the interactive webserver http://bioinformatics.bc.edu/clotelab/RNAiFold; additionally, the source code can be downloaded from that site.

  18. Inverse Kinematics and Control of a 7-DOF Redundant Manipulator Based on the Closed-Loop Algorithm

    Directory of Open Access Journals (Sweden)

    Jingguo Wang

    2011-01-01

    Full Text Available Closed-loop inverse kinematics (CLIK algorithm mostly resolves the redundancy at the velocity level. In this paper we extend the CLIK algorithm to the acceleration level to meet some applications that require the joint accelerations. The redundancy resolutions at the velocities and acceleration levels via pseudoinverse method are analyzed respectively. The objective function of joint limits avoidance (JLA is combined into the redundancy resolution as an optimization approach of the null space motion. A seven-DOF redundant manipulator is designed to do the computer simulations and the real experiments are carried out on a Powercube modular manipulator. Their results demonstrated the effectiveness of the proposed algorithm.

  19. Noise reduction for modal parameters estimation using algorithm of solving partially described inverse singular value problem

    Science.gov (United States)

    Bao, Xingxian; Cao, Aixia; Zhang, Jing

    2016-07-01

    Modal parameters estimation plays an important role for structural health monitoring. Accurately estimating the modal parameters of structures is more challenging as the measured vibration response signals are contaminated with noise. This study develops a mathematical algorithm of solving the partially described inverse singular value problem (PDISVP) combined with the complex exponential (CE) method to estimate the modal parameters. The PDISVP solving method is to reconstruct an L2-norm optimized (filtered) data matrix from the measured (noisy) data matrix, when the prescribed data constraints are one or several sets of singular triplets of the matrix. The measured data matrix is Hankel structured, which is constructed based on the measured impulse response function (IRF). The reconstructed matrix must maintain the Hankel structure, and be lowered in rank as well. Once the filtered IRF is obtained, the CE method can be applied to extract the modal parameters. Two physical experiments, including a steel cantilever beam with 10 accelerometers mounted, and a steel plate with 30 accelerometers mounted, excited by an impulsive load, respectively, are investigated to test the applicability of the proposed scheme. In addition, the consistency diagram is proposed to exam the agreement among the modal parameters estimated from those different accelerometers. Results indicate that the PDISVP-CE method can significantly remove noise from measured signals and accurately estimate the modal frequencies and damping ratios.

  20. Three dimensional intensity modulated brachytherapy (IMBT): Dosimetry algorithm and inverse treatment planning

    Energy Technology Data Exchange (ETDEWEB)

    Shi Chengyu; Guo Bingqi; Cheng, Chih-Yao; Esquivel, Carlos; Eng, Tony; Papanikolaou, Niko [Cancer Therapy and Research Center, University of Texas Health Science Center at San Antonio, San Antonio, Texas 78229 (United States); Department of Radiation Oncology, Oklahoma University Health Science Center, Oklahoma City, Oklahoma 73104 (United States); Cancer Therapy and Research Center, University of Texas Health Science Center at San Antonio, San Antonio, Texas 78229 (United States)

    2010-07-15

    Purpose: The feasibility of intensity modulated brachytherapy (IMBT) to improve dose conformity for irregularly shaped targets has been previously investigated by researchers by means of using partially shielded sources. However, partial shielding does not fully explore the potential of IMBT. The goal of this study is to introduce the concept of three dimensional (3D) intensity modulated brachytherapy and solve two fundamental issues regarding the application of 3D IMBT treatment planning: The dose calculation algorithm and the inverse treatment planning method. Methods: A 3D IMBT treatment planning system prototype was developed using the MATLAB platform. This system consists of three major components: (1) A comprehensive IMBT source calibration method with dosimetric inputs from Monte Carlo (EGSnrc) simulations; (2) a ''modified TG-43'' (mTG-43) dose calculation formalism for IMBT dosimetry; and (3) a physical constraint based inverse IMBT treatment planning platform utilizing a simulated annealing optimization algorithm. The model S700 Axxent electronic brachytherapy source developed by Xoft, Inc. (Fremont, CA), was simulated in this application. Ten intracavitary accelerated partial breast irradiation (APBI) cases were studied. For each case, an ''isotropic plan'' with only optimized source dwell time and a fully optimized IMBT plan were generated and compared to the original plan in various dosimetric aspects, such as the plan quality, planning, and delivery time. The issue of the mechanical complexity of the IMBT applicator is not addressed in this study. Results: IMBT approaches showed superior plan quality compared to the original plans and the isotropic plans to different extents in all studied cases. An extremely difficult case with a small breast and a small distance to the ribs and skin, the IMBT plan minimized the high dose volume V{sub 200} by 16.1% and 4.8%, respectively, compared to the original and the

  1. A Generic 1D Forward Modeling and Inversion Algorithm for TEM Sounding with an Arbitrary Horizontal Loop

    Science.gov (United States)

    Li, Zhanhui; Huang, Qinghua; Xie, Xingbing; Tang, Xingong; Chang, Liao

    2016-08-01

    We present a generic 1D forward modeling and inversion algorithm for transient electromagnetic (TEM) data with an arbitrary horizontal transmitting loop and receivers at any depth in a layered earth. Both the Hankel and sine transforms required in the forward algorithm are calculated using the filter method. The adjoint-equation method is used to derive the formulation of data sensitivity at any depth in non-permeable media. The inversion algorithm based on this forward modeling algorithm and sensitivity formulation is developed using the Gauss-Newton iteration method combined with the Tikhonov regularization. We propose a new data-weighting method to minimize the initial model dependence that enhances the convergence stability. On a laptop with a CPU of i7-5700HQ@3.5 GHz, the inversion iteration of a 200 layered input model with a single receiver takes only 0.34 s, while it increases to only 0.53 s for the data from four receivers at a same depth. For the case of four receivers at different depths, the inversion iteration runtime increases to 1.3 s. Modeling the data with an irregular loop and an equal-area square loop indicates that the effect of the loop geometry is significant at early times and vanishes gradually along the diffusion of TEM field. For a stratified earth, inversion of data from more than one receiver is useful in noise reducing to get a more credible layered earth. However, for a resistive layer shielded below a conductive layer, increasing the number of receivers on the ground does not have significant improvement in recovering the resistive layer. Even with a down-hole TEM sounding, the shielded resistive layer cannot be recovered if all receivers are above the shielded resistive layer. However, our modeling demonstrates remarkable improvement in detecting the resistive layer with receivers in or under this layer.

  2. Multi-GPU parallel algorithm design and analysis for improved inversion of probability tomography with gravity gradiometry data

    Science.gov (United States)

    Hou, Zhenlong; Huang, Danian

    2017-09-01

    In this paper, we make a study on the inversion of probability tomography (IPT) with gravity gradiometry data at first. The space resolution of the results is improved by multi-tensor joint inversion, depth weighting matrix and the other methods. Aiming at solving the problems brought by the big data in the exploration, we present the parallel algorithm and the performance analysis combining Compute Unified Device Architecture (CUDA) with Open Multi-Processing (OpenMP) based on Graphics Processing Unit (GPU) accelerating. In the test of the synthetic model and real data from Vinton Dome, we get the improved results. It is also proved that the improved inversion algorithm is effective and feasible. The performance of parallel algorithm we designed is better than the other ones with CUDA. The maximum speedup could be more than 200. In the performance analysis, multi-GPU speedup and multi-GPU efficiency are applied to analyze the scalability of the multi-GPU programs. The designed parallel algorithm is demonstrated to be able to process larger scale of data and the new analysis method is practical.

  3. A Comparison of Finite Element-Based Inversion Algorithms, Local Frequency Estimation, and Direct Inversion Approach Used in MRE.

    Science.gov (United States)

    Honarvar, Mohammad; Sahebjavaher, Ramin S; Rohling, Robert; Salcudean, Septimiu E

    2017-08-01

    In quantitative elastography, maps of the mechanical properties of soft tissue, or elastograms, are calculated from the measured displacement data by solving an inverse problem. The model assumptions have a significant effect on elastograms. Motivated by the high sensitivity of imaging results to the model assumptions for in vivo magnetic resonance elastography of the prostate, we compared elastograms obtained with four different methods. Two finite-element method (FEM)-based methods developed by our group were compared with two other commonly used methods, local frequency estimator (LFE) and curl-based direct inversion (c-DI). All the methods assume a linear isotropic elastic model, but the methods vary in their assumptions, such as local homogeneity or incompressibility, and in the specific approach used. We report results using simulations, phantom, and ex vivo and in vivo data. The simulation and phantom studies show, for regions with an inclusion, that the contrast to noise ratio (CNR) for the FEM methods is about three to five times higher than the CNR for the LFE and c-DI and the rms error is about half. The LFE method produces very smooth results (i.e., low CNR) and is fast. c-DI is faster than the FEM methods but it is only accurate in areas where elasticity variations are small. The artifacts resulting from the homogeneity assumption in c-DI is detrimental in regions with large variations. The ex vivo and in vivo results also show similar trends as the simulation and phantom studies. The c-FEM method is more sensitive to noise compared with the mixed-FEM due to higher orders derivatives. This is especially evident at lower frequencies, where the wave curvature is smaller and it is more prone to such error, causing a discrepancy in the absolute values between the mixed-FEM and c-FEM in our in vivo results. In general, the proposed FEMs use fewer simplifying assumptions and outperform the other methods but they are computationally more expensive.

  4. A new damping factor algorithm based on line search of the local minimum point for inverse approach

    Science.gov (United States)

    Zhang, Yaqi; Liu, Weijie; Lu, Fang; Zhang, Xiangkui; Hu, Ping

    2013-05-01

    The influence of damping factor on the convergence and computational efficiency of the inverse approach was studied through a series of practical examples. A new selection algorithm of the damping (relaxation) factor which takes into account of both robustness and calculation efficiency is proposed, then the computer program is implemented and tested on Siemens PLM NX | One-Step. The result is compared with the traditional Armijo rule through six examples such as U-beam, square box and cylindrical cup et al, confirming the effectiveness of proposed algorithm.

  5. Music algorithm for imaging of a sound-hard arc in limited-view inverse scattering problem

    Science.gov (United States)

    Park, Won-Kwang

    2017-07-01

    MUltiple SIgnal Classification (MUSIC) algorithm for a non-iterative imaging of sound-hard arc in limited-view inverse scattering problem is considered. In order to discover mathematical structure of MUSIC, we derive a relationship between MUSIC and an infinite series of Bessel functions of integer order. This structure enables us to examine some properties of MUSIC in limited-view problem. Numerical simulations are performed to support the identified structure of MUSIC.

  6. Non-recursive augmented Lagrangian algorithms for the forward and inverse dynamics of constrained flexible multibodies

    Science.gov (United States)

    Bayo, Eduardo; Ledesma, Ragnar

    1993-01-01

    A technique is presented for solving the inverse dynamics of flexible planar multibody systems. This technique yields the non-causal joint efforts (inverse dynamics) as well as the internal states (inverse kinematics) that produce a prescribed nominal trajectory of the end effector. A non-recursive global Lagrangian approach is used in formulating the equations for motion as well as in solving the inverse dynamics equations. Contrary to the recursive method previously presented, the proposed method solves the inverse problem in a systematic and direct manner for both open-chain as well as closed-chain configurations. Numerical simulation shows that the proposed procedure provides an excellent tracking of the desired end effector trajectory.

  7. Feasibility of waveform inversion of Rayleigh waves for shallow shear-wave velocity using a genetic algorithm

    Science.gov (United States)

    Zeng, C.; Xia, J.; Miller, R.D.; Tsoflias, G.P.

    2011-01-01

    Conventional surface wave inversion for shallow shear (S)-wave velocity relies on the generation of dispersion curves of Rayleigh waves. This constrains the method to only laterally homogeneous (or very smooth laterally heterogeneous) earth models. Waveform inversion directly fits waveforms on seismograms, hence, does not have such a limitation. Waveforms of Rayleigh waves are highly related to S-wave velocities. By inverting the waveforms of Rayleigh waves on a near-surface seismogram, shallow S-wave velocities can be estimated for earth models with strong lateral heterogeneity. We employ genetic algorithm (GA) to perform waveform inversion of Rayleigh waves for S-wave velocities. The forward problem is solved by finite-difference modeling in the time domain. The model space is updated by generating offspring models using GA. Final solutions can be found through an iterative waveform-fitting scheme. Inversions based on synthetic records show that the S-wave velocities can be recovered successfully with errors no more than 10% for several typical near-surface earth models. For layered earth models, the proposed method can generate one-dimensional S-wave velocity profiles without the knowledge of initial models. For earth models containing lateral heterogeneity in which case conventional dispersion-curve-based inversion methods are challenging, it is feasible to produce high-resolution S-wave velocity sections by GA waveform inversion with appropriate priori information. The synthetic tests indicate that the GA waveform inversion of Rayleigh waves has the great potential for shallow S-wave velocity imaging with the existence of strong lateral heterogeneity. ?? 2011 Elsevier B.V.

  8. A comparison of inverse optimization algorithms for HDR/PDR prostate brachytherapy treatment planning.

    Science.gov (United States)

    Dinkla, Anna M; van der Laarse, Rob; Kaljouw, Emmie; Pieters, Bradley R; Koedooder, Kees; van Wieringen, Niek; Bel, Arjan

    2015-01-01

    Graphical optimization (GrO) is a common method for high-dose-rate/pulsed-dose-rate (PDR) prostate brachytherapy treatment planning. New methods performing inverse optimization of the dose distribution have been developed over the past years. The purpose is to compare GrO and two established inverse methods, inverse planning simulated annealing (IPSA) and hybrid inverse treatment planning and optimization (HIPO), and one new method, enhanced geometric optimization-interactive inverse planning (EGO-IIP), in terms of speed and dose-volume histogram (DVH) parameters. For 26 prostate cancer patients treated with a PDR brachytherapy boost, an experienced treatment planner optimized the dose distributions using four different methods: GrO, IPSA, HIPO, and EGO-IIP. Relevant DVH parameters (prostate-V100%, D90%, V150%; urethra-D(0.1cm3) and D(1.0cm3); rectum-D(0.1cm3) and D(2.0cm3); bladder-D(2.0cm3)) were evaluated and their compliance to the constraints. Treatment planning time was also recorded. All inverse methods resulted in shorter planning time (mean, 4-6.7 min), as compared with GrO (mean, 7.6 min). In terms of DVH parameters, none of the inverse methods outperformed the others. However, all inverse methods improved on compliance to the planning constraints as compared with GrO. On average, EGO-IIP and GrO resulted in highest D90%, and the IPSA plans resulted in lowest bladder D2.0cm3 and urethra D(1.0cm3). Inverse planning methods decrease planning time as compared with GrO for PDR/high-dose-rate prostate brachytherapy. DVH parameters are comparable for all methods. Copyright © 2015 American Brachytherapy Society. Published by Elsevier Inc. All rights reserved.

  9. Solving the Inverse Kinematics for Robot Manipulators using Modified Electromagnetism-like Algorithm with Record to Record Travel

    Directory of Open Access Journals (Sweden)

    Issa Ahmed Abed

    2014-05-01

    Full Text Available A new modification of Electromagnetism-like (EM algorithm which incorporating the Record-to-Record Travel (RRT local search algorithm; namely MEMR has been developed to solve the problem of Inverse Kinematics (IK for a four Degree-of-Freedom (DOF manipulator. The proposed method is able to generate multiple robot configurations for the IK test performed at different end effect or positions. In addition, the comparison between the proposed MEMR and Genetic Algorithm (GA was carried out using two mathematical test functions; De Jong and Rastrigin. The tests results show that the proposed MEMR is comparable in performance to GA in terms of both convergence speed and error rate.

  10. Inversion of particle size distribution by spectral extinction technique using the attractive and repulsive particle swarm optimization algorithm

    Directory of Open Access Journals (Sweden)

    Qi Hong

    2015-01-01

    Full Text Available The particle size distribution (PSD plays an important role in environmental pollution detection and human health protection, such as fog, haze and soot. In this study, the Attractive and Repulsive Particle Swarm Optimization (ARPSO algorithm and the basic PSO were applied to retrieve the PSD. The spectral extinction technique coupled with the Anomalous Diffraction Approximation (ADA and the Lambert-Beer Law were employed to investigate the retrieval of the PSD. Three commonly used monomodal PSDs, i.e. the Rosin-Rammer (R-R distribution, the normal (N-N distribution, the logarithmic normal (L-N distribution were studied in the dependent model. Then, an optimal wavelengths selection algorithm was proposed. To study the accuracy and robustness of the inverse results, some characteristic parameters were employed. The research revealed that the ARPSO showed more accurate and faster convergence rate than the basic PSO, even with random measurement error. Moreover, the investigation also demonstrated that the inverse results of four incident laser wavelengths showed more accurate and robust than those of two wavelengths. The research also found that if increasing the interval of the selected incident laser wavelengths, inverse results would show more accurate, even in the presence of random error.

  11. A novel hybrid ant colony optimization and particle swarm optimization algorithm for inverse problems of coupled radiative and conductive heat transfer

    National Research Council Canada - National Science Library

    Zhang Biao; Qi Hong; Sun Shuang-Cheng; Ruan Li-Ming; Tan He-Ping

    2016-01-01

    In this study, a continuous ant colony optimization algorithm on the basis of probability density function was applied to the inverse problems of one-dimensional coupled radiative and conductive heat transfer...

  12. TaBoo SeArch Algorithm with a Modified Inverse Histogram for Reproducing Biologically Relevant Rare Events of Proteins.

    Science.gov (United States)

    Harada, Ryuhei; Takano, Yu; Shigeta, Yasuteru

    2016-05-10

    The TaBoo SeArch (TBSA) algorithm [ Harada et al. J. Comput. Chem. 2015 , 36 , 763 - 772 and Harada et al. Chem. Phys. Lett. 2015 , 630 , 68 - 75 ] was recently proposed as an enhanced conformational sampling method for reproducing biologically relevant rare events of a given protein. In TBSA, an inverse histogram of the original distribution, mapped onto a set of reaction coordinates, is constructed from trajectories obtained by multiple short-time molecular dynamics (MD) simulations. Rarely occurring states of a given protein are statistically selected as new initial states based on the inverse histogram, and resampling is performed by restarting the MD simulations from the new initial states to promote the conformational transition. In this process, the definition of the inverse histogram, which characterizes the rarely occurring states, is crucial for the efficiency of TBSA. In this study, we propose a simple modification of the inverse histogram to further accelerate the convergence of TBSA. As demonstrations of the modified TBSA, we applied it to (a) hydrogen bonding rearrangements of Met-enkephalin, (b) large-amplitude domain motions of Glutamine-Binding Protein, and (c) folding processes of the B domain of Staphylococcus aureus Protein A. All demonstrations numerically proved that the modified TBSA reproduced these biologically relevant rare events with nanosecond-order simulation times, although a set of microsecond-order, canonical MD simulations failed to reproduce the rare events, indicating the high efficiency of the modified TBSA.

  13. Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

    Energy Technology Data Exchange (ETDEWEB)

    Elsheikh, Ahmed H., E-mail: aelsheikh@ices.utexas.edu [Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin, TX (United States); Institute of Petroleum Engineering, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom); Wheeler, Mary F. [Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin, TX (United States); Hoteit, Ibrahim [Department of Earth Sciences and Engineering, King Abdullah University of Science and Technology (KAUST), Thuwal (Saudi Arabia)

    2014-02-01

    A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems.

  14. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm.

    Science.gov (United States)

    Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

    2016-01-01

    Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter.

  15. Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

    Directory of Open Access Journals (Sweden)

    Zhihua Zhang

    2016-01-01

    Full Text Available Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO. Rechenberg’s 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter.

  16. Algorithms for the inversion of lidar signals: Rayleigh-Mie measurements in the stratosphere

    Directory of Open Access Journals (Sweden)

    F. Masci

    1999-06-01

    Full Text Available We report the features and the performances of the algorithms, developed at the Lidar Station of L'Aquila, for retrieving atmospheric parameters and constituents from elastic lidar signals. The algorithm for ozone retrieving is discussed in detail and checked with model lidar signals to take into account the numerical distortion on the profile. The performances of the aerosol backscattering ratio algorithm that includes the transmission loss due to the aerosol extinction are evaluated. A new algorithm developed to retrieve atmospheric temperature profiles from elastic lidar returns in the altitude range 30-90 km is also examined in detail.

  17. Genetic inverse algorithm for retrieval of component temperature of mixed pixel by multi-angle thermal infrared remote sensing data

    Institute of Scientific and Technical Information of China (English)

    XU; Xiru; (徐希孺); CHEN; Liangfu; (陈良富); ZHUANG; Jiali; (庄家礼)

    2001-01-01

    After carefully studying the results of retrieval of land surface temperature(LST) by multi-channel thermal infrared remote sensing data, the authors of this paper point out that its accuracy and significance for applications are seriously damaged by the high correlation coefficient among multi-channel information and its disablement of direct retrieval of component temperature. Based on the model of directional radiation of non-isothermal mixed pixel, the authors point out that multi-angle thermal infrared remote sensing can offer the possibility to directly retrieve component temperature, but it is also a multi-parameter synchronous inverse problem. The results of digital simulation and field experiments show that the genetic inverse algorithm (GIA) is an effective method to fulfill multi-parameter synchronous retrieval. So it is possible to realize retrieval of component temperature with error less than 1K by multi-angle thermal infrared remote sensing data and GIA.

  18. All-Weather Sounding of Moisture and Temperature From Microwave Sensors Using a Coupled Surface/Atmosphere Inversion Algorithm

    Science.gov (United States)

    Boukabara, S. A.; Garrett, K.

    2014-12-01

    A one-dimensional variational retrieval system has been developed, capable of producing temperature and water vapor profiles in clear, cloudy and precipitating conditions. The algorithm, known as the Microwave Integrated Retrieval System (MiRS), is currently running operationally at the National Oceanic and Atmospheric Administration (NOAA) National Environmental Satellite Data and Information Service (NESDIS), and is applied to a variety of data from the AMSU-A/MHS sensors on board the NOAA-18, NOAA-19, and MetOp-A/B polar satellite platforms, as well as SSMI/S on board both DMSP F-16 and F18, and from the NPP ATMS sensor. MiRS inverts microwave brightness temperatures into atmospheric temperature and water vapor profiles, along with hydrometeors and surface parameters, simultaneously. This atmosphere/surface coupled inversion allows for more accurate retrievals in the lower tropospheric layers by accounting for the surface emissivity impact on the measurements. It also allows the inversion of the soundings in all-weather conditions thanks to the incorporation of the hydrometeors parameters in the inverted state vector as well as to the inclusion of the emissivity in the same state vector, which is accounted for dynamically for the highly variable surface conditions found under precipitating atmospheres. The inversion is constrained in precipitating conditions by the inclusion of covariances for hydrometeors, to take advantage of the natural correlations that exist between temperature and water vapor with liquid and ice cloud along with rain water. In this study, we present a full assessment of temperature and water vapor retrieval performances in all-weather conditions and over all surface types (ocean, sea-ice, land, and snow) using matchups with radiosonde as well as Numerical Weather Prediction and other satellite retrieval algorithms as references. An emphasis is placed on retrievals in cloudy and precipitating atmospheres, including extreme weather events

  19. Restart Operator Meta-heuristics for a Problem-Oriented Evolutionary Strategies Algorithm in Inverse Mathematical MISO Modelling Problem Solving

    Science.gov (United States)

    Ryzhikov, I. S.; Semenkin, E. S.

    2017-02-01

    This study is focused on solving an inverse mathematical modelling problem for dynamical systems based on observation data and control inputs. The mathematical model is being searched in the form of a linear differential equation, which determines the system with multiple inputs and a single output, and a vector of the initial point coordinates. The described problem is complex and multimodal and for this reason the proposed evolutionary-based optimization technique, which is oriented on a dynamical system identification problem, was applied. To improve its performance an algorithm restart operator was implemented.

  20. A reconstruction algorithm based on topological gradient for an inverse problem related to a semilinear elliptic boundary value problem

    Science.gov (United States)

    Beretta, Elena; Manzoni, Andrea; Ratti, Luca

    2017-03-01

    In this paper we develop a reconstruction algorithm for the solution of an inverse boundary value problem dealing with a semilinear elliptic partial differential equation of interest in cardiac electrophysiology. The goal is the detection of small inhomogeneities located inside a domain Ω , where the coefficients of the equation are altered, starting from observations of the solution of the equation on the boundary \\partial Ω . Exploiting theoretical results recently achieved in [13], we implement a reconstruction procedure based on the computation of the topological gradient of a suitable cost functional. Numerical results obtained for several test cases finally assess the feasibility and the accuracy of the proposed technique.

  1. (abstract) Using an Inversion Algorithm to Retrieve Parameters and Monitor Changes over Forested Areas from SAR Data

    Science.gov (United States)

    Moghaddam, Mahta

    1995-01-01

    In this work, the application of an inversion algorithm based on a nonlinear opimization technique to retrieve forest parameters from multifrequency polarimetric SAR data is discussed. The approach discussed here allows for retrieving and monitoring changes in forest parameters in a quantative and systematic fashion using SAR data. The parameters to be inverted directly from the data are the electromagnetic scattering properties of the forest components such as their dielectric constants and size characteristics. Once these are known, attributes such as canopy moisture content can be obtained, which are useful in the ecosystem models.

  2. Statistically optimized inversion algorithm for enhanced retrieval of aerosol properties from spectral multi-angle polarimetric satellite observations

    Science.gov (United States)

    Dubovik, O.; Herman, M.; Holdak, A.; Lapyonok, T.; Tanré, D.; Deuzé, J. L.; Ducos, F.; Sinyuk, A.; Lopatin, A.

    2011-05-01

    The proposed development is an attempt to enhance aerosol retrieval by emphasizing statistical optimization in inversion of advanced satellite observations. This optimization concept improves retrieval accuracy relying on the knowledge of measurement error distribution. Efficient application of such optimization requires pronounced data redundancy (excess of the measurements number over number of unknowns) that is not common in satellite observations. The POLDER imager on board the PARASOL micro-satellite registers spectral polarimetric characteristics of the reflected atmospheric radiation at up to 16 viewing directions over each observed pixel. The completeness of such observations is notably higher than for most currently operating passive satellite aerosol sensors. This provides an opportunity for profound utilization of statistical optimization principles in satellite data inversion. The proposed retrieval scheme is designed as statistically optimized multi-variable fitting of all available angular observations obtained by the POLDER sensor in the window spectral channels where absorption by gas is minimal. The total number of such observations by PARASOL always exceeds a hundred over each pixel and the statistical optimization concept promises to be efficient even if the algorithm retrieves several tens of aerosol parameters. Based on this idea, the proposed algorithm uses a large number of unknowns and is aimed at retrieval of extended set of parameters affecting measured radiation. The algorithm is designed to retrieve complete aerosol properties globally. Over land, the algorithm retrieves the parameters of underlying surface simultaneously with aerosol. In all situations, the approach is anticipated to achieve a robust retrieval of complete aerosol properties including information about aerosol particle sizes, shape, absorption and composition (refractive index). In order to achieve reliable retrieval from PARASOL observations even over very reflective

  3. Statistically optimized inversion algorithm for enhanced retrieval of aerosol properties from spectral multi-angle polarimetric satellite observations

    Directory of Open Access Journals (Sweden)

    O. Dubovik

    2011-05-01

    Full Text Available The proposed development is an attempt to enhance aerosol retrieval by emphasizing statistical optimization in inversion of advanced satellite observations. This optimization concept improves retrieval accuracy relying on the knowledge of measurement error distribution. Efficient application of such optimization requires pronounced data redundancy (excess of the measurements number over number of unknowns that is not common in satellite observations. The POLDER imager on board the PARASOL micro-satellite registers spectral polarimetric characteristics of the reflected atmospheric radiation at up to 16 viewing directions over each observed pixel. The completeness of such observations is notably higher than for most currently operating passive satellite aerosol sensors. This provides an opportunity for profound utilization of statistical optimization principles in satellite data inversion. The proposed retrieval scheme is designed as statistically optimized multi-variable fitting of all available angular observations obtained by the POLDER sensor in the window spectral channels where absorption by gas is minimal. The total number of such observations by PARASOL always exceeds a hundred over each pixel and the statistical optimization concept promises to be efficient even if the algorithm retrieves several tens of aerosol parameters. Based on this idea, the proposed algorithm uses a large number of unknowns and is aimed at retrieval of extended set of parameters affecting measured radiation.

    The algorithm is designed to retrieve complete aerosol properties globally. Over land, the algorithm retrieves the parameters of underlying surface simultaneously with aerosol. In all situations, the approach is anticipated to achieve a robust retrieval of complete aerosol properties including information about aerosol particle sizes, shape, absorption and composition (refractive index. In order to achieve reliable retrieval from PARASOL observations

  4. Statistically optimized inversion algorithm for enhanced retrieval of aerosol properties from spectral multi-angle polarimetric satellite observations

    Directory of Open Access Journals (Sweden)

    O. Dubovik

    2010-11-01

    Full Text Available The proposed development is an attempt to enhance aerosol retrieval by emphasizing statistical optimization in inversion of advanced satellite observations. This optimization concept improves retrieval accuracy relying on the knowledge of measurement error distribution. Efficient application of such optimization requires pronounced data redundancy (excess of the measurements number over number of unknowns that is not common in satellite observations. The POLDER imager on board of the PARASOL micro-satellite registers spectral polarimetric characteristics of the reflected atmospheric radiation at up to 16 viewing directions over each observed pixel. The completeness of such observations is notably higher than for most currently operating passive satellite aerosol sensors. This provides an opportunity for profound utilization of statistical optimization principles in satellite data inversion. The proposed retrieval scheme is designed as statistically optimized multi-variable fitting of the all available angular observations of total and polarized radiances obtained by POLDER sensor in the window spectral channels where absorption by gaseous is minimal. The total number of such observations by PARASOL always exceeds a hundred over each pixel and the statistical optimization concept promises to be efficient even if the algorithm retrieves several tens of aerosol parameters. Based on this idea, the proposed algorithm uses a large number of unknowns and is aimed on retrieval of extended set of parameters affecting measured radiation.

    The algorithm is designed to retrieve complete aerosol properties globally. Over land, the algorithm retrieves the parameters of underlying surface simultaneously with aerosol. In all situations, the approach is anticipated to achieve a robust retrieval of complete aerosol properties including information about aerosol particle sizes, shape, absorption and composition (refractive index. In order to achieve

  5. Some algorithmic issues in full-waveform inversion of teleseismic data for high-resolution lithospheric imaging

    Science.gov (United States)

    Monteiller, Vadim; Beller, Stephen; Nolet, Guust; Operto, Stephane; Brossier, Romain; Métivier, Ludovic; Paul, Anne; Virieux, Jean

    2014-05-01

    The current development of dense seismic arrays and high performance computing make feasible today application of full-waveform inversion (FWI) on teleseismic data for high-resolution lithospheric imaging. In teleseismic configuration, the source is to first-order a plane-wave that impinges the base of the lithospheric target located below the receiver array. In this setting, FWI aims to exploit not only the forward-scattered waves propagating up to the receiver but also second-order arrivals that are back-scattered from the free-surface and the reflectors before their recordings on the surface. FWI requires using full-wave methods modeling such as finite-difference or finite-element methods. In this framework, careful design of FWI algorithms is topical to mitigate as much as possible the computational burden of multi-source full-waveform modeling. In this presentation, we review some key specifications that might be considered for versatile FWI implementation. An abstraction level between the forward and inverse problems that allows for the interfacing of different modeling engines with the inversion. This requires the subsurface meshings that are used to perform seismic modeling and update the subsurface models during inversion to be fully independent through some back-and-forth projection processes. The subsurface parameterization should be carefully chosen during multi-parameter FWI as it controls the trade-off between parameters of different nature. A versatile FWI algorithm should be designed such that different subsurface parameterizations for the model update can be easily implemented. The gradient of the misfit function should be computed as easily as possible with the adjoint-state method in parallel environment. This first requires the gradient to be independent to the discretization method that is used to perform seismic modeling. Second, the incident and adjoint wavefields should be computed with the same numerical scheme, even if the forward problem

  6. Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

    KAUST Repository

    Elsheikh, Ahmed H.

    2014-02-01

    A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems. © 2013 Elsevier Inc.

  7. A sequential algorithm of inverse heat conduction problems using singular value decomposition

    Energy Technology Data Exchange (ETDEWEB)

    Gutierrez Cabeza, J.M. [Dep. of Applied Physics of Univ. of Cadiz, Escuela Politecnica Superior de Algeciras, Cadiz (Spain); Garcia, Juan Andres Martin [Department of Electrical Engineering of University of Cadiz, Escuela Politecnica Superior de Algeciras, Avda. Ramon Puyol, s/n, 11202 Algeciras (Cadiz) (Spain); Rodriguez, Alfonso Corz [Department of Industrial and Civil Engineering of University of Cadiz, Escuela Politecnica Superior de Algeciras, Avda. Ramon Puyol, s/n, 11202 Algeciras (Cadiz) (Spain)

    2005-03-01

    This paper examines numerically and theoretically the application of truncated Singular Value Decomposition (SVD) in a sequential form. The Sequential SVD algorithm presents two tunable hyper-parameters: the number of future temperature (r) and the rank of the truncated sensitivity matrix (p). The regularization effect of both hyper-parameters is consistent with the data filtering interpretation by truncated SVD (reported by Shenefelt [Internat. J. Heat Mass Transfer 45 (2002) 67]). This study reveals that the most suitable reduced rank is ''one''. Under this assumption (p=1), the sequential procedure proposed, presents several advantages with respect to the standard whole-domain procedure: The search of the optimum rank value is not required. The simplification of the model is the maximum that can be achieved. The unique tunable hyper-parameter is the number of future temperatures, and a very simple algorithm is obtained. This algorithm has been compared to: Function Specification Method (FSM) proposed by Beck and the standard whole-domain SVD. In this comparative study, the parameters considered have been: the shape of the input, the noise level of measurement and the size of time step. In all cases, the FSM and sequential SVD algorithm give very similar results. In one case, the results obtained by the sequential SVD algorithm are clearly superior to the ones obtained by the whole-domain algorithm. (authors)

  8. Adaptive Measurement Partitioning Algorithm for a Gaussian Inverse Wishart PHD Filter that Tracks Closely Spaced Extended Targets

    Directory of Open Access Journals (Sweden)

    P. Li

    2017-06-01

    Full Text Available Use of the Gaussian inverse Wishart probability hypothesis density (GIW-PHD filter has demonstrated promise as an approach to track an unknown number of extended targets. However, when targets of various sizes are spaced closely together and performing maneuvers, estimation errors will occur because measurement partitioning algorithms fail to provide the correct partitions. Specifically, the sub-partitioning algorithm fails to handle cases in which targets are of different sizes, while other partitioning approaches are sensitive to target maneuvers. This paper presents an improved partitioning algorithm for a GIW-PHD filter in order to solve the above problems. The sub-partitioning algorithm is improved by considering target extension information and by employing Mahalanobis distances to distinguish among measurement cells of different sizes. Thus, the improved approach is not sensitive to either differences in target sizes or target maneuvering. Simulation results show that the use of the proposed partitioning approach can improve the tracking performance of a GIW-PHD filter when target are spaced closely together.

  9. 3D imaging of soil apparent electrical conductivity from VERIS data using a 1D spatially constrained inversion algorithm

    Science.gov (United States)

    Jesús Moral García, Francisco; Rebollo Castillo, Francisco Javier; Monteiro Santos, Fernando

    2016-04-01

    Maps of apparent electrical conductivity of the soil are commonly used in precision agriculture to indirectly characterize some important properties like salinity, water, and clay content. Traditionally, these studies are made through an empirical relationship between apparent electrical conductivity and properties measured in soil samples collected at a few locations in the experimental area and at a few selected depths. Recently, some authors have used not the apparent conductivity values but the soil bulk conductivity (in 2D or 3D) calculated from measured apparent electrical conductivity through the application of an inversion method. All the published works used data collected with electromagnetic (EM) instruments. We present a new software to invert the apparent electrical conductivity data collected with VERIS 3100 and 3150 (or the more recent version with three pairs of electrodes) using the 1D spatially constrained inversion method (1D SCI). The software allows the calculation of the distribution of the bulk electrical conductivity in the survey area till a depth of 1 m. The algorithm is applied to experimental data and correlations with clay and water content have been established using soil samples collected at some boreholes. Keywords: Digital soil mapping; inversion modelling; VERIS; soil apparent electrical conductivity.

  10. A Comparative Study of Genetic Algorithm Parameters for the Inverse Problem-based Fault Diagnosis of Liquid Rocket Propulsion Systems

    Institute of Scientific and Technical Information of China (English)

    Erfu Yang; Hongjun Xiang; Dongbing Gu; Zhenpeng Zhang

    2007-01-01

    Fault diagnosis of liquid rocket propulsion systems (LRPSs) is a very important issue in space launch activities particularly when manned space missions are accompanied, since the safety and reliability can be significantly enhanced by exploiting an efficient fault diagnosis system. Currently, inverse problem-based diagnosis has attracted a great deal of research attention in fault diagnosis domain. This methodology provides a new strategy to model-based fault diagnosis for monitoring the health of propulsion systems. To solve the inverse problems arising from the fault diagnosis of LRPSs, GAs have been adopted in recent years as the first and effective choice of available numerical optimization tools. However, the GA has many control parameters to be chosen in advance and there still lack sound theoretical tools to analyze the effects of these parameters on diagnostic performance analytically. In this paper a comparative study of the influence of GA parameters on diagnostic results is conducted by performing a series of numerical experiments. The objective of this study is to investigate the contribution of individual algorithm parameter to final diagnostic result and provide reasonable estimates for choosing GA parameters in the inverse problem-based fault diagnosis of LRPSs. Some constructive remarks are made in conclusion and will be helpful for the implementation of GA to the fault diagnosis practice of LRPSs in the future.

  11. A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

    Energy Technology Data Exchange (ETDEWEB)

    Bakhos, Tania, E-mail: taniab@stanford.edu [Institute for Computational and Mathematical Engineering, Stanford University (United States); Saibaba, Arvind K. [Department of Electrical and Computer Engineering, Tufts University (United States); Kitanidis, Peter K. [Institute for Computational and Mathematical Engineering, Stanford University (United States); Department of Civil and Environmental Engineering, Stanford University (United States)

    2015-10-15

    We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

  12. 3D non-linear inversion of magnetic anomalies caused by prismatic bodies using differential evolution algorithm

    Science.gov (United States)

    Balkaya, Çağlayan; Ekinci, Yunus Levent; Göktürkler, Gökhan; Turan, Seçil

    2017-01-01

    3D non-linear inversion of total field magnetic anomalies caused by vertical-sided prismatic bodies has been achieved by differential evolution (DE), which is one of the population-based evolutionary algorithms. We have demonstrated the efficiency of the algorithm on both synthetic and field magnetic anomalies by estimating horizontal distances from the origin in both north and east directions, depths to the top and bottom of the bodies, inclination and declination angles of the magnetization, and intensity of magnetization of the causative bodies. In the synthetic anomaly case, we have considered both noise-free and noisy data sets due to two vertical-sided prismatic bodies in a non-magnetic medium. For the field case, airborne magnetic anomalies originated from intrusive granitoids at the eastern part of the Biga Peninsula (NW Turkey) which is composed of various kinds of sedimentary, metamorphic and igneous rocks, have been inverted and interpreted. Since the granitoids are the outcropped rocks in the field, the estimations for the top depths of two prisms representing the magnetic bodies were excluded during inversion studies. Estimated bottom depths are in good agreement with the ones obtained by a different approach based on 3D modelling of pseudogravity anomalies. Accuracy of the estimated parameters from both cases has been also investigated via probability density functions. Based on the tests in the present study, it can be concluded that DE is a useful tool for the parameter estimation of source bodies using magnetic anomalies.

  13. MODIFIED NEWTON'S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

    Institute of Scientific and Technical Information of China (English)

    Jian-feng Cai; Michael K.Ng; Yi-min Wei

    2006-01-01

    Newton's iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration,the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix,the matrix-vector multiplication involved in Newton's iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.

  14. A general nonlinear inverse transport algorithm using forward and adjoint flux computations

    Energy Technology Data Exchange (ETDEWEB)

    Norton, S.J. [Oak Ridge National Lab., TN (United States)

    1997-04-01

    Iterative approaches to the nonlinear inverse transport problem are described, which give rise to the structure that best predicts a set of transport observations. Such methods are based on minimizing a global error functional measuring the discrepancy between predicted and observed transport data. Required for this minimization is the functional gradient (Frechet derivative) of the global error evaluated with respect to a set of unknown material parameters (specifying boundary locations, scattering cross sections, etc.) which are to be determined. It is shown how this functional gradient is obtained from numerical solutions to the forward and adjoint transport problems computed once per iteration. This approach is not only far more efficient, but also more accurate, than a finite-difference method for computing the gradient of the global error. The general technique can be applied to inverse-transport problems of all descriptions, provided only that solutions to the forward and adjoint problems can be found numerically. As an illustration, two inverse problems are treated: the reconstruction of an anisotropic scattering function in a one-dimensional homogeneous slab and the two-dimensional imaging of a spatially-varying scattering cross section.

  15. Investigation of the Solution Space of Marine Controlled-Source Electromagnetic Inversion Problems By Using a Genetic Algorithm

    Science.gov (United States)

    Hunziker, J.; Thorbecke, J.; Slob, E. C.

    2014-12-01

    Commonly, electromagnetic measurements for exploring and monitoring hydrocarbon reservoirs are inverted for the subsurface conductivity distribution by minimizing the difference between the actual data and a forward modeled dataset. The convergence of the inversion process to the correct solution strongly depends on the shape of the solution space. Since this is a non-linear problem, there exist a multitude of minima of which only the global one provides the correct conductivity values. To easily find the global minimum we desire it to have a broad cone of attraction, while it should also feature a very narrow bottom in order to obtain the subsurface conductivity with high resolution. In this study, we aim to determine which combination of input data corresponds to a favorable shape of the solution space. Since the solution space is N-dimensional, with N being the number of unknown subsurface parameters, plotting it is out of the question. In our approach, we use a genetic algorithm (Goldberg, 1989) to probe the solution space. Such algorithms have the advantage that every run of the same problem will end up at a different solution. Most of these solutions are expected to lie close to the global minimum. A situation where only few runs end up in the global minimum indicates that the solution space consists of a lot of local minima or that the cone of attraction of the global minimum is small. If a lot of runs end up with a similar data-misfit but with a large spread of the subsurface medium parameters in one or more direction, it can be concluded that the chosen data-input is not sensitive with respect to that direction. Compared to the study of Hunziker et al. 2014, we allow also to invert for subsurface boundaries and include more combinations of input datasets. The results so far suggest that it is essential to include the magnetic field in the inversion process in order to find the anisotropic conductivity values. ReferencesGoldberg, D. E., 1989. Genetic

  16. Monitoring carbon dioxide from space: Retrieval algorithm and flux inversion based on GOSAT data and using CarbonTracker-China

    Science.gov (United States)

    Yang, Dongxu; Zhang, Huifang; Liu, Yi; Chen, Baozhang; Cai, Zhaonan; Lü, Daren

    2017-08-01

    Monitoring atmospheric carbon dioxide (CO2) from space-borne state-of-the-art hyperspectral instruments can provide a high precision global dataset to improve carbon flux estimation and reduce the uncertainty of climate projection. Here, we introduce a carbon flux inversion system for estimating carbon flux with satellite measurements under the support of "The Strategic Priority Research Program of the Chinese Academy of Sciences—Climate Change: Carbon Budget and Relevant Issues". The carbon flux inversion system is composed of two separate parts: the Institute of Atmospheric Physics Carbon Dioxide Retrieval Algorithm for Satellite Remote Sensing (IAPCAS), and CarbonTracker-China (CT-China), developed at the Chinese Academy of Sciences. The Greenhouse gases Observing SATellite (GOSAT) measurements are used in the carbon flux inversion experiment. To improve the quality of the IAPCAS-GOSAT retrieval, we have developed a post-screening and bias correction method, resulting in 25%-30% of the data remaining after quality control. Based on these data, the seasonal variation of XCO2 (column-averaged CO2 dry-air mole fraction) is studied, and a strong relation with vegetation cover and population is identified. Then, the IAPCAS-GOSAT XCO2 product is used in carbon flux estimation by CT-China. The net ecosystem CO2 exchange is -0.34 Pg C yr-1 (±0.08 Pg C yr-1), with a large error reduction of 84%, which is a significant improvement on the error reduction when compared with in situ-only inversion.

  17. Inverse regression-based uncertainty quantification algorithms for high-dimensional models: Theory and practice

    Energy Technology Data Exchange (ETDEWEB)

    Li, Weixuan; Lin, Guang; Li, Bing

    2016-09-01

    A well-known challenge in uncertainty quantification (UQ) is the "curse of dimensionality". However, many high-dimensional UQ problems are essentially low-dimensional, because the randomness of the quantity of interest (QoI) is caused only by uncertain parameters varying within a low-dimensional subspace, known as the sufficient dimension reduction (SDR) subspace. Motivated by this observation, we propose and demonstrate in this paper an inverse regression-based UQ approach (IRUQ) for high-dimensional problems. Specifically, we use an inverse regression procedure to estimate the SDR subspace and then convert the original problem to a low-dimensional one, which can be efficiently solved by building a response surface model such as a polynomial chaos expansion. The novelty and advantages of the proposed approach is seen in its computational efficiency and practicality. Comparing with Monte Carlo, the traditionally preferred approach for high-dimensional UQ, IRUQ with a comparable cost generally gives much more accurate solutions even for high-dimensional problems, and even when the dimension reduction is not exactly sufficient. Theoretically, IRUQ is proved to converge twice as fast as the approach it uses seeking the SDR subspace. For example, while a sliced inverse regression method converges to the SDR subspace at the rate of $O(n^{-1/2})$, the corresponding IRUQ converges at $O(n^{-1})$. IRUQ also provides several desired conveniences in practice. It is non-intrusive, requiring only a simulator to generate realizations of the QoI, and there is no need to compute the high-dimensional gradient of the QoI. Finally, error bars can be derived for the estimation results reported by IRUQ.

  18. GOAL: an inverse toxicity-related algorithm for daily clinical practice decision making in advanced kidney cancer.

    Science.gov (United States)

    Bracarda, Sergio; Sisani, Michele; Marrocolo, Francesca; Hamzaj, Alketa; del Buono, Sabrina; De Simone, Valeria

    2014-03-01

    Metastatic renal cell carcinoma (mRCC), considered almost an orphan disease only six years ago, appears today a very dynamic pathology. The recently switch to the actual overcrowded scenario defined by seven active drugs has driven physicians to an incertitude status, due to difficulties in defining the best possible treatment strategy. This situation is mainly related to the absence of predictive biomarkers for any available or new therapy. Such issue, associated with the nearly absence of published face-to-face studies, draws a complex picture frame. In order to solve this dilemma, decisional algorithms tailored on drug efficacy data and patient profile are recognized as very useful tools. These approaches try to select the best therapy suitable for every patient profile. On the contrary, the present review has the "goal" to suggest a reverse approach: basing on the pivotal studies, post-marketing surveillance reports and our experience, we defined the polarizing toxicity (the most frequent toxicity in the light of clinical experience) for every single therapy, creating a new algorithm able to identify the patient profile, mainly comorbidities, unquestionably unsuitable for each single agent presently available for either the first- or the second-line therapy. The GOAL inverse decision-making algorithm, proposed at the end of this review, allows to select the best therapy for mRCC by reducing the risk of limiting toxicities.

  19. Inversion of dispersion coefficient in water quality model using optimal perturbation algorithm

    Institute of Scientific and Technical Information of China (English)

    Hong-tao NIE; Jian-hua TAO

    2009-01-01

    As a primary parameter in the water quality model for shallow bays,the dispersion coefficient is traditionally determined with a trial-and-error method,which is time-consuming and requires much experience.In this paper,based on the measured data of chemical oxygen demand(COD),the dispersion coefficient is calculated using an inversion method.In the process,the regularization method is applied to treat the ill-posedness.and an operator identity perturbation method is used to obtain the solution.Using the model with an inverted dispersion coefficient,the distributions of COD,inorganic nitrogen(IN),and inorganic phosphorus(IP)in Bohai Bay are predicted and compared with the measured data.The results indicate that the method is feasible and the inverted dispersion coefficient can be used to predict other pollutant distribution.This method may also be further extended to the inversion of other parameters in the water quality model.

  20. Performance Evaluation of Glottal Inverse Filtering Algorithms Using a Physiologically Based Articulatory Speech Synthesizer

    Science.gov (United States)

    2017-01-05

    in terms of DC gain and minimum phase. They carried out performance evaluation with the vowel /a/ synthesized by a physical model of voice production ...synthesizer provides a realistic simulation of the voice production process, and thus an adequate test bed for revealing the temporal and spectral performance...characteristics of each algorithm. Included in the synthetic data are continuous running speech utterances and sustained vowels , which are produced

  1. Fractional-Order Controller Design for Oscillatory Fractional Time-Delay Systems Based on the Numerical Inverse Laplace Transform Algorithms

    Directory of Open Access Journals (Sweden)

    Lu Liu

    2015-01-01

    Full Text Available Fractional-order time-delay system is thought to be a kind of oscillatory complex system which could not be controlled efficaciously so far because it does not have an analytical solution when using inverse Laplace transform. In this paper, a type of fractional-order controller based on numerical inverse Laplace transform algorithm INVLAP was proposed for the mentioned systems by searching for the optimal controller parameters with the objective function of ITAE index due to the verified nature that fractional-order controllers were the best means of controlling fractional-order systems. Simulations of step unit tracking and load-disturbance responses of the proposed fractional-order optimal PIλDμ controller (FOPID and corresponding conventional optimal PID (OPID controller have been done on three typical kinds of fractional time-delay system with different ratio between time delay (L and time constant (T and a complex high-order fractional time delay system to verify the availability of the presented control method.

  2. An efficient algorithm for the inverse problem in elasticity imaging by means of variational r-adaption

    Science.gov (United States)

    Arnold, Alexander; Bruhns, Otto T.; Mosler, Jörn

    2011-07-01

    A novel finite element formulation suitable for computing efficiently the stiffness distribution in soft biological tissue is presented in this paper. For that purpose, the inverse problem of finite strain hyperelasticity is considered and solved iteratively. In line with Arnold et al (2010 Phys. Med. Biol. 55 2035), the computing time is effectively reduced by using adaptive finite element methods. In sharp contrast to previous approaches, the novel mesh adaption relies on an r-adaption (re-allocation of the nodes within the finite element triangulation). This method allows the detection of material interfaces between healthy and diseased tissue in a very effective manner. The evolution of the nodal positions is canonically driven by the same minimization principle characterizing the inverse problem of hyperelasticity. Consequently, the proposed mesh adaption is variationally consistent. Furthermore, it guarantees that the quality of the numerical solution is improved. Since the proposed r-adaption requires only a relatively coarse triangulation for detecting material interfaces, the underlying finite element spaces are usually not rich enough for predicting the deformation field sufficiently accurately (the forward problem). For this reason, the novel variational r-refinement is combined with the variational h-adaption (Arnold et al 2010) to obtain a variational hr-refinement algorithm. The resulting approach captures material interfaces well (by using r-adaption) and predicts a deformation field in good agreement with that observed experimentally (by using h-adaption).

  3. Inversion Algorithms and PS Detection in SAR Tomography, Case Study of Bucharest City

    Directory of Open Access Journals (Sweden)

    C. Dănişor

    2016-06-01

    Full Text Available Synthetic Aperture Radar (SAR tomography can reconstruct the elevation profile of each pixel based on a set of co-registered complex images of a scene. Its main advantage over classical interferometric methods consists in the capability to improve the detection of single persistent scatterers as well as to enable the detection of multiple scatterers interfering within the same pixel. In this paper, three tomographic algorithms are compared and applied to a dataset of 32 images to generate the elevation map of dominant scatterers from a scene. Targets which present stable proprieties over time - Persistent Scatterers (PS are then detected based on reflectivity functions reconstructed with Capon filtering.

  4. Discriminating phytoplankton functional types (PFTs) in the coastal ocean using the inversion algorithm PHYDOTax and airborne imaging spectrometer data

    Science.gov (United States)

    Palacios, S. L.; Schafer, C. B.; Broughton, J.; Guild, L. S.; Kudela, R. M.

    2013-12-01

    There is a need in the Biological Oceanography community to discriminate among phytoplankton groups within the bulk chlorophyll pool to understand energy flow through ecosystems, to track the fate of carbon in the ocean, and to detect and monitor-for harmful algal blooms (HABs). The ocean color community has responded to this demand with the development of phytoplankton functional type (PFT) discrimination algorithms. These PFT algorithms fall into one of three categories depending on the science application: size-based, biogeochemical function, and taxonomy. The new PFT algorithm Phytoplankton Detection with Optics (PHYDOTax) is an inversion algorithm that discriminates taxon-specific biomass to differentiate among six taxa found in the California Current System: diatoms, dinoflagellates, haptophytes, chlorophytes, cryptophytes, and cyanophytes. PHYDOTax was developed and validated in Monterey Bay, CA for the high resolution imaging spectrometer, Spectroscopic Aerial Mapping System with On-board Navigation (SAMSON - 3.5 nm resolution). PHYDOTax exploits the high spectral resolution of an imaging spectrometer and the improved spatial resolution that airborne data provides for coastal areas. The objective of this study was to apply PHYDOTax to a relatively lower resolution imaging spectrometer to test the algorithm's sensitivity to atmospheric correction, to evaluate capability with other sensors, and to determine if down-sampling spectral resolution would degrade its ability to discriminate among phytoplankton taxa. This study is a part of the larger Hyperspectral Infrared Imager (HyspIRI) airborne simulation campaign which is collecting Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) imagery aboard NASA's ER-2 aircraft during three seasons in each of two years over terrestrial and marine targets in California. Our aquatic component seeks to develop and test algorithms to retrieve water quality properties (e.g. HABs and river plumes) in both marine and in

  5. Discriminating Phytoplankton Functional Types (PFTs) in the Coastal Ocean Using the Inversion Algorithm Phydotax and Airborne Imaging Spectrometer Data

    Science.gov (United States)

    Palacios, Sherry L.; Schafer, Chris; Broughton, Jennifer; Guild, Liane S.; Kudela, Raphael M.

    2013-01-01

    There is a need in the Biological Oceanography community to discriminate among phytoplankton groups within the bulk chlorophyll pool to understand energy flow through ecosystems, to track the fate of carbon in the ocean, and to detect and monitor-for harmful algal blooms (HABs). The ocean color community has responded to this demand with the development of phytoplankton functional type (PFT) discrimination algorithms. These PFT algorithms fall into one of three categories depending on the science application: size-based, biogeochemical function, and taxonomy. The new PFT algorithm Phytoplankton Detection with Optics (PHYDOTax) is an inversion algorithm that discriminates taxon-specific biomass to differentiate among six taxa found in the California Current System: diatoms, dinoflagellates, haptophytes, chlorophytes, cryptophytes, and cyanophytes. PHYDOTax was developed and validated in Monterey Bay, CA for the high resolution imaging spectrometer, Spectroscopic Aerial Mapping System with On-board Navigation (SAMSON - 3.5 nm resolution). PHYDOTax exploits the high spectral resolution of an imaging spectrometer and the improved spatial resolution that airborne data provides for coastal areas. The objective of this study was to apply PHYDOTax to a relatively lower resolution imaging spectrometer to test the algorithm's sensitivity to atmospheric correction, to evaluate capability with other sensors, and to determine if down-sampling spectral resolution would degrade its ability to discriminate among phytoplankton taxa. This study is a part of the larger Hyperspectral Infrared Imager (HyspIRI) airborne simulation campaign which is collecting Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) imagery aboard NASA's ER-2 aircraft during three seasons in each of two years over terrestrial and marine targets in California. Our aquatic component seeks to develop and test algorithms to retrieve water quality properties (e.g. HABs and river plumes) in both marine and in

  6. Trajectory Evaluation of Rotor-Flying Robots Using Accurate Inverse Computation Based on Algorithm Differentiation

    Directory of Open Access Journals (Sweden)

    Yuqing He

    2014-01-01

    Full Text Available Autonomous maneuvering flight control of rotor-flying robots (RFR is a challenging problem due to the highly complicated structure of its model and significant uncertainties regarding many aspects of the field. As a consequence, it is difficult in many cases to decide whether or not a flight maneuver trajectory is feasible. It is necessary to conduct an analysis of the flight maneuvering ability of an RFR prior to test flight. Our aim in this paper is to use a numerical method called algorithm differentiation (AD to solve this problem. The basic idea is to compute the internal state (i.e., attitude angles and angular rates and input profiles based on predetermined maneuvering trajectory information denoted by the outputs (i.e., positions and yaw angle and their higher-order derivatives. For this purpose, we first present a model of the RFR system and show that it is flat. We then cast the procedure for obtaining the required state/input based on the desired outputs as a static optimization problem, which is solved using AD and a derivative based optimization algorithm. Finally, we test our proposed method using a flight maneuver trajectory to verify its performance.

  7. A multifrequency MUSIC algorithm for locating small inhomogeneities in inverse scattering

    Science.gov (United States)

    Griesmaier, Roland; Schmiedecke, Christian

    2017-03-01

    We consider an inverse scattering problem for time-harmonic acoustic or electromagnetic waves with sparse multifrequency far field data-sets. The goal is to localize several small penetrable objects embedded inside an otherwise homogeneous background medium from observations of far fields of scattered waves corresponding to incident plane waves with one fixed incident direction but several different frequencies. We assume that the far field is measured at a few observation directions only. Taking advantage of the smallness of the scatterers with respect to wavelength we utilize an asymptotic representation formula for the far field to design and analyze a MUSIC-type reconstruction method for this setup. We establish lower bounds on the number of frequencies and receiver directions that are required to recover the number and the positions of an ensemble of scatterers from the given measurements. Furthermore we briefly sketch a possible application of the reconstruction method to the practically relevant case of multifrequency backscattering data. Numerical examples are presented to document the potentials and limitations of this approach.

  8. The inversion of anelastic coefficient, source parameters and site respond using genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    刘杰; 郑斯华; 黄玉龙

    2003-01-01

    It gradually becomes a common work using large seismic wave data to obtain source parameters, such as seismic moment, break radius, stress drop, with completingof digital seismic network in China (Hough, et al, 1999; Bindi, et al, 2001). These parameters are useful on earthquake prediction and seismic hazard analysis.Although the computation methods of source parameters are simple in principle and the many research works have been done, it is not easy to obtain the parameters accurately. There are two factors affecting the stability of computation results. The first one is the effect of spread path and site respond on signal. According to the research results, there are different geometrical spreading coefficients on different epicenter distance. The better method is to introduce trilinear geometrical spreading model (Atkinson, Mereu, 1992; Atkinson, Boore, 1995; WONG, et al, 2002). In addition, traditional site respond is estimated by comparing with rock station, such as linear inversion method (Andrews, 1982), but the comparative estimation will introduce some errors when selecting different stations. Some recent research results show that site respond is not flat for rock station (Moya, et al, 2000; ZHANG,. et al, 2001; JIN, et al, 2000; Dutta, et al, 2001). The second factor is to obtain low-frequency level and corner frequency fromdisplacement spectrum. Because the source spectrum model is nonlinear function,these values are obtained by eye. The subjectivity is strong. The small change of corner frequency will affect significantly the result of stress drop.

  9. A Modified Three-Stage Inversion Algorithm Based on R-RVoG Model for Pol-InSAR Data

    Directory of Open Access Journals (Sweden)

    Qi Zhang

    2016-10-01

    Full Text Available In this paper, a modified two-layer scattering model is applied to a three-stage algorithm for high-precision retrieval of forest parameters from Polarimetric Synthetic Aperture Radar Interferometry (Pol-InSAR data. Traditional Random-Volume-over-Ground (RVoG model considers forest target as a two-layer combination of flat ground and volumetric canopy. However, when it comes to sloped terrain, the inversion accuracy of three-stage process deteriorates with the ascending estimation error in volume correlation which is mainly caused by the existence of underlying terrain slope. Aiming at this problem, a Range-sloped RVoG (R-RVoG model is presented in this paper. By modifying the ground layer as a range-sloped plane, the complex correlation of R-RVoG model can be amended as a function of ground phase, ground-to-volume scattering ratio, forest height, mean extinction and range slope. The introduction of range slope variable makes this modified model better resemble to real scene and thus improves the performance of three-stage algorithm. Both of the simulated data with different terrain slopes and the Space-borne Imaging Radar-C (SIR-C real data in Tianshan test area are processed to verify the validity of this modification.

  10. SelInv - An Algorithm for Selected Inversion of a Sparse Symmetric Matrix

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Lin; Yang, Chao; Meza, Juan C.; Lu, Jianfeng; Ying, Lexing; E, Weinan

    2009-10-16

    We describe an efficient implementation of an algorithm for computing selected elements of a general sparse symmetric matrix A that can be decomposed as A = LDL^T, where L is lower triangular and D is diagonal. Our implementation, which is called SelInv, is built on top of an efficient supernodal left-looking LDL^T factorization of A. We discuss how computational efficiency can be gained by making use of a relative index array to handle indirect addressing. We report the performance of SelInv on a collection of sparse matrices of various sizes and nonzero structures. We also demonstrate how SelInv can be used in electronic structure calculations.

  11. The pre-launch status of TanSat Mission: Instrument, Retrieval algorithm, Flux inversion and Validation

    Science.gov (United States)

    Liu, Yi; Yin, Zengshan; Yang, Zhongdong; Zheng, Yuquan; Yan, Changxiang; Tian, Xiangjun; Yang, Dongxu

    2016-04-01

    After 5 years development, The Chinese carbon dioxide observation satellite (TanSat), the first scientific experimental CO2 satellite of China, step into the pre-launch phase. The characters of pre-launch carbon dioxide spectrometer have been optimized during the laboratory test and calibration. Radiometric calibration shows a SNR of 440 (O2A 0.76um band), 300 (CO2 1.61um band) and 180 (CO2 2.06um band) on average in the typical radiance condition. Instrument line shape was calibrated automatically in using a well design testing system with laser control and record. After a series of test and calibration in laboratory, the instrumental performances meet the design requirements. TanSat will be launched on August 2016. The optimal estimation theory was involved in TanSat XCO2 retrieval algorithm in a full physics way with simulation of the radiance transfer in atmosphere. Gas absorption, aerosol and cirrus scattering and surface reflectance associate with wavelength dispersion have been considered in inversion for better correction the interference errors to XCO2. In order to simulate the radiance transfer precisely and efficiently, we develop a fast vector radiative transfer simulation method. Application of TanSat algorithm on GOSAT observation (ATANGO) is appropriate to evaluate the performance of algorithm. Validated with TCCON measurements, the ATANGO product achieves a 1.5 ppm precision. A Chinese carbon cycle data- assimilation system Tan-Tracker is developed based on the atmospheric chemical transport model GEOS-Chem. Tan-Tracker is a dual-pass data-assimilation system in which both CO2 concentrations and CO2 fluxes are simultaneously assimilated from atmospheric observations. A validation network has been established around China to support a series of CO2 satellite of China, which include 3 IFS-125HR and 4 Optical Spectrum Analyzer etc.

  12. Inversion model validation of ground emissivity. Contribution to the development of SMOS algorithm

    CERN Document Server

    Demontoux, François; Ruffié, Gilles; Wigneron, Jean Pierre; Grant, Jennifer; Hernandez, Daniel Medina

    2007-01-01

    SMOS (Soil Moisture and Ocean Salinity), is the second mission of 'Earth Explorer' to be developed within the program 'Living Planet' of the European Space Agency (ESA). This satellite, containing the very first 1.4GHz interferometric radiometer 2D, will carry out the first cartography on a planetary scale of the moisture of the grounds and the salinity of the oceans. The forests are relatively opaque, and the knowledge of moisture remains problematic. The effect of the vegetation can be corrected thanks a simple radiative model. Nevertheless simulations show that the effect of the litter on the emissivity of a system litter + ground is not negligible. Our objective is to highlight the effects of this layer on the total multi layer system. This will make it possible to lead to a simple analytical formulation of a model of litter which can be integrated into the calculation algorithm of SMOS. Radiometer measurements, coupled to dielectric characterizations of samples in laboratory can enable us to characterize...

  13. EPSILON-ALGORITHM AND ETA-ALGORITHM OF GENERALIZED INVERSE FUNCTION-VALUED PADE APPROXIMANTS USING FOR SOLUTION OF INTEGRAL EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    李春景; 顾传青

    2003-01-01

    Two efficient recursive algorithms epsilon- algorithm and eta-algorithm are approximants were used to accelerate the convergence of the power series with functionvalued coefficients and to estimate characteristic value of the integral equations. Famous two algorithms.

  14. A method for inversion of layered shear wavespeed azimuthal anisotropy from Rayleigh wave dispersion using the Neighborhood Algorithm

    Institute of Scientific and Technical Information of China (English)

    Huajian Yao

    2015-01-01

    Seismic anisotropy provides important constraints on deformation patterns of Earth's material.Rayleigh wave dispersion data with azimuthal anisotropy can be used to invert for depth-dependent shear wavespeed azimuthal anisotropy,therefore reflecting depth-varying deformation patterns in the crust and upper mantle.In this study,we propose a two-step method that uses the Neighborhood Algorithm (NA) for the point-wise inversion of depth-dependent shear wavespeeds and azimuthal anisotropy from Rayleigh wave azimuthally anisotropic dispersion data.The first step employs the NA to estimate depthdependent Vsv (or the elastic parameter L) as well as their uncertainties from the isotropic part Rayleigh wave dispersion data.In the second step,we first adopt a difference scheme to compute approximate Rayleigh-wave phase velocity sensitivity kernels to azimuthally anisotropic parameters with respect to the velocity model obtained in the first step.Then we perform the NA to estimate the azi.muthally anisotropic parameters Gc/L and Gs/L at depths separately from the corresponding cosine and sine terms of the azimuthally anisotropic dispersion data.Finally,we compute the depth-dependent magnitude and fast polarization azimuth of shear wavespeed azimuthal anisotropy.The use of the global search NA and Bayesian analysis allows for more reliable estimates of depth-dependent shear wavespeeds and azimuthal anisotropy as well as their uncertainties.We illustrate the inversion method using the azimuthally anisotropic dispersion data in SE Tibet,where we find apparent changes of fast axes of shear wavespeed azimuthal anisotropy between the crust and uppermost mantle.

  15. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.

    Science.gov (United States)

    Semenov, Alexander; Zaikin, Oleg

    2016-01-01

    In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning. With each partitioning we associate a point in the special finite search space. The estimation of effectiveness of the particular partitioning is the value of predictive function in the corresponding point of this space. The problem of search for an effective partitioning can be formulated as a problem of optimization of the predictive function. We use metaheuristic algorithms (simulated annealing and tabu search) to move from point to point in the search space. In our computational experiments we found partitionings for SAT instances encoding problems of inversion of some cryptographic functions. Several of these SAT instances with realistic predicted solving time were successfully solved on a computing cluster and in the volunteer computing project SAT@home. The solving time agrees well with estimations obtained by the proposed method.

  16. Hemodynamic Assessment of Compliance of Pre-Stressed Pulmonary Valve-Vasculature in Patient Specific Geometry Using an Inverse Algorithm

    Science.gov (United States)

    Hebbar, Ullhas; Paul, Anup; Banerjee, Rupak

    2016-11-01

    Image based modeling is finding increasing relevance in assisting diagnosis of Pulmonary Valve-Vasculature Dysfunction (PVD) in congenital heart disease patients. This research presents compliant artery - blood interaction in a patient specific Pulmonary Artery (PA) model. This is an improvement over our previous numerical studies which assumed rigid walled arteries. The impedance of the arteries and the energy transfer from the Right Ventricle (RV) to PA is governed by compliance, which in turn is influenced by the level of pre-stress in the arteries. In order to evaluate the pre-stress, an inverse algorithm was developed using an in-house script written in MATLAB and Python, and implemented using the Finite Element Method (FEM). This analysis used a patient specific material model developed by our group, in conjunction with measured pressure (invasive) and velocity (non-invasive) values. The analysis was performed on an FEM solver, and preliminary results indicated that the Main PA (MPA) exhibited higher compliance as well as increased hysteresis over the cardiac cycle when compared with the Left PA (LPA). The computed compliance values for the MPA and LPA were 14% and 34% lesser than the corresponding measured values. Further, the computed pressure drop and flow waveforms were in close agreement with the measured values. In conclusion, compliant artery - blood interaction models of patient specific geometries can play an important role in hemodynamics based diagnosis of PVD.

  17. Simulation study on the detection of size, shape and position of three different scatterers using non-standard time domain time inverse Maxwell's algorithm.

    Science.gov (United States)

    Chakrabarti, Kisalaya; Cole, James B

    2010-03-01

    Inverse method has wide application on medical diagnosis where non-destructive evaluation is the key factor .Back scattered waves or echoes generated from the forward moving waves has information about its geometry, size and location. In this paper we have investigated how well different geometries of the object is determined from the back scattered waves by a high accuracy Non-Standard Finite Difference Time Inverse (NSFD-TI) Maxwell's algorithm and how the refractive index of the object plays a deterministic role on its size.

  18. Rayleigh wave modeling: A study of dispersion curve sensitivity and methodology for calculating an initial model to be included in an inversion algorithm

    Science.gov (United States)

    de Lucena, Rodrigo F.; Taioli, Fabio

    2014-09-01

    This paper presents a study on Rayleigh wave modeling. After model implementation using Matlab software, unpublished studies were conducted of dispersion curve sensitivity to percentage changes in parameter values, including S- and P-wave velocities, substrate density, and layer thickness. The study of the sensitivity of dispersion curves demonstrated that parameters such as S-wave velocity and layer thickness cannot be ignored as inversion parameters, while P-wave velocity and density can be considered as known parameters since their influence is minimal. However, the results showed limitations that should be considered and overcome when choosing the known and unknown parameters through determining a good initial model or/and by gathering a priori information. A methodology considering the sensitivity study of dispersion curves was developed and evaluated to generate initial values (initial model) to be included in the local search inversion algorithm, clearly establishing initial favorable conditions for data inversion.

  19. A new algorithm for three-dimensional joint inversion of body wave and surface wave data and its application to the Southern California plate boundary region

    Science.gov (United States)

    Fang, Hongjian; Zhang, Haijiang; Yao, Huajian; Allam, Amir; Zigone, Dimitri; Ben-Zion, Yehuda; Thurber, Clifford; van der Hilst, Robert D.

    2016-05-01

    We introduce a new algorithm for joint inversion of body wave and surface wave data to get better 3-D P wave (Vp) and S wave (Vs) velocity models by taking advantage of the complementary strengths of each data set. Our joint inversion algorithm uses a one-step inversion of surface wave traveltime measurements at different periods for 3-D Vs and Vp models without constructing the intermediate phase or group velocity maps. This allows a more straightforward modeling of surface wave traveltime data with the body wave arrival times. We take into consideration the sensitivity of surface wave data with respect to Vp in addition to its large sensitivity to Vs, which means both models are constrained by two different data types. The method is applied to determine 3-D crustal Vp and Vs models using body wave and Rayleigh wave data in the Southern California plate boundary region, which has previously been studied with both double-difference tomography method using body wave arrival times and ambient noise tomography method with Rayleigh and Love wave group velocity dispersion measurements. Our approach creates self-consistent and unique models with no prominent gaps, with Rayleigh wave data resolving shallow and large-scale features and body wave data constraining relatively deeper structures where their ray coverage is good. The velocity model from the joint inversion is consistent with local geological structures and produces better fits to observed seismic waveforms than the current Southern California Earthquake Center (SCEC) model.

  20. Implementing a C++ Version of the Joint Seismic-Geodetic Algorithm for Finite-Fault Detection and Slip Inversion for Earthquake Early Warning

    Science.gov (United States)

    Smith, D. E.; Felizardo, C.; Minson, S. E.; Boese, M.; Langbein, J. O.; Guillemot, C.; Murray, J. R.

    2015-12-01

    The earthquake early warning (EEW) systems in California and elsewhere can greatly benefit from algorithms that generate estimates of finite-fault parameters. These estimates could significantly improve real-time shaking calculations and yield important information for immediate disaster response. Minson et al. (2015) determined that combining FinDer's seismic-based algorithm (Böse et al., 2012) with BEFORES' geodetic-based algorithm (Minson et al., 2014) yields a more robust and informative joint solution than using either algorithm alone. FinDer examines the distribution of peak ground accelerations from seismic stations and determines the best finite-fault extent and strike from template matching. BEFORES employs a Bayesian framework to search for the best slip inversion over all possible fault geometries in terms of strike and dip. Using FinDer and BEFORES together generates estimates of finite-fault extent, strike, dip, preferred slip, and magnitude. To yield the quickest, most flexible, and open-source version of the joint algorithm, we translated BEFORES and FinDer from Matlab into C++. We are now developing a C++ Application Protocol Interface for these two algorithms to be connected to the seismic and geodetic data flowing from the EEW system. The interface that is being developed will also enable communication between the two algorithms to generate the joint solution of finite-fault parameters. Once this interface is developed and implemented, the next step will be to run test seismic and geodetic data through the system via the Earthworm module, Tank Player. This will allow us to examine algorithm performance on simulated data and past real events.

  1. Microwave Imaging of Three-Dimensional Targets by Means of an Inexact-Newton-Based Inversion Algorithm

    Directory of Open Access Journals (Sweden)

    Claudio Estatico

    2013-01-01

    Full Text Available A microwave imaging method previously developed for tomographic inspection of dielectric targets is extended to three-dimensional objects. The approach is based on the full vector equations of the electromagnetic inverse scattering problem. The ill-posedness of the problem is faced by the application of an inexact-Newton method. Preliminary reconstruction results are reported.

  2. Numerical solution of a coefficient inverse problem with multi-frequency experimental raw data by a globally convergent algorithm

    Science.gov (United States)

    Nguyen, Dinh-Liem; Klibanov, Michael V.; Nguyen, Loc H.; Kolesov, Aleksandr E.; Fiddy, Michael A.; Liu, Hui

    2017-09-01

    We analyze in this paper the performance of a newly developed globally convergent numerical method for a coefficient inverse problem for the case of multi-frequency experimental backscatter data associated to a single incident wave. These data were collected using a microwave scattering facility at the University of North Carolina at Charlotte. The challenges for the inverse problem under the consideration are not only from its high nonlinearity and severe ill-posedness but also from the facts that the amount of the measured data is minimal and that these raw data are contaminated by a significant amount of noise, due to a non-ideal experimental setup. This setup is motivated by our target application in detecting and identifying explosives. We show in this paper how the raw data can be preprocessed and successfully inverted using our inversion method. More precisely, we are able to reconstruct the dielectric constants and the locations of the scattering objects with a good accuracy, without using any advanced a priori knowledge of their physical and geometrical properties.

  3. Rapid processing of data based on high-performance algorithms for solving inverse problems and 3D-simulation of the tsunami and earthquakes

    Science.gov (United States)

    Marinin, I. V.; Kabanikhin, S. I.; Krivorotko, O. I.; Karas, A.; Khidasheli, D. G.

    2012-04-01

    We consider new techniques and methods for earthquake and tsunami related problems, particularly - inverse problems for the determination of tsunami source parameters, numerical simulation of long wave propagation in soil and water and tsunami risk estimations. In addition, we will touch upon the issue of database management and destruction scenario visualization. New approaches and strategies, as well as mathematical tools and software are to be shown. The long joint investigations by researchers of the Institute of Mathematical Geophysics and Computational Mathematics SB RAS and specialists from WAPMERR and Informap have produced special theoretical approaches, numerical methods, and software tsunami and earthquake modeling (modeling of propagation and run-up of tsunami waves on coastal areas), visualization, risk estimation of tsunami, and earthquakes. Algorithms are developed for the operational definition of the origin and forms of the tsunami source. The system TSS numerically simulates the source of tsunami and/or earthquakes and includes the possibility to solve the direct and the inverse problem. It becomes possible to involve advanced mathematical results to improve models and to increase the resolution of inverse problems. Via TSS one can construct maps of risks, the online scenario of disasters, estimation of potential damage to buildings and roads. One of the main tools for the numerical modeling is the finite volume method (FVM), which allows us to achieve stability with respect to possible input errors, as well as to achieve optimum computing speed. Our approach to the inverse problem of tsunami and earthquake determination is based on recent theoretical results concerning the Dirichlet problem for the wave equation. This problem is intrinsically ill-posed. We use the optimization approach to solve this problem and SVD-analysis to estimate the degree of ill-posedness and to find the quasi-solution. The software system we developed is intended to

  4. An Extragradient Method and Proximal Point Algorithm for Inverse Strongly Monotone Operators and Maximal Monotone Operators in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Plubtieng Somyot

    2009-01-01

    Full Text Available Abstract We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.

  5. An Extragradient Method and Proximal Point Algorithm for Inverse Strongly Monotone Operators and Maximal Monotone Operators in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Somyot Plubtieng

    2009-01-01

    Full Text Available We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.

  6. 基于PIK算法的虚拟人下意识行为研究%Generation of Subconscious Actions of Virtual Characters by Prioritized Inverse Kinematics Algorithm

    Institute of Scientific and Technical Information of China (English)

    胡应龙; 李猛; 李可; 梁加红; 孥石磊

    2011-01-01

    随着虚拟人运动控制研究的逐步发展,人们对虚拟人运动的"类人性"提出了更高的要求,有必要对虚拟人的下意识行为进行一定的研究。根据下意识行为生成机理,创建下意识行为智能体,对智能体进行参数设计,确立下意识行为生成方式;构建下意识行为单元,根据智能体"指令"选择对应的下意识行为,利用姿态样本库,依据特定任务约束,生成带优先级的逆向运动学(PIK)算法计算需要的初始姿态;参照初始姿态,利用PIK算法对所有任务约束按优先级顺序进行IK迭代求解,生成关键帧,实现下意识行为的生成。实验结果表明,通过使用PIK算法,生成%Currently,with the development of the survey of the virtual human motion generation and control technology,people propose higher requirements for the control of virtual human,which promote us to do some research on the subconscious actions.According to the mechanism of the generation of the subconscious actions,first,an agent model of subconscious actions was constructed,and the parameters were set to establish the generation way of subconscious actions.Then,the subconscious unit was built to select the corresponding subconscious action in the light of the command of the agent model.Simultaneously,based on posture sample database,the system would generate the initial posture which was needed by the calculation of Prioritized Inverse Kinematics Algorithm.Finally referenced to the initial posture and with all constraints considered at different priority levels,the PIK(Prioritized Inverse Kinematics) algorithm could be iterated step by step to get a final key posture,which realized the generation of subconscious action.The experiments present that,by using the Prioritized Inverse Kinematics Algorithm,the realistic subconscious actions is generated,which increases the "lifelike" nature of the motion of virtual human greatly.

  7. Inverse problem studies of biochemical systems with structure identification of S-systems by embedding training functions in a genetic algorithm.

    Science.gov (United States)

    Sarode, Ketan Dinkar; Kumar, V Ravi; Kulkarni, B D

    2016-05-01

    An efficient inverse problem approach for parameter estimation, state and structure identification from dynamic data by embedding training functions in a genetic algorithm methodology (ETFGA) is proposed for nonlinear dynamical biosystems using S-system canonical models. Use of multiple shooting and decomposition approach as training functions has been shown for handling of noisy datasets and computational efficiency in studying the inverse problem. The advantages of the methodology are brought out systematically by studying it for three biochemical model systems of interest. By studying a small-scale gene regulatory system described by a S-system model, the first example demonstrates the use of ETFGA for the multifold aims of the inverse problem. The estimation of a large number of parameters with simultaneous state and network identification is shown by training a generalized S-system canonical model with noisy datasets. The results of this study bring out the superior performance of ETFGA on comparison with other metaheuristic approaches. The second example studies the regulation of cAMP oscillations in Dictyostelium cells now assuming limited availability of noisy data. Here, flexibility of the approach to incorporate partial system information in the identification process is shown and its effect on accuracy and predictive ability of the estimated model are studied. The third example studies the phenomenological toy model of the regulation of circadian oscillations in Drosophila that follows rate laws different from S-system power-law. For the limited noisy data, using a priori information about properties of the system, we could estimate an alternate S-system model that showed robust oscillatory behavior with predictive abilities.

  8. Accurate estimation of seismic source parameters of induced seismicity by a combined approach of generalized inversion and genetic algorithm: Application to The Geysers geothermal area, California

    Science.gov (United States)

    Picozzi, M.; Oth, A.; Parolai, S.; Bindi, D.; De Landro, G.; Amoroso, O.

    2017-05-01

    The accurate determination of stress drop, seismic efficiency, and how source parameters scale with earthquake size is an important issue for seismic hazard assessment of induced seismicity. We propose an improved nonparametric, data-driven strategy suitable for monitoring induced seismicity, which combines the generalized inversion technique together with genetic algorithms. In the first step of the analysis the generalized inversion technique allows for an effective correction of waveforms for attenuation and site contributions. Then, the retrieved source spectra are inverted by a nonlinear sensitivity-driven inversion scheme that allows accurate estimation of source parameters. We therefore investigate the earthquake source characteristics of 633 induced earthquakes (Mw 2-3.8) recorded at The Geysers geothermal field (California) by a dense seismic network (i.e., 32 stations, more than 17.000 velocity records). We find a nonself-similar behavior, empirical source spectra that require an ωγ source model with γ > 2 to be well fit and small radiation efficiency ηSW. All these findings suggest different dynamic rupture processes for smaller and larger earthquakes and that the proportion of high-frequency energy radiation and the amount of energy required to overcome the friction or for the creation of new fractures surface changes with earthquake size. Furthermore, we observe also two distinct families of events with peculiar source parameters that in one case suggests the reactivation of deep structures linked to the regional tectonics, while in the other supports the idea of an important role of steeply dipping faults in the fluid pressure diffusion.

  9. 位置伺服系统逆模型控制算法研究%Research on Inverse Model Control Algorithm of Position Servo System

    Institute of Scientific and Technical Information of China (English)

    陈奎生; 任印美; 涂福泉; 周文娟; 熊承乾; 王文娟

    2011-01-01

    Inverse model algorithm was used to control the new driven valve-control-cylinder position servo system.The system was linearized into pseudo-linear system.A linear system controler was designed using state feedback and pole assignment to control the system.There was a comparison with the traditional PID control schemes.The simulation results show that the control effect of inverse system is better than the traditional PID control method.%运用逆模型算法控制新型驱动式阀控缸位置伺服系统,将系统线性化成伪线性系统,利用状态反馈和极点配置方法设计线性系统控制器,实现对系统的控制;并与传统的PID控制方案进行比较.仿真结果表明,采用逆系统控制方法的控制效果较传统PID控制方法好.

  10. A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Lin; Yang, Chao; Lu, Jiangfeng; Ying, Lexing; E, Weinan

    2009-09-25

    We present an efficient parallel algorithm and its implementation for computing the diagonal of $H^-1$ where $H$ is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of $H$ through a recently developed pole-expansion technique \\cite{LinLuYingE2009}. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems \\citeHohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of $(H-z_i I)^-1$ for a small number of poles $z_i$ is much faster, especially when the quantum dot contains many electrons.

  11. Inversion methods for satellite studies of the Earth Radiation Budget - Development of algorithms for the ERBE mission

    Science.gov (United States)

    Smith, G. L.; Green, R. N.; Avis, L. M.; Suttles, J. T.; Wielicki, B. A.; Raschke, E.; Davies, R.

    1986-01-01

    The Earth Radiation Budget Experiment carries a three-channel scanning radiometer and a set of nadir-looking wide and medium field-of-view instruments for measuring the radiation emitted from earth and the solar radiation reflected from earth. This paper describes the algorithms which are used to compute the radiant exitances at a reference level ('top of the atmosphere') from these measurements. Methods used to analyze data from previous radiation budget experiments are reviewed, and the rationale for the present algorithms is developed. The scanner data are converted to radiances by use of spectral factors, which account for imperfect spectral response of the optics. These radiances are converted to radiant exitances at the reference level by use of directional models, which account for anisotropy of the radiation as it leaves the earth. The spectral factors and directional models are selected on the basis of the scene, which is identified on the basis of the location and the long-wave and shortwave radiances. These individual results are averaged over 2.5 x 2.5 deg regions. Data from the wide and medium field-of-view instruments are analyzed by use of the traditional shape factor method and also by use of a numerical filter, which permits resolution enhancement along the orbit track.

  12. Improvement and research of inversion algorithm of elliptic curve based on GF(2m)%基于GF(2m)的椭圆曲线求逆算法的改进研究

    Institute of Scientific and Technical Information of China (English)

    郭高峰; 崔强强

    2014-01-01

    Since the existing inversion operation algorithm based on GF(2m)has the following disadvantages:large amount of calculation,poor degree of parallelism and slow speed,an improved algorithm is proposed in this paper based on Extended Euclidean Algorithm. A corresponding multiplier hardware structure was designed. Its operation performance and the status of re-source occupancy are analyzed. This parallel improved algorithm of inversion operation calculator was realized with the program based Verilog. The comprehensive simulation of the whole inversion algorithm was conducted with Xilinx ISE 12.4. The opera-tion efficiency of the inversion algorithm was verified on hardware platform of Xilinx Virtex-5 xc5vfx70t. The experimental result and performance comparison show that the modification of the inversion algorithm has improved its speed.%针对二进制域上现有求逆算法计算量大、并行度小、速度慢的缺点进行改进,基于二元Euclidean算法提出了改进,设计了相应的乘法器硬件结构,并且分析了其运算效能和资源占用情况。将此求逆计算器的并行改进算法使用Verilog语言编程实现,利用Xilinx ISE 12.4对整个求逆算法综合仿真(行为级),在Xilinx Virtex-5 XC5VFX70T的硬件平台上验证求逆算法的运算效率,结果表明对求逆算法的改进有效地提高了求逆运算的速度。

  13. 叶面积指数遥感反演算法研究%Research on Leaf Area Index Remote Sensing Inversion Algorithms

    Institute of Scientific and Technical Information of China (English)

    周洋; 米晓飞; 叶李灶

    2013-01-01

    叶面积指数是确定陆袁生态系统物质和能量交换大小的重要结构参数之一.本文基于NDVI、RVI的反演模型,结合GDAL影像库和C++语言设计实现相关算法,形成从影像数据到叶面积指数图的处理流程,提高了影像的利用率.经预处理的Hyperion数据测试,算法运行稳定且计算结果精确,为植物长势监测、粮食产量预测提供可靠数据源.%Leaf area index is one of the important structural parameters to ensure land surface ecosystem substances and the size of energy exchange, this algorithm is designed on NDVI, RVI inversion model, combine the GDAL image library and C++ language to realize. It has achieved the operational flow from image data to leaf area index map, which improve the utilization rate of image data. The algorithm runs stable and accurate by the test of pretreatment Hyperion data, and provides reliable data for plant growth monitoring, forecast the grain production.

  14. Tropospheric ozone from IASI: comparison of different inversion algorithms and validation with ozone sondes in the northern middle latitudes

    Directory of Open Access Journals (Sweden)

    C. Keim

    2009-05-01

    Full Text Available This paper presents a first statistical validation of tropospheric ozone products derived from measurements of the satellite instrument IASI. Since end of 2006, IASI (Infrared Atmospheric Sounding Interferometer aboard the polar orbiter Metop-A measures infrared spectra of the Earth's atmosphere in nadir geometry. This validation covers the northern mid-latitudes and the period from July 2007 to August 2008. The comparison of the ozone products with the vertical ozone concentration profiles from balloon sondes leads to estimates of the systematic and random errors in the IASI ozone products. The intercomparison of the retrieval results from four different sources (including the EUMETSAT ozone products shows systematic differences due to the used methods and algorithms. On average the tropospheric columns have a small bias of less than 2 Dobson Units (DU when compared to the sonde measured columns. The comparison of the still pre-operational EUMETSAT columns shows higher mean differences of about 5 DU.

  15. 改进的峰值检测反距离加权插值算法%Improved inverse distance weighting interpolation algorithm for peak detection

    Institute of Scientific and Technical Information of China (English)

    李超; 陈钱; 顾国华; 钱惟贤

    2013-01-01

      采样频率限制和回波脉冲展宽是导致数字化激光脉冲测距峰值检测精度低的主要原因。传统的反距离加权插值算法只能解决低采样频率的问题,却无力解决回波脉冲展宽的问题。针对该问题,根据回波时间能量分布模型,从采样得到的峰值位置分别向上升沿和下降沿方向搜索,各自对搜索半径内的采样点按照距离远近赋予不同权重和插值,然后加权平均提取修正后的峰值时刻。该改进算法有效地解决了回波展宽的问题,减小了低采样频率和回波脉冲展宽带来的测量误差,通过实验论证了算法的有效性。%Low sampling frequency and echo broadening are the main rea sons for low peak detection accuracy in digital pulsed laser ranging. The traditional inverse distance weighted interpolation algorithm (IDW) for peak detection can only solve the problem of low sampling frequency. Aim at the problem, an improved inverse distance weighted interpolation algorithm(IIDW) was proposed. The sampling peak value is firstly located, then sampling spots within the researching radius of the rising edge and falling edge were assigned with different weight according to the different distance to the peak value separately, finally the peak time was corrected by weighted average. This algorithm reduces peak detection errors caused by restriction of sampling frequency and echo broadening effectively and improves the detection precision of digital pulsed laser ranging.

  16. Tropospheric ozone from IASI: comparison of different inversion algorithms and validation with ozone sondes in the northern middle latitudes

    Directory of Open Access Journals (Sweden)

    R. Stübi

    2009-12-01

    Full Text Available This paper presents a first statistical validation of tropospheric ozone products derived from measurements of the IASI satellite instrument. Since the end of 2006, IASI (Infrared Atmospheric Sounding Interferometer aboard the polar orbiter Metop-A measures infrared spectra of the Earth's atmosphere in nadir geometry. This validation covers the northern mid-latitudes and the period from July 2007 to August 2008. Retrieval results from four different sources are presented: three are from scientific products (LATMOS, LISA, LPMAA and the fourth one is the pre-operational product distributed by EUMETSAT (version 4.2. The different products are derived from different algorithms with different approaches. The difference and their implications for the retrieved products are discussed. In order to evaluate the quality and the performance of each product, comparisons with the vertical ozone concentration profiles measured by balloon sondes are performed and lead to estimates of the systematic and random errors in the IASI ozone products (profiles and partial columns. A first comparison is performed on the given profiles; a second comparison takes into account the altitude dependent sensitivity of the retrievals. Tropospheric columnar amounts are compared to the sonde for a lower tropospheric column (surface to about 6 km and a "total" tropospheric column (surface to about 11 km. On average both tropospheric columns have small biases for the scientific products, less than 2 Dobson Units (DU for the lower troposphere and less than 1 DU for the total troposphere. The comparison of the still pre-operational EUMETSAT columns shows higher mean differences of about 5 DU.

  17. Algoritmo para el cálculo de la transformada Z inversa utilizando DERIVE // Algorithm for the calculation of the transformed inverse Z using the mathematical assistant DERIVE.

    Directory of Open Access Journals (Sweden)

    D. Galán Martínez

    2000-07-01

    Full Text Available Una de las herramientas matemáticas más utilizadas en ingeniería en el estudio de los denominados sistemas de control dedatos muestreados es la transformada Z. La transformada Z como método operacional puede ser utilizada en la resoluciónde ecuaciones en diferencias finitas; las cuales formulan la dinámica de los sistemas de control de datos muestreados. Estatransformada juega un papel similar que el de la transformada de Laplace en el análisis de los sistemas de control de tiempocontinuo.El presente trabajo tiene como objetivo la confección de un programa para computadora digital, utilizando el asistentematemático DERIVE, para la determinación de la transformada Z inversa de una función algebraica racional, las cualesmodelan matemáticamente los sistemas de control de datos muestreados lineales que aparecen con mucha frecuencia en elestudio de los procesos de ingeniería.Palabras claves: Algoritmo, transformada Z, DERIVE, función algebraica racional, modelo matemático._______________________________________________________________________AbstractOne of the mathematical tools more used in engineering in the study of the denominated systems of data control samples isthe transformed Z. The transformed Z like as an operational method can be used in the resolution of equations in finitedifferences; which formulate the dynamics of the systems of data control samples. This transformed plays a similar paperthat the Laplace transformed in the analysis of the systems of control in continuous time.The present work has as objective the confection of a program for digital computer, using the mathematical assistantDERIVES, for the determination of the Z inverse transformed of a rational algebraic function, which model mathematicallythe systems of lineal data control samples that appear very frecuently in the study of the engineering processesKey words: algorithm, Z inverse transformed, Derives, Digital computer program, Rational

  18. MICAN: a protein structure alignment algorithm that can handle Multiple-chains, Inverse alignments, C(α) only models, Alternative alignments, and Non-sequential alignments.

    Science.gov (United States)

    Minami, Shintaro; Sawada, Kengo; Chikenji, George

    2013-01-18

    Protein pairs that have the same secondary structure packing arrangement but have different topologies have attracted much attention in terms of both evolution and physical chemistry of protein structures. Further investigation of such protein relationships would give us a hint as to how proteins can change their fold in the course of evolution, as well as a insight into physico-chemical properties of secondary structure packing. For this purpose, highly accurate sequence order independent structure comparison methods are needed. We have developed a novel protein structure alignment algorithm, MICAN (a structure alignment algorithm that can handle Multiple-chain complexes, Inverse direction of secondary structures, Cα only models, Alternative alignments, and Non-sequential alignments). The algorithm was designed so as to identify the best structural alignment between protein pairs by disregarding the connectivity between secondary structure elements (SSE). One of the key feature of the algorithm is utilizing the multiple vector representation for each SSE, which enables us to correctly treat bent or twisted nature of long SSE. We compared MICAN with other 9 publicly available structure alignment programs, using both reference-dependent and reference-independent evaluation methods on a variety of benchmark test sets which include both sequential and non-sequential alignments. We show that MICAN outperforms the other existing methods for reproducing reference alignments of non-sequential test sets. Further, although MICAN does not specialize in sequential structure alignment, it showed the top level performance on the sequential test sets. We also show that MICAN program is the fastest non-sequential structure alignment program among all the programs we examined here. MICAN is the fastest and the most accurate program among non-sequential alignment programs we examined here. These results suggest that MICAN is a highly effective tool for automatically detecting non

  19. MICAN : a protein structure alignment algorithm that can handle Multiple-chains, Inverse alignments, Cα only models, Alternative alignments, and Non-sequential alignments

    Science.gov (United States)

    2013-01-01

    Background Protein pairs that have the same secondary structure packing arrangement but have different topologies have attracted much attention in terms of both evolution and physical chemistry of protein structures. Further investigation of such protein relationships would give us a hint as to how proteins can change their fold in the course of evolution, as well as a insight into physico-chemical properties of secondary structure packing. For this purpose, highly accurate sequence order independent structure comparison methods are needed. Results We have developed a novel protein structure alignment algorithm, MICAN (a structure alignment algorithm that can handle Multiple-chain complexes, Inverse direction of secondary structures, Cα only models, Alternative alignments, and Non-sequential alignments). The algorithm was designed so as to identify the best structural alignment between protein pairs by disregarding the connectivity between secondary structure elements (SSE). One of the key feature of the algorithm is utilizing the multiple vector representation for each SSE, which enables us to correctly treat bent or twisted nature of long SSE. We compared MICAN with other 9 publicly available structure alignment programs, using both reference-dependent and reference-independent evaluation methods on a variety of benchmark test sets which include both sequential and non-sequential alignments. We show that MICAN outperforms the other existing methods for reproducing reference alignments of non-sequential test sets. Further, although MICAN does not specialize in sequential structure alignment, it showed the top level performance on the sequential test sets. We also show that MICAN program is the fastest non-sequential structure alignment program among all the programs we examined here. Conclusions MICAN is the fastest and the most accurate program among non-sequential alignment programs we examined here. These results suggest that MICAN is a highly effective tool

  20. Adaptive Measurement Algorithm of Revo Probe and Inverse Position%Revo测头的自适应测量算法及位置反解

    Institute of Scientific and Technical Information of China (English)

    赵磊; 刘书桂

    2012-01-01

    为解决关节臂式三坐标测量机测量精度低的致命弊端,在三坐标测量系统中采用Revo测头.经分析系统的结构特点,确定了转动关节与测杆姿态的几何关系并构造测量时的接近矢量,实现测杆姿态的控制.在此基础上,提出一种基于初始姿态的自适应测量算法,根据数据点的坐标,求得测杆姿态最小变化量,结合位置方程求得该姿态下的位置反解.实验表明:该算法可实现测头姿态的精确控制和位置反解的计算,为具有Revo测头高自由度关节臂式三坐标测量系统的发展和运动学问题的深入研究奠定了理论基础.%The Revo probe was used for the first time in coordinate measuring machine system to solve the problem of low accuracy for articulated arm coordinate measuring machine. The geometrical relationship was found between rotational joints and measuring bar through analysis of the structural features of system, and the approach vector was calculated according to this relationship. So the control of measuring bar's posture was realized. An algorithm of self-adaptation measuring was proposed based on measuring pole's initial posture. The minimum variation of posture was obtained on the basis of known coordinates of data. The calculation of inverse position was completed by the positional equation. The experiment shows that the control of Revo probe's posture and inverse position are achievable through applying this algorithm. The theory foundation is built for the further research on the development and kinematics of the articulated arm coordinate measuring system with high freedom and Revo probe.

  1. Revising the retrieval technique of a long-term stratospheric HNO3 data set: from a constrained matrix inversion to the optimal estimation algorithm

    Directory of Open Access Journals (Sweden)

    R. L. de Zafra

    2011-07-01

    Full Text Available The Ground-Based Millimeter-wave Spectrometer (GBMS was designed and built at the State University of New York at Stony Brook in the early 1990s and since then has carried out many measurement campaigns of stratospheric O3, HNO3, CO and N2O at polar and mid-latitudes. Its HNO3 data set shed light on HNO3 annual cycles over the Antarctic continent and contributed to the validation of both generations of the satellite-based JPL Microwave Limb Sounder (MLS. Following the increasing need for long-term data sets of stratospheric constituents, we resolved to establish a long-term GMBS observation site at the Arctic station of Thule (76.5° N, 68.8° W, Greenland, beginning in January 2009, in order to track the long- and short-term interactions between the changing climate and the seasonal processes tied to the ozone depletion phenomenon. Furthermore, we updated the retrieval algorithm adapting the Optimal Estimation (OE method to GBMS spectral data in order to conform to the standard of the Network for the Detection of Atmospheric Composition Change (NDACC microwave group, and to provide our retrievals with a set of averaging kernels that allow more straightforward comparisons with other data sets. The new OE algorithm was applied to GBMS HNO3 data sets from 1993 South Pole observations to date, in order to produce HNO3 version 2 (v2 profiles. A sample of results obtained at Antarctic latitudes in fall and winter and at mid-latitudes is shown here. In most conditions, v2 inversions show a sensitivity (i.e., sum of column elements of the averaging kernel matrix of 100 ± 20 % from 20 to 45 km altitude, with somewhat worse (better sensitivity in the Antarctic winter lower (upper stratosphere. The 1σ uncertainty on HNO3 v2 mixing ratio vertical profiles depends on altitude and is estimated at ~15 % or 0.3 ppbv, whichever is larger. Comparisons of v2 with former (v1 GBMS HNO3 vertical profiles, obtained employing the constrained matrix inversion method

  2. A study of 2-D magnetotelluric quantum genetic inversion algorithm based on subspace%基于子空间的二维大地电磁量子遗传反演法研究

    Institute of Scientific and Technical Information of China (English)

    范建柯; 师学明; 吴时国; 施剑

    2011-01-01

    量子遗传算法作为一种高效的优化算法,仍存在容易陷入局部极值的缺点.为提高算法的高效性,并探讨将算法应用于大地电磁二维反演的可行性和有效性,本文对算法进行了改进,并通过一维两层D型和四层HK型模型数值试验验证了改进的有效性.然后将改进后的算法引入二维大地电磁反演,在引入滑动子空间思想,同时只考虑最简化反演条件的前提下,对一个简单的二维低阻地电模型进行了传统量子遗传算法和改进量子遗传算法的反演,结果说明了将量子遗传算法引入基于子空间的二维大地电磁反演是可行的和有效的,而且改进的算法效果要优于传统算法.最后对实测资料进行了反演,得到了比较好的结果.%Quantum Genetic Algorithm is an excellent method. Nevertheless, there is a disadvantage to trap into the local minima for the conventional Quantum Genetic Algorithm. To advance the algorithm and probe the feasibility and effectiveness of the algorithm introduced into the magnetotelluric data 2D inversion, some improvements are made, whose effectiveness is testified through the inversion for ID magnetotelluric two-layer (D-type) model and four-layer (HK-type) model. Then, the improved method is introduced into the magnetotelluric data 2D inversion. Based on the sliding subspace and the most simplified inversion condition, one typical 2D low-resistivity model is inversed using the conventional Quantum Genetic Algorithm and the improved Quantum Genetic Algorithm, respectively. The results indicate that it is feasible and effective to apply the Quantum Genetic Algorithm to magnetotelluric 2D inversion based on the subspace method and the result from the improved method is better than the conventional method. Finally, the better result is also obtained for the field data.

  3. Revising the retrieval technique of a long-term stratospheric HNO{sub 3} data set. From a constrained matrix inversion to the optimal estimation algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Fiorucci, I.; Muscari, G. [Istituto Nazionale di Geofisica e Vulcanologia, Rome (Italy); De Zafra, R.L. [State Univ. of New York, Stony Brook, NY (United States). Dept. of Physics and Astronomy

    2011-07-01

    The Ground-Based Millimeter-wave Spectrometer (GBMS) was designed and built at the State University of New York at Stony Brook in the early 1990s and since then has carried out many measurement campaigns of stratospheric O{sub 3}, HNO{sub 3}, CO and N{sub 2}O at polar and mid-latitudes. Its HNO{sub 3} data set shed light on HNO{sub 3} annual cycles over the Antarctic continent and contributed to the validation of both generations of the satellite-based JPL Microwave Limb Sounder (MLS). Following the increasing need for long-term data sets of stratospheric constituents, we resolved to establish a long-term GMBS observation site at the Arctic station of Thule (76.5 N, 68.8 W), Greenland, beginning in January 2009, in order to track the long- and short-term interactions between the changing climate and the seasonal processes tied to the ozone depletion phenomenon. Furthermore, we updated the retrieval algorithm adapting the Optimal Estimation (OE) method to GBMS spectral data in order to conform to the standard of the Network for the Detection of Atmospheric Composition Change (NDACC) microwave group, and to provide our retrievals with a set of averaging kernels that allow more straightforward comparisons with other data sets. The new OE algorithm was applied to GBMS HNO{sub 3} data sets from 1993 South Pole observations to date, in order to produce HNO{sub 3} version 2 (v2) profiles. A sample of results obtained at Antarctic latitudes in fall and winter and at mid-latitudes is shown here. In most conditions, v2 inversions show a sensitivity (i.e., sum of column elements of the averaging kernel matrix) of 100{+-}20% from 20 to 45 km altitude, with somewhat worse (better) sensitivity in the Antarctic winter lower (upper) stratosphere. The 1{sigma} uncertainty on HNO{sub 3} v2 mixing ratio vertical profiles depends on altitude and is estimated at {proportional_to}15% or 0.3 ppbv, whichever is larger. Comparisons of v2 with former (v1) GBMS HNO{sub 3} vertical profiles

  4. The inverse electroencephalography pipeline

    Science.gov (United States)

    Weinstein, David Michael

    The inverse electroencephalography (EEG) problem is defined as determining which regions of the brain are active based on remote measurements recorded with scalp EEG electrodes. An accurate solution to this problem would benefit both fundamental neuroscience research and clinical neuroscience applications. However, constructing accurate patient-specific inverse EEG solutions requires complex modeling, simulation, and visualization algorithms, and to date only a few systems have been developed that provide such capabilities. In this dissertation, a computational system for generating and investigating patient-specific inverse EEG solutions is introduced, and the requirements for each stage of this Inverse EEG Pipeline are defined and discussed. While the requirements of many of the stages are satisfied with existing algorithms, others have motivated research into novel modeling and simulation methods. The principal technical results of this work include novel surface-based volume modeling techniques, an efficient construction for the EEG lead field, and the Open Source release of the Inverse EEG Pipeline software for use by the bioelectric field research community. In this work, the Inverse EEG Pipeline is applied to three research problems in neurology: comparing focal and distributed source imaging algorithms; separating measurements into independent activation components for multifocal epilepsy; and localizing the cortical activity that produces the P300 effect in schizophrenia.

  5. The representation and computation of generalized inverse

    Science.gov (United States)

    Sheng, Xingping; Chen, Guoliang; Gong, Yi

    2008-03-01

    This paper presents a novel representation for the generalized inverse . Based on this, we give an algorithm to compute this generalized inverse. As an application, we use Gauss-Jordan elimination to compute the weighted Moore-Penrose inverse and the Drazin inverse Ad.

  6. Image reconstruction of single photon emission computed tomography (SPECT) on a pebble bed reactor (PBR) using expectation maximization and exact inversion algorithms: Comparison study by means of numerical phantom

    Energy Technology Data Exchange (ETDEWEB)

    Razali, Azhani Mohd, E-mail: azhani@nuclearmalaysia.gov.my; Abdullah, Jaafar, E-mail: jaafar@nuclearmalaysia.gov.my [Plant Assessment Technology (PAT) Group, Industrial Technology Division, Malaysian Nuclear Agency, Bangi, 43000 Kajang (Malaysia)

    2015-04-29

    Single Photon Emission Computed Tomography (SPECT) is a well-known imaging technique used in medical application, and it is part of medical imaging modalities that made the diagnosis and treatment of disease possible. However, SPECT technique is not only limited to the medical sector. Many works are carried out to adapt the same concept by using high-energy photon emission to diagnose process malfunctions in critical industrial systems such as in chemical reaction engineering research laboratories, as well as in oil and gas, petrochemical and petrochemical refining industries. Motivated by vast applications of SPECT technique, this work attempts to study the application of SPECT on a Pebble Bed Reactor (PBR) using numerical phantom of pebbles inside the PBR core. From the cross-sectional images obtained from SPECT, the behavior of pebbles inside the core can be analyzed for further improvement of the PBR design. As the quality of the reconstructed image is largely dependent on the algorithm used, this work aims to compare two image reconstruction algorithms for SPECT, namely the Expectation Maximization Algorithm and the Exact Inversion Formula. The results obtained from the Exact Inversion Formula showed better image contrast and sharpness, and shorter computational time compared to the Expectation Maximization Algorithm.

  7. Image reconstruction of single photon emission computed tomography (SPECT) on a pebble bed reactor (PBR) using expectation maximization and exact inversion algorithms: Comparison study by means of numerical phantom

    Science.gov (United States)

    Razali, Azhani Mohd; Abdullah, Jaafar

    2015-04-01

    Single Photon Emission Computed Tomography (SPECT) is a well-known imaging technique used in medical application, and it is part of medical imaging modalities that made the diagnosis and treatment of disease possible. However, SPECT technique is not only limited to the medical sector. Many works are carried out to adapt the same concept by using high-energy photon emission to diagnose process malfunctions in critical industrial systems such as in chemical reaction engineering research laboratories, as well as in oil and gas, petrochemical and petrochemical refining industries. Motivated by vast applications of SPECT technique, this work attempts to study the application of SPECT on a Pebble Bed Reactor (PBR) using numerical phantom of pebbles inside the PBR core. From the cross-sectional images obtained from SPECT, the behavior of pebbles inside the core can be analyzed for further improvement of the PBR design. As the quality of the reconstructed image is largely dependent on the algorithm used, this work aims to compare two image reconstruction algorithms for SPECT, namely the Expectation Maximization Algorithm and the Exact Inversion Formula. The results obtained from the Exact Inversion Formula showed better image contrast and sharpness, and shorter computational time compared to the Expectation Maximization Algorithm.

  8. Modelling of radiative transfer by the Monte Carlo method and solving the inverse problem based on a genetic algorithm according to experimental results of aerosol sensing on short paths using a femtosecond laser source

    Energy Technology Data Exchange (ETDEWEB)

    Matvienko, G G; Oshlakov, V K; Sukhanov, A Ya [V.E. Zuev Institute of Atmospheric Optics, Siberian Branch, Russian Academy of Sciences, Tomsk (Russian Federation); Stepanov, A N [Institute of Applied Physics, Russian Academy of Sciences, Nizhnii Novgorod (Russian Federation)

    2015-02-28

    We consider the algorithms that implement a broadband ('multiwave') radiative transfer with allowance for multiple (aerosol) scattering and absorption by main atmospheric gases. In the spectral range of 0.6 – 1 μm, a closed numerical simulation of modifications of the supercontinuum component of a probing femtosecond pulse is performed. In the framework of the algorithms for solving the inverse atmospheric-optics problems with the help of a genetic algorithm, we give an interpretation of the experimental backscattered spectrum of the supercontinuum. An adequate reconstruction of the distribution mode for the particles of artificial aerosol with the narrow-modal distributions in a size range of 0.5 – 2 mm and a step of 0.5 mm is obtained. (light scattering)

  9. 蚁群算法在磁测资料反演解释中的应用%THE APPLICATION OF ANT COLONY ALGORITHM TO THE INVERSION AND INTERPRETATION OF MAGNETIC DATA

    Institute of Scientific and Technical Information of China (English)

    刘双; 刘天佑; 冯杰; 高文利; 邱礼泉

    2013-01-01

    Simulating the behavior of ant colony searching for food, the Ant Colony Algorithm is an emulated and optimized algorithm, which demonstrates excellent performance in such combinatorial optimization problems as Traveling Salesman. However, it has not been widely applied to the inversion and interpretation of magnetic data. Based on the characteristics of magnetic data inversion and interpretation, this paper improves the mapping mechanism from objective function value to pheromone and summarizes Ant Colony Algorithm optimizing for continuous and multiple objective function using nodes partition strategy. Satisfactory results were achieved when Ant Colony Algorithm was simulated to inverse the parameters in the synthetic model experiment of magnetic data and was applied to prospect the banded iron formation according to low-altitude aeromagnetic data surveyed at Iron Mount mining area, southern Australia.%蚁群算法是模拟蚂蚁群体觅食行为的仿真优化算法,在旅行商等组合优化问题中展现出优异的性能,其在磁测资料反演解释中的应用却很少.基于磁测资料反演解释的特点,本文改善了目标函数值与信息素的映射机制,总结出节点划分策略的连续域多变量目标函数优化蚁群算法.并对磁测资料的模型参数反演进行理论模拟,最后应用于澳大利亚南部Iron Mount矿区低空航磁资料的条带状铁矿构建勘查,取得良好应用效果.

  10. EAST六自由度内窥机械臂的逆运动学算法研究%Inverse kinematics algorithm preliminary research for EAST in-vessel viewing 6R manipulators

    Institute of Scientific and Technical Information of China (English)

    魏小洋; 王堃; 潘洪涛; 赵文龙

    2015-01-01

    A universal inverse kinematics algorithm which aim is for EAST in-vessel viewing manipulators with coupled articulated structure has been proposed to realize its real-time and high accuracy control. This is to build manipulator kinematics multivariable equations, which can be expressed as a univariate matrix polynomial and solved through getting the eigenvalues of the matrix determinant eventually. Moreover, in order to meet the requirement of programming and actual control of manipulator, positive and inverse kinematics was validated by software developed based on MFC of VC++6.0. The solved instance indicated that the proposed algorithm can obtain all of the inverse kinematics solutions of the manipulators in ms level.%为了实现 EAST装置真空室内的内窥多关节机械臂的实时高精度控制,提出了一种逆运动学算法,即建立机械臂多变量的方程组,转化成为矩阵的特征值问题求解。为了验证和满足实际控制的需要,还基于VC++6.0开发了 MFC 运动学算法程序。结果表明,该算法能在 ms 级别内得到机械臂的所有运动学逆解。

  11. The Implementation of BTT Missile Neural Network Direct Inverse Control Algorithm Based on FPGA%BTT导弹神经网络直接逆控制算法的FPGA实现研究

    Institute of Scientific and Technical Information of China (English)

    马建伟; 王志鹏; 刘忠

    2011-01-01

    Regarding the nonlinear strong coupling characteristics of missile model in BTT missile control system, an inverse missile model is built by combining neural network with inverse system. Taking the pitch channel for instance, the structure of BP neural network inverse control algorithm is designed. And the Verilog HDL is used to implement each module of BP neural network and then realized in FPGA. According to the comparison of the implementation of neural network inverse control methods between FPGA and general computer software, the scheme can meet requirement of the BTT missile control algorithm for computing speed. The performance of neural network hardware implementation is also analyzed in this paper.%针对BTT导弹控制系统中导弹模型的非线性和强耦合的特点,应用逆7系统和神经网络相结合的方法建立了导弹的逆模型.并以俯仰通道为例,设计了逆控制算法的BP神经网络结构,采用Verilog HDL编写了BP神经网络各个功能模块,并将其在FPGA上实现.通过神经网络逆控制算法在FPGA硬件实现和通用计算机上软件实现的对比,表明该方案能够满足BTT导弹对控制算法运算速度的要求.文中还对硬件实现神经网络的性能进行了分析.

  12. Limits to Nonlinear Inversion

    DEFF Research Database (Denmark)

    Mosegaard, Klaus

    2012-01-01

    For non-linear inverse problems, the mathematical structure of the mapping from model parameters to data is usually unknown or partly unknown. Absence of information about the mathematical structure of this function prevents us from presenting an analytical solution, so our solution depends on our......-heuristics are inefficient for large-scale, non-linear inverse problems, and that the 'no-free-lunch' theorem holds. We discuss typical objections to the relevance of this theorem. A consequence of the no-free-lunch theorem is that algorithms adapted to the mathematical structure of the problem perform more efficiently than...

  13. How to Use Euclidean Algorithm to Work out the Inverse Matrix of Cycle Matrix%用辗转相除法求循环矩阵的逆矩阵

    Institute of Scientific and Technical Information of China (English)

    蒋加清

    2011-01-01

    利用两个多项式的最大公因式的求法,给出了用辗转相除法求循环矩阵的逆矩阵的算法,该方法不需要计算循环矩阵的特征值。%This paper studies how to use Euclidean algorithm to work out the inverse matrix of cycle matrix by the method of working out the highest common factor for two polynomials. This method does not require the computation of cycle matrix eigenvalues.

  14. 一种基于RD成像逆处理的双基地SAR回波模拟算法%An Echo Simulation Algorithm Based on Inverse Processing of RD Imaging for Bistatic SAR

    Institute of Scientific and Technical Information of China (English)

    张顺生; 陆逸; 曹建蜀

    2013-01-01

    与传统单基地SAR相比,双基地SAR具有获取信息丰富、抗电子干扰、抗摧毁、抗截获等优点,因而其应用场景更加广阔.然而,由于双基地SAR系统面临空时频同步等技术难题,获取实际的双基地SAR回波数据非常困难.因此,本文提出一种基于RD成像逆处理的双基地SAR回波模拟算法.该算法基于二维驻定相位原理和RD成像处理的逆过程,实现了双基地SAR回波数据的快速模拟.这种算法的运算速度与距离时域叠加算法和一维FFT算法相比有显著提高,且可以适用于移变模式.点目标和自然场景的仿真结果验证了算法的有效性.仿真速度的测试结果验证了算法的高效性.%Compared with traditional monostatic SAR, Bistatic synthetic aperture radar has the advantages of obtaining richer information, anti-electronic jamming, anti-destroy, anti-intercept. So, it has broader application prospect. However, bistatic SAR system is confronted with the space, time and frequency synchronization and other technical problems. It is very difficult to obtain the actual bistatic SAR echo data. So, a fast echo simulation algorithm based on two-dimensional principle of stationary phase (2D-PSP) and inverse processing of RD imaging algorithm was proposed in this paper. Firstly, the two-dimensional spectrum of bistatic SAR echo was deduced by using the theory of two-dimensional principle of stationary phase. Then corresponding inverse processing was taken in accordance with the steps of imaging process. At last, a fast echo data simulation for bistatic SAR was achieved. Comparing to distance time-domain overlay algorithm and one-dimensional FFT algorithm, this algorithm's simulating speed has a significant improvement and it can be used on shift-variant mode. The simulation results of a point target and natural scene verify the effectiveness of the algorithm. The test result of simulating speed can verify high efficiency of the algorithm.

  15. Inverse Limits

    CERN Document Server

    Ingram, WT

    2012-01-01

    Inverse limits provide a powerful tool for constructing complicated spaces from simple ones. They also turn the study of a dynamical system consisting of a space and a self-map into a study of a (likely more complicated) space and a self-homeomorphism. In four chapters along with an appendix containing background material the authors develop the theory of inverse limits. The book begins with an introduction through inverse limits on [0,1] before moving to a general treatment of the subject. Special topics in continuum theory complete the book. Although it is not a book on dynamics, the influen

  16. Analysis of nonlinear channel friction inverse problem

    Institute of Scientific and Technical Information of China (English)

    CHENG Weiping; LIU Guohua

    2007-01-01

    Based on the Backus-Gilbert inverse theory, the singular value decomposition (SVD) for general inverse matrices and the optimization algorithm are used to solve the channel friction inverse problem. The resolution and covari- ance friction inverse model in matrix form is developed to examine the reliability of solutions. Theoretical analyses demonstrate that the convergence rate of the general Newton optimization algorithm is in the second-order. The Wiggins method is also incorporated into the algorithm. Using the method, noise can be suppressed effectively, and the results are close to accurate solutions with proper control parameters. Also, the numerical stability can be improved.

  17. Bayesian seismic AVO inversion

    Energy Technology Data Exchange (ETDEWEB)

    Buland, Arild

    2002-07-01

    A new linearized AVO inversion technique is developed in a Bayesian framework. The objective is to obtain posterior distributions for P-wave velocity, S-wave velocity and density. Distributions for other elastic parameters can also be assessed, for example acoustic impedance, shear impedance and P-wave to S-wave velocity ratio. The inversion algorithm is based on the convolutional model and a linearized weak contrast approximation of the Zoeppritz equation. The solution is represented by a Gaussian posterior distribution with explicit expressions for the posterior expectation and covariance, hence exact prediction intervals for the inverted parameters can be computed under the specified model. The explicit analytical form of the posterior distribution provides a computationally fast inversion method. Tests on synthetic data show that all inverted parameters were almost perfectly retrieved when the noise approached zero. With realistic noise levels, acoustic impedance was the best determined parameter, while the inversion provided practically no information about the density. The inversion algorithm has also been tested on a real 3-D dataset from the Sleipner Field. The results show good agreement with well logs but the uncertainty is high. The stochastic model includes uncertainties of both the elastic parameters, the wavelet and the seismic and well log data. The posterior distribution is explored by Markov chain Monte Carlo simulation using the Gibbs sampler algorithm. The inversion algorithm has been tested on a seismic line from the Heidrun Field with two wells located on the line. The uncertainty of the estimated wavelet is low. In the Heidrun examples the effect of including uncertainty of the wavelet and the noise level was marginal with respect to the AVO inversion results. We have developed a 3-D linearized AVO inversion method with spatially coupled model parameters where the objective is to obtain posterior distributions for P-wave velocity, S

  18. 求置换因子循环矩阵的极小多项式和逆的算法%Algorithms for Finding the Minimal Polynomials and Inverses of Permutation Factor Circulant Matrices

    Institute of Scientific and Technical Information of China (English)

    江兆林; 徐宗本; 高淑萍

    2006-01-01

    In this paper, the permutation factor circulant matrix over any field is introduced. Algorithms for computing the minimal polynomial and common minimal polynomial of this kind of matrices over any field are presented by means of the Gr(o)bner basis of the ideal in the polynomial ring, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with permutation factor circulant blocks over any field is given by using the Schur complement, which can be implemented by CoCoA 4.0, an algebraic system, over the field of rational numbers or the field of residue classes of modulo prime number.%本文引入了任意域上置换因子循环矩阵,利用多项式环的理想的Gr(o)bner基的算法给出了任意域上置换因子循环矩阵的极小多项式和公共极小多项式的算法,同时给出了这类矩阵逆矩阵的两种算法.最后,利用Schur补给出了任意域上具有置换因子循环矩阵块的分块矩阵逆的一个算法,在有理数域或模素数剩余类域上,这一算法可由代数系统软件CoCoA 4.0实现.

  19. 无线传感器网络中基于反距离加权的DV-Hop改进算法%Study on Improved DV-Hop Algorithm Based on Inverse Distance Weighting Method in Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    汪文明; 操小伟; 刘桂江; 施赵媛

    2016-01-01

    通过分析传统 DV-Hop 定位算法在对无线传感器网络中节点分布随机性方面的不足,提出了一种改进算法。该算法采用最小均方误差准则代替方差或偏差,求得平均每跳距离。为了体现各信标节点对未知节点的影响程度不同,采用反距离加权法来处理平均每跳距离。实验结果表明,在没有增加原算法复杂度和成本的前提下,定位精度有了一定提高,该算法是一种简单实用的改进定位算法。%An improved algorithm was proposed by analyzing the deficiencies of traditional DV-Hop algorithm in terms of ran-dom distribution, which owns improvements over two aspects.Firstly, instead of variance or deviation, the average one-hop dis-tance is estimated by minimum mean-squared error criterion (MMSE).Secondly, in order to reflect the different effects of each beacon node on unknown nodes, inverse distance weighting method is adopted to deal with the average one-hop distance.Improved algorithm is simulated on MATLAB platform , and the results show that the positioning accuracy is improved on the condition of no increasing complexity and cost.The improved algorithm is a simple and practical algorithm.

  20. Three-dimensional nonlinear conjugate gradient parallel inversion with full information of marine magnetotellurics

    Science.gov (United States)

    Zhang, Kun; Yan, Jiayong; Lü, Qingtian; Zhao, Jinhua; Hu, Hao

    2017-04-01

    A new inversion method using marine magnetotellurics is proposed based on previous studies using the nonlinear conjugate gradient method. A numerical example is used to verify the inversion algorithm and program. The inversion model and response resemble the synthetic model. Some technologies have been added to the inversion algorithm: parallel structure, terrain inversion and static shift correction.

  1. Inverse disjuncties

    NARCIS (Netherlands)

    Malepaard, J.

    2007-01-01

    Balansschikkingen (of negatief gebonden of-constructies) zijn volgens de in dit artikel ontwikkelde hypothese inverse disjuncties (id's). Het zijn tweeledige zinnen waarvan het eerste lid een verplichte negatieve of minimaliserende constituent bevat en het tweede lid met of begint. Evenals

  2. Solving and analyzing PD0L inverse process

    Institute of Scientific and Technical Information of China (English)

    樊勇兵; 陈刚; 董光昌

    2001-01-01

    The importance of L inverse process is emphasized and an algorithm is given to realize PD0L inverse process. On the basis of algorithm analysis, this note discusses the possibility of applying L inverse process to data compression and the difficulties in doing that.

  3. An operational procedure for precipitable and cloud liquid water estimate in non-raining conditions over sea Study on the assessment of the nonlinear physical inversion algorithm

    CERN Document Server

    Nativi, S; Mazzetti, P

    2004-01-01

    In a previous work, an operative procedure to estimate precipitable and liquid water in non-raining conditions over sea was developed and assessed. The procedure is based on a fast non-linear physical inversion scheme and a forward model; it is valid for most of satellite microwave radiometers and it also estimates water effective profiles. This paper presents two improvements of the procedure: first, a refinement to provide modularity of the software components and portability across different computation system architectures; second, the adoption of the CERN MINUIT minimisation package, which addresses the problem of global minimisation but is computationally more demanding. Together with the increased computational performance that allowed to impose stricter requirements on the quality of fit, these refinements improved fitting precision and reliability, and allowed to relax the requirements on the initial guesses for the model parameters. The re-analysis of the same data-set considered in the previous pap...

  4. MAMAP - a new spectrometer system for column-averaged methane and carbon dioxide observations from aircraft: retrieval algorithm and first inversions for point source emission rates

    Science.gov (United States)

    Krings, T.; Gerilowski, K.; Buchwitz, M.; Reuter, M.; Tretner, A.; Erzinger, J.; Heinze, D.; Burrows, J. P.; Bovensmann, H.

    2011-04-01

    MAMAP is an airborne passive remote sensing instrument designed for measuring columns of methane (CH4) and carbon dioxide (CO2). The MAMAP instrument consists of two optical grating spectrometers: One in the short wave infrared band (SWIR) at 1590-1690 nm to measure CO2 and CH4 absorptions and another one in the near infrared (NIR) at 757-768 nm to measure O2 absorptions for reference purposes. MAMAP can be operated in both nadir and zenith geometry during the flight. Mounted on an airplane MAMAP can effectively survey areas on regional to local scales with a ground pixel resolution of about 29 m × 33 m for a typical aircraft altitude of 1250 m and a velocity of 200 km h-1. The retrieval precision of the measured column relative to background is typically ≲ 1% (1σ). MAMAP can be used to close the gap between satellite data exhibiting global coverage but with a rather coarse resolution on the one hand and highly accurate in situ measurements with sparse coverage on the other hand. In July 2007 test flights were performed over two coal-fired powerplants operated by Vattenfall Europe Generation AG: Jänschwalde (27.4 Mt CO2 yr-1) and Schwarze Pumpe (11.9 Mt CO2 yr-1), about 100 km southeast of Berlin, Germany. By using two different inversion approaches, one based on an optimal estimation scheme to fit Gaussian plume models from multiple sources to the data, and another using a simple Gaussian integral method, the emission rates can be determined and compared with emissions as stated by Vattenfall Europe. An extensive error analysis for the retrieval's dry column results (XCO2 and XCH4) and for the two inversion methods has been performed. Both methods - the Gaussian plume model fit and the Gaussian integral method - are capable of delivering reliable estimates for strong point source emission rates, given appropriate flight patterns and detailed knowledge of wind conditions.

  5. 一种基于Snell定理反演二维斜界面的几何方法%A geometric algorithm based on Snell theorem for the inclined interface inversion in two-dimensional space

    Institute of Scientific and Technical Information of China (English)

    张义德; 关威

    2011-01-01

    在二维情况下,如果地质结构的分界面为一条有固定斜率的斜线,则反演该界面时所需要确定的参数可以归结为两个:一个是界面上的反射点,另一个是界面的斜率.依据Snell定理,利用源点与反射波最短路径点之间的几何关系,导出一种快速反演斜界面的方法.作为算例,首先利用时域有限差分法对一个二维倾斜界面模型进行了数值模拟,而后利用该方法进行反演,界面位置误差在1%以内.%In two-dimensional space, if an interface of geologic structure has one fixed slope, then only two parameters needs to determined for the inversion of the interface. One is a reflect point in it, and another is the slope. Using the geometrical relationship between the source point and the fastest travel point of the reflect wave, a quick inversion algorithm was gained based on Snell theorem. At last, some examples of numerical simulation were given and it is very good. The inversion data was got from a two-dimensional model with a slope interface using FDTD.

  6. MAMAP – a new spectrometer system for column-averaged methane and carbon dioxide observations from aircraft: retrieval algorithm and first inversions for point source emission rates

    Directory of Open Access Journals (Sweden)

    H. Bovensmann

    2011-09-01

    Full Text Available MAMAP is an airborne passive remote sensing instrument designed to measure the dry columns of methane (CH4 and carbon dioxide (CO2. The MAMAP instrument comprises two optical grating spectrometers: the first observing in the short wave infrared band (SWIR at 1590–1690 nm to measure CO2 and CH4 absorptions, and the second in the near infrared (NIR at 757–768 nm to measure O2 absorptions for reference/normalisation purposes. MAMAP can be operated in both nadir and zenith geometry during the flight. Mounted on an aeroplane, MAMAP surveys areas on regional to local scales with a ground pixel resolution of approximately 29 m × 33 m for a typical aircraft altitude of 1250 m and a velocity of 200 km h−1. The retrieval precision of the measured column relative to background is typically ≲1% (1σ. MAMAP measurements are valuable to close the gap between satellite data, having global coverage but with a rather coarse resolution, on the one hand, and highly accurate in situ measurements with sparse coverage on the other hand. In July 2007, test flights were performed over two coal-fired power plants operated by Vattenfall Europe Generation AG: Jänschwalde (27.4 Mt CO2 yr−1 and Schwarze Pumpe (11.9 Mt CO2 yr−1, about 100 km southeast of Berlin, Germany. By using two different inversion approaches, one based on an optimal estimation scheme to fit Gaussian plume models from multiple sources to the data, and another using a simple Gaussian integral method, the emission rates can be determined and compared with emissions reported by Vattenfall Europe. An extensive error analysis for the retrieval's dry column results (XCO2 and XCH4 and for the two inversion methods has been performed. Both methods – the Gaussian plume model fit and the Gaussian integral method – are capable of deriving

  7. MAMAP – a new spectrometer system for column-averaged methane and carbon dioxide observations from aircraft: retrieval algorithm and first inversions for point source emission rates

    Directory of Open Access Journals (Sweden)

    J. P. Burrows

    2011-04-01

    Full Text Available MAMAP is an airborne passive remote sensing instrument designed for measuring columns of methane (CH4 and carbon dioxide (CO2. The MAMAP instrument consists of two optical grating spectrometers: One in the short wave infrared band (SWIR at 1590–1690 nm to measure CO2 and CH4 absorptions and another one in the near infrared (NIR at 757–768 nm to measure O2 absorptions for reference purposes. MAMAP can be operated in both nadir and zenith geometry during the flight. Mounted on an airplane MAMAP can effectively survey areas on regional to local scales with a ground pixel resolution of about 29 m × 33 m for a typical aircraft altitude of 1250 m and a velocity of 200 km h−1. The retrieval precision of the measured column relative to background is typically ≲ 1% (1σ. MAMAP can be used to close the gap between satellite data exhibiting global coverage but with a rather coarse resolution on the one hand and highly accurate in situ measurements with sparse coverage on the other hand. In July 2007 test flights were performed over two coal-fired powerplants operated by Vattenfall Europe Generation AG: Jänschwalde (27.4 Mt CO2 yr−1 and Schwarze Pumpe (11.9 Mt CO2 yr−1, about 100 km southeast of Berlin, Germany. By using two different inversion approaches, one based on an optimal estimation scheme to fit Gaussian plume models from multiple sources to the data, and another using a simple Gaussian integral method, the emission rates can be determined and compared with emissions as stated by Vattenfall Europe. An extensive error analysis for the retrieval's dry column results (XCO2 and XCH4 and for the two inversion methods has been performed. Both methods – the Gaussian plume model fit and the Gaussian integral method – are capable of delivering reliable estimates for strong point source emission rates, given appropriate flight patterns and detailed knowledge of wind conditions.

  8. MAMAP - a new spectrometer system for column-averaged methane and carbon dioxide observations from aircraft: retrieval algorithm and first inversions for point source emission rates

    Science.gov (United States)

    Krings, T.; Gerilowski, K.; Buchwitz, M.; Reuter, M.; Tretner, A.; Erzinger, J.; Heinze, D.; Pflüger, U.; Burrows, J. P.; Bovensmann, H.

    2011-09-01

    MAMAP is an airborne passive remote sensing instrument designed to measure the dry columns of methane (CH4) and carbon dioxide (CO2). The MAMAP instrument comprises two optical grating spectrometers: the first observing in the short wave infrared band (SWIR) at 1590-1690 nm to measure CO2 and CH4 absorptions, and the second in the near infrared (NIR) at 757-768 nm to measure O2 absorptions for reference/normalisation purposes. MAMAP can be operated in both nadir and zenith geometry during the flight. Mounted on an aeroplane, MAMAP surveys areas on regional to local scales with a ground pixel resolution of approximately 29 m × 33 m for a typical aircraft altitude of 1250 m and a velocity of 200 km h-1. The retrieval precision of the measured column relative to background is typically ≲ 1% (1σ). MAMAP measurements are valuable to close the gap between satellite data, having global coverage but with a rather coarse resolution, on the one hand, and highly accurate in situ measurements with sparse coverage on the other hand. In July 2007, test flights were performed over two coal-fired power plants operated by Vattenfall Europe Generation AG: Jänschwalde (27.4 Mt CO2 yr-1) and Schwarze Pumpe (11.9 Mt CO2 yr-1), about 100 km southeast of Berlin, Germany. By using two different inversion approaches, one based on an optimal estimation scheme to fit Gaussian plume models from multiple sources to the data, and another using a simple Gaussian integral method, the emission rates can be determined and compared with emissions reported by Vattenfall Europe. An extensive error analysis for the retrieval's dry column results (XCO2 and XCH4) and for the two inversion methods has been performed. Both methods - the Gaussian plume model fit and the Gaussian integral method - are capable of deriving estimates for strong point source emission rates that are within ±10% of the reported values, given appropriate flight patterns and detailed knowledge of wind conditions.

  9. A robust behavior of Feed Forward Back propagation algorithm of Artificial Neural Networks in the application of vertical electrical sounding data inversion

    Directory of Open Access Journals (Sweden)

    Y. Srinivas

    2012-09-01

    Full Text Available The applications of intelligent techniques have increased exponentially in recent days to study most of the non-linear parameters. In particular, the behavior of earth resembles the non-linearity applications. An efficient tool is needed for the interpretation of geophysical parameters to study the subsurface of the earth. Artificial Neural Networks (ANN perform certain tasks if the structure of the network is modified accordingly for the purpose it has been used. The three most robust networks were taken and comparatively analyzed for their performance to choose the appropriate network. The single-layer feed-forward neural network with the back propagation algorithm is chosen as one of the well-suited networks after comparing the results. Initially, certain synthetic data sets of all three-layer curves have been taken for training the network, and the network is validated by the field datasets collected from Tuticorin Coastal Region (78°7′30"E and 8°48′45"N, Tamil Nadu, India. The interpretation has been done successfully using the corresponding learning algorithm in the present study. With proper training of back propagation networks, it tends to give the resistivity and thickness of the subsurface layer model of the field resistivity data concerning the synthetic data trained earlier in the appropriate network. The network is trained with more Vertical Electrical Sounding (VES data, and this trained network is demonstrated by the field data. Groundwater table depth also has been modeled.

  10. 基于改进遗传算法的BISQ模型多参数反演方法研究%The methodological study of multi-inversion of BISQ mold parameters based on modified genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    吴涛; 李红星; 陶春辉; 顾春华

    2012-01-01

    BISQ mold inversion has vast vista application and practical value in the exploration of ocean oil and gas resources,and Marine seismic survey fields. Intending to solve the problem of parameters inversion for BISQ mold with high dimensional parameters and multimodal function, based on the traditional genetic algorithm, this paper added and inseted the global best mechanism, the Boltzmann existent mechanism, the DC drifting of niching technology,the idea of catastrophe of population, and other methods and techniques . The modified combined genetic algorithm, used in a high dimensional parameters and inversion problem with multimodal function, can help to get global optimal values. Using the method introduced in this paper,and combining with the in-situ experimental data of multi-frequency acoustic velocities of submarine sediment, have got the parameters values which well compared with the acoustic velocities,and obtained a satisfied results.%BISQ模型反演在油气资源与海洋地震勘探中具有广阔的应用前景与实用价值.为解决具高维参数与多峰值的BISQ模型参数反演问题,本文在传统的遗传算法基础上添加插入了全局保优机制、Boltzmann生存机制、小生境之DC漂移技术和群体灾变等方法与技术,使改进组合的遗传算法能在高维参数与多峰值的反问题中搜索得到全局最优解.结合海底多频原位沉积物声学测量数据,应用本文方法,得到了与声波传播速度相似性最优模型的各参数值,效果明显.

  11. 基于Hooke—Jeeves算法的渤海现今应力场优化反演%OPTIMIZATION INVERSION OF THE PRESENT GROUND STRESS FIELD OF BOHAI SEA BASED ON HOOKE-JEEVES ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    解秋红; 刘保华; 李西双; 刘晨光; 裴彦良; 华清峰

    2012-01-01

    An optimization inversion model of 3D ground stress field of the Bohai Sea was established based on the in-situ stress data from the existing measuring points in the study area and the analyses of tectonic evolution background and characteristics of Bohai Sea. By comparing the stress values and directions obtained at measuring points by means of finite element method with the in-situ measured data, an error function was established and taken as the optimization object function. The optimization inversion analysis was carried out by combining the Hooke-Jeeves optimization algorithm and the finite element method. The optimization inversion calculation process was completed by taking the finite element analysis program ANSYS as a calculation module and calling circularly the batch model through the Matlab platform, thus obtaining the distribution law of the present shallow ground stress field in Bohai Sea. The research results have shown that the method presented in the paper can be used to inverse a more reasonable stress field distribution by using the data from less measuring points, thus offering a reference for further study of the tectonic activity in Bohai Sea.%在分析渤海构造演化背景和地质构造特征的基础上,根据区域内已有测点的地应力资料,建立渤海三维应力场优化反演分析模型。通过由有限元法得到的测点处应力值大小及方向与现场实际数据的比较,构建误差函数作为优化目标函数,采用Hooke.Jeeves优化算法与有限元计算相结合的方法进行优化反演分析,将ANSYS有限元程序作为一个计算模块并通过Matlab实现其批处理模式下的循环调用,完成优化反演计算过程,得到了渤海浅部的现今应力场分布规律。优化结果分析表明,该文方法可以通过较少的测点数据优化反演得到较合理的构造应力分布,能够为进一步研究渤海海域现今构造活动提供一定参考。

  12. A 3D algorithm based on the combined inversion of Rayleigh and Love waves for imaging and monitoring of shallow structures

    Science.gov (United States)

    Pilz, Marco; Parolai, Stefano; Woith, Heiko

    2017-01-01

    SUMMARYIn recent years there has been increasing interest in the study of seismic noise interferometry as it can provide a complementary approach to active source or earthquake based methods for imaging and continuous monitoring the shallow structure of the Earth. This meaningful information is extracted from wavefields propagating between those receiver positions at which seismic noise was recorded. Until recently, noise-based imaging relied mostly on Rayleigh waves. However, considering similar wavelengths, a combined use of Rayleigh and Love wave tomography can succeed in retrieving velocity heterogeneities at depth due to their different sensitivity kernels. Here we present a novel one-step algorithm for simultaneously inverting Rayleigh and Love wave dispersion data aiming at identifying and describing complex 3D velocity structures. The algorithm may help to accurately and efficiently map the shear-wave velocities and the Poisson ratio of the surficial soil layers. In the high-frequency range, the scattered part of the correlation functions stabilizes sufficiently fast to provide a reliable estimate of the velocity structure not only for imaging purposes but also allows for changes in the medium properties to be monitored. Such monitoring can be achieved with a high spatial resolution in 3D and with a time resolution as small as a few hours. In this article, we describe a recent array experiment in a volcanic environment in Solfatara (Italy) and we show that this novel approach has identified strong velocity variations at the interface between liquids and gas-dominated reservoirs, allowing localizing a region which is highly dynamic due to the interaction between the deep convection and its surroundings.

  13. Pseudo waveform inversion

    Energy Technology Data Exchange (ETDEWEB)

    Shin, Chang Soo; Park, Keun Pil [Korea Inst. of Geology Mining and Materials, Taejon (Korea, Republic of); Suh, Jung Hee; Hyun, Byung Koo; Shin, Sung Ryul [Seoul National University, Seoul (Korea, Republic of)

    1995-12-01

    The seismic reflection exploration technique which is one of the geophysical methods for oil exploration became effectively to image the subsurface structure with rapid development of computer. However, the imagining of subsurface based on the conventional data processing is almost impossible to obtain the information on physical properties of the subsurface such as velocity and density. Since seismic data are implicitly function of velocities of subsurface, it is necessary to develop the inversion method that can delineate the velocity structure using seismic topography and waveform inversion. As a tool to perform seismic inversion, seismic forward modeling program using ray tracing should be developed. In this study, we have developed the algorithm that calculate the travel time of the complex geologic structure using shooting ray tracing by subdividing the geologic model into blocky structure having the constant velocity. With the travel time calculation, the partial derivatives of travel time can be calculated efficiently without difficulties. Since the current ray tracing technique has a limitation to calculate the travel times for extremely complex geologic model, our aim in the future is to develop the powerful ray tracer using the finite element technique. After applying the pseudo waveform inversion to the seismic data of Korea offshore, we can obtain the subsurface velocity model and use the result in bring up the quality of the seismic data processing. If conventional seismic data processing and seismic interpretation are linked with this inversion technique, the high quality of seismic data processing can be expected to image the structure of the subsurface. Future research area is to develop the powerful ray tracer of ray tracing which can calculate the travel times for the extremely complex geologic model. (author). 39 refs., 32 figs., 2 tabs.

  14. Comparaison de quelques algorithmes d'inversion matricielle sur le calculateur CRAY 1 Comparison of Some Matrix Solvers on a Cray 1 Computer

    Directory of Open Access Journals (Sweden)

    Quandalle P.

    2006-11-01

    Full Text Available Cet article est une étude comparative de différentes méthodes itératives de résolution matricielle sur le calc-lateur CRAY 1. Les différentes méthodes retenues sont des méthodes qui ont déjà été décrites dans la littérature pétrolière, mais dont la structure (plus ou moins vectorisable leur confère un regain d'intérêt sur des calculateurs tels que le CRAY 1 ou le CYBER 205. Le contexte dans lequel nous nous plaçons est celui de la simulation d'un écoulement triphasique et tridimensionnel en milieu poreux sur un modèle de type Black Oil. Nous supposerons que les équations qui décrivent l'écoulement sont discrétisées par la méthode des différences finies utilisant un schéma à cinq points [1]. Les algorithmes que nous allons étudier sont dérivés de trois méthodes, la méthode de Surrelaxation par blocks, la Strong lmplicit Procedure, et la méthode Orthomin. A l'aide d'exemples, nous essaierons de dégager des informations tant sur leur rapidité d'exécution que sur la qualité de leur solution. This article makes a comparative study of different iterative methods for matrix solving on a CRAY 1 computer. The selected methods have been described in the petroleum litterature but are such that their (more or less vectorizable structure makes them of renewed interest with computers such as the CRAY 1 or CYBER 205. The context dealt with here is that of simulating a three-phase three-dimensional flow in a porous medium on a Black Oil model. We assume that the equations describing the flow are discretized by the finite-difference method using a five-spot pattern. The algorithme we are going to investigate are derived from three methods : the Block Successive Over Relaxation method, the Strong Implicit Procedure, and the Orthomin method. Examples will be used to bring out information on both their execution speed and the quality of their solution.

  15. Multidimensional NMR Inversion without Kronecker Products: Multilinear Inversion

    CERN Document Server

    Medellín, David; Torres-Verdín, Carlos

    2016-01-01

    Multidimensional NMR inversion using Kronecker products poses several challenges. First, kernel compression is only possible when the kernel matrices are separable, and in recent years, there has been an increasing interest in NMR sequences with non-separable kernels. Second, in three or more dimensions, the singular value decomposition is not unique; therefore kernel compression is not well-defined for higher dimensions. Without kernel compression, the Kronecker product yields matrices that require large amounts of memory, making the inversion intractable for personal computers. Finally, incorporating arbitrary regularization terms is not possible using the Lawson-Hanson (LH) or the Butler-Reeds-Dawson (BRD) algorithms. We develop a minimization-based inversion method that circumvents the above problems by using multilinear forms to perform multidimensional NMR inversion without using kernel compression or Kronecker products. The new method is memory efficient, requiring less than 0.1% of the memory required...

  16. Comparison between GPR measurements and ultrasonic tomography with different inversion algorithms: an application to the base of an ancient Egyptian sculpture

    Science.gov (United States)

    Sambuelli, L.; Bohm, G.; Capizzi, P.; Cardarelli, E.; Cosentino, P.

    2011-09-01

    By late 2008 one of the most important pieces of the 'Museo delle Antichità Egizie' of Turin, the sculpture of the Pharaoh with god Amun, was planned to be one of the masterpieces of a travelling exhibition in Japan. The 'Fondazione Museo delle Antichità Egizie di Torino', who manages the museum, was concerned with the integrity of the base of the statue which actually presents visible signs of restoration dating back to the early 19th century. It was required to estimate the persistence of the visible fractures, to search for unknown ones and to provide information about the overall mechanical strength of the base. To tackle the first question a GPR reflection survey along three sides of the base was performed and the results were assembled in a 3D rendering. As far as the second question is concerned, two parallel, horizontal ultrasonic 2D tomograms across the base were made. We acquired, for each section, 723 ultrasonic signals corresponding to different transmitter and receiver positions. The tomographic data were inverted using four different software packages based upon different algorithms. The obtained velocity images were then compared each other, with the GPR results and with the visible fractures in the base. A critical analysis of the comparisons is finally presented.

  17. Inverse methods for radiation transport

    Science.gov (United States)

    Bledsoe, Keith C.

    Implicit optimization methods for solving the inverse transport problems of interface location identification, source isotope weight fraction identification, shield material identification, and material mass density identification are explored. Among these optimization methods are the Schwinger inverse method, Levenberg-Marquardt method, and evolutionary algorithms. Inverse problems are studied in one-dimensional spherical and two-dimensional cylindrical geometries. The scalar fluxes of unscattered gamma-ray lines, leakages of neutron-induced gamma-ray lines, and/or neutron multiplication in the system are assumed to be measured. Each optimization method is studied on numerical test problems in which the measured data is simulated using the same deterministic transport code used in the optimization process (assuming perfectly consistent measurements) and using a Monte Carlo code (assuming less-consistent, more realistic measurements). The Schwinger inverse method and Levenberg-Marquardt methods are found to be successful for problems with relatively few (i.e. 4 or fewer) unknown parameters, with the former being the best for unknown isotope problems and the latter being more adept at interface location, unknown material mass density, and mixed parameter problems. A study of a variety of evolutionary algorithms indicates that the differential evolution method is the best for inverse transport problems, and outperforms the Levenberg-Marquardt method on problems with large numbers of unknowns. An algorithm created by combining different variants of the differential evolution method is shown to be highly successful on spherical problems with unscattered gamma-ray lines, while a basic differential evolution approach is more useful for problems with scattering and in cylindrical geometries. A hybrid differential evolution/Levenberg-Marquardt algorithm also was found to show promise for fast and robust solution of inverse problems.

  18. Iterative optimization in inverse problems

    CERN Document Server

    Byrne, Charles L

    2014-01-01

    Iterative Optimization in Inverse Problems brings together a number of important iterative algorithms for medical imaging, optimization, and statistical estimation. It incorporates recent work that has not appeared in other books and draws on the author's considerable research in the field, including his recently developed class of SUMMA algorithms. Related to sequential unconstrained minimization methods, the SUMMA class includes a wide range of iterative algorithms well known to researchers in various areas, such as statistics and image processing. Organizing the topics from general to more

  19. Distributed evolutionary algorithms for inverse design problems of airfoil in aerodynamics%分布式进化算法及其在翼型气动反设计中的应用

    Institute of Scientific and Technical Information of China (English)

    王江峰; 伍贻兆; Periaux J

    2003-01-01

    New parallel hierarchical multi-objective optimization approaches based on Genetic Algorithms (GAs) with Nash scenarios of Game Theory (GT) are investigated for solving inverse multi-element airfoil design problems in aerodynamics on distributed parallel environments. A multi-objective optimization methodology presented here relies on binary coded GAs and coupled with GT. The design variables of such optimization problems are split among several players, the global multi-criterion optimization problem being replaced by several sub optimizations operating in the decomposed search space. A shape/position reconstruction problem (inverse problem) for a multi-element airfoil in compressible potential flow is solved using Parallel Hierarchical GAs coupled a Nash game with a hierarchy based on unstructured meshes. Numerical results, compared with sequential algorithms, show that parallel hierarchical GAs combined with Nash strategy are more efficient and robust than simple GAs and this method could be used with high efficiency for complex multi-criteria optimization problems in aerodynamics.%构造了一种新型基于基因算法与博弈论的并行分级多目标优化方法,并应用于多段翼型气动反设计.此方法基于二进制编码的基因算法和博弈论,优化变量被分配给不同的博弈者,因而总体优化问题转变为分裂空间中的局部优化问题.文中给出了一个多段翼型形状/位置可压位流的反设计问题的求解算例,引入了基于非结构网格的分级结构.与传统基因算法数值算例的对比表明了本文构造的并行分级算法具有较高的计算效率,可广泛应用于多目标优化问题.

  20. Analysis of fast optimization algorithm for inverse detecting faulty insulators%逆向诊断劣质绝缘子的快速优化算法分析

    Institute of Scientific and Technical Information of China (English)

    张占龙; 彭孟杰; 李德文; 周军; 唐炬; 范康林

    2012-01-01

    针对劣质绝缘子电场逆问题计算量大的缺点,在传统模拟电荷法建模的基础之上采用快速多极子算法对其进行预处理,给出了基本计算原理,并采用Tikhonov正则化方法处理因测量数据干扰引起的逆问题解的不适定性,以及采用牛顿迭代法搜索逆问题的最优解,得到绝缘子模型的场源参数,从而实现对劣质绝缘子的检测。通过构造基本点电荷系模型对该快速优化算法进行可行性验证,最后将该算法应用于110kV猫头型三相绝缘子串的一相绝缘子进行了实例计算,结果表明:该快速优化算法能够快速有效地实现对劣质绝缘子的在线诊断。%In order to improve the computational efficiency of the insulator electric field inverse problem,the fast multi-pole method has been introduced to the traditional simulation charge method.Tikhonov regularization is used to process the ill-posed characteristic of inverse problem solution caused by the interference.Newton method is used to search the optimum solution,and then the actual field source parameters of insulators and the practical voltage distribution on the surface of the insulators can be obtained.The fast optimization algorithm has been verified in point charge model.And 110 kV insulator string is carried out to demonstrate that the fast optimization algorithm is much faster and more efficient than traditional method.

  1. 基于自适应收缩可行域的遗传算法反演TEM导电薄层%Application of the Adaptive Shrinkage Genetic Algorithm in the Feasible Region to TEM Conductive Thin Layer Inversion

    Institute of Scientific and Technical Information of China (English)

    李貅; 薛国强; 宋建平; 郭文波; 武军杰; 沈梅芳

    2005-01-01

    将自适应收缩可行域的遗传算法与视纵向电导微分成像法相结合,反演瞬变电磁测深中的导电薄层,计算结果证明:该算法通过对可行域的自适应收缩,加快了计算速度、提高了计算精度;并在一定程度上克服了瞬变电磁测深的等值性,缩小了等值范围.通过对导电薄层模型的模拟计算和实例分析,并与常规反演曲线进行对比,使用本法反演成像的结果,明显地显示出导电薄层的存在.%Combining the adaptive shrinkage genetic algorithm in the feasible region with the imaging of apparent vertical conductance differential, we have inverted the TEM conductive thin layer. The result of the inversion demonstrates that by adaptive shrinkage in the feasible region, the calculation speed accelerates and the calculation precision improves.To a certain extent, in this method we surmount the transient electromagnetic sounding equivalence and reduced equivalence scope. Comparison of the inverted result with the forward curve clearly shows that we can image the conductive thin layer.

  2. Neural Network-Based Hyperspectral Algorithms

    Science.gov (United States)

    2016-06-07

    Neural Network-Based Hyperspectral Algorithms Walter F. Smith, Jr. and Juanita Sandidge Naval Research Laboratory Code 7340, Bldg 1105 Stennis Space...our effort is development of robust numerical inversion algorithms , which will retrieve inherent optical properties of the water column as well as...validate the resulting inversion algorithms with in-situ data and provide estimates of the error bounds associated with the inversion algorithm . APPROACH

  3. Voxel inversion of airborne EM data

    DEFF Research Database (Denmark)

    Fiandaca, Gianluca G.; Auken, Esben; Christiansen, Anders Vest C A.V.C.;

    2013-01-01

    We present a geophysical inversion algorithm working directly in a voxel grid disconnected from the actual measuring points, which allows for straightforward integration of different data types in joint inversion, for informing geological/hydrogeological models directly and for easier incorporation...... for jointly inverting airborne and ground-based geophysical data. Furthermore, geological and groundwater models most often refer to a regular voxel grid not correlated to the geophysical model space, and incorporating the geophysical data into the geological/hydrological modelling grids is problematic. We...... present a voxel grid inversion routine that overcomes these problems and we discuss in detail the algorithm implementation....

  4. New focused crawling algorithm

    Institute of Scientific and Technical Information of China (English)

    Su Guiyang; Li Jianhua; Ma Yinghua; Li Shenghong; Song Juping

    2005-01-01

    Focused carawling is a new research approach of search engine. It restricts information retrieval and provides search service in specific topic area. Focused crawling search algorithm is a key technique of focused crawler which directly affects the search quality. This paper first introduces several traditional topic-specific crawling algorithms, then an inverse link based topic-specific crawling algorithm is put forward. Comparison experiment proves that this algorithm has a good performance in recall, obviously better than traditional Breadth-First and Shark-Search algorithms. The experiment also proves that this algorithm has a good precision.

  5. Bayesian approach to inverse statistical mechanics.

    Science.gov (United States)

    Habeck, Michael

    2014-05-01

    Inverse statistical mechanics aims to determine particle interactions from ensemble properties. This article looks at this inverse problem from a Bayesian perspective and discusses several statistical estimators to solve it. In addition, a sequential Monte Carlo algorithm is proposed that draws the interaction parameters from their posterior probability distribution. The posterior probability involves an intractable partition function that is estimated along with the interactions. The method is illustrated for inverse problems of varying complexity, including the estimation of a temperature, the inverse Ising problem, maximum entropy fitting, and the reconstruction of molecular interaction potentials.

  6. Inverse Kinematics of a Serial Robot

    Directory of Open Access Journals (Sweden)

    Amici Cinzia

    2016-01-01

    Full Text Available This work describes a technique to treat the inverse kinematics of a serial manipulator. The inverse kinematics is obtained through the numerical inversion of the Jacobian matrix, that represents the equation of motion of the manipulator. The inversion is affected by numerical errors and, in different conditions, due to the numerical nature of the solver, it does not converge to a reasonable solution. Thus a soft computing approach is adopted to mix different traditional methods to obtain an increment of algorithmic convergence.

  7. Topological inverse semigroups

    Institute of Scientific and Technical Information of China (English)

    ZHU Yongwen

    2004-01-01

    That the projective limit of any projective system of compact inverse semigroups is also a compact inverse semigroup,the injective limit of any injective system of inverse semigroups is also an inverse semigroup, and that a compact inverse semigroup is topologically isomorphic to a strict projective limit of compact metric inverse semigroups are proved. It is also demonstrated that Horn (S,T) is a topological inverse semigroup provided that S or T is a topological inverse semigroup with some other conditions. Being proved by means of the combination of topological semigroup theory with inverse semigroup theory,all these results generalize the corresponding ones related to topological semigroups or topological groups.

  8. Two-wavelength lidar inversion algorithm

    NARCIS (Netherlands)

    Kunz, G.J.

    1999-01-01

    Potter [Appl. Opt. 26, 1250 (1987)] has presented a method to determine profiles of the atmospheric aerosol extinction coefficients by use of a two-wavelength lidar with the assumptions of a constant value for the extinction-to-backscatter ratio for each wavelength and a constant value for the ratio

  9. Exploring the Hamiltonian inversion landscape.

    Science.gov (United States)

    Donovan, Ashley; Rabitz, Herschel

    2014-08-07

    The identification of quantum system Hamiltonians through the use of experimental data remains an important research goal. Seeking a Hamiltonian that is consistent with experimental measurements constitutes an excursion over a Hamiltonian inversion landscape, which is the quality of reproducing the data as a function of the Hamiltonian parameters. Recent theoretical work showed that with sufficient experimental data there should be local convexity about the true Hamiltonian on the landscape. The present paper builds on this result and performs simulations to test whether such convexity is observed. A gradient-based Hamiltonian search algorithm is incorporated into an inversion routine as a means to explore the local inversion landscape. The simulations consider idealized noise-free as well as noise-ridden experimental data. The results suggest that a sizable convex domain exists about the true Hamiltonian, even with a modest amount of experimental data and in the presence of a reasonable level of noise.

  10. Inverse imbalance reconstruction in rotordynamics

    Energy Technology Data Exchange (ETDEWEB)

    Ramlau, R. [Austrian Academy of Sciences, Linz (Austria). Johann Radon Inst. for Computational and Applied Mathematics; Dicken, V. [MeVis GmbH, Bremen (Germany); Maass, P. [Bremen Univ. (Germany). Zentrum fuer Technomathematik; Streller, C. [Rolls-Royce Germany GmbH, Dahlewitz (Germany); Rienaecker, A. [MTU Aero Engines GmbH, Muenchen (Germany)

    2006-05-15

    The goal of this work is to establish and compare algorithms for inverse imbalance reconstruction in aircraft turbines. Such algorithms are based on a validated whole engine model of a turbo engine under consideration. Base on the model, the impact of an imbalance distribution on the vibration behaviour of the turbine can be described as a matrix-vector multiplication Af = g, where f is the imbalance distribution and g the vibration response. It turns out that the matrix A is very ill-conditioned. As the measured data is highly affected with noise, we have to use regularization methods in order to stabilize the inversion. Our main interest was in the use of nonlinear regularization methods, in particular nonlinear filtered singular value decomposition and conjugate gradient regularization. (orig.)

  11. Multidimensional NMR inversion without Kronecker products: Multilinear inversion

    Science.gov (United States)

    Medellín, David; Ravi, Vivek R.; Torres-Verdín, Carlos

    2016-08-01

    Multidimensional NMR inversion using Kronecker products poses several challenges. First, kernel compression is only possible when the kernel matrices are separable, and in recent years, there has been an increasing interest in NMR sequences with non-separable kernels. Second, in three or more dimensions, the singular value decomposition is not unique; therefore kernel compression is not well-defined for higher dimensions. Without kernel compression, the Kronecker product yields matrices that require large amounts of memory, making the inversion intractable for personal computers. Finally, incorporating arbitrary regularization terms is not possible using the Lawson-Hanson (LH) or the Butler-Reeds-Dawson (BRD) algorithms. We develop a minimization-based inversion method that circumvents the above problems by using multilinear forms to perform multidimensional NMR inversion without using kernel compression or Kronecker products. The new method is memory efficient, requiring less than 0.1% of the memory required by the LH or BRD methods. It can also be extended to arbitrary dimensions and adapted to include non-separable kernels, linear constraints, and arbitrary regularization terms. Additionally, it is easy to implement because only a cost function and its first derivative are required to perform the inversion.

  12. Algorithm 865

    DEFF Research Database (Denmark)

    Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy

    2007-01-01

    variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel......We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n + 1)/2 real...

  13. Rapid Inversion Imaging Techniques for Deep Transient Electromagnetic Sounding Data

    Institute of Scientific and Technical Information of China (English)

    ChenBenchi; Shaomin; HeZhanxiang; LiuHong

    2003-01-01

    This paper introduces two types of rapid inversion imaging techniques for long offset transient electromagnetic sounding: namely S-inversing algorithm based on the conductive sheet model and quasi-wave equation based on wavefield transform. The corresponding software was developed with VC++. Application of the algorithms to the processing of the real Lotem data from the western part of China proved that two the algorithms and the developed software package are effective, fast and stable.

  14. Improvement of Tourism Information Resources Index Algorithm Based on Inverse Model%改进的基于逆模型的旅游信息资源索引算法

    Institute of Scientific and Technical Information of China (English)

    林烨秋; 张运波

    2015-01-01

    在云计算构建下实现对旅游信息的优化调度,提高旅游资源数据的开发和利用效率。传统的旅游信息资源采用经验模态分解的调度算法,通过人工分区实现信息资源的调度模型具有随机性和无组织性,资源分配效率不高。提出一种基于逆模型参数预失真估计的云计算架构下旅游信息资源优化调度模型。设计旅游资源信息调度网络,云计算构架的逆模型网络结构采用BP网络的输出结构,训练包括前向传播信息,反向传播误差两个过程。设计循环堆栈的约束指向矢量,使旅游资源信息调度网络的路由节点的资源分配输出误差最小。采用三亚的5个旅游景点作为研究对象,以2003~2014年度的游客数据作为模型参量,仿真结果表明,模型对旅游资源的融合性能较好,有效剔除簇内非相干数据,提高数据融合效率,分层调度融合度能达到90%以上,优化调度性能优越。%To realize the optimization of scheduling in cloud computing on tourism information construction, improve the de⁃velopment of tourism resources and the utilization efficiency of data. Scheduling algorithm of empirical mode decomposition using traditional tourism information resources, through the scheduling model of artificial partition to realize information re⁃source is random and has no organization, resource allocation efficiency is not high. Presented a method for calculating the tourism information resource optimization scheduling model under the framework of distortion estimation inverse model pa⁃rameters based on pre cloud. Design of tourist resources information scheduling network, output structure of cloud inverse network structure model computing architectures using BP network, training including prior to the dissemination of informa⁃tion. Using 5 tourist attractions in Sanya as the research object, to 2003~2014 annual visitors data as the model parame

  15. Workflows for Full Waveform Inversions

    Science.gov (United States)

    Boehm, Christian; Krischer, Lion; Afanasiev, Michael; van Driel, Martin; May, Dave A.; Rietmann, Max; Fichtner, Andreas

    2017-04-01

    Despite many theoretical advances and the increasing availability of high-performance computing clusters, full seismic waveform inversions still face considerable challenges regarding data and workflow management. While the community has access to solvers which can harness modern heterogeneous computing architectures, the computational bottleneck has fallen to these often manpower-bounded issues that need to be overcome to facilitate further progress. Modern inversions involve huge amounts of data and require a tight integration between numerical PDE solvers, data acquisition and processing systems, nonlinear optimization libraries, and job orchestration frameworks. To this end we created a set of libraries and applications revolving around Salvus (http://salvus.io), a novel software package designed to solve large-scale full waveform inverse problems. This presentation focuses on solving passive source seismic full waveform inversions from local to global scales with Salvus. We discuss (i) design choices for the aforementioned components required for full waveform modeling and inversion, (ii) their implementation in the Salvus framework, and (iii) how it is all tied together by a usable workflow system. We combine state-of-the-art algorithms ranging from high-order finite-element solutions of the wave equation to quasi-Newton optimization algorithms using trust-region methods that can handle inexact derivatives. All is steered by an automated interactive graph-based workflow framework capable of orchestrating all necessary pieces. This naturally facilitates the creation of new Earth models and hopefully sparks new scientific insights. Additionally, and even more importantly, it enhances reproducibility and reliability of the final results.

  16. Inverse Folding of RNA Pseudoknot Structures

    CERN Document Server

    Gao, James Z M; Reidys, Christian M

    2010-01-01

    Background: RNA exhibits a variety of structural configurations. Here we consider a structure to be tantamount to the noncrossing Watson-Crick and \\pairGU-base pairings (secondary structure) and additional cross-serial base pairs. These interactions are called pseudoknots and are observed across the whole spectrum of RNA functionalities. In the context of studying natural RNA structures, searching for new ribozymes and designing artificial RNA, it is of interest to find RNA sequences folding into a specific structure and to analyze their induced neutral networks. Since the established inverse folding algorithms, {\\tt RNAinverse}, {\\tt RNA-SSD} as well as {\\tt INFO-RNA} are limited to RNA secondary structures, we present in this paper the inverse folding algorithm {\\tt Inv} which can deal with 3-noncrossing, canonical pseudoknot structures. Results: In this paper we present the inverse folding algorithm {\\tt Inv}. We give a detailed analysis of {\\tt Inv}, including pseudocodes. We show that {\\tt Inv} allows to...

  17. Inverse Distance Weighted Interpolation Involving Position Shading

    OpenAIRE

    Li, Zhengquan; WU Yaoxiang

    2015-01-01

    Considering the shortcomings of inverse distance weighted (IDW) interpolation in practical applications, this study improved the IDW algorithm and put forward a new spatial interpolation method that named as adjusted inverse distance weighted (AIDW). In interpolating process, the AIDW is capable of taking into account the comprehensive influence of distance and position of sample point to interpolation point, by adding a coefficient (K) into the normal IDW formula. The coefficient (K) is used...

  18. Locally Inverse Semigroups with Inverse Transversals

    Institute of Scientific and Technical Information of China (English)

    SHAO Yong; ZHAO Xian Zhong

    2009-01-01

    Let S be a locally inverse semigroup with an inverse transversal S°. In this paper, we construct an amenable partial order on S by an R-cone. Conversely, every amenable partial order on S can be constructed in this way. We give some properties of a locally inverse semigroup with a Clifford transversal. In particular, if S is a locally inverse semigroup with a Clifford transversal, then there is an order-preserving bijection from the set of all amenable partial orders on S to the set of all R-cones of S.

  19. Source-independent elastic waveform inversion using a logarithmic wavefield

    KAUST Repository

    Choi, Yun Seok

    2012-01-01

    The logarithmic waveform inversion has been widely developed and applied to some synthetic and real data. In most logarithmic waveform inversion algorithms, the subsurface velocities are updated along with the source estimation. To avoid estimating the source wavelet in the logarithmic waveform inversion, we developed a source-independent logarithmic waveform inversion algorithm. In this inversion algorithm, we first normalize the wavefields with the reference wavefield to remove the source wavelet, and then take the logarithm of the normalized wavefields. Based on the properties of the logarithm, we define three types of misfit functions using the following methods: combination of amplitude and phase, amplitude-only, and phase-only. In the inversion, the gradient is computed using the back-propagation formula without directly calculating the Jacobian matrix. We apply our algorithm to noise-free and noise-added synthetic data generated for the modified version of elastic Marmousi2 model, and compare the results with those of the source-estimation logarithmic waveform inversion. For the noise-free data, the source-independent algorithms yield velocity models close to true velocity models. For random-noise data, the source-estimation logarithmic waveform inversion yields better results than the source-independent method, whereas for coherent-noise data, the results are reversed. Numerical results show that the source-independent and source-estimation logarithmic waveform inversion methods have their own merits for random- and coherent-noise data. © 2011.

  20. A Single Software For Processing, Inversion, And Presentation Of Aem Data Of Different Systems

    DEFF Research Database (Denmark)

    Auken, Esben; Christiansen, Anders Vest; Viezzoli, Andrea

    2009-01-01

    modeling and Spatial Constrained inversion (SCI) for quasi 3-D inversion. The Workbench implements a user friendly interface to these algorithms enabling non-geophysicists to carry out inversion of complicated airborne data sets without having in-depth knowledge about how the algorithm actually works. Just...

  1. Efficient 2d full waveform inversion using Fortran coarray

    Science.gov (United States)

    Ryu, Donghyun; Kim, ahreum; Ha, Wansoo

    2016-04-01

    We developed a time-domain seismic inversion program using the coarray feature of the Fortran 2008 standard to parallelize the algorithm. We converted a 2d acoustic parallel full waveform inversion program with Message Passing Interface (MPI) to a coarray program and examined performance of the two inversion programs. The results show that the speed of the waveform inversion program using the coarray is slightly faster than that of the MPI version. The standard coarray lacks features for collective communication; however, it can be improved in following standards since it is introduced recently. The parallel algorithm can be applied for 3D seismic data processing.

  2. The inverse maximum dynamic flow problem

    Institute of Scientific and Technical Information of China (English)

    BAGHERIAN; Mehri

    2010-01-01

    We consider the inverse maximum dynamic flow (IMDF) problem.IMDF problem can be described as: how to change the capacity vector of a dynamic network as little as possible so that a given feasible dynamic flow becomes a maximum dynamic flow.After discussing some characteristics of this problem,it is converted to a constrained minimum dynamic cut problem.Then an efficient algorithm which uses two maximum dynamic flow algorithms is proposed to solve the problem.

  3. Monte Carlo Hamiltonian:Inverse Potential

    Institute of Scientific and Technical Information of China (English)

    LUO Xiang-Qian; CHENG Xiao-Ni; Helmut KR(O)GER

    2004-01-01

    The Monte Carlo Hamiltonian method developed recently allows to investigate the ground state and low-lying excited states of a quantum system,using Monte Carlo(MC)algorithm with importance sampling.However,conventional MC algorithm has some difficulties when applied to inverse potentials.We propose to use effective potential and extrapolation method to solve the problem.We present examples from the hydrogen system.

  4. INVERSE CENTER LOCATION PROBLEM ON A TREE

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints.The authors first show that the problem can be formulated as a series of combinatorial linear programs,then an O(|V|2 log |V|)time algorithm to solve the problem is presented.For the equal cost case,the authors further give an O(|V|)time algorithm.

  5. Inverse anticipating chaos synchronization.

    Science.gov (United States)

    Shahverdiev, E M; Sivaprakasam, S; Shore, K A

    2002-07-01

    We derive conditions for achieving inverse anticipating synchronization where a driven time-delay chaotic system synchronizes to the inverse future state of the driver. The significance of inverse anticipating chaos in delineating synchronization regimes in time-delay systems is elucidated. The concept is extended to cascaded time-delay systems.

  6. Locative Inversion in Cantonese.

    Science.gov (United States)

    Mok, Sui-Sang

    This study investigates the phenomenon of "Locative Inversion" in Cantonese. The term "Locative Inversion" indicates that the locative phrase (LP) syntactic process in Cantonese and the appears at the sentence-initial position and its logical subject occurs postverbally. It is demonstrated that this Locative Inversion is a…

  7. Image Fusion for Travel Time Tomography Inversion

    Directory of Open Access Journals (Sweden)

    Liu Linan

    2015-09-01

    Full Text Available The travel time tomography technology had achieved wide application, the hinge of tomography was inversion algorithm, the ray path tracing technology had a great impact on the inversion results. In order to improve the SNR of inversion image, comprehensive utilization of inversion results with different ray tracing can be used. We presented an imaging fusion method based on improved Wilkinson iteration method. Firstly, the shortest path method and the linear travel time interpolation were used for forward calculation; then combined the improved Wilkinson iteration method with super relaxation precondition method to reduce the condition number of matrix and accelerate iterative speed, the precise integration method was used to solve the inverse matrix more precisely in tomography inversion process; finally, use wavelet transform for image fusion, obtain the final image. Therefore, the ill-conditioned linear equations were changed into iterative normal system through two times of treatment and using images with different forward algorithms for image fusion, it reduced the influence effect of measurement error on imaging. Simulation results showed that, this method can eliminate the artifacts in images effectively, it had extensive practical significance.

  8. Mathematical model of MMR inversion for geophysical data

    Directory of Open Access Journals (Sweden)

    Suabsagun Yooyuanyong

    2007-09-01

    Full Text Available In this paper, we present an analysis of the solution to a number of geophysical inverse problems which are generally non-unique. The mathematical inverse problem that arises is commonly ill-posed in the sense that small changes in the data lead to large changes in the solution. We conduct the inversion algorithm to explore the conductivity for the ground structure. The algorithm uses the data in the form of magnetic field measurements for magnetometric resistivity (MMR. The inversion example is performed to investigate the conductivity ground profile that best fits the observed data. The result is compared with the true model and discussed to show the efficiency of the method. The model for the inversion example with the apparent conductivity and the true conductivity are plotted to show the convergence of the algorithm.

  9. Numerical pole assignment by eigenvalue Jacobian inversion

    Science.gov (United States)

    Sevaston, George E.

    1986-01-01

    A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.

  10. Inverse Scattering Approach to Improving Pattern Recognition

    Energy Technology Data Exchange (ETDEWEB)

    Chapline, G; Fu, C

    2005-02-15

    The Helmholtz machine provides what may be the best existing model for how the mammalian brain recognizes patterns. Based on the observation that the ''wake-sleep'' algorithm for training a Helmholtz machine is similar to the problem of finding the potential for a multi-channel Schrodinger equation, we propose that the construction of a Schrodinger potential using inverse scattering methods can serve as a model for how the mammalian brain learns to extract essential information from sensory data. In particular, inverse scattering theory provides a conceptual framework for imagining how one might use EEG and MEG observations of brain-waves together with sensory feedback to improve human learning and pattern recognition. Longer term, implementation of inverse scattering algorithms on a digital or optical computer could be a step towards mimicking the seamless information fusion of the mammalian brain.

  11. Unwrapped phase inversion for near surface seismic data

    KAUST Repository

    Choi, Yun Seok

    2012-11-04

    The Phase-wrapping is one of the main obstacles of waveform inversion. We use an inversion algorithm based on the instantaneous-traveltime that overcomes the phase-wrapping problem. With a high damping factor, the frequency-dependent instantaneous-traveltime inversion provides the stability of refraction tomography, with higher resolution results, and no arrival picking involved. We apply the instantaneous-traveltime inversion to the synthetic data generated by the elastic time-domain modeling. The synthetic data is a representative of the near surface seismic data. Although the inversion algorithm is based on the acoustic wave equation, the numerical examples show that the instantaneous-traveltime inversion generates a convergent velocity model, very similar to what we see from traveltime tomography.

  12. Computing generalized inverses using LU factorization of matrix product

    CERN Document Server

    Stanimirović,; Tasić,; B, M; 10.1080/00207160701582077

    2011-01-01

    An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4} -inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A(2, 3)s and A(2, 4)s are characterized in terms of matrix products (R*A)+R* and T*(AT*)+, where R and T are rational matrices with appropriate dimensions and corresponding rank. The proposed algorithm is based on these general representations and the Cholesky factorization of symmetric positive matrices. The algorithm is implemented in programming languages MATHEMATICA and DELPHI, and illustrated via examples. Numerical results of the algorithm, corresponding to the Moore-Penrose inverse, are compared with corresponding results obtained by several known methods for computing the Moore-Penrose inverse.

  13. Sparse nonlinear inverse imaging for shot count reduction in inverse lithography.

    Science.gov (United States)

    Wu, Xiaofei; Liu, Shiyuan; Lv, Wen; Lam, Edmund Y

    2015-10-19

    Inverse lithography technique (ILT) is significant to reduce the feature size of ArF optical lithography due to its strong ability to overcome the optical proximity effect. A critical issue for inverse lithography is the complex curvilinear patterns produced, which are very costly to write due to the large number of shots needed with the current variable shape beam (VSB) writers. In this paper, we devise an inverse lithography method to reduce the shot count by incorporating a model-based fracturing (MBF) in the optimization. The MBF is formulated as a sparse nonlinear inverse imaging problem based on representing the mask as a linear combination of shots followed by a threshold function. The problem is approached with a Gauss-Newton algorithm, which is adapted to promote sparsity of the solution, corresponding to the reduction of the shot count. Simulations of inverse lithography are performed on several test cases, and results demonstrate reduced shot count of the resulting mask.

  14. SOLVING INVERSE KINEMATICS OF REDUNDANT MANIPULATOR BASED ON NEURAL NETWORK

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    For the redundant manipulators, neural network is used to tackle the velocity inverse kinematics of robot manipulators. The neural networks utilized are multi-layered perceptions with a back-propagation training algorithm. The weight table is used to save the weights solving the inverse kinematics based on the different optimization performance criteria. Simulations verify the effectiveness of using neural network.

  15. REGULARIZED D-BAR METHOD FOR THE INVERSE CONDUCTIVITY PROBLEM

    DEFF Research Database (Denmark)

    Knudsen, Kim; Lassas, Matti; Mueller, Jennifer;

    2009-01-01

    A strategy for regularizing the inversion procedure for the two-dimensional D-bar reconstruction algorithm based on the global uniqueness proof of Nachman [Ann. Math. 143 (1996)] for the ill-posed inverse conductivity problem is presented. The strategy utilizes truncation of the boundary integral...

  16. Discovery of large genomic inversions using long range information.

    Science.gov (United States)

    Eslami Rasekh, Marzieh; Chiatante, Giorgia; Miroballo, Mattia; Tang, Joyce; Ventura, Mario; Amemiya, Chris T; Eichler, Evan E; Antonacci, Francesca; Alkan, Can

    2017-01-10

    Although many algorithms are now available that aim to characterize different classes of structural variation, discovery of balanced rearrangements such as inversions remains an open problem. This is mainly due to the fact that breakpoints of such events typically lie within segmental duplications or common repeats, which reduces the mappability of short reads. The algorithms developed within the 1000 Genomes Project to identify inversions are limited to relatively short inversions, and there are currently no available algorithms to discover large inversions using high throughput sequencing technologies. Here we propose a novel algorithm, VALOR, to discover large inversions using new sequencing methods that provide long range information such as 10X Genomics linked-read sequencing, pooled clone sequencing, or other similar technologies that we commonly refer to as long range sequencing. We demonstrate the utility of VALOR using both pooled clone sequencing and 10X Genomics linked-read sequencing generated from the genome of an individual from the HapMap project (NA12878). We also provide a comprehensive comparison of VALOR against several state-of-the-art structural variation discovery algorithms that use whole genome shotgun sequencing data. In this paper, we show that VALOR is able to accurately discover all previously identified and experimentally validated large inversions in the same genome with a low false discovery rate. Using VALOR, we also predicted a novel inversion, which we validated using fluorescent in situ hybridization. VALOR is available at https://github.com/BilkentCompGen/VALOR.

  17. Modular Regularization Algorithms

    DEFF Research Database (Denmark)

    Jacobsen, Michael

    2004-01-01

    The class of linear ill-posed problems is introduced along with a range of standard numerical tools and basic concepts from linear algebra, statistics and optimization. Known algorithms for solving linear inverse ill-posed problems are analyzed to determine how they can be decomposed...

  18. Direct Waveform Inversion by Iterative Inverse Propagation

    CERN Document Server

    Schlottmann, R B

    2009-01-01

    Seismic waves are the most sensitive probe of the Earth's interior we have. With the dense data sets available in exploration, images of subsurface structures can be obtained through processes such as migration. Unfortunately, relating these surface recordings to actual Earth properties is non-trivial. Tomographic techniques use only a small amount of the information contained in the full seismogram and result in relatively low resolution images. Other methods use a larger amount of the seismogram but are based on either linearization of the problem, an expensive statistical search over a limited range of models, or both. We present the development of a new approach to full waveform inversion, i.e., inversion which uses the complete seismogram. This new method, which falls under the general category of inverse scattering, is based on a highly non-linear Fredholm integral equation relating the Earth structure to itself and to the recorded seismograms. An iterative solution to this equation is proposed. The res...

  19. Inverse Kinematics using Quaternions

    DEFF Research Database (Denmark)

    Henriksen, Knud; Erleben, Kenny; Engell-Nørregård, Morten

    In this project I describe the status of inverse kinematics research, with the focus firmly on the methods that solve the core problem. An overview of the different methods are presented Three common methods used in inverse kinematics computation have been chosen as subject for closer inspection....... suite, developed in this project and in [4]. Source code developed for this project includes the CCD method , improvements on the BFGS method and Jacobian inverse originally developed in [4]....

  20. Inverse periodic shadowing properties

    CERN Document Server

    Osipov, Alexey V

    2011-01-01

    We consider inverse periodic shadowing properties of discrete dynamical systems generated by diffeomorphisms of closed smooth manifolds. We show that the $C^1$-interior of the set of all diffeomorphisms having so-called inverse periodic shadowing property coincides with the set of $\\Omega$-stable diffeomorphisms. The equivalence of Lipschitz inverse periodic shadowing property and hyperbolicity of the closure of all periodic points is proved. Besides, we prove that the set of all diffeomorphisms that have Lipschitz inverse periodic shadowing property and whose periodic points are dense in the nonwandering set coincides with the set of Axiom A diffeomorphisms.

  1. A NEW INVERSION METHOD OF TIME-LAPSE SEISMIC

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Time-Lapse Seismic improves oil recovery ratio by dynamic reservoir monitoring. Because of the large number of seismic explorations in the process of time-lapse seismic inversion, traditional methods need plenty of inversion calculations which cost high computational works. The method is therefore inefficient. In this paper, in order to reduce the repeating computations in traditional, a new time-lapse seismic inversion method is put forward. Firstly a homotopy-regularization method is proposed for the first time inversion. Secondly, with the first time inversion results as the initial value of following model, a model of the second time inversion is rebuilt by analyzing the characters of time-lapse seismic and localized inversion method is designed by using the model. Finally, through simulation, the comparison between traditional method and the new scheme is given. Our simulation results show that the new scheme could save the algorithm computations greatly.

  2. Unwrapped phase inversion with an exponential damping

    KAUST Repository

    Choi, Yun Seok

    2015-07-28

    Full-waveform inversion (FWI) suffers from the phase wrapping (cycle skipping) problem when the frequency of data is not low enough. Unless we obtain a good initial velocity model, the phase wrapping problem in FWI causes a result corresponding to a local minimum, usually far away from the true solution, especially at depth. Thus, we have developed an inversion algorithm based on a space-domain unwrapped phase, and we also used exponential damping to mitigate the nonlinearity associated with the reflections. We construct the 2D phase residual map, which usually contains the wrapping discontinuities, especially if the model is complex and the frequency is high. We then unwrap the phase map and remove these cycle-based jumps. However, if the phase map has several residues, the unwrapping process becomes very complicated. We apply a strong exponential damping to the wavefield to eliminate much of the residues in the phase map, thus making the unwrapping process simple. We finally invert the unwrapped phases using the back-propagation algorithm to calculate the gradient. We progressively reduce the damping factor to obtain a high-resolution image. Numerical examples determined that the unwrapped phase inversion with a strong exponential damping generated convergent long-wavelength updates without low-frequency information. This model can be used as a good starting model for a subsequent inversion with a reduced damping, eventually leading to conventional waveform inversion.

  3. Sparse CSEM inversion driven by seismic coherence

    Science.gov (United States)

    Guo, Zhenwei; Dong, Hefeng; Kristensen, Åge

    2016-12-01

    Marine controlled source electromagnetic (CSEM) data inversion for hydrocarbon exploration is often challenging due to high computational cost, physical memory requirement and low resolution of the obtained resistivity map. This paper aims to enhance both the speed and resolution of CSEM inversion by introducing structural geological information in the inversion algorithm. A coarse mesh is generated for Occam’s inversion, where the parameters are fewer than in the fine regular mesh. This sparse mesh is defined as a coherence-based irregular (IC) sparse mesh, which is based on vertices extracted from available geological information. Inversion results on synthetic data illustrate that the IC sparse mesh has a smaller inversion computational cost compared to the regular dense (RD) mesh. It also has a higher resolution than with a regular sparse (RS) mesh for the same number of estimated parameters. In order to study how the IC sparse mesh reduces the computational time, four different meshes are generated for Occam’s inversion. As a result, an IC sparse mesh can reduce the computational cost while it keeps the resolution as good as a fine regular mesh. The IC sparse mesh reduces the computational cost of the matrix operation for model updates. When the number of estimated parameters reduces to a limited value, the computational cost is independent of the number of parameters. For a testing model with two resistive layers, the inversion result using an IC sparse mesh has higher resolution in both horizontal and vertical directions. Overall, the model representing significant geological information in the IC mesh can improve the resolution of the resistivity models obtained from inversion of CSEM data.

  4. On the inversion-indel distance.

    Science.gov (United States)

    Willing, Eyla; Zaccaria, Simone; Braga, Marília D V; Stoye, Jens

    2013-01-01

    The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be computed thanks to a pioneering approach of Hannenhalli and Pevzner in 1995. In 2000, El-Mabrouk extended the inversion model to allow the comparison of unichromosomal genomes with unequal contents, thus insertions and deletions of DNA segments besides inversions. However, an exact algorithm was presented only for the case in which we have insertions alone and no deletion (or vice versa), while a heuristic was provided for the symmetric case, that allows both insertions and deletions and is called the inversion-indel distance. In 2005, Yancopoulos, Attie and Friedberg started a new branch of research by introducing the generic double cut and join (DCJ) operation, that can represent several genome rearrangements (including inversions). Among others, the DCJ model gave rise to two important results. First, it has been shown that the inversion distance can be computed in a simpler way with the help of the DCJ operation. Second, the DCJ operation originated the DCJ-indel distance, that allows the comparison of genomes with unequal contents, considering DCJ, insertions and deletions, and can be computed in linear time. In the present work we put these two results together to solve an open problem, showing that, when the graph that represents the relation between the two compared genomes has no bad components, the inversion-indel distance is equal to the DCJ-indel distance. We also give a lower and an upper bound for the inversion-indel distance in the presence of bad components.

  5. A recursive Formulation of the Inversion of symmetric positive defite matrices in packed storage data format

    DEFF Research Database (Denmark)

    Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred

    2002-01-01

    A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words....... New recursive packed BLAS needed for this algorithm have been developed too. Two transformation routines, from the LAPACK packed storage data format to the recursive storage data format were added to the package too....

  6. Dynamical inverse problems

    CERN Document Server

    Gladwell, Graham ML

    2011-01-01

    The papers in this volume present an overview of the general aspects and practical applications of dynamic inverse methods, through the interaction of several topics, ranging from classical and advanced inverse problems in vibration, isospectral systems, dynamic methods for structural identification, active vibration control and damage detection, imaging shear stiffness in biological tissues, wave propagation, to computational and experimental aspects relevant for engineering problems.

  7. Emergent strategies for inverse molecular design

    Institute of Scientific and Technical Information of China (English)

    BERATAN; David; N.

    2009-01-01

    Molecular design is essential and ubiquitous in chemistry,physics,biology,and material science.The immense space of available candidate molecules requires novel optimization strategies and algorithms for exploring the space and achieving efficient and effective molecular design.This paper summarizes the current progress toward developing practical theoretical optimization schemes for molecular design.In particular,we emphasize emergent strategies for inverse molecular design.Several representative design examples,based on recently developed strategies,are described to demonstrate the principles of inverse molecular design.

  8. Inverse potential scattering in duct acoustics.

    Science.gov (United States)

    Forbes, Barbara J; Pike, E Roy; Sharp, David B; Aktosun, Tuncay

    2006-01-01

    The inverse problem of the noninvasive measurement of the shape of an acoustical duct in which one-dimensional wave propagation can be assumed is examined within the theoretical framework of the governing Klein-Gordon equation. Previous deterministic methods developed over the last 40 years have all required direct measurement of the reflectance or input impedance but now, by application of the methods of inverse quantum scattering to the acoustical system, it is shown that the reflectance can be algorithmically derived from the radiated wave. The potential and area functions of the duct can subsequently be reconstructed. The results are discussed with particular reference to acoustic pulse reflectometry.

  9. Optimal Transport for Seismic Full Waveform Inversion

    CERN Document Server

    Engquist, Bjorn; Yang, Yunan

    2016-01-01

    Full waveform inversion is a successful procedure for determining properties of the earth from surface measurements in seismology. This inverse problem is solved by a PDE constrained optimization where unknown coefficients in a computed wavefield are adjusted to minimize the mismatch with the measured data. We propose using the Wasserstein metric, which is related to optimal transport, for measuring this mismatch. Several advantageous properties are proved with regards to convexity of the objective function and robustness with respect to noise. The Wasserstein metric is computed by solving a Monge-Ampere equation. We describe an algorithm for computing its Frechet gradient for use in the optimization. Numerical examples are given.

  10. Inverse Symmetric Inflationary Attractors

    CERN Document Server

    Odintsov, S D

    2016-01-01

    We present a class of inflationary potentials which are invariant under a special symmetry, which depends on the parameters of the models. As we show, in certain limiting cases, the inverse symmetric potentials are qualitatively similar to the $\\alpha$-attractors models, since the resulting observational indices are identical. However, there are some quantitative differences which we discuss in some detail. As we show, some inverse symmetric models always yield results compatible with observations, but this strongly depends on the asymptotic form of the potential at large $e$-folding numbers. In fact when the limiting functional form is identical to the one corresponding to the $\\alpha$-attractors models, the compatibility with the observations is guaranteed. Also we find the relation of the inverse symmetric models with the Starobinsky model and we highlight the differences. In addition, an alternative inverse symmetric model is studied and as we show, not all the inverse symmetric models are viable. Moreove...

  11. 0-Semidistributive Inverse Semigroups

    Institute of Scientific and Technical Information of China (English)

    田振际

    2004-01-01

    @@ For an inverse semigroup S, the set L(S) of all inverse subsemigroups (including the empty set) of S forms a lattice with respect to intersection denoted as usual by ∩ and union, where the union is the inverse subsemigroup generated by inverse subsemigroups A, B of S. The set LF(S) of all full inverse subsemigroups of S forms a complete sublattice of L(S), with Es as zero element (Es is the set of all idempotent of S)(see [3,5,6]). Note, that if S a group, then LF(S)=L(S), its lattice of all subgroups of S. If S = G0 is a group with adjoined zero, then clearly LF(S) ≌ L(G).

  12. Frequency-domain waveform inversion using the unwrapped phase

    KAUST Repository

    Choi, Yun Seok

    2011-01-01

    Phase wrapping in the frequency-domain (or cycle skipping in the time-domain) is the major cause of the local minima problem in the waveform inversion. The unwrapped phase has the potential to provide us with a robust and reliable waveform inversion, with reduced local minima. We propose a waveform inversion algorithm using the unwrapped phase objective function in the frequency-domain. The unwrapped phase, or what we call the instantaneous traveltime, is given by the imaginary part of dividing the derivative of the wavefield with respect to the angular frequency by the wavefield itself. As a result, the objective function is given a traveltime-like function, which allows us to smooth it and reduce its nonlinearity. The gradient of the objective function is computed using the back-propagation algorithm based on the adjoint-state technique. We apply both our waveform inversion algorithm using the unwrapped phase and the conventional waveform inversion and show that our inversion algorithm gives better convergence to the true model than the conventional waveform inversion. © 2011 Society of Exploration Geophysicists.

  13. Swarm intelligence optimization and its application in geophysical data inversion

    Institute of Scientific and Technical Information of China (English)

    Yuan Sanyi; Wang Shangxu; Tian Nan

    2009-01-01

    The inversions of complex geophysical data always solve multi-parameter, nonlinear, and multimodal optimization problems. Searching for the optimal inversion solutions is similar to the social behavior observed in swarms such as birds and ants when searching for food. In this article, first the particle swarm optimization algorithm was described in detail, and ant colony algorithm improved. Then the methods were applied to three different kinds of geophysical inversion problems: (1) a linear problem which is sensitive to noise, (2) a synchronous inversion of linear and nonlinear problems, and (3) a nonlinear problem. The results validate their feasibility and efficiency. Compared with the conventional genetic algorithm and simulated annealing, they have the advantages of higher convergence speed and accuracy. Compared with the quasi-Newton method and Levenberg-Marquardt method, they work better with the ability to overcome the locally optimal solutions.

  14. A GPU-Computing Approach to Solar Stokes Profile Inversion

    CERN Document Server

    Harker, Brian J

    2012-01-01

    We present a new computational approach to the inversion of solar photospheric Stokes polarization profiles, under the Milne-Eddington model, for vector magnetography. Our code, named GENESIS (GENEtic Stokes Inversion Strategy), employs multi-threaded parallel-processing techniques to harness the computing power of graphics processing units GPUs, along with algorithms designed to exploit the inherent parallelism of the Stokes inversion problem. Using a genetic algorithm (GA) engineered specifically for use with a GPU, we produce full-disc maps of the photospheric vector magnetic field from polarized spectral line observations recorded by the Synoptic Optical Long-term Investigations of the Sun (SOLIS) Vector Spectromagnetograph (VSM) instrument. We show the advantages of pairing a population-parallel genetic algorithm with data-parallel GPU-computing techniques, and present an overview of the Stokes inversion problem, including a description of our adaptation to the GPU-computing paradigm. Full-disc vector ma...

  15. Software product for inversion of 3D seismic data

    Energy Technology Data Exchange (ETDEWEB)

    Bown, J.

    1997-03-01

    ISIS3D Seismic Inversion removes the effect of the wavelet from seismic data, and in so doing determines model for the subsurface variation of a real physical parameter, acoustic impedance. The displays based on the results produced by ISIS3D allow improved lithologic interpretation for reservoir delineation. ISIS3D assists the interpreter with respect to: Resolution of thin layers; Variations in lithology; Porosity variations within a reservoir; and Structural interpretation. The ISIS inversion process is divided into four fundamental steps: Calibration of the well logs and derivation of acoustic impedance and reflectivity logs; Determination of the optimal wavelet for the seismic inversion algorithm; Construction of a prior acoustic impedance model for use by the seismic inversion algorithm; and Globally optimised, multi-trace seismic inversion. (EG)

  16. Electromagnetic tomography (EMT): image reconstruction based on the inverse problem

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    Starting from Maxwell's equations for inhomogeneous media, nonlinear integral equations of the inverse problem of the electromagnetic tomography (EMT) are derived, whose kernel is the dyadic Green's function for the EMT sensor with a homogeneous medium in the object space. Then in terms of ill-posedness of the inverse problem, a Tikhonov-type regularization model is established based on a linearization-approximation of the nonlinear inverse problem. Finally, an iterative algorithm of image reconstruction based on the inverse problem and reconstruction images of some object flows for simplified sensor are given. Initial results of the image reconstruction show that the algorithm based on the inverse problem is superior to those based on the linear back-projection in the quality of image reconstruction.

  17. Explicit inverse distance weighting mesh motion for coupled problems

    NARCIS (Netherlands)

    Witteveen, J.A.S.; Bijl, H.

    2009-01-01

    An explicit mesh motion algorithm based on inverse distance weighting interpolation is presented. The explicit formulation leads to a fast mesh motion algorithm and an easy implementation. In addition, the proposed point-by-point method is robust and flexible in case of large deformations, hanging n

  18. Iterative Reconstruction Methods for Hybrid Inverse Problems in Impedance Tomography

    DEFF Research Database (Denmark)

    Hoffmann, Kristoffer; Knudsen, Kim

    2014-01-01

    For a general formulation of hybrid inverse problems in impedance tomography the Picard and Newton iterative schemes are adapted and four iterative reconstruction algorithms are developed. The general problem formulation includes several existing hybrid imaging modalities such as current density...... impedance imaging, magnetic resonance electrical impedance tomography, and ultrasound modulated electrical impedance tomography, and the unified approach to the reconstruction problem encompasses several algorithms suggested in the literature. The four proposed algorithms are implemented numerically in two...... be based on a theoretical analysis of the underlying inverse problem....

  19. Sparse inversion of Stokes profiles. I. Two-dimensional Milne-Eddington inversions

    CERN Document Server

    Ramos, A Asensio

    2015-01-01

    Inversion codes are numerical tools used for the inference of physical properties from the observations. Despite their success, the quality of current spectropolarimetric observations and those expected in the near future presents a challenge to current inversion codes. The pixel-by-pixel strategy of inverting spectropolarimetric data that we currently utilize needs to be surpassed and improved. The inverted physical parameters have to take into account the spatial correlation that is present in the data and that contains valuable physical information. We utilize the concept of sparsity or compressibility to develop an new generation of inversion codes for the Stokes parameters. The inversion code uses numerical optimization techniques based on the idea of proximal algorithms to impose sparsity. In so doing, we allow for the first time to exploit the presence of spatial correlation on the maps of physical parameters. Sparsity also regularizes the solution by reducing the number of unknowns. We compare the res...

  20. Inversion of Stokes Profiles with Systematic Effects

    CERN Document Server

    Ramos, A Asensio; Gonzalez, M J Martinez; Yabar, A Pastor

    2016-01-01

    Quantitative thermodynamical, dynamical and magnetic properties of the solar and stellar plasmas are obtained by interpreting their emergent non-polarized and polarized spectrum. This inference requires the selection of a set of spectral lines particularly sensitive to the physical conditions in the plasma and a suitable parametric model of the solar/stellar atmosphere. Nonlinear inversion codes are then used to fit the model to the observations. However, the presence of systematic effects like nearby or blended spectral lines, telluric absorption or incorrect correction of the continuum, among others, can strongly affect the results. We present an extension to current inversion codes that can deal with these effects in a transparent way. The resulting algorithm is very simple and can be applied to any existing inversion code with the addition of a few lines of code as an extra step in each iteration.

  1. Estimation of large residual statics by multiscale inversion algorithm%大剩余静校正量求解的多尺度反演方法研究

    Institute of Scientific and Technical Information of China (English)

    井西利

    2009-01-01

    Regarding the residual static correction for large statics, the development of residual static correction technique which based on model trace was introduced in this paper. The related analysis was conducted and the reason for 'loop jump' which was caused by large residual statics to residual static correction inversion method which is based on model trace was found out. It is believed that if the product of the highest frequency of seismic wave and the largest residual statics is small, the model trace which is formed by stacking the traces in the CDP gather is reliable. In this paper the development of multiscaie residual static correction technique which is based on model trace is introduced. Synthetic and real seismic data test show that the technique is effective and can solve 'loop jump' problem for large residual statics, the technique is not only as effective as non-linear inversion residual static correction techniques, but also as efficient as the linear inversion techniques.%文中针对大静校正量的剩余静校正问题,提出了基干模型道的剩余静校正方法.通过分析,找出了大静校正量使基于模型道的剩余静校正反演方法产生周波跳跃的原因,并指出在形成模型道的地震波频率上限与最大静校正量之积足够小的条件下,通过叠加形成的模型道是可靠的.据此建立了合理的基于模型道的多尺度剩余静校正方法,并进行了理论数据和实际资料的试算.试算结果表明,该方法可在一定程度上有效解决大静校正量的周波跳跃问题.该方法既具有非线性反演剩余静校正方法的计算效果,同时又具有线性反演方法的较高计算效率的特点.

  2. Analog fault diagnosis by inverse problem technique

    KAUST Repository

    Ahmed, Rania F.

    2011-12-01

    A novel algorithm for detecting soft faults in linear analog circuits based on the inverse problem concept is proposed. The proposed approach utilizes optimization techniques with the aid of sensitivity analysis. The main contribution of this work is to apply the inverse problem technique to estimate the actual parameter values of the tested circuit and so, to detect and diagnose single fault in analog circuits. The validation of the algorithm is illustrated through applying it to Sallen-Key second order band pass filter and the results show that the detecting percentage efficiency was 100% and also, the maximum error percentage of estimating the parameter values is 0.7%. This technique can be applied to any other linear circuit and it also can be extended to be applied to non-linear circuits. © 2011 IEEE.

  3. Sparse Matrix Inversion with Scaled Lasso

    CERN Document Server

    Sun, Tingni

    2012-01-01

    We propose a new method of learning a sparse nonnegative-definite target matrix. Our primary example of the target matrix is the inverse of a population covariance matrix or correlation matrix. The algorithm first estimates each column of the matrix by scaled Lasso, a joint estimation of regression coefficients and noise level, and then adjusts the matrix estimator to be symmetric. The procedure is efficient in the sense that the penalty level of the scaled Lasso for each column is completely determined by the data via convex minimization, without using cross-validation. We prove that this method guarantees the fastest proven rate of convergence in the spectrum norm under conditions of weaker form than those in the existing analyses of other $\\ell_1$ algorithms, and has faster guaranteed rate of convergence when the ratio of the $\\ell_1$ and spectrum norms of the target inverse matrix diverges to infinity. A simulation study also demonstrates the competitive performance of the proposed estimator.

  4. Inverse Eigenvalue Problem in Structural Dynamics Design

    Institute of Scientific and Technical Information of China (English)

    Huiqing Xie; Hua Dai

    2006-01-01

    A kind of inverse eigenvalue problem in structural dynamics design is considered. The problem is formulated as an optimization problem. The properties of this problem are analyzed, and the existence of the optimum solution is proved. The directional derivative of the objective function is obtained and a necessary condition for a point to be a local minimum point is given. Then a numerical algorithm for solving the problem is presented and a plane-truss problem is discussed to show the applications of the theories and the algorithm.

  5. Low-complexity systolic architecture for inversion

    Institute of Scientific and Technical Information of China (English)

    Yuan Danshou; Rong Mengtian

    2006-01-01

    A modified extended binary Euclid's algorithm which is more regularly iterative for computing an inversion in GF(2m) is presented. Based on above modified algorithm, a serial-in serial-out architecture is proposed. It has area complexity of O(m), latency of 5m-2, and throughput of 1/m. Compared with other serial systolic architectures, the proposed one has the smallest area complexity, shorter latency. It is highly regular, modular, and thus well suited for high-speed VLSI design.

  6. On Generalized Inverse Transversals

    Institute of Scientific and Technical Information of China (English)

    Rong Hua ZHANG; Shou Feng WANG

    2008-01-01

    Let S be a regular semigroup,S° an inverse subsemigroup of S.S° is called a generalized inverse transversal of S,if V(x) ∩N S°≠φ.In this paper,some properties of this kind of semigroups are discussed.In particular,a construction theorem is obtained which contains some recent results in the literature as its special cases.

  7. Recursive Inversion Of Externally Defined Linear Systems

    Science.gov (United States)

    Bach, Ralph E., Jr.; Baram, Yoram

    1992-01-01

    Technical memorandum discusses mathematical technique described in "Recursive Inversion by Finite-Impulse-Response Filters" (ARC-12247). Technique is recursive algorithm yielding finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Useful in such diverse applications as medical diagnoses, identification of military targets, geophysical exploration, and nondestructive testing.

  8. Variational Bayesian Approximation methods for inverse problems

    Science.gov (United States)

    Mohammad-Djafari, Ali

    2012-09-01

    Variational Bayesian Approximation (VBA) methods are recent tools for effective Bayesian computations. In this paper, these tools are used for inverse problems where the prior models include hidden variables and where where the estimation of the hyper parameters has also to be addressed. In particular two specific prior models (Student-t and mixture of Gaussian models) are considered and details of the algorithms are given.

  9. Inverse folding of RNA pseudoknot structures

    Directory of Open Access Journals (Sweden)

    Li Linda YM

    2010-06-01

    Full Text Available Abstract Background RNA exhibits a variety of structural configurations. Here we consider a structure to be tantamount to the noncrossing Watson-Crick and G-U-base pairings (secondary structure and additional cross-serial base pairs. These interactions are called pseudoknots and are observed across the whole spectrum of RNA functionalities. In the context of studying natural RNA structures, searching for new ribozymes and designing artificial RNA, it is of interest to find RNA sequences folding into a specific structure and to analyze their induced neutral networks. Since the established inverse folding algorithms, RNAinverse, RNA-SSD as well as INFO-RNA are limited to RNA secondary structures, we present in this paper the inverse folding algorithm Inv which can deal with 3-noncrossing, canonical pseudoknot structures. Results In this paper we present the inverse folding algorithm Inv. We give a detailed analysis of Inv, including pseudocodes. We show that Inv allows to design in particular 3-noncrossing nonplanar RNA pseudoknot 3-noncrossing RNA structures-a class which is difficult to construct via dynamic programming routines. Inv is freely available at http://www.combinatorics.cn/cbpc/inv.html. Conclusions The algorithm Inv extends inverse folding capabilities to RNA pseudoknot structures. In comparison with RNAinverse it uses new ideas, for instance by considering sets of competing structures. As a result, Inv is not only able to find novel sequences even for RNA secondary structures, it does so in the context of competing structures that potentially exhibit cross-serial interactions.

  10. Numerical linear algebra for reconstruction inverse problems

    Science.gov (United States)

    Nachaoui, Abdeljalil

    2004-01-01

    Our goal in this paper is to discuss various issues we have encountered in trying to find and implement efficient solvers for a boundary integral equation (BIE) formulation of an iterative method for solving a reconstruction problem. We survey some methods from numerical linear algebra, which are relevant for the solution of this class of inverse problems. We motivate the use of our constructing algorithm, discuss its implementation and mention the use of preconditioned Krylov methods.

  11. Efficient Numerical Inversion for Financial Simulations

    OpenAIRE

    Derflinger, Gerhard; Hörmann, Wolfgang; Leydold, Josef; Sak, Halis

    2009-01-01

    Generating samples from generalized hyperbolic distributions and non-central chi-square distributions by inversion has become an important task for the simulation of recent models in finance in the framework of (quasi-) Monte Carlo. However, their distribution functions are quite expensive to evaluate and thus numerical methods like root finding algorithms are extremely slow. In this paper we demonstrate how our new method based on Newton interpolation and Gauss-Lobatto quadrature can be util...

  12. Voltammetry: mathematical modelling and Inverse Problem

    CERN Document Server

    Koshev, N A; Kuzina, V V

    2016-01-01

    We propose the fast semi-analytical method of modelling the polarization curves in the voltammetric experiment. The method is based on usage of the special func- tions and shows a big calculation speed and a high accuracy and stability. Low computational needs of the proposed algorithm allow us to state the set of Inverse Problems of voltammetry for the reconstruction of metal ions concentrations or the other parameters of the electrolyte under investigation.

  13. Generalized emissivity inverse problem.

    Science.gov (United States)

    Ming, DengMing; Wen, Tao; Dai, XianXi; Dai, JiXin; Evenson, William E

    2002-04-01

    Inverse problems have recently drawn considerable attention from the physics community due to of potential widespread applications [K. Chadan and P. C. Sabatier, Inverse Problems in Quantum Scattering Theory, 2nd ed. (Springer Verlag, Berlin, 1989)]. An inverse emissivity problem that determines the emissivity g(nu) from measurements of only the total radiated power J(T) has recently been studied [Tao Wen, DengMing Ming, Xianxi Dai, Jixin Dai, and William E. Evenson, Phys. Rev. E 63, 045601(R) (2001)]. In this paper, a new type of generalized emissivity and transmissivity inverse (GETI) problem is proposed. The present problem differs from our previous work on inverse problems by allowing the unknown (emissivity) function g(nu) to be temperature dependent as well as frequency dependent. Based on published experimental information, we have developed an exact solution formula for this GETI problem. A universal function set suggested for numerical calculation is shown to be robust, making this inversion method practical and convenient for realistic calculations.

  14. Analysis of Temperature Distributions in Nighttime Inversions

    Science.gov (United States)

    Telyak, Oksana; Krasouski, Aliaksandr; Svetashev, Alexander; Turishev, Leonid; Barodka, Siarhei

    2015-04-01

    theoretical approaches based on discriminant analysis, mesoscale modeling with WRF provides fairly successful forecasts of formation times and regions for all types of temperature inversions up to 3 days in advance. Furthermore, we conclude that without proper adjustment for the presence of thin isothermal layers (adiabatic and/or inversion layers), temperature data can affect results of statistical climate studies. Provided there are regions where a long-term, constant inversion is present (e.g., Antarctica or regions with continental climate), these data can contribute an uncompensated systematic error of 2 to 10° C. We argue that this very fact may lead to inconsistencies in long-term temperature data interpretations (e.g., conclusions ranging from "global warming" to "global cooling" based on temperature observations for the same region and time period). Due to the importance of this problem from the scientific as well as practical point of view, our plans for further studies include analysis of autumn and wintertime inversions and convective inversions. At the same time, it seems promising to develop an algorithm of automatic recognition of temperature inversions based on a combination of WRF modeling results, surface and satellite observations.

  15. ROBUST PARTIAL INVERSE NETWORK FLOW PROBLEMS%强部分逆网络流问题

    Institute of Scientific and Technical Information of China (English)

    杨晓光

    2001-01-01

    In this paper,a new model for inverse network flow problems,robust partial inverse problem is presented. For a given partial solution,the robust partial inverse problem is to modify the coefficients optimally such that all full solutions containing the partial solution become optimal under new coefficients. It has been shown that the robust partial inverse spanning tree problem can be formulated as a combinatorial linear program,while the robust partial inverse minimum cut problem and the robust partial inverse assignment problem can be solved by combinatorial strongly polynomial algorithms.

  16. Frnakenstein: multiple target inverse RNA folding

    Directory of Open Access Journals (Sweden)

    Lyngsø Rune B

    2012-10-01

    Full Text Available Abstract Background RNA secondary structure prediction, or folding, is a classic problem in bioinformatics: given a sequence of nucleotides, the aim is to predict the base pairs formed in its three dimensional conformation. The inverse problem of designing a sequence folding into a particular target structure has only more recently received notable interest. With a growing appreciation and understanding of the functional and structural properties of RNA motifs, and a growing interest in utilising biomolecules in nano-scale designs, the interest in the inverse RNA folding problem is bound to increase. However, whereas the RNA folding problem from an algorithmic viewpoint has an elegant and efficient solution, the inverse RNA folding problem appears to be hard. Results In this paper we present a genetic algorithm approach to solve the inverse folding problem. The main aims of the development was to address the hitherto mostly ignored extension of solving the inverse folding problem, the multi-target inverse folding problem, while simultaneously designing a method with superior performance when measured on the quality of designed sequences. The genetic algorithm has been implemented as a Python program called Frnakenstein. It was benchmarked against four existing methods and several data sets totalling 769 real and predicted single structure targets, and on 292 two structure targets. It performed as well as or better at finding sequences which folded in silico into the target structure than all existing methods, without the heavy bias towards CG base pairs that was observed for all other top performing methods. On the two structure targets it also performed well, generating a perfect design for about 80% of the targets. Conclusions Our method illustrates that successful designs for the inverse RNA folding problem does not necessarily have to rely on heavy biases in base pair and unpaired base distributions. The design problem seems to become more

  17. Etude D'Un Modele D'Inversion Liant L'Emissivite a L'Humidite Des Sols. Contribution a la Mise Au Point De L'Algorithme De la Mission Smos

    CERN Document Server

    Demontoux, François; Ruffié, Gilles; Wigneron, Jean Pierre; Grant, Jennifer; Lawrence, Heather

    2007-01-01

    The work which we present takes place within the framework of mission SMOS of the ESA which will consist to send a radiometer (1.4 GHz) in space. The goal of the research which we propose is the improvement of the comprehension of the effects of structure soil and litter. The effects of the litter and heterogeneities of the ground are probably important but still ignored. Its effect can be corrected via a simple radiative model. It is thus necessary to set up an analytical model which would make it possible to correct the effect of this additional layer. The objective of this article is to present the analytical models which we retained to correct the effect of the vegetation and the litter in order to know the emissivity of the bare soil. We developed a numerical model (with software HFSS) of calculation of the emissivity of multi-layer systems in order to validate the results of the forward inversion models. Ranges of permittivity are introduced with the model in order to take account of the disturbances re...

  18. Sharp spatially constrained inversion

    DEFF Research Database (Denmark)

    Vignoli, Giulio G.; Fiandaca, Gianluca G.; Christiansen, Anders Vest C A.V.C.;

    2013-01-01

    We present sharp reconstruction of multi-layer models using a spatially constrained inversion with minimum gradient support regularization. In particular, its application to airborne electromagnetic data is discussed. Airborne surveys produce extremely large datasets, traditionally inverted...... by using smoothly varying 1D models. Smoothness is a result of the regularization constraints applied to address the inversion ill-posedness. The standard Occam-type regularized multi-layer inversion produces results where boundaries between layers are smeared. The sharp regularization overcomes......, the results are compatible with the data and, at the same time, favor sharp transitions. The focusing strategy can also be used to constrain the 1D solutions laterally, guaranteeing that lateral sharp transitions are retrieved without losing resolution. By means of real and synthetic datasets, sharp...

  19. AN ADAPTIVE INVERSE ITERATION FEM FOR THE INHOMOGENEOUS DIELECTRIC WAVEGUIDES

    Institute of Scientific and Technical Information of China (English)

    Jianhua Yuan

    2007-01-01

    We introduce an adaptive finite element method for computing electromagnetic guided waves in a closed, inhomogeneous, pillared three-dimensional waveguide at a given frequency based on the inverse iteration method. The problem is formulated as a generalized eigenvalue problems. By modifying the exact inverse iteration algorithm for the eigenvalue problem, we design a new adaptive inverse iteration finite element algorithm. Adaptive finite element methods based on a posteriori error estimate are known to be successful in resolving singularities of eigenfunctions which deteriorate the finite element convergence.We construct a posteriori error estimator for the electromagnetic guided waves problem.Numerical results are reported to illustrate the quasi-optimal performance of our adaptive inverse iteration finite element method.

  20. 'Inverse' temporomandibular joint dislocation.

    Science.gov (United States)

    Alemán Navas, R M; Martínez Mendoza, M G

    2011-08-01

    Temporomandibular joint (TMJ) dislocation can be classified into four groups (anterior, posterior, lateral, and superior) depending on the direction of displacement and the location of the condylar head. All the groups are rare except for anterior dislocation. 'Inverse' TMJ dislocation is a bilateral anterior and superior dislocation with impaction of the mandible over the maxilla; to the authors' knowledge only two cases have previously been reported in the literature. Inverse TMJ dislocation has unique clinical and radiographic findings, which are described for this case. Copyright © 2011 International Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.

  1. Inverse dynamics algorithm design and application based on the DELTA robot%基于DELTA机器人的动力学逆解算法设计及应用

    Institute of Scientific and Technical Information of China (English)

    徐恒; 李梦姣; 阴雷鸣

    2015-01-01

    并联机器人由多个封闭的机构环组成。这些机构环通常是由连接基座和运动平台的两或多个机构链构成,其中一个关节被驱动,其它关节也跟着一起运动。本文介绍一种3自由度的并联机器人--DELTA机器人。DELTA机器人具有在短时间内搬运大量的轻巧物体的能力,这满足了工业的需求。本文根据DELTA机器人的机构结构,运用空间向量知识,建立机器人各连杆之间位置的向量关系,进行DELTA机器人的运动学逆解计算,以及工作空间的计算。%Parallel institutions by multiple closed rings. These institutions are usually composed of two rings or more organizations chaining base and motion platforms. One such joint is driven , also followed in other joints move together. This paper describes a three degree of freedom parallel robot-DELTA robots. DELTA robot has the ability to carry large amounts of short lightweight objects, which meet the needs of industry. Based on the institutional structure DELTA robot, using space vector knowledge to build the vector relationship between the robot location of each link , perform inverse kinematics of the robot DELTA computing, and computing workspace.

  2. A global harmony search algorithm and its application to inverse kinematics problem for humanoid arm%全局和声搜索方法及其在仿人灵巧臂逆运动学求解中的应用

    Institute of Scientific and Technical Information of China (English)

    任子武; 王振华; 孙立宁

    2012-01-01

    The inverse kinematics (IK) problem of humanoid arm can be solved by using numerical optimization method, which is essentially an equivalent minimization problem. The harmony search (HS) is a meta-heuristic optimization method which mimics behaviors of music players in an improvisation process. To the best of our knowledge, there is very little research work on HS for inverse kinematics problem of robot manipulator. In this paper, an effective global harmony search algorithm (GHSA) based on the swarm intelligence is developed to solve the optimization problem. The GHSA combines the particle swarm optimization (PSO) with HS, and adopts the PSO operation to produce new improvisation instead of regular search rules of harmony search. The improvisation step based on the movement of harmony particles with self-cognitive and swarm behavior in GHSA makes the algorithm strive for a well balance between the global exploration and the local exploitation. Also, the GHSA performs the uniform mutation operation to get rid of the local optimum. The experimental results of benchmark functions show that the GHSA algorithm greatly improves both the global optimization performance and the reliability performance. Based on these, the 7-degree of freedom (7-DOF) redundant humanoid arm is used as an example, and the end-effector error (position and orientation) and the comfortable level of the humanoid arm constitute the fitness function of the GHSA. The proposed GHSA has been applied to solve the inverse kinematics problem of the 7-DOF redundant humanoid arm; numerical simulation results demonstrate the effectiveness of this algorithm.%仿人灵巧臂逆运动学(IK)问题可转化为等效的最小化问题,并采用数值优化方法求解.和声搜索(HS)是模拟乐师在音乐演奏中调整音调现象的一种启发式搜索方法,目前还尚未在机器人机械臂逆运动学问题中得到应用.本文提出一种基于粒子群体智能的全局和声搜索方法(GHSA),

  3. Inverse Quantum Chemistry: Concepts and Strategies for Rational Compound Design

    CERN Document Server

    Weymuth, Thomas

    2014-01-01

    The rational design of molecules and materials is becoming more and more important. With the advent of powerful computer systems and sophisticated algorithms, quantum chemistry plays an important role in rational design. While traditional quantum chemical approaches predict the properties of a predefined molecular structure, the goal of inverse quantum chemistry is to find a structure featuring one or more desired properties. Herein, we review inverse quantum chemical approaches proposed so far and discuss their advantages as well as their weaknesses.

  4. Methodology Using Inverse Methods for Pit Characterization in Multilayer Structures

    Science.gov (United States)

    Aldrin, John C.; Sabbagh, Harold A.; Sabbagh, Elias H.; Murphy, R. Kim; Concordia, Michael; Judd, David R.; Lindgren, Eric; Knopp, Jeremy

    2006-03-01

    This paper presents a methodology incorporating ultrasonic and eddy current data and NDE models to characterize pits in first and second layers. Approaches such as equivalent pit dimensions, approximate probe models, and iterative inversion schemes were designed to improve the reliability and speed of inverse methods for second layer pit characterization. A novel clutter removal algorithm was developed to compensate for coherent background noise. Validation was achieved using artificial and real pitting corrosion samples.

  5. Local regularization of linear inverse problems via variational filtering

    Science.gov (United States)

    Lamm, Patricia K.

    2017-08-01

    We develop local regularization methods for ill-posed linear inverse problems governed by general Fredholm integral operators. The methods are executed as filtering algorithms which are simple to implement and computationally efficient for a large class of problems. We establish a convergence theory and give convergence rates for such methods, and illustrate their computational speed in numerical tests for inverse problems in geomagnetic exploration and imaging.

  6. Inverse transient heat conduction problems and identification of thermal parameters

    Science.gov (United States)

    Atchonouglo, K.; Banna, M.; Vallée, C.; Dupré, J.-C.

    2008-04-01

    This work deals with the estimation of polymers properties. An inverse analysis based on finite element method is applied to identify simultaneously the constants thermal conductivity and heat capacity per unit volume. The inverse method algorithm constructed is validated from simulated transient temperature recording taken at several locations on the surface of the solid. Transient temperature measures taped with infrared camera on polymers were used for identifying the thermal properties. The results show an excellent agreement between manufacturer and identified values.

  7. 地球物理资料非线性反演方法讲座(八)量子遗传算法%Lecture on Non-Linear Inverse Methods in Geophysical Data(8) Quantum Genetic Algorithm and Its Applicaton in Geophysical Inversion

    Institute of Scientific and Technical Information of China (English)

    罗红明; 王家映; 师学明; 朱培民

    2008-01-01

    虽然线性反演理论目前已经相当成熟,但由于其方法本身比较依赖初始模型,而且容易陷入局部极小,在实际应用中常常显得"力不从心".量子遗传算法QGA(Quantum Genetic Algorithm)以量子理论为基础,通过量子位编码和量子旋转门更新种群来寻找全局最优,加快了搜索速度,具有更强的全局寻优能力.通过对量子遗传算法内在机理的分析表明,QGA的寻优质量和效果明显优于传统遗传算法.

  8. Locative Inversion in English

    NARCIS (Netherlands)

    Broekhuis, H.

    2005-01-01

    This article aims at reformulating in more current terms Hoekstra and Mulder’s (1990) analysis of the Locative Inversion (LI) construction. The new proposal is crucially based on the assumption that Small Clause (SC) predicates agree with their external argument in phi-features, which may be morphol

  9. Frequency-domain waveform inversion using the phase derivative

    KAUST Repository

    Choi, Yun Seok

    2013-09-26

    Phase wrapping in the frequency domain or cycle skipping in the time domain is the major cause of the local minima problem in the waveform inversion when the starting model is far from the true model. Since the phase derivative does not suffer from the wrapping effect, its inversion has the potential of providing a robust and reliable inversion result. We propose a new waveform inversion algorithm using the phase derivative in the frequency domain along with the exponential damping term to attenuate reflections. We estimate the phase derivative, or what we refer to as the instantaneous traveltime, by taking the derivative of the Fourier-transformed wavefield with respect to the angular frequency, dividing it by the wavefield itself and taking the imaginary part. The objective function is constructed using the phase derivative and the gradient of the objective function is computed using the back-propagation algorithm. Numerical examples show that our inversion algorithm with a strong damping generates a tomographic result even for a high ‘single’ frequency, which can be a good initial model for full waveform inversion and migration.

  10. Calculation of the inverse data space via sparse inversion

    KAUST Repository

    Saragiotis, Christos

    2011-01-01

    The inverse data space provides a natural separation of primaries and surface-related multiples, as the surface multiples map onto the area around the origin while the primaries map elsewhere. However, the calculation of the inverse data is far from trivial as theory requires infinite time and offset recording. Furthermore regularization issues arise during inversion. We perform the inversion by minimizing the least-squares norm of the misfit function by constraining the $ell_1$ norm of the solution, being the inverse data space. In this way a sparse inversion approach is obtained. We show results on field data with an application to surface multiple removal.

  11. Inverse Estimation of Transient Heat Flux to Slab Surface

    Institute of Scientific and Technical Information of China (English)

    CUI Miao; YANG Kai; LIU Yun-fei; GAO Xiao-wei

    2012-01-01

    The transient heat flux was calculated using a model for inverse heat conduction problems based on temper- ature measurements. The unknown heat flux was taken as an optimization variable and solved by minimizing the differences between the calculated temperatures and the measured ones. Several examples were given to show the ef- fectiveness and the accuracy of the inverse algorithm in estimating the transient heat flux to a slab surface. The re sults show that the inverse approach can be applied in the steel industry or in other areas where the target of investi- gation is inaccessible to direct measurements or difficult to be directly modeled.

  12. Modular Regularization Algorithms

    DEFF Research Database (Denmark)

    Jacobsen, Michael

    2004-01-01

    The class of linear ill-posed problems is introduced along with a range of standard numerical tools and basic concepts from linear algebra, statistics and optimization. Known algorithms for solving linear inverse ill-posed problems are analyzed to determine how they can be decomposed into indepen......The class of linear ill-posed problems is introduced along with a range of standard numerical tools and basic concepts from linear algebra, statistics and optimization. Known algorithms for solving linear inverse ill-posed problems are analyzed to determine how they can be decomposed...... into independent modules. These modules are then combined to form new regularization algorithms with other properties than those we started out with. Several variations are tested using the Matlab toolbox MOORe Tools created in connection with this thesis. Object oriented programming techniques are explained...... and used to set up the illposed problems in the toolbox. Hereby, we are able to write regularization algorithms that automatically exploit structure in the ill-posed problem without being rewritten explicitly. We explain how to implement a stopping criteria for a parameter choice method based upon...

  13. Inversion of oceanic chloro- phyll concentrations by neural networks

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Neural networks (NNs) for the inversion of chlorophyll concentrations from remote sensing reflectance measurements were designed and trained on a subset of the SeaBAM data set. The remaining SeaBAM data set was then applied to evaluating the performance of NNs and compared with those of the SeaBAM empirical algorithms. NNs achieved better inversion accuracy than the empirical algo-rithms in most of chlorophyll concentration range, especially in the intermediate and high chlorophyll regions and CaseⅡ waters. Systematic overestimation existed in the very low chlorophyll (<0.031 mg/m3) region, and little improvement was obtained by changing the size of the training data set.

  14. 3D strain measurement in soft tissue: demonstration of a novel inverse finite element model algorithm on MicroCT images of a tissue phantom exposed to negative pressure wound therapy.

    Science.gov (United States)

    Wilkes, R; Zhao, Y; Cunningham, K; Kieswetter, K; Haridas, B

    2009-07-01

    This study describes a novel system for acquiring the 3D strain field in soft tissue at sub-millimeter spatial resolution during negative pressure wound therapy (NPWT). Recent research in advanced wound treatment modalities theorizes that microdeformations induced by the application of sub-atmospheric (negative) pressure through V.A.C. GranuFoam Dressing, a reticulated open-cell polyurethane foam (ROCF), is instrumental in regulating the mechanobiology of granulation tissue formation [Saxena, V., Hwang, C.W., Huang, S., Eichbaum, Q., Ingber, D., Orgill, D.P., 2004. Vacuum-assisted closure: Microdeformations of wounds and cell proliferation. Plast. Reconstr. Surg. 114, 1086-1096]. While the clinical response is unequivocal, measurement of deformations at the wound-dressing interface has not been possible due to the inaccessibility of the wound tissue beneath the sealed dressing. Here we describe the development of a bench-test wound model for microcomputed tomography (microCT) imaging of deformation induced by NPWT and an algorithm set for quantifying the 3D strain field at sub-millimeter resolution. Microdeformations induced in the tissue phantom revealed average tensile strains of 18%-23% at sub-atmospheric pressures of -50 to -200 mmHg (-6.7 to -26.7 kPa). The compressive strains (22%-24%) and shear strains (20%-23%) correlate with 2D FEM studies of microdeformational wound therapy in the reference cited above. We anticipate that strain signals quantified using this system can then be used in future research aimed at correlating the effects of mechanical loading on the phenotypic expression of dermal fibroblasts in acute and chronic ulcer models. Furthermore, the method developed here can be applied to continuum deformation analysis in other contexts, such as 3D cell culture via confocal microscopy, full scale CT and MRI imaging, and in machine vision.

  15. Parallel rapid relaxation inversion of 3D magnetotelluric data%大地电磁三维快速松弛反演并行算法研究

    Institute of Scientific and Technical Information of China (English)

    林昌洪; 谭捍东; 佟拓

    2009-01-01

    We implement a parallel algorithm with the advantage of MPI (Message Passing Interface) to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with synthetic and real data. The execution efficiency of the algorithm for several different situations is also compared. The results 'indicate that the parallel rapid relaxation algorithm for 3D magnetotelluric inversion, is effective. This parallel algorithm implemented on a common PC promotes the practical application of 3D magnetotelluric inversion and can be suitable for the other geophysical 3D modeling and inversion.

  16. A new method for multi-exponential inversion of NMR relaxation measurements

    Institute of Scientific and Technical Information of China (English)

    WANG; Zhongdong; XIAO; Lizhi; LIU; Tangyan

    2004-01-01

    A new method for multi-exponential inversion to NMR T1 and T2 relaxation time distributions is suggested and tested. Inversion results are compared with MAP-II which is based on SVD algorithm and widely accepted in the industry. Inversed NMR relaxation spectra that have different pre-assigned relaxation times from echo trains with different SNR confirm that the new method with 16 to 64 equally spaced time constants in logarithm scale will ensure the relaxation distribution. Testing results show that the new inversion algorithm is a valuable tool for rock core NMR experimental analysis and NMR logging data process and interpretation.

  17. Chahine algorithm to invert light scattering spectroscopy of epithelial dysplasia

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    To perceive the epithelial dysplasia from the light scattering spectroscopy (LSS) is an inverse problem, which can be transformed into the inversion of the size distribution of epithelial-cell nuclei. Based on the simulation of single polarized LSS for epithelial-cell nuclei, Chahine algorithm is adopted to retrieve the size distribution. Numerical results show that Chahine algorithm has high inversion precision for both single-peaked and bimodal models, which implies the potential to increase diagnostic resolution of LSS.

  18. Unstructured discontinuous Galerkin for seismic inversion.

    Energy Technology Data Exchange (ETDEWEB)

    van Bloemen Waanders, Bart Gustaaf; Ober, Curtis Curry; Collis, Samuel Scott

    2010-04-01

    This abstract explores the potential advantages of discontinuous Galerkin (DG) methods for the time-domain inversion of media parameters within the earth's interior. In particular, DG methods enable local polynomial refinement to better capture localized geological features within an area of interest while also allowing the use of unstructured meshes that can accurately capture discontinuous material interfaces. This abstract describes our initial findings when using DG methods combined with Runge-Kutta time integration and adjoint-based optimization algorithms for full-waveform inversion. Our initial results suggest that DG methods allow great flexibility in matching the media characteristics (faults, ocean bottom and salt structures) while also providing higher fidelity representations in target regions. Time-domain inversion using discontinuous Galerkin on unstructured meshes and with local polynomial refinement is shown to better capture localized geological features and accurately capture discontinuous-material interfaces. These approaches provide the ability to surgically refine representations in order to improve predicted models for specific geological features. Our future work will entail automated extensions to directly incorporate local refinement and adaptive unstructured meshes within the inversion process.

  19. Auditory model inversion and its application

    Institute of Scientific and Technical Information of China (English)

    ZHAO Heming; WANG Yongqi; CHEN Xueqin

    2005-01-01

    Auditory model has been applied to several aspects of speech signal processing field, and appears to be effective in performance. This paper presents the inverse transform of each stage of one widely used auditory model. First of all it is necessary to invert correlogram and reconstruct phase information by repetitious iterations in order to get auditory-nerve firing rate. The next step is to obtain the negative parts of the signal via the reverse process of the HWR (Half Wave Rectification). Finally the functions of inner hair cell/synapse model and Gammatone filters have to be inverted. Thus the whole auditory model inversion has been achieved. An application of noisy speech enhancement based on auditory model inversion algorithm is proposed. Many experiments show that this method is effective in reducing noise.Especially when SNR of noisy speech is low it is more effective than other methods. Thus this auditory model inversion method given in this paper is applicable to speech enhancement field.

  20. Algorithm design

    CERN Document Server

    Kleinberg, Jon

    2006-01-01

    Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

  1. Genetic algorithms

    Science.gov (United States)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  2. Reduced Bayesian Inversion

    OpenAIRE

    Himpe, Christian; Ohlberger, Mario

    2014-01-01

    Bayesian inversion of models with large state and parameter spaces proves to be computationally complex. A combined state and parameter reduction can significantly decrease the computational time and cost required for the parameter estimation. The presented technique is based on the well-known balanced truncation approach. Classically, the balancing of the controllability and observability gramians allows a truncation of discardable states. Here the underlying model, being a linear or nonline...

  3. The Fukushima Inverse Problem

    OpenAIRE

    Martinez-Camara, Marta; Dokmanic, Ivan; Ranieri, Juri; Scheibler, Robin; Vetterli, Martin; STOHL Andreas

    2013-01-01

    Knowing what amount of radioactive material was released from Fukushima in March 2011 and at what time instants is crucial to assess the risk, the pollution, and to understand the scope of the consequences. Moreover, it could be used in forward simulations to obtain accurate maps of deposition. But these data are often not publicly available. We propose to estimate the emission waveforms by solving an inverse problem. Previous approaches have relied on a detailed expert guess of how the relea...

  4. Sensitivity analysis of distributed volcanic source inversion

    Science.gov (United States)

    Cannavo', Flavio; Camacho, Antonio G.; González, Pablo J.; Puglisi, Giuseppe; Fernández, José

    2016-04-01

    A recently proposed algorithm (Camacho et al., 2011) claims to rapidly estimate magmatic sources from surface geodetic data without any a priori assumption about source geometry. The algorithm takes the advantages of fast calculation from the analytical models and adds the capability to model free-shape distributed sources. Assuming homogenous elastic conditions, the approach can determine general geometrical configurations of pressured and/or density source and/or sliding structures corresponding to prescribed values of anomalous density, pressure and slip. These source bodies are described as aggregation of elemental point sources for pressure, density and slip, and they fit the whole data (keeping some 3D regularity conditions). Although some examples and applications have been already presented to demonstrate the ability of the algorithm in reconstructing a magma pressure source (e.g. Camacho et al., 2011,Cannavò et al., 2015), a systematic analysis of sensitivity and reliability of the algorithm is still lacking. In this explorative work we present results from a large statistical test designed to evaluate the advantages and limitations of the methodology by assessing its sensitivity to the free and constrained parameters involved in inversions. In particular, besides the source parameters, we focused on the ground deformation network topology, and noise in measurements. The proposed analysis can be used for a better interpretation of the algorithm results in real-case applications. Camacho, A. G., González, P. J., Fernández, J. & Berrino, G. (2011) Simultaneous inversion of surface deformation and gravity changes by means of extended bodies with a free geometry: Application to deforming calderas. J. Geophys. Res. 116. Cannavò F., Camacho A.G., González P.J., Mattia M., Puglisi G., Fernández J. (2015) Real Time Tracking of Magmatic Intrusions by means of Ground Deformation Modeling during Volcanic Crises, Scientific Reports, 5 (10970) doi:10.1038/srep

  5. Explicit inverse distance weighting mesh motion for coupled problems

    OpenAIRE

    Witteveen, J.A.S.; Bijl, H.

    2009-01-01

    An explicit mesh motion algorithm based on inverse distance weighting interpolation is presented. The explicit formulation leads to a fast mesh motion algorithm and an easy implementation. In addition, the proposed point-by-point method is robust and flexible in case of large deformations, hanging nodes, and parallelization. Mesh quality results and CPU time comparisons are presented for triangular and hexahedral unstructured meshes in an airfoil flutter fluid-structure interaction problem.

  6. [Total inversion of the uterus].

    Science.gov (United States)

    Novachkov, V; Baltadzhieva, B; Ilieva, A; Rachev, E

    2008-01-01

    Non puerperal inversion of the uterus is very uncommon. Patients may present with pelvic pain, vaginal bleeding or hemodynamic shock. We report a fifty five old woman with uterus inversion second stage.

  7. Inversion based on computational simulations

    Energy Technology Data Exchange (ETDEWEB)

    Hanson, K.M.; Cunningham, G.S.; Saquib, S.S.

    1998-09-01

    A standard approach to solving inversion problems that involve many parameters uses gradient-based optimization to find the parameters that best match the data. The authors discuss enabling techniques that facilitate application of this approach to large-scale computational simulations, which are the only way to investigate many complex physical phenomena. Such simulations may not seem to lend themselves to calculation of the gradient with respect to numerous parameters. However, adjoint differentiation allows one to efficiently compute the gradient of an objective function with respect to all the variables of a simulation. When combined with advanced gradient-based optimization algorithms, adjoint differentiation permits one to solve very large problems of optimization or parameter estimation. These techniques will be illustrated through the simulation of the time-dependent diffusion of infrared light through tissue, which has been used to perform optical tomography. The techniques discussed have a wide range of applicability to modeling including the optimization of models to achieve a desired design goal.

  8. Inverse problems and uncertainty quantification

    KAUST Repository

    Litvinenko, Alexander

    2013-12-18

    In a Bayesian setting, inverse problems and uncertainty quantification (UQ)— the propagation of uncertainty through a computational (forward) model—are strongly connected. In the form of conditional expectation the Bayesian update becomes computationally attractive. This is especially the case as together with a functional or spectral approach for the forward UQ there is no need for time- consuming and slowly convergent Monte Carlo sampling. The developed sampling- free non-linear Bayesian update is derived from the variational problem associated with conditional expectation. This formulation in general calls for further discretisa- tion to make the computation possible, and we choose a polynomial approximation. After giving details on the actual computation in the framework of functional or spectral approximations, we demonstrate the workings of the algorithm on a number of examples of increasing complexity. At last, we compare the linear and quadratic Bayesian update on the small but taxing example of the chaotic Lorenz 84 model, where we experiment with the influence of different observation or measurement operators on the update.

  9. Inverse Problems and Uncertainty Quantification

    KAUST Repository

    Litvinenko, Alexander

    2014-01-06

    In a Bayesian setting, inverse problems and uncertainty quantification (UQ) - the propagation of uncertainty through a computational (forward) modelare strongly connected. In the form of conditional expectation the Bayesian update becomes computationally attractive. This is especially the case as together with a functional or spectral approach for the forward UQ there is no need for time- consuming and slowly convergent Monte Carlo sampling. The developed sampling- free non-linear Bayesian update is derived from the variational problem associated with conditional expectation. This formulation in general calls for further discretisa- tion to make the computation possible, and we choose a polynomial approximation. After giving details on the actual computation in the framework of functional or spectral approximations, we demonstrate the workings of the algorithm on a number of examples of increasing complexity. At last, we compare the linear and quadratic Bayesian update on the small but taxing example of the chaotic Lorenz 84 model, where we experiment with the influence of different observation or measurement operators on the update.

  10. New pole placement algorithm - Polynomial matrix approach

    Science.gov (United States)

    Shafai, B.; Keel, L. H.

    1990-01-01

    A simple and direct pole-placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well-established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.

  11. Kalman plus weights: a time scale algorithm

    Science.gov (United States)

    Greenhall, C. A.

    2001-01-01

    KPW is a time scale algorithm that combines Kalman filtering with the basic time scale equation (BTSE). A single Kalman filter that estimates all clocks simultaneously is used to generate the BTSE frequency estimates, while the BTSE weights are inversely proportional to the white FM variances of the clocks. Results from simulated clock ensembles are compared to previous simulation results from other algorithms.

  12. Joint inversion of surface and borehole magnetic amplitude data

    Science.gov (United States)

    Li, Zelin; Yao, Changli; Zheng, Yuanman; Yuan, Xiaoyu

    2016-04-01

    3D magnetic inversion for susceptibility distribution is a powerful tool in quantitative interpretation of magnetic data in mineral exploration. However, the inversion and interpretation of such data are faced with two problems. One problem is the poor imaging results of deep sources when only surface data are inverted. The other is the unknown total magnetization directions of sources when strong remanence exists. To deal with these problems simultaneously, we propose a method through the joint inversion of surface and borehole magnetic amplitude data. In this method, we first transform both surface and borehole magnetic data to magnetic amplitude data that are less sensitive to the directions of total magnetization, and then preform a joint inversion of the whole amplitude data to generate a 3D susceptibility distribution. The amplitude inversion algorithm uses Tikhonov regularization and imposes a positivity constraint on the effective susceptibility defined as the ratio of magnetization magnitude over the geomagnetic field strength. In addition, a distance-based weighting function is used to make the algorithm applicable to joint data sets. To solve this positivity-constraint inversion problem efficiently, an appropriate optimization method must be chosen. We first use an interior-point method to incorporate the positivity constraint into the total objective function, and then minimize the objective function via a Gauss-Newton method due to the nonlinearity introduced by the positivity constraint and the amplitude data. To further improve the efficiency of the inversion algorithm, we use a conjugate gradient method to carry out the fast matrix-vector multiplication during the minimization. To verify the utility of the proposed method, we invert the synthetic and field data using three inversion methods, including the joint inversion of surface and borehole three-component magnetic data, the inversion of surface magnetic amplitude data, and the proposed joint

  13. Voxel inversion of airborne electromagnetic data for improved model integration

    Science.gov (United States)

    Fiandaca, Gianluca; Auken, Esben; Kirkegaard, Casper; Vest Christiansen, Anders

    2014-05-01

    Inversion of electromagnetic data has migrated from single site interpretations to inversions including entire surveys using spatial constraints to obtain geologically reasonable results. Though, the model space is usually linked to the actual observation points. For airborne electromagnetic (AEM) surveys the spatial discretization of the model space reflects the flight lines. On the contrary, geological and groundwater models most often refer to a regular voxel grid, not correlated to the geophysical model space, and the geophysical information has to be relocated for integration in (hydro)geological models. We have developed a new geophysical inversion algorithm working directly in a voxel grid disconnected from the actual measuring points, which then allows for informing directly geological/hydrogeological models. The new voxel model space defines the soil properties (like resistivity) on a set of nodes, and the distribution of the soil properties is computed everywhere by means of an interpolation function (e.g. inverse distance or kriging). Given this definition of the voxel model space, the 1D forward responses of the AEM data are computed as follows: 1) a 1D model subdivision, in terms of model thicknesses, is defined for each 1D data set, creating "virtual" layers. 2) the "virtual" 1D models at the sounding positions are finalized by interpolating the soil properties (the resistivity) in the center of the "virtual" layers. 3) the forward response is computed in 1D for each "virtual" model. We tested the new inversion scheme on an AEM survey carried out with the SkyTEM system close to Odder, in Denmark. The survey comprises 106054 dual mode AEM soundings, and covers an area of approximately 13 km X 16 km. The voxel inversion was carried out on a structured grid of 260 X 325 X 29 xyz nodes (50 m xy spacing), for a total of 2450500 inversion parameters. A classical spatially constrained inversion (SCI) was carried out on the same data set, using 106054

  14. Algorithmic cryptanalysis

    CERN Document Server

    Joux, Antoine

    2009-01-01

    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

  15. Inversion assuming weak scattering

    DEFF Research Database (Denmark)

    Xenaki, Angeliki; Gerstoft, Peter; Mosegaard, Klaus

    2013-01-01

    The study of weak scattering from inhomogeneous media or interface roughness has long been of interest in sonar applications. In an acoustic backscattering model of a stationary field of volume inhomogeneities, a stochastic description of the field is more useful than a deterministic description...... due to the complex nature of the field. A method based on linear inversion is employed to infer information about the statistical properties of the scattering field from the obtained cross-spectral matrix. A synthetic example based on an active high-frequency sonar demonstrates that the proposed...

  16. Inverse Degree and Connectivity

    Institute of Scientific and Technical Information of China (English)

    MA Xiao-ling; TIAN Ying-zhi

    2013-01-01

    Let G be a connected graph with vertex set V(G),order n =丨V(G)丨,minimum degree δ(G) and connectivity κ(G).The graph G is called maximally connected if κ(G) =δ(G).Define the inverse degree of G with no isolated vertices as R(G) =Σv∈V(G)1/d(v),where d(v) denotes the degree of the vertex v.We show that G is maximally connected if R(G) < 1 + 2/δ + n-2δ+1/(n-1)(n-3).

  17. Layered and Laterally Constrained 2D Inversion of Time Domain Induced Polarization Data

    DEFF Research Database (Denmark)

    Fiandaca, Gianluca; Ramm, James; Auken, Esben;

    In a sedimentary environment, quasi-layered models often represent the actual geology more accurately than smooth minimum-structure models. We have developed a new layered and laterally constrained inversion algorithm for time domain induced polarization data. The algorithm is based on the time...... transform of a complex resistivity forward response and the inversion extracts the spectral information of the time domain measures in terms of the Cole-Cole parameters. The developed forward code and inversion algorithm use the full time decay of the induced polarization response, together with an accurate...... description of the transmitter waveform and of the receiver transfer function allowing for a quantitative interpretation of the parameters. The code has been optimized for parallel computation and the inversion time is comparable to codes inverting just for direct current resistivity. The new inversion...

  18. The inversion of 2D NMR relaxometry data using L1 regularization

    Science.gov (United States)

    Zhou, Xiaolong; Su, Guanqun; Wang, Lijia; Nie, Shengdong; Ge, Xinmin

    2017-02-01

    NMR relaxometry has been used as a powerful tool to study molecular dynamics. Many algorithms have been developed for the inversion of 2D NMR relaxometry data. Unlike traditional algorithms implementing L2 regularization, high order Tikhonov regularization or iterative regularization, L1 penalty term is involved to constrain the sparsity of resultant spectra in this paper. Then fast iterative shrinkage-thresholding algorithm (FISTA) is proposed to solve the L1 regularization problem. The effectiveness, noise vulnerability and practical utility of the proposed algorithm are analyzed by simulations and experiments. The results demonstrate that the proposed algorithm has a more excellent capability to reveal narrow peaks than traditional inversion algorithms. The L1 regularization implemented by our algorithm can be a useful complementary to the existing algorithms.

  19. Recursive Inversion By Finite-Impulse-Response Filters

    Science.gov (United States)

    Bach, Ralph E., Jr.; Baram, Yoram

    1991-01-01

    Recursive approximation gives least-squares best fit to exact response. Algorithm yields finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Applicable to such system-inversion problems as suppression of echoes and identification of target from its scatter response to incident impulse.

  20. Effective and accurate processing and inversion of airborne electromagnetic data

    DEFF Research Database (Denmark)

    Auken, Esben; Christiansen, Anders Vest; Andersen, Kristoffer Rønne

    Airborne electromagnetic (AEM) data is used throughout the world for mapping of mineral targets and groundwater resources. The development of technology and inversion algorithms has been tremendously over the last decade and results from these surveys are high-resolution images of the subsurface...

  1. Broadband matched-field inversion for shallow water environment parameters

    Institute of Scientific and Technical Information of China (English)

    YANG Kunde; MA Yuanliang

    2003-01-01

    In this paper, broadband multi-frequencies matched-field inversion method is used to determine the environmental parameters in shallow water. According to different conditions, several broadband objective functions are presented. Using ASIAEX2001 experiment data and genetic algorithms, environmental parameters are obtained, especially in sediment.

  2. AN INVERSE MAXIMUM CAPACITY PATH PROBLEM WITH LOWER BOUND CONSTRAINTS

    Institute of Scientific and Technical Information of China (English)

    杨超; 陈学旗

    2002-01-01

    The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomial algorithm for a local optimal solution is provided.

  3. A Parallel Butterfly Algorithm

    KAUST Repository

    Poulson, Jack

    2014-02-04

    The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

  4. An Algorithm for Solving Quadratic Programming Problems

    Directory of Open Access Journals (Sweden)

    V. Moraru

    1997-08-01

    Full Text Available Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems.

  5. ILU preconditioning based on the FAPINV algorithm

    Directory of Open Access Journals (Sweden)

    Davod Khojasteh Salkuyeh

    2015-01-01

    Full Text Available A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV algorithm is presented. We show that this algorithm is well-defined for H-matrices. Moreover, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Numerical experiments on some test matrices are given to show the efficiency of the new ILU preconditioner.

  6. Algorithmic mathematics

    CERN Document Server

    Hougardy, Stefan

    2016-01-01

    Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

  7. The Rational Hybrid Monte Carlo Algorithm

    CERN Document Server

    Clark, M A

    2006-01-01

    The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

  8. The Rational Hybrid Monte Carlo algorithm

    Science.gov (United States)

    Clark, Michael

    2006-12-01

    The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

  9. Quantitative analysis of SMEX'02 AIRSAR data for soil moisture inversion

    Science.gov (United States)

    Zyl, J. J. van; Njoku, E.; Jackson, T.

    2003-01-01

    This paper discusses in detail the characteristics of the AIRSAR data acquired, and provides an initial quantitative assessment of the accuracy of the radar inversion algorithms under these vegetated conditions.

  10. Quantitative analysis of SMEX'02 AIRSAR data for soil moisture inversion

    Science.gov (United States)

    Zyl, J. J. van; Njoku, E.; Jackson, T.

    2003-01-01

    This paper discusses in detail the characteristics of the AIRSAR data acquired, and provides an initial quantitative assessment of the accuracy of the radar inversion algorithms under these vegetated conditions.

  11. Fast Inverse Nonlinear Fourier Transforms for Fiber Bragg Grating Design and Related Problems

    CERN Document Server

    Wahls, Sander

    2016-01-01

    The problem of constructing a fiber Bragg grating profile numerically such that the reflection coefficient of the grating matches a given specification is considered. The well-known analytic solution to this problem is given by a suitable inverse nonlinear Fourier transform (also known as inverse scattering transform) of the specificed reflection coefficient. Many different algorithms have been proposed to compute this inverse nonlinear Fourier transform numerically. The most efficient ones require $\\mathcal{O}(D^{2})$ floating point operations (flops) to generate $D$ samples of the grating profile. In this paper, two new fast inverse nonlinear Fourier transform algorithms that require only $\\mathcal{O}(D\\log^{2}D)$ flops are proposed. The merits of our algorithms are demonstrated in numerical examples, in which they are compared to a conventional layer peeling method, the Toeplitz inner bordering method and integral layer peeling. One of our two algorithms also extends to the design problem for fiber-assiste...

  12. Two dimensional joint inversion of direct current resistivity, radio-magnetotelluric and seismic refraction data: An application from Bafra Plain, Turkey

    Science.gov (United States)

    Demirci, İsmail; Candansayar, Mehmet Emin; Vafidis, Antonis; Soupios, Pantelis

    2017-04-01

    Direct current resistivity, radio-magnetotelluric and seismic refraction methods are widely used in the identification of near surface structures with collected data generally being interpreted separately. In recent decades, the use of joint inversion algorithms in geosciences has become widespread to identify near surface structures. However, there is no developed joint inversion algorithm using direct current resistivity, radio-magnetotelluric and seismic refraction methods. In this study, we developed a new two-dimensional joint inversion algorithm for direct current resistivity, radio-magnetotelluric and seismic refraction data based on a cross gradient approach. In addition, we proposed a new data weighting matrix to stabilize the convergence behavior of the joint inversion algorithms. We used synthetic data to show the advantage of the algorithm. The developed joint inversion algorithm found resistivity and velocity models that are better than the individual inversion of each data set. We also tested an algorithm with the field data collected in the Bafra Plain (Samsun, Turkey) to investigate saltwater intrusion. In comparing the field data inversion results with the sounding log, it can be seen that the developed joint inversion algorithm with the proposed data weighting matrix recovered the resistivity and velocity model better than the individual inversion and classical joint inversion of each data set. Our results showed that a more unique hydrogeological scenario might be obtained, especially in highly conductive media, with the joint usage of these methods.

  13. Quantum Algorithms

    Science.gov (United States)

    Abrams, D.; Williams, C.

    1999-01-01

    This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

  14. Total algorithms

    NARCIS (Netherlands)

    Tel, G.

    1993-01-01

    We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of distri

  15. Constrained Two-Dimensional Inversion of Gravity Data

    Directory of Open Access Journals (Sweden)

    Hendra Grandis

    2014-04-01

    Full Text Available The non-uniqueness in the solution of gravity inversion poses a major problem in the interpretation of gravity data. To overcome this ambiguity, “a priori” information is introduced by minimizing a functional that describes the geometrical or physical properties of the solution. This paper presents a 2D gravity inversion technique incorporating axes of anomalous mass concentration as constraints. The inverse problem is formulated as a minimization of the moment of inertia of the causative body with respect to the axes of the mass concentration. The proposed method is particularly applicable to homogeneous, linear mass distributions, such as mineralization along faults and intruded sills or dikes. Inversions of synthetic and field data illustrate the versatility of the implemented algorithm.

  16. Inversion for sediment geoacoustic properties at the New England Bight

    Science.gov (United States)

    Potty, Gopu R.; Miller, James H.; Lynch, James F.

    2003-10-01

    This article discusses inversions for bottom geoacoustic properties using broadband acoustic signals obtained from explosive sources. Two different inversion schemes for estimating the compressional wave speeds and attenuation are presented in this paper. In addition to these sediment parameters, source-receiver range is also estimated using the arrival time data. The experimental data used for the inversions are SUS charge explosions acquired on a vertical hydrophone array during the Shelf Break Primer Experiment conducted south of New England in the Middle Atlantic Bight in August 1996. The modal arrival times are extracted using a wavelet analysis. In the first inversion scheme, arrival times corresponding to various modes and frequencies from 10 to 200 Hz are used for the inversion of compressional wave speeds. A hybrid inversion scheme based on a genetic algorithm (GA) is used for the inversion. In an earlier study, Potty et al. [J. Acoust. Soc. Am. 108(3), 973-986 (2000)] have used this hybrid scheme in a range-independent environment. In the present study results of range-dependent inversions are presented. The sound speeds in the water column and bathymetry are assumed range dependent, whereas the sediment compressional wave speeds are assumed range independent. The variations in the sound speeds in the water column are represented using empirical orthogonal functions (EOFs). The replica fields corresponding to the unknown parameters were constructed using adiabatic theory. In the second inversion scheme, modal attenuation coefficients are calculated using modal amplitude ratios. The ratios of the modal amplitudes are also calculated using time-frequency diagrams. A GA-based inversion scheme is used for this search. Finally, as a cross check, the computed compressional wave speeds along with the modal arrival times were used to estimate the source-receiver range. The inverted sediment properties and ranges are seen to compare well with in situ measurements

  17. Riemann–Hilbert problem approach for two-dimensional flow inverse scattering

    Energy Technology Data Exchange (ETDEWEB)

    Agaltsov, A. D., E-mail: agalets@gmail.com [Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, 119991 Moscow (Russian Federation); Novikov, R. G., E-mail: novikov@cmap.polytechnique.fr [CNRS (UMR 7641), Centre de Mathématiques Appliquées, Ecole Polytechnique, 91128 Palaiseau (France); IEPT RAS, 117997 Moscow (Russian Federation); Moscow Institute of Physics and Technology, Dolgoprudny (Russian Federation)

    2014-10-15

    We consider inverse scattering for the time-harmonic wave equation with first-order perturbation in two dimensions. This problem arises in particular in the acoustic tomography of moving fluid. We consider linearized and nonlinearized reconstruction algorithms for this problem of inverse scattering. Our nonlinearized reconstruction algorithm is based on the non-local Riemann–Hilbert problem approach. Comparisons with preceding results are given.

  18. Optimization of regularization parameter of inversion in particle sizing using light extinction method

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In particle sizing by light extinction method, the regularization parameter plays an important role in applying regularization to find the solution to ill-posed inverse problems. We combine the generalized cross-validation (GCV) and L-curve criteria with the Twomey-NNLS algorithm in parameter optimization. Numerical simulation and experimental validation show that the resistance of the newly developed algorithms to measurement errors can be improved leading to stable inversion results for unimodal particle size distribution.

  19. Solving Inverse Kinematics – A New Approach to the Extended Jacobian Technique

    Directory of Open Access Journals (Sweden)

    M. Šoch

    2005-01-01

    Full Text Available This paper presents a brief summary of current numerical algorithms for solving the Inverse Kinematics problem. Then a new approach based on the Extended Jacobian technique is compared with the current Jacobian Inversion method. The presented method is intended for use in the field of computer graphics for animation of articulated structures. 

  20. Considerations about the solution space of a VTI marine CSEM Inversion problem using vertical antennas

    NARCIS (Netherlands)

    Hunziker, J.W.; Thorbecke, J.W.; Slob, E.C.

    2015-01-01

    We exploit the randomness of a genetic inversion algorithm to map the global minimum of the solution space of Controlled-Source Electromagnetic inversion problems. In this study, we focus on the information content that vertical electric or magnetic receivers could add to solve for anisotropic condu

  1. Efficient Inversion in Underwater Acoustics with Analytic, Iterative and Sequential Bayesian Methods

    Science.gov (United States)

    2015-09-30

    Iterative and Sequential Bayesian Methods Zoi-Heleni Michalopoulou Department of Mathematical Sciences New Jersey Institute of Technology...exploiting (fully or partially) the physics of the propagation medium. Algorithms are designed for inversion via the extraction of features of the...statistical modeling. • Develop methods for passive localization and inversion of environmental parameters that select features of propagation that are

  2. Embedding Term Similarity and Inverse Document Frequency into a Logical Model of Information Retrieval.

    Science.gov (United States)

    Losada, David E.; Barreiro, Alvaro

    2003-01-01

    Proposes an approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. Highlights include document representation and matching; incorporating term similarity into the measure of distance; new algorithms for implementation; inverse document frequency; and logical versus classical models of…

  3. Deformation field validation and inversion applied to adaptive radiation therapy.

    Science.gov (United States)

    Vercauteren, Tom; De Gersem, Werner; Olteanu, Luiza A M; Madani, Indira; Duprez, Fréderic; Berwouts, Dieter; Speleers, Bruno; De Neve, Wilfried

    2013-08-07

    Development and implementation of chronological and anti-chronological adaptive dose accumulation strategies in adaptive intensity-modulated radiation therapy (IMRT) for head-and-neck cancer. An algorithm based on Newton iterations was implemented to efficiently compute inverse deformation fields (DFs). Four verification steps were performed to ensure a valid dose propagation: intra-cell folding detection finds zero or negative Jacobian determinants in the input DF; inter-cell folding detection is implemented on the resolution of the output DF; a region growing algorithm detects undefined values in the output DF; DF domains can be composed and displayed on the CT data. In 2011, one patient with nonmetastatic head and neck cancer selected from a three phase adaptive DPBN study was used to illustrate the algorithms implemented for adaptive chronological and anti-chronological dose accumulation. The patient received three (18)F-FDG-PET/CTs prior to each treatment phase and one CT after finalizing treatment. Contour propagation and DF generation between two consecutive CTs was performed in Atlas-based autosegmentation (ABAS). Deformable image registration based dose accumulations were performed on CT1 and CT4. Dose propagation was done using combinations of DFs or their inversions. We have implemented a chronological and anti-chronological dose accumulation algorithm based on DF inversion. Algorithms were designed and implemented to detect cell folding.

  4. Deformation field validation and inversion applied to adaptive radiation therapy

    Science.gov (United States)

    Vercauteren, Tom; De Gersem, Werner; Olteanu, Luiza A. M.; Madani, Indira; Duprez, Fréderic; Berwouts, Dieter; Speleers, Bruno; De Neve, Wilfried

    2013-08-01

    Development and implementation of chronological and anti-chronological adaptive dose accumulation strategies in adaptive intensity-modulated radiation therapy (IMRT) for head-and-neck cancer. An algorithm based on Newton iterations was implemented to efficiently compute inverse deformation fields (DFs). Four verification steps were performed to ensure a valid dose propagation: intra-cell folding detection finds zero or negative Jacobian determinants in the input DF; inter-cell folding detection is implemented on the resolution of the output DF; a region growing algorithm detects undefined values in the output DF; DF domains can be composed and displayed on the CT data. In 2011, one patient with nonmetastatic head and neck cancer selected from a three phase adaptive DPBN study was used to illustrate the algorithms implemented for adaptive chronological and anti-chronological dose accumulation. The patient received three 18F-FDG-PET/CTs prior to each treatment phase and one CT after finalizing treatment. Contour propagation and DF generation between two consecutive CTs was performed in Atlas-based autosegmentation (ABAS). Deformable image registration based dose accumulations were performed on CT1 and CT4. Dose propagation was done using combinations of DFs or their inversions. We have implemented a chronological and anti-chronological dose accumulation algorithm based on DF inversion. Algorithms were designed and implemented to detect cell folding.

  5. Compressed word problems for inverse monoids

    CERN Document Server

    Lohrey, Markus

    2011-01-01

    The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that generate a single string, are used in this paper. It is shown that the compressed word problem for a free inverse monoid of finite rank at least two is complete for Pi^p_2 (second universal level of the polynomial time hierarchy). Moreover, it is shown that there exists a fixed finite idempotent presentation (i.e., a finite set of relations involving idempotents of a free inverse monoid), for which the corresponding quotient monoid has a PSPACE-complete compressed word problem. It was shown previously that the ordinary uncompressed word problem for such a quotient can be solved in logspace. Finally, a PSPACE-algorithm that checks whether a given element of a free inverse monoid belongs to a given rational subset is presented. This problem is also shown to be PSPACE-complet...

  6. Inverse problems biomechanical imaging (Conference Presentation)

    Science.gov (United States)

    Oberai, Assad A.

    2016-03-01

    It is now well recognized that a host of imaging modalities (a list that includes Ultrasound, MRI, Optical Coherence Tomography, and optical microscopy) can be used to "watch" tissue as it deforms in response to an internal or external excitation. The result is a detailed map of the deformation field in the interior of the tissue. This deformation field can be used in conjunction with a material mechanical response to determine the spatial distribution of material properties of the tissue by solving an inverse problem. Images of material properties thus obtained can be used to quantify the health of the tissue. Recently, they have been used to detect, diagnose and monitor cancerous lesions, detect vulnerable plaque in arteries, diagnose liver cirrhosis, and possibly detect the onset of Alzheimer's disease. In this talk I will describe the mathematical and computational aspects of solving this class of inverse problems, and their applications in biology and medicine. In particular, I will discuss the well-posedness of these problems and quantify the amount of displacement data necessary to obtain a unique property distribution. I will describe an efficient algorithm for solving the resulting inverse problem. I will also describe some recent developments based on Bayesian inference in estimating the variance in the estimates of material properties. I will conclude with the applications of these techniques in diagnosing breast cancer and in characterizing the mechanical properties of cells with sub-cellular resolution.

  7. Computationally efficient Bayesian inference for inverse problems.

    Energy Technology Data Exchange (ETDEWEB)

    Marzouk, Youssef M.; Najm, Habib N.; Rahn, Larry A.

    2007-10-01

    Bayesian statistics provides a foundation for inference from noisy and incomplete data, a natural mechanism for regularization in the form of prior information, and a quantitative assessment of uncertainty in the inferred results. Inverse problems - representing indirect estimation of model parameters, inputs, or structural components - can be fruitfully cast in this framework. Complex and computationally intensive forward models arising in physical applications, however, can render a Bayesian approach prohibitive. This difficulty is compounded by high-dimensional model spaces, as when the unknown is a spatiotemporal field. We present new algorithmic developments for Bayesian inference in this context, showing strong connections with the forward propagation of uncertainty. In particular, we introduce a stochastic spectral formulation that dramatically accelerates the Bayesian solution of inverse problems via rapid evaluation of a surrogate posterior. We also explore dimensionality reduction for the inference of spatiotemporal fields, using truncated spectral representations of Gaussian process priors. These new approaches are demonstrated on scalar transport problems arising in contaminant source inversion and in the inference of inhomogeneous material or transport properties. We also present a Bayesian framework for parameter estimation in stochastic models, where intrinsic stochasticity may be intermingled with observational noise. Evaluation of a likelihood function may not be analytically tractable in these cases, and thus several alternative Markov chain Monte Carlo (MCMC) schemes, operating on the product space of the observations and the parameters, are introduced.

  8. Inverse Distance Weighted Interpolation Involving Position Shading

    Directory of Open Access Journals (Sweden)

    LI Zhengquan

    2015-01-01

    Full Text Available Considering the shortcomings of inverse distance weighted (IDW interpolation in practical applications, this study improved the IDW algorithm and put forward a new spatial interpolation method that named as adjusted inverse distance weighted (AIDW. In interpolating process, the AIDW is capable of taking into account the comprehensive influence of distance and position of sample point to interpolation point, by adding a coefficient (K into the normal IDW formula. The coefficient (K is used to adjust interpolation weight of the sample point according to its position in sample points. Theoretical analysis and practical application indicates that the AIDW algorithm could diminish or eliminate the IDW interpolation defect of non-uniform distribution of sample points. Consequently the AIDW interpolating is more reasonable, compared with the IDW interpolating. On the other hand, the contour plotting of the AIDW interpolation could effectively avoid the implausible isolated and concentric circles that originated from the defect of the IDW interpolation, with the result that the contour derived from the AIDW interpolated surface is more similar to the professional manual identification.

  9. Sparse Inverse Covariance Selection via Alternating Linearization Methods

    CERN Document Server

    Scheinberg, Katya; Goldfarb, Donald

    2010-01-01

    Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse covariance matrix of the Gaussian distribution, one can learn the structure of the graph by estimating a sparse inverse covariance matrix from sample data, by solving a convex maximum likelihood problem with an $\\ell_1$-regularization term. In this paper, we propose a first-order method based on an alternating linearization technique that exploits the problem's special structure; in particular, the subproblems solved in each iteration have closed-form solutions. Moreover, our algorithm obtains an $\\epsilon$-optimal solution in $O(1/\\epsilon)$ iterations. Numerical experiments on both synthetic and real data from gene association networks show that a practical version of this algorithm outperforms other competitive algorithms.

  10. Inverse problems in classical and quantum physics

    Energy Technology Data Exchange (ETDEWEB)

    Almasy, A.A.

    2007-06-29

    The subject of this thesis is in the area of Applied Mathematics known as Inverse Problems. Inverse problems are those where a set of measured data is analysed in order to get as much information as possible on a model which is assumed to represent a system in the real world. We study two inverse problems in the fields of classical and quantum physics: QCD condensates from tau-decay data and the inverse conductivity problem. Despite a concentrated effort by physicists extending over many years, an understanding of QCD from first principles continues to be elusive. Fortunately, data continues to appear which provide a rather direct probe of the inner workings of the strong interactions. We use a functional method which allows us to extract within rather general assumptions phenomenological parameters of QCD (the condensates) from a comparison of the time-like experimental data with asymptotic space-like results from theory. The price to be paid for the generality of assumptions is relatively large errors in the values of the extracted parameters. Although we do not claim that our method is superior to other approaches, we hope that our results lend additional confidence to the numerical results obtained with the help of methods based on QCD sum rules. EIT is a technology developed to image the electrical conductivity distribution of a conductive medium. The technique works by performing simultaneous measurements of direct or alternating electric currents and voltages on the boundary of an object. These are the data used by an image reconstruction algorithm to determine the electrical conductivity distribution within the object. In this thesis, two approaches of EIT image reconstruction are proposed. The first is based on reformulating the inverse problem in terms of integral equations. This method uses only a single set of measurements for the reconstruction. The second approach is an algorithm based on linearisation which uses more then one set of measurements. A

  11. Influences of Gate Operation Errors in the Quantum Counting Algorithm

    Institute of Scientific and Technical Information of China (English)

    Qing Ai; Yan-Song Li; Gui-Lu Long

    2006-01-01

    In this article, the error analysis in the quantum counting algorithm is investigated. It has been found that the random error plays as important a role as the systematic error does in the phase inversion operations. Both systematic and random errors are important in the Hadamard transformation. This is quite different from the Grover algorithm and the Shor algorithm.

  12. Dark Radiative Inverse Seesaw

    CERN Document Server

    Ahriche, Amine; Nasri, Salah

    2016-01-01

    We present a minimal model that simultaneously accounts for neutrino masses and the origin of dark matter (DM) and where the electroweak phase transition is strong enough to allow for electroweak baryogenesis. The Standard Model is enlarged with a Majorana fermion, three generations of chiral fermion pairs, and a single complex scalar that plays a central role in DM production and phenomenology, neutrino masses, and the strength of the phase transition. All the new fields are singlets under the SM gauge group. Neutrino masses are generated via a new variant of radiative inverse seesaw where the required small mass term is generated via loops involving DM and no large hierarchy is assumed among the mass scales. The model offers all the advantage of low-scale neutrino mass models as well as a viable dark matter candidate that is testable with direct detection experiments.

  13. Monte Carlo full-waveform inversion of crosshole GPR data using multiple-point geostatistical a priori information

    DEFF Research Database (Denmark)

    Cordua, Knud Skou; Hansen, Thomas Mejer; Mosegaard, Klaus

    2012-01-01

    We present a general Monte Carlo full-waveform inversion strategy that integrates a priori information described by geostatistical algorithms with Bayesian inverse problem theory. The extended Metropolis algorithm can be used to sample the a posteriori probability density of highly nonlinear......) Based on a posteriori realizations, complicated statistical questions can be answered, such as the probability of connectivity across a layer. (3) Complex a priori information can be included through geostatistical algorithms. These benefits, however, require more computing resources than traditional...

  14. Mapping soil water dynamics and a moving wetting front by spatiotemporal inversion of electromagnetic induction data

    Science.gov (United States)

    Huang, J.; Monteiro Santos, F. A.; Triantafilis, J.

    2016-11-01

    Characterization of the spatiotemporal distribution of soil volumetric water content (θ) is fundamental to agriculture, ecology, and earth science. Given the labor intensive and inefficient nature of determining θ, apparent electrical conductivity (ECa) measured by electromagnetic induction has been used as a proxy. A number of previous studies have employed inversion algorithms to convert ECa data to depth-specific electrical conductivity (σ) which could then be correlated to soil θ and other soil properties. The purpose of this study was to develop a spatiotemporal inversion algorithm which accounts for the temporal continuity of ECa. The algorithm was applied to a case study where time-lapse ECa was collected on a 350 m transect on seven different days on an alfalfa farm in the USA. Results showed that the approach was able to map the location of moving wetting front along the transect. Results also showed that the spatiotemporal inversion algorithm was more precise (RMSE = 0.0457 cm3/cm3) and less biased (ME = -0.0023 cm3/cm3) as compared with the nonspatiotemporal inversion approach (0.0483 cm3/cm3 and ME = -0.0030 cm3/cm3, respectively). In addition, the spatiotemporal inversion algorithm allows for a reduced set of ECa surveys to be used when non abrupt changes of soil water content occur with time. To apply this spatiotemporal inversion algorithm beyond low induction number condition, full solution of the EM induction phenomena can be studied in the future.

  15. Numerical test of an inverse polarized radiative transfer algorithm

    CERN Document Server

    Viik, T

    2003-01-01

    A procedure is tested with which to determine the single-scattering albedo from polarization measurements of the angle-dependent intensity at two locations within, or on the boundaries of, a homogeneous finite or infinite atmosphere that scatters radiation according to the Rayleigh law with true absorption.

  16. Inverse Queries For Multidimensional Spaces

    CERN Document Server

    Bernecker, Thomas; Kriegel, Hans-Peter; Mamoulis, Nikos; Renz, Matthias; Zhang, Shiming; Züfle, Andreas

    2011-01-01

    Traditional spatial queries return, for a given query object $q$, all database objects that satisfy a given predicate, such as epsilon range and $k$-nearest neighbors. This paper defines and studies {\\em inverse} spatial queries, which, given a subset of database objects $Q$ and a query predicate, return all objects which, if used as query objects with the predicate, contain $Q$ in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse $k$-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches.

  17. Learning theory of distributed spectral algorithms

    Science.gov (United States)

    Guo, Zheng-Chu; Lin, Shao-Bo; Zhou, Ding-Xuan

    2017-07-01

    Spectral algorithms have been widely used and studied in learning theory and inverse problems. This paper is concerned with distributed spectral algorithms, for handling big data, based on a divide-and-conquer approach. We present a learning theory for these distributed kernel-based learning algorithms in a regression framework including nice error bounds and optimal minimax learning rates achieved by means of a novel integral operator approach and a second order decomposition of inverse operators. Our quantitative estimates are given in terms of regularity of the regression function, effective dimension of the reproducing kernel Hilbert space, and qualification of the filter function of the spectral algorithm. They do not need any eigenfunction or noise conditions and are better than the existing results even for the classical family of spectral algorithms.

  18. Approximation Theorems of Moore-Penrose Inverse by Outer Inverses

    Institute of Scientific and Technical Information of China (English)

    Qianglian Huang; Zheng Fang

    2006-01-01

    Let X and Y be Hilbert spaces and T a bounded linear operator from X into Y with a separable range. In this note, we prove, without assuming the closeness of the range of T, that the Moore-Penrose inverse T+ of T can be approximated by its bounded outer inverses T#n with finite ranks.

  19. Statistical Inversion of Seismic Noise Inversion statistique du bruit sismique

    Directory of Open Access Journals (Sweden)

    Adler P. M.

    2006-11-01

    ès faibles atténuations que l'on mesure. Elles sont en effet plus faibles que la précision communément admise lors de mesures sur le terrain. Les résultats des deux parties précédentes sont valables pour des milieux aléatoires isotropes. La plupart des milieux géologiques et en particulier les milieux sédimentaires, ne le sont pas. Il est donc important de transposer nos résultats à ce type de milieux. Seul le spectre des codas a été étudié puisque l'on a montré dans la partie précédente que l'atténuation n'est pas utilisable de manière réaliste. Le schéma numérique de propagation est toujours le même mais l'algorithme de génération des milieux aléatoires a été modifié pour obtenir des distributions de vitesse possédant une anisotropie géométrique. Nous nous sommes limités à des milieux gaussiens caractérisés par deux longueurs de corrélation différentes selon des directions orthogonales. La théorie linéaire utilisée dans la première partie a été étendue à de tels milieux anisotropes en introduisant un facteur de rétrodiffraction généralisé G(Pi. Ce facteur est la transformée de Hankel, pour un coefficient dépendant de la fréquence et la vitesse moyenne, d'une intégrale angulaire Ñ de la fonction de corrélation ; cette quantité s'interprète comme une vision intégrée du milieu sous tous les angles. Comme pour un milieu isotrope, cette transformée de Hankel peut être inversée. La connaissance du spectre des codas et de la vitesse moyenne permet ainsi d'obtenir Ñ. On recherche ensuite un milieu gaussien équivalent qui donne la même fonction Ñ, ce qui permet de déduire les deux longueurs caractéristiques du milieu. L'illustration, sur des cas réels, de la méthode d'inversion des codas est importante. Dans ce but, les théories précédemment utilisées sont étendues à des milieux élastiques, tridimensionnels et anisotropes. Un processus d'inversion qui s'inspire de celui de la première partie, est mis au

  20. Deep Convolutional Neural Network for Inverse Problems in Imaging

    Science.gov (United States)

    Jin, Kyong Hwan; McCann, Michael T.; Froustey, Emmanuel; Unser, Michael

    2017-09-01

    In this paper, we propose a novel deep convolutional neural network (CNN)-based algorithm for solving ill-posed inverse problems. Regularized iterative algorithms have emerged as the standard approach to ill-posed inverse problems in the past few decades. These methods produce excellent results, but can be challenging to deploy in practice due to factors including the high computational cost of the forward and adjoint operators and the difficulty of hyper parameter selection. The starting point of our work is the observation that unrolled iterative methods have the form of a CNN (filtering followed by point-wise non-linearity) when the normal operator (H*H, the adjoint of H times H) of the forward model is a convolution. Based on this observation, we propose using direct inversion followed by a CNN to solve normal-convolutional inverse problems. The direct inversion encapsulates the physical model of the system, but leads to artifacts when the problem is ill-posed; the CNN combines multiresolution decomposition and residual learning in order to learn to remove these artifacts while preserving image structure. We demonstrate the performance of the proposed network in sparse-view reconstruction (down to 50 views) on parallel beam X-ray computed tomography in synthetic phantoms as well as in real experimental sinograms. The proposed network outperforms total variation-regularized iterative reconstruction for the more realistic phantoms and requires less than a second to reconstruct a 512 x 512 image on GPU.

  1. The Estimation and Inversion of Magnetotelluric Data with Static Shift

    Science.gov (United States)

    Wang, X.; Zhou, J.; Zhang, J.; Min, G.; Xia, S.

    2015-12-01

    IntroductionIn magnetotelluric sounding data processing, the static shift correction is one of the most important steps. Due to the complexity of near-surface inhomogeneous bodies distribution, it is difficult to estimate the static shift of measured data. For this problem, we put forward on the basis of the inversion model for static shift estimation, and reconstructed the initial model with using the original data for 2D or 3D inversion. Estimation and Inversion methodThe magnetotelluric impedance phase has the characteristics of not influenced by the static shift in Two-dimensional electrical structure. The objective function for static shift estimation can be constructed based on impedance phase data. On the basis of normal inversion, utilizing one-dimensional linear search algorithm, combined with the forward modeling, the MT static shift can be estimated.Using estimation results for translation of anomaly measured curve. According to the inversion(1-D) of these translated curve, the initial model for two-dimensional or two-dimensional inversion can be reconstructed. On this basis, we do inversion for the original data, which not only can effectively eliminate the influence of static shift on the deep structure of inversion model, but also can get the right shallow electrical structure in the inversionConclusionThe estimation value of static shift based on impedance phase can be close to the true value. This estimation results can be used to modify the initial model, which makes the deep electric structure of the model more reasonable. On this basis, the inversion of the original data can ensure the correctness of the final inversion results (including shallow and deep).Acknowledgement This paper is supported by National Natural Science Foundation (41274078) and National 863 High Technology Research and Development Program (2014AA06A612).Reference[1] deGroot-Hedlin C. Removal of static shift in two dimensions by regularized inversion[J]. Geophysics, 1991, 56

  2. Multiples waveform inversion

    KAUST Repository

    Zhang, D. L.

    2013-01-01

    To increase the illumination of the subsurface and to eliminate the dependency of FWI on the source wavelet, we propose multiples waveform inversion (MWI) that transforms each hydrophone into a virtual point source with a time history equal to that of the recorded data. These virtual sources are used to numerically generate downgoing wavefields that are correlated with the backprojected surface-related multiples to give the migration image. Since the recorded data are treated as the virtual sources, knowledge of the source wavelet is not required, and the subsurface illumination is greatly enhanced because the entire free surface acts as an extended source compared to the radiation pattern of a traditional point source. Numerical tests on the Marmousi2 model show that the convergence rate and the spatial resolution of MWI is, respectively, faster and more accurate then FWI. The potential pitfall with this method is that the multiples undergo more than one roundtrip to the surface, which increases attenuation and reduces spatial resolution. This can lead to less resolved tomograms compared to conventional FWI. The possible solution is to combine both FWI and MWI in inverting for the subsurface velocity distribution.

  3. Inverse problem in hydrogeology

    Science.gov (United States)

    Carrera, Jesús; Alcolea, Andrés; Medina, Agustín; Hidalgo, Juan; Slooten, Luit J.

    2005-03-01

    The state of the groundwater inverse problem is synthesized. Emphasis is placed on aquifer characterization, where modelers have to deal with conceptual model uncertainty (notably spatial and temporal variability), scale dependence, many types of unknown parameters (transmissivity, recharge, boundary conditions, etc.), nonlinearity, and often low sensitivity of state variables (typically heads and concentrations) to aquifer properties. Because of these difficulties, calibration cannot be separated from the modeling process, as it is sometimes done in other fields. Instead, it should be viewed as one step in the process of understanding aquifer behavior. In fact, it is shown that actual parameter estimation methods do not differ from each other in the essence, though they may differ in the computational details. It is argued that there is ample room for improvement in groundwater inversion: development of user-friendly codes, accommodation of variability through geostatistics, incorporation of geological information and different types of data (temperature, occurrence and concentration of isotopes, age, etc.), proper accounting of uncertainty, etc. Despite this, even with existing codes, automatic calibration facilitates enormously the task of modeling. Therefore, it is contended that its use should become standard practice. L'état du problème inverse des eaux souterraines est synthétisé. L'accent est placé sur la caractérisation de l'aquifère, où les modélisateurs doivent jouer avec l'incertitude des modèles conceptuels (notamment la variabilité spatiale et temporelle), les facteurs d'échelle, plusieurs inconnues sur différents paramètres (transmissivité, recharge, conditions aux limites, etc.), la non linéarité, et souvent la sensibilité de plusieurs variables d'état (charges hydrauliques, concentrations) des propriétés de l'aquifère. A cause de ces difficultés, le calibrage ne peut êtreséparé du processus de modélisation, comme c'est le

  4. Inverse problems for Maxwell's equations

    CERN Document Server

    Romanov, V G

    1994-01-01

    The Inverse and Ill-Posed Problems Series is a series of monographs publishing postgraduate level information on inverse and ill-posed problems for an international readership of professional scientists and researchers. The series aims to publish works which involve both theory and applications in, e.g., physics, medicine, geophysics, acoustics, electrodynamics, tomography, and ecology.

  5. Inversion exercises inspired by mechanics

    Science.gov (United States)

    Groetsch, C. W.

    2016-02-01

    An elementary calculus transform, inspired by the centroid and gyration radius, is introduced as a prelude to the study of more advanced transforms. Analysis of the transform, including its inversion, makes use of several key concepts from basic calculus and exercises in the application and inversion of the transform provide practice in the use of technology in calculus.

  6. A Recursive Born Approach to Nonlinear Inverse Scattering

    CERN Document Server

    Kamilov, Ulugbek S; Mansour, Hassan; Boufounos, Petros T

    2016-01-01

    The Iterative Born Approximation (IBA) is a well-known method for describing waves scattered by semi-transparent objects. In this paper, we present a novel nonlinear inverse scattering method that combines IBA with an edge-preserving total variation (TV) regularizer. The proposed method is obtained by relating iterations of IBA to layers of a feedforward neural network and developing a corresponding error backpropagation algorithm for efficiently estimating the permittivity of the object. Simulations illustrate that, by accounting for multiple scattering, the method successfully recovers the permittivity distribution where the traditional linear inverse scattering fails.

  7. Inverse thermal analysis method to study solidification in cast iron

    DEFF Research Database (Denmark)

    Dioszegi, Atilla; Hattel, Jesper

    2004-01-01

    Solidification modelling of cast metals is widely used to predict final properties in cast components. Accurate models necessitate good knowledge of the solidification behaviour. The present study includes a re-examination of the Fourier thermal analysis method. This involves an inverse numerical...... solution of a 1-dimensional heat transfer problem connected to solidification of cast alloys. In the analysis, the relation between the thermal state and the fraction solid of the metal is evaluated by a numerical method. This method contains an iteration algorithm controlled by an under relaxation term...... inverse thermal analysis was tested on both experimental and simulated data....

  8. Continued Fraction Algorithm for Matrix Exponentials

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n-th convergence of Thiele-type continued fraction expansion, a new type of the generalized inverse matrix-valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.

  9. A generalized computationally efficient inverse characterization approach combining direct inversion solution initialization with gradient-based optimization

    Science.gov (United States)

    Wang, Mengyu; Brigham, John C.

    2017-03-01

    A computationally efficient gradient-based optimization approach for inverse material characterization from incomplete system response measurements that can utilize a generally applicable parameterization (e.g., finite element-type parameterization) is presented and evaluated. The key to this inverse characterization algorithm is the use of a direct inversion strategy with Gappy proper orthogonal decomposition (POD) response field estimation to initialize the inverse solution estimate prior to gradient-based optimization. Gappy POD is used to estimate the complete (i.e., all components over the entire spatial domain) system response field from incomplete (e.g., partial spatial distribution) measurements obtained from some type of system testing along with some amount of a priori information regarding the potential distribution of the unknown material property. The estimated complete system response is used within a physics-based direct inversion procedure with a finite element-type parameterization to estimate the spatial distribution of the desired unknown material property with minimal computational expense. Then, this estimated spatial distribution of the unknown material property is used to initialize a gradient-based optimization approach, which uses the adjoint method for computationally efficient gradient calculations, to produce the final estimate of the material property distribution. The three-step [(1) Gappy POD, (2) direct inversion, and (3) gradient-based optimization] inverse characterization approach is evaluated through simulated test problems based on the characterization of elastic modulus distributions with localized variations (e.g., inclusions) within simple structures. Overall, this inverse characterization approach is shown to efficiently and consistently provide accurate inverse characterization estimates for material property distributions from incomplete response field measurements. Moreover, the solution procedure is shown to be capable

  10. Multiscale Modelling and Inverse Problems

    CERN Document Server

    Nolen, J; Stuart, A M

    2010-01-01

    The need to blend observational data and mathematical models arises in many applications and leads naturally to inverse problems. Parameters appearing in the model, such as constitutive tensors, initial conditions, boundary conditions, and forcing can be estimated on the basis of observed data. The resulting inverse problems are often ill-posed and some form of regularization is required. These notes discuss parameter estimation in situations where the unknown parameters vary across multiple scales. We illustrate the main ideas using a simple model for groundwater flow. We will highlight various approaches to regularization for inverse problems, including Tikhonov and Bayesian methods. We illustrate three ideas that arise when considering inverse problems in the multiscale context. The first idea is that the choice of space or set in which to seek the solution to the inverse problem is intimately related to whether a homogenized or full multiscale solution is required. This is a choice of regularization. The ...

  11. Source Estimation by Full Wave Form Inversion

    Energy Technology Data Exchange (ETDEWEB)

    Sjögreen, Björn [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Petersson, N. Anders [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing

    2013-08-07

    Given time-dependent ground motion recordings at a number of receiver stations, we solve the inverse problem for estimating the parameters of the seismic source. The source is modeled as a point moment tensor source, characterized by its location, moment tensor components, the start time, and frequency parameter (rise time) of its source time function. In total, there are 11 unknown parameters. We use a non-linear conjugate gradient algorithm to minimize the full waveform misfit between observed and computed ground motions at the receiver stations. An important underlying assumption of the minimization problem is that the wave propagation is accurately described by the elastic wave equation in a heterogeneous isotropic material. We use a fourth order accurate finite difference method, developed in [12], to evolve the waves forwards in time. The adjoint wave equation corresponding to the discretized elastic wave equation is used to compute the gradient of the misfit, which is needed by the non-linear conjugated minimization algorithm. A new source point moment source discretization is derived that guarantees that the Hessian of the misfit is a continuous function of the source location. An efficient approach for calculating the Hessian is also presented. We show how the Hessian can be used to scale the problem to improve the convergence of the non-linear conjugated gradient algorithm. Numerical experiments are presented for estimating the source parameters from synthetic data in a layer over half-space problem (LOH.1), illustrating rapid convergence of the proposed approach.

  12. Waveform inversion of lateral velocity variation from wavefield source location perturbation

    KAUST Repository

    Choi, Yun Seok

    2013-09-22

    It is challenge in waveform inversion to precisely define the deep part of the velocity model compared to the shallow part. The lateral velocity variation, or what referred to as the derivative of velocity with respect to the horizontal distance, with well log data can be used to update the deep part of the velocity model more precisely. We develop a waveform inversion algorithm to obtain the lateral velocity variation by inverting the wavefield variation associated with the lateral shot location perturbation. The gradient of the new waveform inversion algorithm is obtained by the adjoint-state method. Our inversion algorithm focuses on resolving the lateral changes of the velocity model with respect to a fixed reference vertical velocity profile given by a well log. We apply the method on a simple-dome model to highlight the methods potential.

  13. Fast Algorithm of Multivariable Generalized Predictive Control

    Institute of Scientific and Technical Information of China (English)

    Jin,Yuanyu; Pang,Zhonghua; Cui,Hong

    2005-01-01

    To avoid the shortcoming of the traditional (previous)generalized predictive control (GPC) algorithms, too large amounts of computation, a fast algorithm of multivariable generalized predictive control is presented in which only the current control actions are computed exactly on line and the rest (the future control actions) are approximately done off line. The algorithm is simple and can be used in the arbitary-dimension input arbitary-dimension output (ADIADO) linear systems. Because it dose not need solving Diophantine equation and reduces the dimension of the inverse matrix, it decreases largely the computational burden. Finally, simulation results show that the presented algorithm is effective and practicable.

  14. SIPPI: A Matlab toolbox for sampling the solution to inverse problems with complex prior information

    DEFF Research Database (Denmark)

    Hansen, Thomas Mejer; Cordua, Knud Skou; Caroline Looms, Majken

    2013-01-01

    for solving such probabilistically formulated inverse problems by sampling the a posteriori probability density function. In order to describe the a priori probability density function, we consider both simple Gaussian models and more complex (and realistic) a priori models based on higher order statistics....... These a priori models can be used with both linear and non-linear inverse problems. For linear inverse Gaussian problems we make use of least-squares and kriging-based methods to describe the a posteriori probability density function directly. For general non-linear (i.e. non-Gaussian) inverse problems, we make...... use of the extended Metropolis algorithm to sample the a posteriori probability density function. Together with the extended Metropolis algorithm, we use sequential Gibbs sampling that allow computationally efficient sampling of complex a priori models. The toolbox can be applied to any inverse...

  15. Fast Component Pursuit for Large-Scale Inverse Covariance Estimation.

    Science.gov (United States)

    Han, Lei; Zhang, Yu; Zhang, Tong

    2016-08-01

    The maximum likelihood estimation (MLE) for the Gaussian graphical model, which is also known as the inverse covariance estimation problem, has gained increasing interest recently. Most existing works assume that inverse covariance estimators contain sparse structure and then construct models with the ℓ1 regularization. In this paper, different from existing works, we study the inverse covariance estimation problem from another perspective by efficiently modeling the low-rank structure in the inverse covariance, which is assumed to be a combination of a low-rank part and a diagonal matrix. One motivation for this assumption is that the low-rank structure is common in many applications including the climate and financial analysis, and another one is that such assumption can reduce the computational complexity when computing its inverse. Specifically, we propose an efficient COmponent Pursuit (COP) method to obtain the low-rank part, where each component can be sparse. For optimization, the COP method greedily learns a rank-one component in each iteration by maximizing the log-likelihood. Moreover, the COP algorithm enjoys several appealing properties including the existence of an efficient solution in each iteration and the theoretical guarantee on the convergence of this greedy approach. Experiments on large-scale synthetic and real-world datasets including thousands of millions variables show that the COP method is faster than the state-of-the-art techniques for the inverse covariance estimation problem when achieving comparable log-likelihood on test data.

  16. Fast Gibbs sampling for high-dimensional Bayesian inversion

    Science.gov (United States)

    Lucka, Felix

    2016-11-01

    Solving ill-posed inverse problems by Bayesian inference has recently attracted considerable attention. Compared to deterministic approaches, the probabilistic representation of the solution by the posterior distribution can be exploited to explore and quantify its uncertainties. In applications where the inverse solution is subject to further analysis procedures can be a significant advantage. Alongside theoretical progress, various new computational techniques allow us to sample very high dimensional posterior distributions: in (Lucka 2012 Inverse Problems 28 125012), and a Markov chain Monte Carlo posterior sampler was developed for linear inverse problems with {{\\ell }}1-type priors. In this article, we extend this single component (SC) Gibbs-type sampler to a wide range of priors used in Bayesian inversion, such as general {{\\ell }}pq priors with additional hard constraints. In addition, a fast computation of the conditional, SC densities in an explicit, parameterized form, a fast, robust and exact sampling from these one-dimensional densities is key to obtain an efficient algorithm. We demonstrate that a generalization of slice sampling can utilize their specific structure for this task and illustrate the performance of the resulting slice-within-Gibbs samplers by different computed examples. These new samplers allow us to perform sample-based Bayesian inference in high-dimensional scenarios with certain priors for the first time, including the inversion of computed tomography data with the popular isotropic total variation prior.

  17. A rainbow inverse problem

    Directory of Open Access Journals (Sweden)

    Calvez V.

    2010-12-01

    Full Text Available We consider the radiative transfer equation (RTE with reflection in a three-dimensional domain, infinite in two dimensions, and prove an existence result. Then, we study the inverse problem of retrieving the optical parameters from boundary measurements, with help of existing results by Choulli and Stefanov. This theoretical analysis is the framework of an attempt to model the color of the skin. For this purpose, a code has been developed to solve the RTE and to study the sensitivity of the measurements made by biophysicists with respect to the physiological parameters responsible for the optical properties of this complex, multi-layered material. On étudie l’équation du transfert radiatif (ETR dans un domaine tridimensionnel infini dans deux directions, et on prouve un résultat d’existence. On s’intéresse ensuite à la reconstruction des paramètres optiques à partir de mesures faites au bord, en s’appuyant sur des résultats de Choulli et Stefanov. Cette analyse sert de cadre théorique à un travail de modélisation de la couleur de la peau. Dans cette perspective, un code à été développé pour résoudre l’ETR et étudier la sensibilité des mesures effectuées par les biophysiciens par rapport aux paramètres physiologiques tenus pour responsables des propriétés optiques de ce complexe matériau multicouche.

  18. Quantum Algorithm for the Toeplitz Systems

    CERN Document Server

    Wan, Lin-Chun; Pan, Shi-Jie; Gao, Fei; Wen, Qiao-Yan

    2016-01-01

    Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given a $n\\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a quantum algorithm for solving the Toeplitz systems, in which a quantum state encoding the solution with error $\\epsilon$ is generated. It is shown that our algorithm's complexity is nearly linear in the condition number, and polylog in the dimensions $n$ and in the inverse error $\\epsilon^{-1}$. This implies our algorithm is exponentially faster than the best classical algorithm for the same problem if the condition number of $T_n$ is $O(\\textrm{poly}(\\textrm{log}\\,n))$. Since no assumption on the sparseness of $T_n$ is demanded in our algorithm, the algorithm can serve as an example of quantum algorithms for solving non-sparse linear systems.

  19. Fast 3D inversion of gravity data using solution space priorconditioned lanczos bidiagonalization

    Science.gov (United States)

    Rezaie, Mohammad; Moradzadeh, Ali; Kalateh, Ali Nejati

    2017-01-01

    Inversion of gravity data is one of the most important steps in the quantitative interpretation of practical data. Inversion is a mathematical technique that automatically constructs a subsurface geophysical model from measured data, incorporating some priori information. Inversion of gravity data is time consuming because of increase in data and model parameters. Some efforts have been made to deal with this problem, one of them is using fast algorithms for solving system of equations in inverse problem. Lanczos bidiagonalization method is a fast algorithm that works based on Krylov subspace iterations and projection method, but cannot always provide a good basis for a projection method. So in this study, we combined the Krylov method with a regularization method applied to the low-dimensional projected problem. To achieve the goal, the orthonormal basis vectors of the discrete cosine transform (DCT) were used to build the low-dimensional subspace. The forward operator matrix replaced with a matrix of lower dimension, thus, the required memory and running time of the inverse modeling is decreased by using the proposed algorithm. It is shown that this algorithm can be appropriate to solve a Tikhonov cost function for inversion of gravity data. The proposed method has been applied on a noise-corrupted synthetic data and field gravity data (Mobrun gravity data) to demonstrate its reliability for three dimensional (3D) gravity inversion. The obtained results of 3D inversion both synthetic and field gravity data (Mobrun gravity data) indicate the proposed inversion algorithm could produce density models consistent with true structures.

  20. Full Waveform Inversion Using Oriented Time Migration Method

    KAUST Repository

    Zhang, Zhendong

    2016-04-12

    Full waveform inversion (FWI) for reflection events is limited by its linearized update requirements given by a process equivalent to migration. Unless the background velocity model is reasonably accurate the resulting gradient can have an inaccurate update direction leading the inversion to converge into what we refer to as local minima of the objective function. In this thesis, I first look into the subject of full model wavenumber to analysis the root of local minima and suggest the possible ways to avoid this problem. And then I analysis the possibility of recovering the corresponding wavenumber components through the existing inversion and migration algorithms. Migration can be taken as a generalized inversion method which mainly retrieves the high wavenumber part of the model. Conventional impedance inversion method gives a mapping relationship between the migration image (high wavenumber) and model parameters (full wavenumber) and thus provides a possible cascade inversion strategy to retrieve the full wavenumber components from seismic data. In the proposed approach, consider a mild lateral variation in the model, I find an analytical Frechet derivation corresponding to the new objective function. In the proposed approach, the gradient is given by the oriented time-domain imaging method. This is independent of the background velocity. Specifically, I apply the oriented time-domain imaging (which depends on the reflection slope instead of a background velocity) on the data residual to obtain the geometrical features of the velocity perturbation. Assuming that density is constant, the conventional 1D impedance inversion method is also applicable for 2D or 3D velocity inversion within the process of FWI. This method is not only capable of inverting for velocity, but it is also capable of retrieving anisotropic parameters relying on linearized representations of the reflection response. To eliminate the cross-talk artifacts between different parameters, I

  1. Solving the structural inverse gravity problem by the modified gradient methods

    Science.gov (United States)

    Martyshko, P. S.; Akimova, E. N.; Misilov, V. E.

    2016-09-01

    New methods for solving the three-dimensional inverse gravity problem in the class of contact surfaces are described. Based on the approach previously suggested by the authors, new algorithms are developed. Application of these algorithms significantly reduces the number of the iterations and computing time compared to the previous ones. The algorithms have been numerically implemented on the multicore processor. The example of solving the structural inverse gravity problem for a model of four-layer medium (with the use of gravity field measurements) is constructed.

  2. Givental graphs and inversion symmetry

    CERN Document Server

    Dunin-Barkowski, P; Spitz, L

    2012-01-01

    Inversion symmetry is a very non-trivial discrete symmetry of Frobenius manifolds. It was obtained by Dubrovin from one of the elementary Schlesinger transformations of a special ODE associated to Frobenius manifold. In this paper, we review the Givental group action on Frobenius manifolds in terms of Feynman graphs and then we obtain an interpretation of the inversion symmetry in terms of the action of the Givental group. We also consider the implication of this interpretation of the inversion symmetry for the Schlesinger transformations and for the Hamiltonians of the associated principle hierarchy.

  3. Inverse Doppler Effects in Flute

    CERN Document Server

    Zhao, Xiao P; Liu, Song; Shen, Fang L; Li, Lin L; Luo, Chun R

    2015-01-01

    Here we report the observation of the inverse Doppler effects in a flute. It is experimentally verified that, when there is a relative movement between the source and the observer, the inverse Doppler effect could be detected for all seven pitches of a musical scale produced by a flute. Higher tone is associated with a greater shift in frequency. The effect of the inverse frequency shift may provide new insights into why the flute, with its euphonious tone, has been popular for thousands of years in Asia and Europe.

  4. Gradient-based inverse extreme ultraviolet lithography.

    Science.gov (United States)

    Ma, Xu; Wang, Jie; Chen, Xuanbo; Li, Yanqiu; Arce, Gonzalo R

    2015-08-20

    Extreme ultraviolet (EUV) lithography is the most promising successor of current deep ultraviolet (DUV) lithography. The very short wavelength, reflective optics, and nontelecentric structure of EUV lithography systems bring in different imaging phenomena into the lithographic image synthesis problem. This paper develops a gradient-based inverse algorithm for EUV lithography systems to effectively improve the image fidelity by comprehensively compensating the optical proximity effect, flare, photoresist, and mask shadowing effects. A block-based method is applied to iteratively optimize the main features and subresolution assist features (SRAFs) of mask patterns, while simultaneously preserving the mask manufacturability. The mask shadowing effect may be compensated by a retargeting method based on a calibrated shadowing model. Illustrative simulations at 22 and 16 nm technology nodes are presented to validate the effectiveness of the proposed methods.

  5. A fast Stokes inversion technique based on quadratic regression

    Science.gov (United States)

    Teng, Fei; Deng, Yuan-Yong

    2016-05-01

    Stokes inversion calculation is a key process in resolving polarization information on radiation from the Sun and obtaining the associated vector magnetic fields. Even in the cases of simple local thermodynamic equilibrium (LTE) and where the Milne-Eddington approximation is valid, the inversion problem may not be easy to solve. The initial values for the iterations are important in handling the case with multiple minima. In this paper, we develop a fast inversion technique without iterations. The time taken for computation is only 1/100 the time that the iterative algorithm takes. In addition, it can provide available initial values even in cases with lower spectral resolutions. This strategy is useful for a filter-type Stokes spectrograph, such as SDO/HMI and the developed two-dimensional real-time spectrograph (2DS).

  6. Counting Magnetic Bipoles on the Sun by Polarity Inversion

    Science.gov (United States)

    Jones, Harrison P.

    2004-01-01

    This paper presents a simple and efficient algorithm for deriving images of polarity inversion from NSO/Kitt Peak magnetograms without use of contouring routines and shows by example how these maps depend upon the spatial scale for filtering the raw data. Smaller filtering scales produce many localized closed contours in mixed polarity regions while supergranular and larger filtering scales produce more global patterns. The apparent continuity of an inversion line depends on how the spatial filtering is accomplished, but its shape depends only on scale. The total length of the magnetic polarity inversion contours varies as a power law of the filter scale with fractal dimension of order 1.9. The amplitude but nut the exponent of this power-law relation varies with solar activity. The results are compared to similar analyses of areal distributions of bipolar magnetic regions.

  7. A time domain sampling method for inverse acoustic scattering problems

    Science.gov (United States)

    Guo, Yukun; Hömberg, Dietmar; Hu, Guanghui; Li, Jingzhi; Liu, Hongyu

    2016-06-01

    This work concerns the inverse scattering problems of imaging unknown/inaccessible scatterers by transient acoustic near-field measurements. Based on the analysis of the migration method, we propose efficient and effective sampling schemes for imaging small and extended scatterers from knowledge of time-dependent scattered data due to incident impulsive point sources. Though the inverse scattering problems are known to be nonlinear and ill-posed, the proposed imaging algorithms are totally "direct" involving only integral calculations on the measurement surface. Theoretical justifications are presented and numerical experiments are conducted to demonstrate the effectiveness and robustness of our methods. In particular, the proposed static imaging functionals enhance the performance of the total focusing method (TFM) and the dynamic imaging functionals show analogous behavior to the time reversal inversion but without solving time-dependent wave equations.

  8. Application of Multi-Exponential Inversion Method to NMR Measurements

    Institute of Scientific and Technical Information of China (English)

    XiaoLizhi; WangZhongdong; LiuTangyan

    2004-01-01

    A new multi-exponential inversion method for NMR relaxation signals is presented and tested, which is based on a solid iteration rebuild technique (SIRT). The T2 spectra inversed by the new method are compared with MAP-Ⅱ results. The T1 and T2 inversion results with different pre-assigned relaxation times and different SNR show that 16 to 64 logarithm equal spaced time constants is better obviously than MAP-Ⅱ. And in particular, it can ensure the relaxation time distribution when the SNR of the measured signal is very low. The new algorithm has been applied in rock core NMR analysis and NMR logging data process and interpretation.

  9. Full Waveform Inversion for Reservoir Characterization - A Synthetic Study

    KAUST Repository

    Zabihi Naeini, E.

    2017-05-26

    Most current reservoir-characterization workflows are based on classic amplitude-variation-with-offset (AVO) inversion techniques. Although these methods have generally served us well over the years, here we examine full-waveform inversion (FWI) as an alternative tool for higher-resolution reservoir characterization. An important step in developing reservoir-oriented FWI is the implementation of facies-based rock physics constraints adapted from the classic methods. We show that such constraints can be incorporated into FWI by adding appropriately designed regularization terms to the objective function. The advantages of the proposed algorithm are demonstrated on both isotropic and VTI (transversely isotropic with a vertical symmetry axis) models with pronounced lateral and vertical heterogeneity. The inversion results are explained using the theoretical radiation patterns produced by perturbations in the medium parameters.

  10. A variational Bayesian method to inverse problems with impulsive noise

    KAUST Repository

    Jin, Bangti

    2012-01-01

    We propose a novel numerical method for solving inverse problems subject to impulsive noises which possibly contain a large number of outliers. The approach is of Bayesian type, and it exploits a heavy-tailed t distribution for data noise to achieve robustness with respect to outliers. A hierarchical model with all hyper-parameters automatically determined from the given data is described. An algorithm of variational type by minimizing the Kullback-Leibler divergence between the true posteriori distribution and a separable approximation is developed. The numerical method is illustrated on several one- and two-dimensional linear and nonlinear inverse problems arising from heat conduction, including estimating boundary temperature, heat flux and heat transfer coefficient. The results show its robustness to outliers and the fast and steady convergence of the algorithm. © 2011 Elsevier Inc.

  11. Fringe inverse videogrammetry based on global pose estimation.

    Science.gov (United States)

    Xiao, Yong-Liang; Su, Xianyu; Chen, Wenjing

    2011-10-10

    Fringe inverse videogrammetry based on global pose estimation is presented to measure a three-dimensional (3D) coordinate. The main components involve an LCD screen, a tactile probe equipped with a microcamera, and a portable personal computer. The LCD is utilized to display fringes, a microcamera is installed on the tactile probe, and the 3D coordinate of the center of the probe tip can be calculated through the microcamera's pose. Fourier fringe analysis is exploited to complete subpixel location of reference points. A convex-relaxation optimization algorithm is employed to estimate the global camera pose, which guarantees global convergence compared with bundle adjustment, a local pose estimation algorithm. The experiments demonstrate that fringe inverse videogrammetry can measure the 3D coordinate precisely. © 2011 Optical Society of America

  12. A Fast Robust Optimization Methodology Based on Polynomial Chaos and Evolutionary Algorithm for Inverse Problems%基于多项式混沌和进化算法的快速鲁棒优化算法及其在电磁场逆问题中的应用

    Institute of Scientific and Technical Information of China (English)

    吴烈; 杨仕友; 李玉玲

    2013-01-01

    为提高电磁场逆问题鲁棒优化设计的计算效率,提出一种基于多项式混沌和进化算法相结合的快速鲁棒优化方法.在该方法中,通过将多项式混沌展开作为鲁棒性能参数的随机响应面模型,提高了期望函数的计算效率和计算精度.此外,为进一步提高算法的计算效率,文章又提出了期望适值赋值的新机制,以及概率可行性模型处理约束函数鲁棒性的方法;引入同时搜索全局最优解和鲁棒最优解的迭代循环机制.通过典型电磁场逆问题的鲁棒优化设计对本文算法进行了数值验证.数值分析结果证明了该文方法的可行性和先进性.%This paper explores the potential of polynomial chaos in robust design optimizations of inverse problems. To this end, a fast numerical methodology based on combinations of polynomial chaos expansion and evolutionary algorithm is proposed. In the proposed methodology, the polynomial chaos expansion is used as a stochastic response surface model for efficient computations of the expectancy metric of the objective function. Additional enhancements, such as the introduction of new methodology for expected fitness assignment and probability feasibility model, a novel driving mechanism to bias the next iterative cycles to search for both global and robust optimal solutions, are introduced. The numerical results on two case studies are reported to illustrate the feasibility and advantage of the present work.

  13. On"Study of Geographic Information Spatial Interpolation Methods Using the Weighted Algorithm of Inverse Distance and Angle"%基于反距离夹角加权算法的地理信息空间内插方法的探讨

    Institute of Scientific and Technical Information of China (English)

    周清; 王奉伟

    2015-01-01

    The article [1] thought the method of Weighted Algorithm of Inverse Distance and Angle could overcome the influence of uneven distribution and uneven density of interpolation on the known sample points with interpolation point full circle range .Also it thought the method can be widely used in DEM and image processing .But the author proved only when the points is distributed the same as the article [1] ,the results are better.On the contrary that the method against the First Law of Geography which proposed by geographer W.R.Tobler from USA.So by the point,it shows that the method is not of universality and generalization and the theory needs further perfection .%文献[1]认为反距离夹角加权空间内插方法能减弱甚至消除已知样本点在内插点全圆方位上分布不均及疏密不匀对内插值的影响,保证内插值接近近点值,将广泛应用在建立DEM 及图像处理等地理空间信息数据内插中。本文通过理论分析和实例验证发现:只有当点位分布完全符合文献[1]中的情况时,内插结果才比较好;反之,该方法违背了美国地理学家W.R.Tobler提出的地理学第一定律。距离待插值点近的点权反而小;距离远的点权反而大,因此,该方法不具有普适性和推广性,其理论仍待完善。

  14. Algorithmic Adventures

    CERN Document Server

    Hromkovic, Juraj

    2009-01-01

    Explores the science of computing. This book starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness.

  15. Parameter estimation and inverse problems

    CERN Document Server

    Aster, Richard C; Thurber, Clifford H

    2005-01-01

    Parameter Estimation and Inverse Problems primarily serves as a textbook for advanced undergraduate and introductory graduate courses. Class notes have been developed and reside on the World Wide Web for faciliting use and feedback by teaching colleagues. The authors'' treatment promotes an understanding of fundamental and practical issus associated with parameter fitting and inverse problems including basic theory of inverse problems, statistical issues, computational issues, and an understanding of how to analyze the success and limitations of solutions to these probles. The text is also a practical resource for general students and professional researchers, where techniques and concepts can be readily picked up on a chapter-by-chapter basis.Parameter Estimation and Inverse Problems is structured around a course at New Mexico Tech and is designed to be accessible to typical graduate students in the physical sciences who may not have an extensive mathematical background. It is accompanied by a Web site that...

  16. Testing earthquake source inversion methodologies

    KAUST Repository

    Page, Morgan T.

    2011-01-01

    Source Inversion Validation Workshop; Palm Springs, California, 11-12 September 2010; Nowadays earthquake source inversions are routinely performed after large earthquakes and represent a key connection between recorded seismic and geodetic data and the complex rupture process at depth. The resulting earthquake source models quantify the spatiotemporal evolution of ruptures. They are also used to provide a rapid assessment of the severity of an earthquake and to estimate losses. However, because of uncertainties in the data, assumed fault geometry and velocity structure, and chosen rupture parameterization, it is not clear which features of these source models are robust. Improved understanding of the uncertainty and reliability of earthquake source inversions will allow the scientific community to use the robust features of kinematic inversions to more thoroughly investigate the complexity of the rupture process and to better constrain other earthquakerelated computations, such as ground motion simulations and static stress change calculations.

  17. Statistical perspectives on inverse problems

    DEFF Research Database (Denmark)

    Andersen, Kim Emil

    of the interior of an object from electrical boundary measurements. One part of this thesis concerns statistical approaches for solving, possibly non-linear, inverse problems. Thus inverse problems are recasted in a form suitable for statistical inference. In particular, a Bayesian approach for regularisation...... is obtained by assuming that the a priori beliefs about the solution before having observed any data can be described by a prior distribution. The solution to the statistical inverse problem is then given by the posterior distribution obtained by Bayes' formula. Hence the solution of an ill-posed inverse...... problem is given in terms of probability distributions. Posterior inference is obtained by Markov chain Monte Carlo methods and new, powerful simulation techniques based on e.g. coupled Markov chains and simulated tempering is developed to improve the computational efficiency of the overall simulation...

  18. Bayesian Approach to Inverse Problems

    CERN Document Server

    2008-01-01

    Many scientific, medical or engineering problems raise the issue of recovering some physical quantities from indirect measurements; for instance, detecting or quantifying flaws or cracks within a material from acoustic or electromagnetic measurements at its surface is an essential problem of non-destructive evaluation. The concept of inverse problems precisely originates from the idea of inverting the laws of physics to recover a quantity of interest from measurable data.Unfortunately, most inverse problems are ill-posed, which means that precise and stable solutions are not easy to devise. Regularization is the key concept to solve inverse problems.The goal of this book is to deal with inverse problems and regularized solutions using the Bayesian statistical tools, with a particular view to signal and image estimation

  19. Inversion Therapy: Can It Relieve Back Pain?

    Science.gov (United States)

    ... and Conditions Back pain Does inversion therapy relieve back pain? Is it safe? Answers from Edward R. Laskowski, M.D. Inversion therapy doesn't provide lasting relief from back pain, and it's not safe for everyone. Inversion therapy ...

  20. Tailored RF pulse optimization for magnetization inversion at ultra high field

    CERN Document Server

    Hurley, Aaron C; Li, Bai; Aickelin, Uwe; Coxon, Ron; Glover, Paul; Gowland, Penny A

    2010-01-01

    The radiofrequency (RF) transmit field is severely inhomogeneous at ultrahigh field due to both RF penetration and RF coil design issues. This particularly impairs image quality for sequences that use inversion pulses such as magnetization prepared rapid acquisition gradient echo and limits the use of quantitative arterial spin labeling sequences such as flow-attenuated inversion recovery. Here we have used a search algorithm to produce inversion pulses tailored to take into account the heterogeneity of the RF transmit field at 7 T. This created a slice selective inversion pulse that worked well (good slice profile and uniform inversion) over the range of RF amplitudes typically obtained in the head at 7 T while still maintaining an experimentally achievable pulse length and pulse amplitude in the brain at 7 T. The pulses used were based on the frequency offset correction inversion technique, as well as time dilation of functions, but the RF amplitude, frequency sweep, and gradient functions were all generate...

  1. A MATLAB based 3D modeling and inversion code for MT data

    Science.gov (United States)

    Singh, Arun; Dehiya, Rahul; Gupta, Pravin K.; Israil, M.

    2017-07-01

    The development of a MATLAB based computer code, AP3DMT, for modeling and inversion of 3D Magnetotelluric (MT) data is presented. The code comprises two independent components: grid generator code and modeling/inversion code. The grid generator code performs model discretization and acts as an interface by generating various I/O files. The inversion code performs core computations in modular form - forward modeling, data functionals, sensitivity computations and regularization. These modules can be readily extended to other similar inverse problems like Controlled-Source EM (CSEM). The modular structure of the code provides a framework useful for implementation of new applications and inversion algorithms. The use of MATLAB and its libraries makes it more compact and user friendly. The code has been validated on several published models. To demonstrate its versatility and capabilities the results of inversion for two complex models are presented.

  2. Inverse polynomial reconstruction method in DCT domain

    Science.gov (United States)

    Dadkhahi, Hamid; Gotchev, Atanas; Egiazarian, Karen

    2012-12-01

    The discrete cosine transform (DCT) offers superior energy compaction properties for a large class of functions and has been employed as a standard tool in many signal and image processing applications. However, it suffers from spurious behavior in the vicinity of edge discontinuities in piecewise smooth signals. To leverage the sparse representation provided by the DCT, in this article, we derive a framework for the inverse polynomial reconstruction in the DCT expansion. It yields the expansion of a piecewise smooth signal in terms of polynomial coefficients, obtained from the DCT representation of the same signal. Taking advantage of this framework, we show that it is feasible to recover piecewise smooth signals from a relatively small number of DCT coefficients with high accuracy. Furthermore, automatic methods based on minimum description length principle and cross-validation are devised to select the polynomial orders, as a requirement of the inverse polynomial reconstruction method in practical applications. The developed framework can considerably enhance the performance of the DCT in sparse representation of piecewise smooth signals. Numerical results show that denoising and image approximation algorithms based on the proposed framework indicate significant improvements over wavelet counterparts for this class of signals.

  3. Inversion-symmetric topological insulators

    Science.gov (United States)

    Hughes, Taylor L.; Prodan, Emil; Bernevig, B. Andrei

    2011-06-01

    We analyze translationally invariant insulators with inversion symmetry that fall outside the current established classification of topological insulators. These insulators exhibit no edge or surface modes in the energy spectrum and hence they are not edge metals when the Fermi level is in the bulk gap. However, they do exhibit protected modes in the entanglement spectrum localized on the cut between two entangled regions. Their entanglement entropy cannot be made to vanish adiabatically, and hence the insulators can be called topological. There is a direct connection between the inversion eigenvalues of the Hamiltonian band structure and the midgap states in the entanglement spectrum. The classification of protected entanglement levels is given by an integer N, which is the difference between the negative inversion eigenvalues at inversion symmetric points in the Brillouin zone, taken in sets of 2. When the Hamiltonian describes a Chern insulator or a nontrivial time-reversal invariant topological insulator, the entirety of the entanglement spectrum exhibits spectral flow. If the Chern number is zero for the former, or time reversal is broken in the latter, the entanglement spectrum does not have spectral flow, but, depending on the inversion eigenvalues, can still exhibit protected midgap bands similar to impurity bands in normal semiconductors. Although spectral flow is broken (implying the absence of real edge or surface modes in the original Hamiltonian), the midgap entanglement bands cannot be adiabatically removed, and the insulator is “topological.” We analyze the linear response of these insulators and provide proofs and examples of when the inversion eigenvalues determine a nontrivial charge polarization, a quantum Hall effect, an anisotropic three-dimensional (3D) quantum Hall effect, or a magnetoelectric polarization. In one dimension, we establish a link between the product of the inversion eigenvalues of all occupied bands at all inversion

  4. -Colour Self-Inverse Compositions

    Indian Academy of Sciences (India)

    Geetika Narang; A K Agarwal

    2006-08-01

    MacMahon’s definition of self-inverse composition is extended to -colour self-inverse composition. This introduces four new sequences which satisfy the same recurrence relation with different initial conditions like the famous Fibonacci and Lucas sequences. For these new sequences explicit formulas, recurrence relations, generating functions and a summation formula are obtained. Two new binomial identities with combinatorial meaning are also given.

  5. Thermal measurements and inverse techniques

    CERN Document Server

    Orlande, Helcio RB; Maillet, Denis; Cotta, Renato M

    2011-01-01

    With its uncommon presentation of instructional material regarding mathematical modeling, measurements, and solution of inverse problems, Thermal Measurements and Inverse Techniques is a one-stop reference for those dealing with various aspects of heat transfer. Progress in mathematical modeling of complex industrial and environmental systems has enabled numerical simulations of most physical phenomena. In addition, recent advances in thermal instrumentation and heat transfer modeling have improved experimental procedures and indirect measurements for heat transfer research of both natural phe

  6. Computing approximate (symmetric block) rational Krylov subspaces without explicit inversion

    OpenAIRE

    Mach, Thomas; Pranić, Miroslav S.; Vandebril, Raf

    2013-01-01

    It has been shown, see TW623, that approximate extended Krylov subspaces can be computed —under certain assumptions— without any explicit inversion or system solves. Instead the necessary products A-1v are obtained in an implicit way retrieved from an enlarged Krylov subspace. In this paper this approach is generalized to rational Krylov subspaces, which contain besides poles at infinite and zero also finite non-zero poles. Also an adaption of the algorithm to the block and the symmetric ...

  7. Inverse Problem in the Surface EMG: A Feasibility Study

    Science.gov (United States)

    2007-11-02

    the arm containing the studied muscle is modelised (figure 1). The multi- electrode recording system is composed of 16 electrodes regularly...nature of this study (feasibility of the inverse problem in SEMG), the modelisation was made with a few simplifying hypotheses in mind to facilitate the...implementation of the localisation algorithm. This modelisation is nevertheless inspired by previous works [6], and the shapes of the synthetic MUAPs

  8. Fast Linear Algebra Applications in Stochastic Inversion and Data Assimilation

    Science.gov (United States)

    Kitanidis, P. K.; Ambikasaran, S.; Saibaba, A.; Li, J. Y.; Darve, E. F.

    2012-12-01

    Inverse problems and data assimilation problems arise frequently in earth-science applications, such as hydraulic tomography, cross-well seismic travel-time tomography, electrical resistivity tomography, contaminant source identification, assimilation of weather data, etc. A common feature amongst inverse problems is that the parameters we are interested in estimating are hard to measure directly, and a crucial component of inverse modeling is using sparse data to evaluate many model parameters. To quantify uncertainty, stochastic methods such as the geostatistical approach to inverse problems and Kalman filtering are often used. The algorithms for the implementation of these methods were originally developed for small-size problems and their cost of implementation increases quickly with the size of the problem, which is usually defined by the number of observations and the number of unknowns. From a practical standpoint, it is critical to develop computational algorithms in linear algebra for which the computational effort, both in terms of storage and computational time, increases roughly linearly with the size of the problem. This is in contrast, for example, with matrix-vector products (resp. LU factorization) that scale quadratically (resp. cubically). This objective is achieved by tailoring methods to the structure of problems. We present an overview of the challenges and general approaches available for reducing computational cost and then present applications focusing on algorithms that use the hierarchical matrix approach. The hierarchical method reduces matrix vector products involving the dense covariance matrix from O(m2) to O(m log m), where m is the number of unknowns. We illustrate the performance of our algorithm on a few applications, such as monitoring CO2 concentrations using crosswell seismic tomography.

  9. Range-instantaneous Doppler imaging of inverse synthetic aperture sonar

    Institute of Scientific and Technical Information of China (English)

    XU Jia; JIANG Xingzhou; TANG Jingsong

    2003-01-01

    Because the existing range-Doppler algorithm in inverse synthetic aperture sonar (ISAS) is based on target model of uniform motion, it may be invalidated for maneuvering targets due to the time-varying changes of both individual scatter′s Doppler and imaging projection plane. To resolve the problem, a new range-instantaneous Doppler imaging method is proposed for imaging maneuvering targets based on time-frequency analysis. The proposed approach is verified using real underwater acoustic data.

  10. A Survey on Inverse Problems for Applied Sciences

    Directory of Open Access Journals (Sweden)

    Fatih Yaman

    2013-01-01

    Full Text Available The aim of this paper is to introduce inversion-based engineering applications and to investigate some of the important ones from mathematical point of view. To do this we employ acoustic, electromagnetic, and elastic waves for presenting different types of inverse problems. More specifically, we first study location, shape, and boundary parameter reconstruction algorithms for the inaccessible targets in acoustics. The inverse problems for the time-dependent differential equations of isotropic and anisotropic elasticity are reviewed in the following section of the paper. These problems were the objects of the study by many authors in the last several decades. The physical interpretations for almost all of these problems are given, and the geophysical applications for some of them are described. In our last section, an introduction with many links into the literature is given for modern algorithms which combine techniques from classical inverse problems with stochastic tools into ensemble methods both for data assimilation as well as for forecasting.

  11. Chromatid Painting for Chromosomal Inversion Detection Project

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose a novel approach to the detection of chromosomal inversions. Transmissible chromosome aberrations (translocations and inversions) have profound genetic...

  12. Obtaining sparse distributions in 2D inverse problems

    Science.gov (United States)

    Reci, A.; Sederman, A. J.; Gladden, L. F.

    2017-08-01

    The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L1 regularization to a class of inverse problems; relaxation-relaxation, T1-T2, and diffusion-relaxation, D-T2, correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L1 regularization algorithm stably recovers a distribution at a signal to noise ratio direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise.

  13. An ICPSO-RBFNN nonlinear inversion for electrical resistivity imaging

    Institute of Scientific and Technical Information of China (English)

    江沸菠; 戴前伟; 董莉

    2016-01-01

    To improve the global search ability and imaging quality of electrical resistivity imaging(ERI) inversion, a two-stage learning ICPSO algorithm of radial basis function neural network (RBFNN) based on information criterion (IC) and particle swarm optimization (PSO) is presented. In the proposed method, IC is applied to obtain the hidden layer structure by calculating the optimal IC value automatically and PSO algorithm is used to optimize the centers and widths of the radial basis functions in the hidden layer. Meanwhile, impacts of different information criteria to the inversion results are compared, and an implementation of the proposed ICPSO algorithm is given. The optimized neural network has one hidden layer with 261 nodes selected by AKAIKE’s information criterion (AIC) and it is trained on 32 data sets and tested on another 8 synthetic data sets. Two complex synthetic examples are used to verify the feasibility and effectiveness of the proposed method with two learning stages. The results show that the proposed method has better performance and higher imaging quality than three-layer and four-layer back propagation neural networks (BPNNs) and traditional least square(LS) inversion.

  14. Refraction traveltime tomography with irregular topography using the unwrapped phase inversion

    KAUST Repository

    Choi, Yun Seok

    2013-01-01

    Traveltime tomography has long served as a stable and efficient tool for velocity estimation, especially for the near surface. It, however, suffers from some of limitations associated with ray tracing and high-frequency traveltime in velocity inversion zones and ray shadow regions. We develop a tomographic approach based on traveltime solutions obtained by tracking the phase (instantaneous traveltime) of the wavefield solution of the Helmholtz wave equation. Since the instantaneous-traveltime does not suffer from phase wrapping, the inversion algorithm using the instantaneous-traveltime has the potential to generate robust inversion results. With a high damping factor, the instantaneous-traveltime inversion provides refraction tomography similar results, but from a single frequency. Despite the Helmholtz-based solver implementation, the tomographic inversion handles irrgular topography. The numerical examples show that our inversion algorithm generates a convergent smooth velocity model, which looks very much like a tomographic result. Next, we plan to apply the instantaneous-traveltime inversion algorithm to real seismic data acquired from the near surface with irregular topography.

  15. Digital Hardware Realization of Forward and Inverse Kinematics for a Five-Axis Articulated Robot Arm

    Directory of Open Access Journals (Sweden)

    Bui Thi Hai Linh

    2015-01-01

    Full Text Available When robot arm performs a motion control, it needs to calculate a complicated algorithm of forward and inverse kinematics which consumes much CPU time and certainty slows down the motion speed of robot arm. Therefore, to solve this issue, the development of a hardware realization of forward and inverse kinematics for an articulated robot arm is investigated. In this paper, the formulation of the forward and inverse kinematics for a five-axis articulated robot arm is derived firstly. Then, the computations algorithm and its hardware implementation are described. Further, very high speed integrated circuits hardware description language (VHDL is applied to describe the overall hardware behavior of forward and inverse kinematics. Additionally, finite state machine (FSM is applied for reducing the hardware resource usage. Finally, for verifying the correctness of forward and inverse kinematics for the five-axis articulated robot arm, a cosimulation work is constructed by ModelSim and Simulink. The hardware of the forward and inverse kinematics is run by ModelSim and a test bench which generates stimulus to ModelSim and displays the output response is taken in Simulink. Under this design, the forward and inverse kinematics algorithms can be completed within one microsecond.

  16. 2D joint inversion of CSAMT and magnetic data based on cross-gradient theory

    Science.gov (United States)

    Wang, Kun-Peng; Tan, Han-Dong; Wang, Tao

    2017-06-01

    A two-dimensional forward and backward algorithm for the controlled-source audio-frequency magnetotelluric (CSAMT) method is developed to invert data in the entire region (near, transition, and far) and deal with the effects of artificial sources. First, a regularization factor is introduced in the 2D magnetic inversion, and the magnetic susceptibility is updated in logarithmic form so that the inversion magnetic susceptibility is always positive. Second, the joint inversion of the CSAMT and magnetic methods is completed with the introduction of the cross gradient. By searching for the weight of the cross-gradient term in the objective function, the mutual influence between two different physical properties at different locations are avoided. Model tests show that the joint inversion based on cross-gradient theory offers better results than the single-method inversion. The 2D forward and inverse algorithm for CSAMT with source can effectively deal with artificial sources and ensures the reliability of the final joint inversion algorithm.

  17. Efficiency of Pareto joint inversion of 2D geophysical data using global optimization methods

    Science.gov (United States)

    Miernik, Katarzyna; Bogacz, Adrian; Kozubal, Adam; Danek, Tomasz; Wojdyła, Marek

    2016-04-01

    Pareto joint inversion of two or more sets of data is a promising new tool of modern geophysical exploration. In the first stage of our investigation we created software enabling execution of forward solvers of two geophysical methods (2D magnetotelluric and gravity) as well as inversion with possibility of constraining solution with seismic data. In the algorithm solving MT forward solver Helmholtz's equations, finite element method and Dirichlet's boundary conditions were applied. Gravity forward solver was based on Talwani's algorithm. To limit dimensionality of solution space we decided to describe model as sets of polygons, using Sharp Boundary Interface (SBI) approach. The main inversion engine was created using Particle Swarm Optimization (PSO) algorithm adapted to handle two or more target functions and to prevent acceptance of solutions which are non - realistic or incompatible with Pareto scheme. Each inversion run generates single Pareto solution, which can be added to Pareto Front. The PSO inversion engine was parallelized using OpenMP standard, what enabled execution code for practically unlimited amount of threads at once. Thereby computing time of inversion process was significantly decreased. Furthermore, computing efficiency increases with number of PSO iterations. In this contribution we analyze the efficiency of created software solution taking under consideration details of chosen global optimization engine used as a main joint minimization engine. Additionally we study the scale of possible decrease of computational time caused by different methods of parallelization applied for both forward solvers and inversion algorithm. All tests were done for 2D magnetotelluric and gravity data based on real geological media. Obtained results show that even for relatively simple mid end computational infrastructure proposed solution of inversion problem can be applied in practice and used for real life problems of geophysical inversion and interpretation.

  18. Monte Carlo full-waveform inversion of crosshole GPR data using multiple-point geostatistical a priori information

    DEFF Research Database (Denmark)

    Cordua, Knud Skou; Hansen, Thomas Mejer; Mosegaard, Klaus

    2012-01-01

    We present a general Monte Carlo full-waveform inversion strategy that integrates a priori information described by geostatistical algorithms with Bayesian inverse problem theory. The extended Metropolis algorithm can be used to sample the a posteriori probability density of highly nonlinear...... into account during the inversion. The suggested inversion strategy is tested on synthetic tomographic crosshole ground-penetrating radar full-waveform data using multiple-point-based a priori information. This is, to our knowledge, the first example of obtaining a posteriori realizations of a full......-waveform inverse problem. Benefits of the proposed methodology compared with deterministic inversion approaches include: (1) The a posteriori model variability reflects the states of information provided by the data uncertainties and a priori information, which provides a means of obtaining resolution analysis. (2...

  19. Breast ultrasound computed tomography using waveform inversion with source encoding

    Science.gov (United States)

    Wang, Kun; Matthews, Thomas; Anis, Fatima; Li, Cuiping; Duric, Neb; Anastasio, Mark A.

    2015-03-01

    Ultrasound computed tomography (USCT) holds great promise for improving the detection and management of breast cancer. Because they are based on the acoustic wave equation, waveform inversion-based reconstruction methods can produce images that possess improved spatial resolution properties over those produced by ray-based methods. However, waveform inversion methods are computationally demanding and have not been applied widely in USCT breast imaging. In this work, source encoding concepts are employed to develop an accelerated USCT reconstruction method that circumvents the large computational burden of conventional waveform inversion methods. This method, referred to as the waveform inversion with source encoding (WISE) method, encodes the measurement data using a random encoding vector and determines an estimate of the speed-of-sound distribution by solving a stochastic optimization problem by use of a stochastic gradient descent algorithm. Computer-simulation studies are conducted to demonstrate the use of the WISE method. Using a single graphics processing unit card, each iteration can be completed within 25 seconds for a 128 × 128 mm2 reconstruction region. The results suggest that the WISE method maintains the high spatial resolution of waveform inversion methods while significantly reducing the computational burden.

  20. Inverse lithography source optimization via compressive sensing.

    Science.gov (United States)

    Song, Zhiyang; Ma, Xu; Gao, Jie; Wang, Jie; Li, Yanqiu; Arce, Gonzalo R

    2014-06-16

    Source optimization (SO) has emerged as a key technique for improving lithographic imaging over a range of process variations. Current SO approaches are pixel-based, where the source pattern is designed by solving a quadratic optimization problem using gradient-based algorithms or solving a linear programming problem. Most of these methods, however, are either computational intensive or result in a process window (PW) that may be further extended. This paper applies the rich theory of compressive sensing (CS) to develop an efficient and robust SO method. In order to accelerate the SO design, the source optimization is formulated as an underdetermined linear problem, where the number of equations can be much less than the source variables. Assuming the source pattern is a sparse pattern on a certain basis, the SO problem is transformed into a l1-norm image reconstruction problem based on CS theory. The linearized Bregman algorithm is applied to synthesize the sparse optimal source pattern on a representation basis, which effectively improves the source manufacturability. It is shown that the proposed linear SO formulation is more effective for improving the contrast of the aerial image than the traditional quadratic formulation. The proposed SO method shows that sparse-regularization in inverse lithography can indeed extend the PW of lithography systems. A set of simulations and analysis demonstrate the superiority of the proposed SO method over the traditional approaches.

  1. Inverse problem approaches for digital hologram reconstruction

    Science.gov (United States)

    Fournier, Corinne; Denis, Loic; Thiebaut, Eric; Fournel, Thierry; Seifi, Mozhdeh

    2011-06-01

    Digital holography (DH) is being increasingly used for its time-resolved three-dimensional (3-D) imaging capabilities. A 3-D volume can be numerically reconstructed from a single 2-D hologram. Applications of DH range from experimental mechanics, biology, and fluid dynamics. Improvement and characterization of the 3-D reconstruction algorithms is a current issue. Over the past decade, numerous algorithms for the analysis of holograms have been proposed. They are mostly based on a common approach to hologram processing: digital reconstruction based on the simulation of hologram diffraction. They suffer from artifacts intrinsic to holography: twin-image contamination of the reconstructed images, image distortions for objects located close to the hologram borders. The analysis of the reconstructed planes is therefore limited by these defects. In contrast to this approach, the inverse problems perspective does not transform the hologram but performs object detection and location by matching a model of the hologram. Information is thus extracted from the hologram in an optimal way, leading to two essential results: an improvement of the axial accuracy and the capability to extend the reconstructed field beyond the physical limit of the sensor size (out-of-field reconstruction). These improvements come at the cost of an increase of the computational load compared to (typically non iterative) classical approaches.

  2. Joint Bayesian Stochastic Inversion of Well Logs and Seismic Data for Volumetric Uncertainty Analysis

    Directory of Open Access Journals (Sweden)

    Moslem Moradi

    2015-06-01

    Full Text Available Here in, an application of a new seismic inversion algorithm in one of Iran’s oilfields is described. Stochastic (geostatistical seismic inversion, as a complementary method to deterministic inversion, is perceived as contribution combination of geostatistics and seismic inversion algorithm. This method integrates information from different data sources with different scales, as prior information in Bayesian statistics. Data integration leads to a probability density function (named as a posteriori probability that can yield a model of subsurface. The Markov Chain Monte Carlo (MCMC method is used to sample the posterior probability distribution, and the subsurface model characteristics can be extracted by analyzing a set of the samples. In this study, the theory of stochastic seismic inversion in a Bayesian framework was described and applied to infer P-impedance and porosity models. The comparison between the stochastic seismic inversion and the deterministic model based seismic inversion indicates that the stochastic seismic inversion can provide more detailed information of subsurface character. Since multiple realizations are extracted by this method, an estimation of pore volume and uncertainty in the estimation were analyzed.

  3. On adaptive trajectory tracking of a robot manipulator using inversion of its neural emulator.

    Science.gov (United States)

    Behera, L; Gopal, M; Chaudhury, S

    1996-01-01

    This paper is concerned with the design of a neuro-adaptive trajectory tracking controller. The paper presents a new control scheme based on inversion of a feedforward neural model of a robot arm. The proposed control scheme requires two modules. The first module consists of an appropriate feedforward neural model of forward dynamics of the robot arm that continuously accounts for the changes in the robot dynamics. The second module implements an efficient network inversion algorithm that computes the control action by inverting the neural model. In this paper, a new extended Kalman filter (EKF) based network inversion scheme is proposed. The scheme is evaluated through comparison with two other schemes of network inversion: gradient search in input space and Lyapunov function approach. Using these three inversion schemes the proposed controller was implemented for trajectory tracking control of a two-link manipulator. Simulation results in all cases confirm the efficacy of control input prediction using network inversion. Comparison of the inversion algorithms in terms of tracking accuracy showed the superior performance of the EKF based inversion scheme over others.

  4. Pareto joint inversion of 2D magnetotelluric and gravity data

    Science.gov (United States)

    Miernik, Katarzyna; Bogacz, Adrian; Kozubal, Adam; Danek, Tomasz; Wojdyła, Marek

    2015-04-01

    In this contribution, the first results of the "Innovative technology of petrophysical parameters estimation of geological media using joint inversion algorithms" project were described. At this stage of the development, Pareto joint inversion scheme for 2D MT and gravity data was used. Additionally, seismic data were provided to set some constrains for the inversion. Sharp Boundary Interface(SBI) approach and description model with set of polygons were used to limit the dimensionality of the solution space. The main engine was based on modified Particle Swarm Optimization(PSO). This algorithm was properly adapted to handle two or more target function at once. Additional algorithm was used to eliminate non- realistic solution proposals. Because PSO is a method of stochastic global optimization, it requires a lot of proposals to be evaluated to find a single Pareto solution and then compose a Pareto front. To optimize this stage parallel computing was used for both inversion engine and 2D MT forward solver. There are many advantages of proposed solution of joint inversion problems. First of all, Pareto scheme eliminates cumbersome rescaling of the target functions, that can highly affect the final solution. Secondly, the whole set of solution is created in one optimization run, providing a choice of the final solution. This choice can be based off qualitative data, that are usually very hard to be incorporated into the regular inversion schema. SBI parameterisation not only limits the problem of dimensionality, but also makes constraining of the solution easier. At this stage of work, decision to test the approach using MT and gravity data was made, because this combination is often used in practice. It is important to mention, that the general solution is not limited to this two methods and it is flexible enough to be used with more than two sources of data. Presented results were obtained for synthetic models, imitating real geological conditions, where

  5. Model based Inverse Methods for Sizing Cracks of Varying Shape and Location in Bolt hole Eddy Current (BHEC) Inspections (Postprint)

    Science.gov (United States)

    2016-02-10

    10.1063/1.4940557 14. ABSTRACT (Maximum 200 words) A comprehensive approach is presented to perform model-based inversion of crack characteristics ...thickness crack types, and from both standard eddy current hardware and a prototype BHEC system with z -axis position encoding. Signal processing...algorithms were developed to process and extract features from the 2D data sets, and inversion algorithms using VIC-3D generated surrogate models were used

  6. Flattening, generalizations of clauses and absorption algorithms

    NARCIS (Netherlands)

    S-H. Nienhuys-Cheng (Shan-Hwei)

    1991-01-01

    textabstractIn predicate logic, flattening can be used to replace terms with functions by variables. It can also be used for expressing absorption in inverse resolution. This has been done by Rouveirol and Puget. In this article three kinds of absorption algorithms are compared.

  7. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  8. A hierarchical Bayesian-MAP approach to inverse problems in imaging

    Science.gov (United States)

    Raj, Raghu G.

    2016-07-01

    We present a novel approach to inverse problems in imaging based on a hierarchical Bayesian-MAP (HB-MAP) formulation. In this paper we specifically focus on the difficult and basic inverse problem of multi-sensor (tomographic) imaging wherein the source object of interest is viewed from multiple directions by independent sensors. Given the measurements recorded by these sensors, the problem is to reconstruct the image (of the object) with a high degree of fidelity. We employ a probabilistic graphical modeling extension of the compound Gaussian distribution as a global image prior into a hierarchical Bayesian inference procedure. Since the prior employed by our HB-MAP algorithm is general enough to subsume a wide class of priors including those typically employed in compressive sensing (CS) algorithms, HB-MAP algorithm offers a vehicle to extend the capabilities of current CS algorithms to include truly global priors. After rigorously deriving the regression algorithm for solving our inverse problem from first principles, we demonstrate the performance of the HB-MAP algorithm on Monte Carlo trials and on real empirical data (natural scenes). In all cases we find that our algorithm outperforms previous approaches in the literature including filtered back-projection and a variety of state-of-the-art CS algorithms. We conclude with directions of future research emanating from this work.

  9. Subadditive functions and their (pseudo-)inverses

    DEFF Research Database (Denmark)

    Østerdal, Lars Peter

    2006-01-01

    The paper considers non-negative increasing functions on intervals with left endpoint closed at zero and investigates the duality between subadditivity and superadditivity via the inverse function and pseudo-inverses......The paper considers non-negative increasing functions on intervals with left endpoint closed at zero and investigates the duality between subadditivity and superadditivity via the inverse function and pseudo-inverses...

  10. Optimization and geophysical inverse problems

    Energy Technology Data Exchange (ETDEWEB)

    Barhen, J.; Berryman, J.G.; Borcea, L.; Dennis, J.; de Groot-Hedlin, C.; Gilbert, F.; Gill, P.; Heinkenschloss, M.; Johnson, L.; McEvilly, T.; More, J.; Newman, G.; Oldenburg, D.; Parker, P.; Porto, B.; Sen, M.; Torczon, V.; Vasco, D.; Woodward, N.B.

    2000-10-01

    A fundamental part of geophysics is to make inferences about the interior of the earth on the basis of data collected at or near the surface of the earth. In almost all cases these measured data are only indirectly related to the properties of the earth that are of interest, so an inverse problem must be solved in order to obtain estimates of the physical properties within the earth. In February of 1999 the U.S. Department of Energy sponsored a workshop that was intended to examine the methods currently being used to solve geophysical inverse problems and to consider what new approaches should be explored in the future. The interdisciplinary area between inverse problems in geophysics and optimization methods in mathematics was specifically targeted as one where an interchange of ideas was likely to be fruitful. Thus about half of the participants were actively involved in solving geophysical inverse problems and about half were actively involved in research on general optimization methods. This report presents some of the topics that were explored at the workshop and the conclusions that were reached. In general, the objective of a geophysical inverse problem is to find an earth model, described by a set of physical parameters, that is consistent with the observational data. It is usually assumed that the forward problem, that of calculating simulated data for an earth model, is well enough understood so that reasonably accurate synthetic data can be generated for an arbitrary model. The inverse problem is then posed as an optimization problem, where the function to be optimized is variously called the objective function, misfit function, or fitness function. The objective function is typically some measure of the difference between observational data and synthetic data calculated for a trial model. However, because of incomplete and inaccurate data, the objective function often incorporates some additional form of regularization, such as a measure of smoothness

  11. Inverse Approach to Evaluate the Tubular Material Parameters Using the Bulging Test

    Directory of Open Access Journals (Sweden)

    Yulong Ge

    2015-01-01

    Full Text Available Tubular material parameters are required for both part manufactory process planning and finite element simulations. The bulging test is one of the most credible ways to detect the property parameters for tubular material. The inverse approach provides more effective access to the accurate material evaluation than with direct identifications. In this paper, a newly designed set of bulging test tools is introduced. An inverse procedure is adopted to determine the tubular material properties in Krupkowski-Swift constitutive model of material deformation using a hybrid algorithm that combines the differential evolution and Levenberg-Marquardt algorithms. The constitutive model’s parameters obtained from the conventional and inverse methods are compared, and this comparison shows that the inverse approach is able to offer more information with higher reliability and can simplify the test equipment.

  12. Multigrid Algorithms for Domain-Wall Fermions

    CERN Document Server

    Cohen, Saul D; Clark, M A; Osborn, J C

    2012-01-01

    We describe an adaptive multigrid algorithm for solving inverses of the domain-wall fermion operator. Our multigrid algorithm uses an adaptive projection of near-null vectors of the domain-wall operator onto coarser four-dimensional lattices. This extension of multigrid techniques to a chiral fermion action will greatly reduce overall computation cost, and the elimination of the fifth dimension in the coarse space reduces the relative cost of using chiral fermions compared to discarding this symmetry. We demonstrate near-elimination of critical slowing as the quark mass is reduced and small volume dependence, which may be suppressed by taking advantage of the recursive nature of the algorithm.

  13. Moment searching algorithm for bioluminescence tomography

    Institute of Scientific and Technical Information of China (English)

    Ludong Jin; Yan Wu; Jie Tian; Heyu Huang; Xiaochao Qu

    2009-01-01

    To avoid the ill-posedness in the inverse problem of bioluminescence tomography, a moment searching algorithm fusing the finite element method (FEM) with the moment concept in theoretical mechanics is developed. In the algorithm, the source's information is mapped to the surface photon flux density by FEM, and the source's position is modified with the feedback through the algorithm of barycenter searching, which makes full use of the position information of the photon flux density on surface. The position is modified in every iterative step and will finally converge to the real source's value theoretically.

  14. Autodriver algorithm

    Directory of Open Access Journals (Sweden)

    Anna Bourmistrova

    2011-02-01

    Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

  15. -Dimensional Fractional Lagrange's Inversion Theorem

    Directory of Open Access Journals (Sweden)

    F. A. Abd El-Salam

    2013-01-01

    Full Text Available Using Riemann-Liouville fractional differential operator, a fractional extension of the Lagrange inversion theorem and related formulas are developed. The required basic definitions, lemmas, and theorems in the fractional calculus are presented. A fractional form of Lagrange's expansion for one implicitly defined independent variable is obtained. Then, a fractional version of Lagrange's expansion in more than one unknown function is generalized. For extending the treatment in higher dimensions, some relevant vectors and tensors definitions and notations are presented. A fractional Taylor expansion of a function of -dimensional polyadics is derived. A fractional -dimensional Lagrange inversion theorem is proved.

  16. Thermoelectric properties of inverse opals

    Science.gov (United States)

    Mahan, G. D.; Poilvert, N.; Crespi, V. H.

    2016-02-01

    Rayleigh's method [Philos. Mag. Ser. 5 34, 481 (1892)] is used to solve for the classical thermoelectric equations in inverse opals. His theory predicts that in an inverse opal, with periodic holes, the Seebeck coefficient and the figure of merit are identical to that of the bulk material. We also provide a major revision to Rayleigh's method, in using the electrochemical potential as an important variable, instead of the electrostatic potential. We also show that in some cases, the thermal boundary resistance is important in the effective thermal conductivity.

  17. Population inversion by chirped pulses

    Energy Technology Data Exchange (ETDEWEB)

    Lu Tianshi [Department of Mathematics and Statistics, Wichita State University, Wichita, Kansas 67260-0033 (United States)

    2011-09-15

    In this paper, we analyze the condition for complete population inversion by a chirped pulse over a finite duration. The nonadiabatic transition probability is mapped in the two-dimensional parameter space of coupling strength and detuning amplitude. Asymptotic forms of the probability are derived by the interference of nonadiabatic transitions for sinusoidal and triangular pulses. The qualitative difference between the maps for the two types of pulses is accounted for. The map is used for the design of stable inversion pulses under specific accuracy thresholds.

  18. Size Estimates in Inverse Problems

    KAUST Repository

    Di Cristo, Michele

    2014-01-06

    Detection of inclusions or obstacles inside a body by boundary measurements is an inverse problems very useful in practical applications. When only finite numbers of measurements are available, we try to detect some information on the embedded object such as its size. In this talk we review some recent results on several inverse problems. The idea is to provide constructive upper and lower estimates of the area/volume of the unknown defect in terms of a quantity related to the work that can be expressed with the available boundary data.

  19. Inverse methods in hydrologic optics

    Directory of Open Access Journals (Sweden)

    Howard R. Gordon

    2002-03-01

    Full Text Available Methods for solving the hydrologic-optics inverse problem, i.e., estimating the inherent optical properties of a water body based solely on measurements of the apparent optical properties, are reviewed in detail. A new method is developed for the inverse problem in water bodies in which fluorescence is important. It is shown that in principle, given profiles of the spectra of up- and downwelling irradiance, estimation of the coefficient of inelastic scattering from any wave band to any other wave band can be effected.

  20. Darwin's "strange inversion of reasoning".

    Science.gov (United States)

    Dennett, Daniel

    2009-06-16

    Darwin's theory of evolution by natural selection unifies the world of physics with the world of meaning and purpose by proposing a deeply counterintuitive "inversion of reasoning" (according to a 19th century critic): "to make a perfect and beautiful machine, it is not requisite to know how to make it" [MacKenzie RB (1868) (Nisbet & Co., London)]. Turing proposed a similar inversion: to be a perfect and beautiful computing machine, it is not requisite to know what arithmetic is. Together, these ideas help to explain how we human intelligences came to be able to discern the reasons for all of the adaptations of life, including our own.