Electrical impedance tomography for human lung reconstruction based on TV regularization algorithm

The total variation (TV) regularization method has been used to solve the ill-posed inverse problem of electrical resistance tomography (ERT), owing to its good ability to preserve edges. However, the quality of the reconstructed images, especially in the flat region, is often degraded by noise. To optimize the regularization term and the regularization factor according to the spatial feature and to improve the resolution of reconstructed images, a spatially adaptive total variation (SATV) regularization method is proposed. A kind of effective spatial feature indicator named difference curvature is used to identify which region is a flat or edge region. According to different spatial features, the SATV regularization method can automatically adjust both the regularization term and regularization factor. At edge regions, the regularization term is approximate to the TV functional to preserve the edges; in flat regions, it is approximate to the first-order Tikhonov (FOT) functional to make the solution stable. Meanwhile, the adaptive regularization factor determined by the spatial feature is used to constrain the regularization strength of the SATV regularization method for different regions. Besides, a numerical scheme is adopted for the implementation of the second derivatives of difference curvature to improve the numerical stability. Several reconstruction image metrics are used to quantitatively evaluate the performance of the reconstructed results. Both simulation and experimental results indicate that, compared with the TV (mean relative error 0.288, mean correlation coefficient 0.627) and FOT (mean relative error 0.295, mean correlation coefficient 0.638) regularization methods, the proposed SATV (mean relative error 0.259, mean correlation coefficient 0.738) regularization method can endure a relatively high level of noise and improve the resolution of reconstructed images.

Total variation (TV) regularization method is a typical method to preserve the discontinuities structure in EIT. Isotropic TV and anisotropic TV are two well-known variants of TV. The main differences between them are that the latter tends to distort the reconstructed internal inhomogeneities along the coordinate axis. In this article, we adopt the alternating direction method of multipliers (ADMM) to overcome the non-differentiability of the anisotropic TV and verify the characteristics of anisotropic TV regularization by the tank experiments.

We introduce a total variation (TV) regularization model for synthetic aperture radar (SAR) image despeckling. A dual-formulation-based adaptive TV (ATV) regularization method is applied to solve the TV regularization. The parameter adaptation of the TV regularization is performed based on the noise level estimated via wavelets. The TV-regularization-based image restoration model has a good performance in preserving image sharpness and edges while removing noises, and it is therefore effective for edge preserve SAR image despeckling. Experiments have been carried out using optical images contaminated with artificial speckles first and then SAR images. A despeckling evaluation index (DEI) is designed to assess the effectiveness of edge preserve despeckling on SAR images, which is based on the ratio of the standard deviations of two neighborhood areas of different sizes of a pixel. Experimental results show that the proposed ATV method can effectively suppress SAR image speckles without compromising the edge sharpness of image features according to both subjective visual assessment of image quality and objective evaluation using DEI.

Full-waveform inversion (FWI) is a highly nonlinear and ill-posed inverse problem, which needs proper regularization to produce reliable results. Recently, sparsity and overcompleteness have been successfully applied to seismic data processing. In this study, we propose a novel adaptive sparsity-promoting regularization for FWI which combines the L-BFGS algorithm with an adaptive overcomplete dictionary learning method. The dictionary is learned from many small imaging patches taken from the optimal velocity model that is obtained by previous L-BFGS iterations. Our dictionary learning method tries to exploit the 2D geometric structure of the training patches in a more direct way and is simple to implement. We test our proposed method on a smoothed Marmousi model, a BG Compass model, and a SEG/EAGE salt model. Since total variation (TV) regularization plays an important role in FWI, the inversion results using the TV regularization method are also presented for comparison purposes. From these experiments, we conclude that the proposed method can achieve better performance than the FWI with the TV regularization method.

