A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction

Due to the restriction of computed tomography (CT) scanning environment, the acquired projection data may be incomplete for exact CT reconstruction. Though some convex optimization methods, such as total variation minimization based method, can be used for incomplete data reconstruction, the edge of reconstruction image may be partly distorted for limited-angle CT reconstruction. To promote the quality of reconstruction image for limited-angle CT imaging, in this paper, a nonconvex and nonsmooth optimization model was investigated. To solve the model, a variational proximal alternating linearized minimization (VPALM) method based on proximal mapping in a given metric was proposed. The proposed method can avoid computing the inverse of a huge system matrix thus can be used to deal with the larger-scale inverse problems. What’s more, we show that each bounded sequence generated by VPALM globally converges to a critical point based on the Kurdyka–Lojasiewicz property. Real data experiments are used to demonstrate the viability and effectiveness of VPALM method, and the results show that the proposed method outperforms two classical CT reconstruction methods.     

Inversion algorithm based on the generalized objective functional for compressed sensing

Owing to providing a novel insight for signal and image processing, compressed sensing (CS) has attracted increasing attention. The accuracy of the reconstruction algorithms plays an important role in real applications of the CS theory. In this paper, a generalized reconstruction model that simultaneously considers the inaccuracies on the measurement matrix and the measurement data is proposed for CS reconstruction. A generalized objective functional, which integrates the advantages of the least squares (LSs) estimation and the combinational M-estimation, is proposed. An iterative scheme that integrates the merits of the homotopy method and the artificial physics optimization (APO) algorithm is developed for solving the proposed objective functional. Numerical simulations are implemented to evaluate the feasibility and effectiveness of the proposed algorithm. For the cases simulated in this paper, the reconstruction accuracy is improved, which indicates that the proposed algorithm is successful in solving CS inverse problems.     

Adaptive Surface Reconstruction Based on Tensor Product Algebraic Splines

Surface reconstruction from unorganized data points is a challenging problem in Computer Aided Design and Geometric Modeling. In this paper, we extend the mathematical model proposed by Juttler and Felis (Adv. Comput. Math., 17 (2002), pp. 135-152) based on tensor product algebraic spline surfaces from fixed meshes to adaptive meshes. We start with a tensor product algebraic B-spline surface defined on an initial mesh to fit the given data based on an optimization approach. By measuring the fitting errors over each cell of the mesh, we recursively insert new knots in cells over which the errors are larger than some given threshold, and construct a new algebraic spline surface to better fit the given data locally. The algorithm terminates when the error over each cell is less than the threshold. We provide some examples to demonstrate our algorithm and compare it with Jiittler's method. Examples suggest that our method is effective and is able to produce reconstruction surfaces of high quality.AMS subject classifications: 65D17     

Ensemble learning-based computational imaging method for electrical capacitance tomography

Electrical capacitance tomography (ECT) is a potential measurement technology for industrial process monitoring, but its applicability is generally limited by low-quality tomographic images. Boosting the performance of inverse computing imaging algorithms is the key to improving the reconstruction quality (RQ). Common regularization iteration imaging methods with analytical prior regularizers are less flexible in dealing with actual reconstruction tasks, leading to large reconstruction errors. To address the challenge, this study proposes a new imaging method, including reconstruction model and optimizer. The data-driven regularizer from a new ensemble learning model and the analytical prior regularizer with the focus on the sparsity of imaging objects are combined into a new optimization model for imaging. In the proposed ensemble learning model, the generalized low rank approximations of matrices (GLRAM) method is used to carry out the dimensionality reduction for decreasing the redundancy of the input data and improving the diversity, the extreme learning machine (ELM) serves as a base learner and the nuclear norm based matrix regression (NNMR) method is developed to aggregate the ensemble of solutions. The singular value thresholding method (SVTM) and the fast iterative shrinkage-thresholding algorithm (FISTA) are inserted into the split Bregman method (SBM) to generate a powerful optimizer for the built computational model. Its comparison to other competing methods through numerical experiments on typical imaging targets demonstrates that the developed algorithm reduces reconstruction error and achieves much more improvement in imaging quality and robustness.     

