Search

To find 3D similarity transformation parameters (a scale, three rotational angles, and three translation elements) between two orthogonal coordinate systems in 3D is an ill-posed non-linear inverse problem by means of common points (their Cartesian components are known in the both systems). The problem can be solved via Linearized Least Squares (LLS) or Direct (non-iterative) Least Squares (DLS). Since the parameters in LLS take different quantities (and units) from each other, the condition problems can arise during the solution of normal equations. In this paper, we propose a combined solution to reducing ill-conditioning and to perform precision analysis and global outlier test in LLS accordingly. The way is based on column norming and uses the normalized unknowns instead of the original ones at the solution stage of the normal equations. While the global outlier test is fulfilled on the normalized unknowns, the original unknowns and their precisions obtained using the normalized matrix with linear transformation to the normalized unknowns and by the error propagation law to their variance-covariance matrix. A direct method (Direct Least Squares, DLS) is used to compute the initial values of LLS for reducing iteration number (to 1-3 cycles) with a 1.E-7 threshold in the paper. And, when the solution of 3D-ST having large rotational angles and uncertainties, it is also shown that DLS goes to a worse solution than LLS by means of a simulated transformation problem. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel class of iterative reconstruction methods for severely angular undersampled or/and limited-view tomographic problems with fan-beam scanning geometry. The proposed algorithms are based on a new analytical transform which generalizes Fourier-slice theorem to divergent-beam scanning geometries. Using a non-rigid coordinate transform, divergent rays can be reorganized into parallel ones. Therefore, one can employ a simpler parallel-beam projection model instead of more complicated divergent-beam geometries. Various existing iterative reconstruction techniques for divergent-beam geometries can be easily adapted to the proposed framework. The significant advantage of this formulation is the possibility of exploiting efficient Fourier-based recovery methods without rebinning of the projections. In case of highly sparse measurements (few-view data), rebinning methods are not suitable due to error-prone angular interpolation involved. In this work, three new methods based on the novel analytical framework for fan-beam geometry are presented: the Gerchberg-Papoulis algorithm, the Neumann decomposition method and its total variation regularized version. Presented numerical experiments demonstrate that the methods can be competitive in reconstructing from few-view noisy tomographic measurements. [ABSTRACT FROM AUTHOR]

In this paper, a non-iterative technique is proposed for the transverse load identification on Kirchhoff plates using approximate Green’s functions (AGFs). In this way, we firstly employ the recently introduced meshless method to construct the AGFs, as the combination of a series of Trefftz basis, i.e. Exponential basis functions (EBFs), and the fundamental solutions of the governing equation. As will be explained, using a proper set of EBFs, as well as a collocation technique, enables us to construct the AGFs for different types of domain shape and boundary conditions. In the second step, a set of artificially generated results, in the absence of realistic experimental results, are used to express the plate’s response field, i.e. deflection or velocity fields, as a series of AGFs through a collocation technique. It will be shown how the constant coefficients of the response series are related to the intensity of the reconstructed force at a set of selected points. The proposed method is capable of constructing both distributed and concentrated loads with desirable accuracy. This ability is shown in the solution of three sample problems of the static and time-harmonic force recovery. [ABSTRACT FROM PUBLISHER]

Bregman iterative algorithms have been extensively used forand total variation regularization problems, allowing to obtain simple, fast and effective algorithms. In this paper, three already-available algorithms for geosounding inversion are modified by including them in a Bregman iterative procedure. The resulting algorithms are easy to implement and do not require any optimization package. Modelling results are presented for synthetic and field data, observing better convergence properties than the original versions, avoiding the need of any continuation descent procedure. [ABSTRACT FROM AUTHOR]

The paper presents the iterative solutions of two coefficient inverse problems (CIPs) arising in frequency sounding and electrical prospecting. An iterative algorithm is constructed to obtain such solutions. Exploiting the Beilina–Klibanov approach to CIPs, this algorithm possesses the new iterative and refinement procedures. These features enhance significantly both the spatial and contrast resolutions of reconstructed coefficients. The computational effectiveness of the proposed numerical technique is demonstrated in computational experiments with two applied CIPs: electromagnetic or acoustic frequency sounding and electrical prospecting of layered media. The Slichter–Langer–Tikhonov formulation is exploited as a mathematical model of the latter. [ABSTRACT FROM PUBLISHER]