A common way for solving the denosing problem is to utilize the total variation (TV) regularization. Many efficient numerical algorithms have been developed for solving the TV regularization problem. Condat described a fast direct algorithm to compute the processed 1D signal. Also there exists a direct algorithm with a linear time for 1D TV denoising referred to as the taut string algorithm. The Condat’s algorithm is based on a dual problem to the 1D TV regularization. In this paper, we propose a variant of the Condat’s algorithm based on the direct 1D TV regularization problem. The usage of the Condat’s algorithm with the taut string approach leads to a clear geometric description of the extremal function. Computer simulation results are provided to illustrate the performance of the proposed algorithm for restoration of degraded signals.

Regularization plays a crucial role in reliably utilizing imaging systems for scientific and medical investigations. It helps to stabilize the process of computationally undoing any degradation caused by physical limitations of the imaging process. In the past decades, total variation regularization played a dominant role in the literature. Two forms of total variation regularizations, namely the first-order and the second-order total variation (TV-1 and TV-2) have been widely used. TV-1 has a disadvantage: it reconstructs images in the form of piece-wise constants when the noise and/or under-sampling is severe, while TV-2 reconstructs natural-looking images under such scenarios. On the other hand, TV-1 can recover sharp jumps better than TV-2. Two forms of generalizations, namely Hessian-Schatten norm (HSN) regularization, and total generalized variation (TGV) regularization, have been proposed and have become significant developments in the area of regularization for imaging inverse problems owing to their performance. While the strength of TGV is that it can combine the advantages of TV-1 and TV-2, HSN has better structure-preserving property. Here, we develop a novel regularization for image recovery that combines the strengths of TGV and HSN. We achieve this by restricting the maximization space in the dual form of HSN in the same way that TGV is obtained from TV-2. We call the new regularization the generalized Hessian-Schatten norm regularization (GHSN). We develop a novel computational method for image reconstruction using the new form of regularization based on the well-known framework called the alternating direction method of multipliers (ADMM). We demonstrate the strength of the GHSN using some reconstruction examples.

Reconstruction of permittivity profile from boundary capacitance data

A cascading l0 regularization reconstruction method in nonsubsampled contourlet domain for limited-angle CT

The main inherent property of medical ultrasound imaging is speckle noise which generally obscures and reduces the diagnostic image resolution and contrast. Consequently, the substantial improvement of ultrasound images is an important prerequisite, whenever ultrasound is used as one of the most utilized diagnostic modalities. The problem of reconstruction of ultrasound images by means of blind deconvolution has long been recognized as a prerequisite in ultrasound imaging processing in the recent decades. Recently, the Total Variation (TV) regularization method has become extremely effective approach for image reconstruction, especially for restoring edges of the blurring image. In this paper, we present a new blind iterative TV deconvolution algorithm for reconstructing ultrasound images from blurry and noisy observations. First, it proposes the initial estimation of the point-spread function (PSF) based on a generalization of two-dimensional homomorphic filtering in cepstrum domain. It is demonstrated that the initial PSF can be effectively estimated by applying a proper smoothing low-pass filtering in cepstrum domain. Second, it introduces a novel blind iterative TV deconvolution which is derived from an alternating minimization algorithm. Fast Fourier Transform (FFT) is used in the pre-iteration computation. The innovative blind deconvolution is based on either concurrent or successive estimation of the PSF function and the image of interest. The iterative scheme is devised to recover the image and simultaneously identify the PSF function. The estimated PSF and restored image will be close to real values in the subsequent iterative deconvolution. Final, tests on phantom and clinical images have proven our novel blind iterative TV deconvolution gives more positive results of higher spatial resolution and better defined tissue structures than other deconvolution methods.

An improved inversion algorithm to reconstruct 2D temperature fields of long sparks with high-speed schlieren technique

Efficient general sparse denoising with non-convex sparse constraint and total variation regularization