基于字典学习方法的CT不完全投影图像重建算法

对于不完全投影角度的重建研究是CT图像重建中一个重要的问题.将压缩感知中字典学习的方法与CT重建算法ART迭代算法相结合.字典学习方法中字典更新采用K-SVD(K-奇异值分解)算法,稀疏编码采用OMP(正交匹配追踪)算法.最后通过对标准Head头部模型进行仿真实验,验证了字典学习方法在CT图像重建中对于提高图像的重建质量和提高信噪比的可行性与有效性.另外还研究了字典学习中图像块大小和滑动距离对重建图像的影响     

一种SENSE模型下信号重建的类-Dykstra近点有效算法

本文研究了SENSE模型下从部分傅里叶数据中信号的重建问题.利用类Dykstra近点方法和Bregman迭代方法,我们获得了一种SENSE模型下信号重建的加速类-Dykstra近点有效算法,并证明了该算法的收敛性.实验仿真显示,该方法比经典的分裂Bregman方法有效.     

Confidence Regions for Local Maxima of Reconstructed Surfaces

There are several methods of surface reconstruction from a finite number of spatial data. The reconstruction is an estimate of the true surface, and it is often used to estimate topographical characteristics, e.g. to identify areas of extreme values. The uncertainty of an estimate depends both on uncertainties introduced by the reconstruction and on observation errors.We present a method to approximately evaluate the reliability of the estimates of the locations of local maxima (or minima) of the true surface. The true surface is modeled as a continuous parameter Gaussian random field, and the reliability is presented as confidence regions around the local maxima of the reconstruction.The method applies for general finite dimension of the spatial parameter, and for any reconstruction method that gives a differentiable surface with an explicit covariance function as result.     

Existence and uniqueness of solutions of surface reconstruction problem

Surface reconstruction from scattered data is an important problem in such areas as reverse engineering and computer aided design.In solving partial differential equations derived from surface reconstruction problems,level-set method has been successfully used.We present in this paper a theoretical analysis on the existence and uniqueness of the solution of a partial differential equation derived from a model of surface reconstruction using the level-set approach.We give the uniqueness analysis of the cl...     

Surface Reconstruction of 3D Scattered Data with Radial Basis Functions

We use Radial Basis Functions （RBFs） to reconstruct smooth surfaces from 3D scattered data. An object＇s surface is defined implicitly as the zero set of an RBF fitted to the given surface data. We propose improvements on the methods of surface reconstruction with radial basis functions. A sparse approximation set of scattered data is constructed by reducing the number of interpolating points on the surface. We present an adaptive method for finding the off-surface normal points. The order of the equation decreases greatly as the number of the off-surface constraints reduces gradually. Experimental results are provided to illustrate that the proposed method is robust and may draw beautiful graphics.     

The reconstruction of the surface of scatterers with continuous curvature via low-frequency moments

In this work, the reconstruction of the shape of an acousticallysoft scatterer from knowledge of the scattering amplitude isexamined. It is demonstrated that if we work in the low-frequencyregion and the scatterer's surface is assumed to have continuouscurvature then we can construct polynomial surfaces tendingto coincide with the scatterer's surface as their degree increases.The proposed method is stable in such a way that small measurementerrors lead to small changes of the polynomial surfaces approximatingthe scatterer's surface.     

Implicit Shape Reconstruction of Unorganized Points Using PDE-Based Deformable 3D Manifolds

