To solve the 'soft-field' nature and the ill-posed problem in electrical capacitance tomography (ECT)technology, a novel preconditioned conjugate gradient algorithm for electrical capacitance tomography is pre...
详细信息
ISBN:
(纸本)9783037850152
To solve the 'soft-field' nature and the ill-posed problem in electrical capacitance tomography (ECT)technology, a novel preconditioned conjugate gradient algorithm for electrical capacitance tomography is presented. The analysis of the basic principles of electrical capacitance tomography, based on the given preconditioned conjugate gradient method and calculation formula of the iteration steps of the ECT and to explore the feasibility of application of the algorithm, the algorithm to meet the convergence conditions and the reconstruction image error. Experimental results and simulation data indicate that the algorithm can provide high quality images and favorable stabilization compared with LBP, conjugate gradient algorithms in simple flow pattern and this new algorithm presents a feasible and effective way to research on image reconstruction algorithm for Electrical Capacitance Tomography System.
For research of the medium response with hierarchic structure we had developed an iterative algorithm for electromagnetic and seismic fields in the problem setting similar to analyzed higher for layered-block models w...
详细信息
ISBN:
(纸本)9781605950549
For research of the medium response with hierarchic structure we had developed an iterative algorithm for electromagnetic and seismic fields in the problem setting similar to analyzed higher for layered-block models with homogeneous inclusions. From the received results we did a conclusion, that the higher the rank of hierarchy of the medium the hardly diminishes the similarity between seismic and electromagnetic results, and the obtained information has a nondependent sense, which underlines the complexity of the researched medium.
Point set registration is important for calibration of multiple cameras, 3D reconstruction and recognition, etc. The iterative closest point (ICP) algorithm is accurate and fast for point set registration in a same sc...
详细信息
Point set registration is important for calibration of multiple cameras, 3D reconstruction and recognition, etc. The iterative closest point (ICP) algorithm is accurate and fast for point set registration in a same scale, but it does not handle the case with different scales. This paper instead introduces a novel approach named the scaling iterative closest point (SICP) algorithm which integrates a scale matrix with boundaries into the original ICP algorithm for scaling registration. At each iterative step of this algorithm, we set up correspondence between two m-D point sets, and then use a simple and fast iterative algorithm with the singular value decomposition (SVD) method and the properties of parabola incorporated to compute scale, rotation and translation transformations. The SICP algorithm has been proved to converge monotonically to a local minimum from any given parameters. Hence, to reach desired global minimum, good initial parameters are required which are successfully estimated in this paper by analyzing covariance matrices of point sets. The SICP algorithm is independent of shape representation and feature extraction, and thereby it is general for scaling registration of m-D point sets. Experimental results demonstrate its efficiency and accuracy compared with the standard ICP algorithm. (C) 2010 Elsevier Inc. All rights reserved.
This paper develops a gradient based and a least squares based iterative algorithms for solving matrix equation AXB + (CXD)-D-T = F. The basic idea is to decompose the matrix equation (system) under consideration into...
详细信息
This paper develops a gradient based and a least squares based iterative algorithms for solving matrix equation AXB + (CXD)-D-T = F. The basic idea is to decompose the matrix equation (system) under consideration into two subsystems by applying the hierarchical identification principle and to derive the iterative algorithms by extending the iterative methods for solving Ax = b and AXB = F. The analysis shows that when the matrix equation has a unique solution (under the sense of least squares), the iterative solution converges to the exact solution for any initial values. A numerical example verifies the proposed theorems. (C) 2010 Elsevier Inc. All rights reserved.
This paper presents an efficient iterative least-squares algorithm for phase-shifting interferometry. If the phase shifts contain errors, the residuals (i.e. the differences between the recorded intensities and their ...
详细信息
This paper presents an efficient iterative least-squares algorithm for phase-shifting interferometry. If the phase shifts contain errors, the residuals (i.e. the differences between the recorded intensities and their recalculated values) of least-squares algorithm are dependent on these errors. Based on this fact, an approach that allows estimating the phase shift errors from these residuals is derived. Using the results, the values of phase shifts are corrected. By iterating the two steps: phase evaluation and phase shift correction, the phase distribution can be accurately reconstructed. Its validity and performances have been investigated by both the numerical simulation and experiment results. The convergence condition with this algorithm is also discussed. (c) 2006 Elsevier Ltd. All rights reserved.
Based on double-line-of-sight measuring relative navigation method, an approach guidance law with the triangle-measuring constraint is presented for autonomous rendezvous. The observability of double-line-of-sight mea...
详细信息
Based on double-line-of-sight measuring relative navigation method, an approach guidance law with the triangle-measuring constraint is presented for autonomous rendezvous. The observability of double-line-of-sight measuring relative navigation system is analyzed using the state estimation error covariance matrix. The triangle-measuring navigation constraint is described as a keep-out cone. The approach guidance law is designed via artificial potential function method. It is ensured that there is a high region of potential in the keep-out cone and the potential still has a unique minimum at the goal position. Numerical simulations are undertaken to verify the guidance method proposed. The results indicate that the control impulses of the potential function guidance ensure convergence of the chase spacecraft to reach the goal position without violating the navigation keep-out zone.
One of the system greatly affecting the performance of a database server is the size-division of buffer pools. This letter proposes an adaptive control method of the buffer pool sizes. This method obtains the nearly o...
详细信息
One of the system greatly affecting the performance of a database server is the size-division of buffer pools. This letter proposes an adaptive control method of the buffer pool sizes. This method obtains the nearly optimal division using only observed response times in a comparatively short duration.
We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique m...
详细信息
We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique minimizer of some quadratic function over the common fixed point sets of an infinite family of nonexoansive mappings. Our result extend and improve many results announced by many authors. (C) 2006 Elsevier Inc. All rights reserved.
The mapping from the symmetric solution set to its independent parameter space is studied and an iterative method is proposed for the least-squares minimum-norm symmetric solution of AXB = E. Numerical results are rep...
详细信息
The mapping from the symmetric solution set to its independent parameter space is studied and an iterative method is proposed for the least-squares minimum-norm symmetric solution of AXB = E. Numerical results are reported that show the efficiency of the proposed methods.
This paper describes a numerical inverse method used in temperature-sensitive-paint measurements for quantitative global heat flux diagnostics in hypersonic tunnels. An iterative algorithm is developed to solve the on...
详细信息
This paper describes a numerical inverse method used in temperature-sensitive-paint measurements for quantitative global heat flux diagnostics in hypersonic tunnels. An iterative algorithm is developed to solve the one-dimensional inverse heat transfer problem for unsteady heat flux into a polymer layer (temperature-sensitive paint) on a semi-infinite base, where the temperature dependencies of the thermal properties of materials are taken into account. Surface heat flux distributions on cone models are calculated by using this algorithm from temperature-sensitive-paint images acquired in hypersonic wind tunnel testing.
暂无评论