ABSTRACTThis study newly demonstrates a compressed sensing (CS)-based reconstruction scheme for computed tomography (CT) with a translational trajectory. CT with a translational trajectory has many potential applications in the field of non-destructive testing (NDT) and medicine. For example, in the X-ray inspection of a large civil engineering structure, the movements of the source and detector are strictly limited, and a simple straight CT trajectory is preferable. This method could also be applied in X-ray inspection lines in factories and airports. In the medical field, this method would complement the tomosynthesis in mammography. When using a translational trajectory, the dispersion of the fan- or cone-beam creates projection data with the angular information of the sample object. However, the angular information inevitably becomes insufficient when using a translational trajectory, which degrades the reconstruction accuracy. In this case, CS is considered suitable for reconstruction because it has been successfully used for reconstructions from sparse-view and limited-angle data. For reconstruction from the translational trajectory projection, a new concept of directional difference (DD) regularization was proposed. An algorithm was developed based on the alternating direction method of multipliers (ADMM) algorithm to solve the regularization problem. Numerical reconstruction experiments from noisy projection data were conducted and the results were compared with those from other reconstruction methods. The convergence performance of the total variation (TV), DD, and mixed TV-DD regularization methods were examined. The proposed DD and TV-DD methods showed better performance than the TV only regularization. Reconstruction from Monte-Carlo simulated projection data was also demonstrated.

This paper proposes a nonlinear weighted anisotropic total variation (NWATV) regularization technique for electrical impedance tomography (EIT). The key idea is to incorporate the internal inhomogeneity information (e.g., edges of the detected objects) into the EIT reconstruction process, aiming to preserve the conductivity profiles (to be detected). We study the NWATV image reconstruction by employing a novel soft thresholding based reformulation included in the alternating direction method of multipliers (ADMM). To evaluate the proposed approach, numerical simulations and human EIT lung imaging are carried out. It is demonstrated that the properties of the internal inhomogeneity are well preserved and improved with the proposed regularization approach, in comparison to traditional total variation (TV) and recently proposed fidelity embedded regularization approaches. Owing to the simplicity of the proposed method, the computational cost is significantly decreased compared with the well established primal-dual algorithm. Precisely, with the proposed algorithm, we are able to alleviate the staircase effect arising in TV regularization and improve the reconstruction accuracy for FER does. To achieve similar accuracy as TV does, the computational times are reduced from 2.311s to 0.629s and 1.733s to 0.428s in 2D and 3D simulations, respectively, and the computational time is reduced from greater than 2s to less than 0.2s in the human experiment. Meanwhile, it was found that the proposed regularization method is quite robust to the measurement noise, which is one of the main uncertainties in EIT.

In this paper, we explore the application of total variation regularization method for bioluminescence tomography (BLT) with an adaptive regularization parameter choice approach. Since BLT is a seriously ill-posed problem, therefore, l(2) regularized methods are frequently adopted to recover the bi-oluminescent sources. However, l(2) regularized methods typically lead to smooth reconstructions. In this paper, we investigated the use of total variation (TV) regularization to improve the quality of BLT reconstruction. Furthermore, the regularization parameter in TV method was chosen adaptively to make the proposed algorithm more stable. Results on simulation data provide evidence that the reconstructed source can be localized accurately compared with l(2) method. Meanwhile, the effectiveness of utility of the parameter choice were illustrated. Finally, different levels of noisy data were added to validate the performance of the proposed algorithm.

It is required that input features are represented as vectors or scalars in machine learning for classification, e.g. support vector machine (SVM). However, real world data such as 2D images is naturally represented as matrices or tensors with higher dimensions. Thus, structural information of the data whose dimensions are more than two is not successfully considered. One typical structural information which is useful for the classification task is the spatial relationship of the nearby data points. In this paper, to leverage this kind of structural information, we propose a novel classification method which combines total variational (TV) regularization with SVM, called TV-SVM. Since TV achieves a local smoothing property by penalizing the local discontinuity of data, TV-SVM preserves better local structure than the original SVM due to TV regularization. We solve the objective function of TV-SVM via the alternating direction method of multipliers (ADMM) algorithm. Experimental results on image classification show that TV-SVM is competitive to the state-of-the-art learning method in both classification accuracy and computational complexity.