<正>In this work we consider the problem of shape reconstruction from an unorganized data set which has many important applications in medical imaging,scientific computing,reverse engineering and geometric modelling.The reconstructed surface is obtained by continuously deforming an initial surface following the Partial Differential Equation(PDE)-based diffusion model derived by a minimal volume-like variational formulation.The evolution is driven both by the distance from the data set and by the curvature analytically computed by it.The distance function is computed by implicit local interpolants defined in terms of radial basis functions.Space discretization of the PDE model is obtained by finite co-volume schemes and semi-implicit approach is used in time/scale.The use of a level set method for the numerical computation of the surface reconstruction allows us to handle complex geometry and even changing topology, without the need of user-interaction.Numerical examples demonstrate the ability of the proposed method to produce high quality reconstructions.Moreover,we show the effectiveness of the new approach to solve hole filling problems and Boolean operations between different data sets.     

Regular and non-regular point sets: Properties and reconstruction

In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants, which are polygonal approximations of curves and surfaces satisfying a new regularity condition. This new condition, which is an extension of the popular notion of r-sampling to the practical case of discrete shapes, seems much more realistic than previously proposed conditions based on properties of the underlying continuous shapes. Indeed, contrary to previous sampling criteria, our regularity condition can be checked on the basis of the samples alone and can be turned into a provably correct curve and surface reconstruction algorithm. Our reconstruction methods can also be applied to non-regular and unorganized point sets, revealing a larger part of the inner structure of such point sets than past approaches. Several real-size reconstruction examples validate the new method.     

An ADMM algorithm for second-order TV-based MR image reconstruction

In this paper, we propose a new model for MR image reconstruction based on second order total variation ( \(\text {TV}^{2}\) ) regularization and wavelet, which can be considered as requiring the image to be sparse in both the spatial finite differences and wavelet transforms. Furthermore, by applying the variable splitting technique twice, augmented Lagrangian method and the Barzilai-Borwein step size selection scheme, an ADMM algorithm is designed to solve the proposed model. It reduces the reconstruction problem to several unconstrained minimization subproblems, which can be solved by shrinking operators and alternating minimization algorithms. The proposed algorithm needs not to solve a fourth-order PDE but to solve several second-order PDEs so as to improve calculation efficiency. Numerical results demonstrate the effectiveness of the presented algorithm and illustrate that the proposed model outperforms some reconstruction models in the quality of reconstructed images.     

A noniterative reconstruction method for the inverse potential problem with partial boundary measurements

In this paper, a noniterative reconstruction method for solving the inverse potential problem is proposed. The forward problem is governed by a modified Helmholtz equation. The inverse problem consists in the reconstruction of a set of anomalies embedded into a geometrical domain from partial or total boundary measurements of the associated potential. Since the inverse problem is written in the form of an ill‐posed boundary value problem, the idea is to rewrite it as a topology optimization problem. In particular, a shape functional measuring the misfit between the solution obtained from the model and the data taken from the boundary measurements is minimized with respect to a set of ball‐shaped anomalies by using the concept of topological derivatives. It means that the shape functional is expanded asymptotically and then truncated up to the desired order term. The resulting truncated expansion is trivially minimized with respect to the parameters under consideration that leads to a noniterative second order reconstruction algorithm. As a result, the reconstruction process becomes very robust with respect to the noisy data and independent of any initial guess. Finally, some numerical experiments are presented showing the capability of the proposed method in reconstructing multiple anomalies of different sizes and shapes by taking into account complete or partial boundary measurements.     

A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing

In this paper, we present a new algorithm to accelerate the Chambolle gradient projection method for total variation image restoration. The new proposed method considers an approximation of the Hessian based on the secant equation. Combined with the quasi‐Cauchy equations and diagonal updating, we can obtain a positive definite diagonal matrix. In the proposed minimization method model, we use the positive definite diagonal matrix instead of the constant time stepsize in Chambolle's method. The global convergence of the proposed scheme is proved. Some numerical results illustrate the efficiency of this method. Moreover, we also extend the quasi‐Newton diagonal updating method to solve nonlinear systems of monotone equations. Performance comparisons show that the proposed method is efficient. A practical application of the monotone equations is shown and tested on sparse signal reconstruction in compressed sensing. Copyright © 2015 John Wiley & Sons, Ltd.     

A numerical method for reconstructing the coefficient in a wave equation

We present a numerical method for reconstructing the coefficient in a wave equation from a single measurement of partial Dirichlet boundary data. The original inverse problem is converted to a nonlinear integral differential equation, which is solved by an iterative method. At each iteration, one linear second‐order elliptic problem is solved to update the reconstruction of the coefficient, then the reconstructed coefficient is used to solve the forward problem to obtain the new data for the next iteration. The initial guess of the iterative method is provided by an approximate model. This model extends the approximate globally convergent method proposed by Beilina and Klibanov, which has been well developed for the determination of the coefficient in a special wave equation. Numerical experiments are presented to demonstrate the stability and robustness of the proposed method with noisy data.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 289–307, 2015     

基于小波变换和改进萤火虫算法优化极限学习机的短期负荷预测

提出了一种基于小波变换和改进萤火虫优化极限学习机的短期负荷预测方法.通过小波分解和重构,对原始负荷序列进行降噪;在模型训练阶段利用改进的萤火虫算法优化极限学习机参数,获得各序列的最优模型;针对各子序列分别预测叠加得到最终预测值.通过在两种时间尺度的数据序列上进行数值计算,与传统的ARMA、BP神经网络、支持向量机及LSSVM等多种经典预测模型相比,模型预测效果更优.     

A Tikhonov regularization method for Cauchy problem based on a new relaxation model

In this paper, we consider a Cauchy problem of recovering both missing value and flux on inaccessible boundary from Dirichlet and Neumann data measured on the remaining accessible boundary. Associated with two mixed boundary value problems, a regularized Kohn-Vogelius formulation is proposed. With an introduction of a relaxation parameter, the Dirichlet boundary conditions are approximated by two Robin ones. Compared to the existing work, weaker regularity is required on the Dirichlet data. This makes the proposed model simpler and more efficient in computation. A series of theoretical results are established for the new reconstruction model. Several numerical examples are provided to show feasibility and effectiveness of the proposed method. For simplicity of the statements, we take Poisson equation as the governed equation. However, the proposed method can be applied directly to Cauchy problems governed by more general equations, even other linear or nonlinear inverse problems.     

A discontinuous Galerkin method for Stokes equation by divergence-free patch reconstruction

A discontinuous Galerkin method by patch reconstruction is proposed for Stokes flows. A locally divergence-free reconstruction space is employed as the approximation space, and the interior penalty method is adopted which imposes the normal component penalty terms to cancel out the pressure term. Consequently, the Stokes equation can be solved as an elliptic system instead of a saddle-point problem due to such weak form. The number of degree of freedoms of our method is the same as the number of elements in the mesh for different order of accuracy. The error estimations of the proposed method are given in a classical style, which are then verified by some numerical examples.     

A Stochastic Model for Assessing Synchronization among Spike Trains in a Population of Motor Neurons

Synchronization among discharges in a population of motor neurons is of interest because of its potential to characterize physiological changes related to the neuromuscular system. Milner-Brown et al. (1973) developed a method to quantify synchronization in a population of motor neurons, in which synchronization is measured by averaging the spike-triggered surface electromyograms (EMG) waveforms. The surface EMG method opened a way to assess motor neuron synchrony in a large population of motor neurons instead of only a few, allowed investigators to track the same or similar groups of motor neurons longitudinally, and overcame the limit of examining only a few motor neurons using cross correlation. However, experimental results have suggested that the surface EMG method does not accurately and consistently detect motor neuron synchrony under some experimental conditions (Yue et al., 1995). This article reports our attempts to improve this method by establishing a new mathematical framework for the surface EMG procedure and to propose a general model based on this framework. The proposed model includes existing methods such as that of Hamm et al. (1985) as special cases. Based on the proposed model, we proposed a new synchronization index and performed computer simulation that indicated that the new index detects synchronization consistently with relatively high accuracy. Though based on the neuromuscular system, the proposed model should be extendable for detecting synchronization in other nervous systems.