Higher degree total variation for 3-D image recovery

We introduce novel image regularization penalties to overcome the practical problems associated with the classical total variation (TV) scheme. Motivated by novel reinterpretations of the classical TV regularizer, we derive two families of functionals involving higher degree partial image derivatives; we term these families as isotropic and anisotropic higher degree TV (HDTV) penalties, respectively. The isotropic penalty is the L(1) - L(2) mixed norm of the directional image derivatives, while the anisotropic penalty is the separable L(1) norm of directional derivatives. These functionals inherit the desirable properties of standard TV schemes such as invariance to rotations and translations, preservation of discontinuities, and convexity. The use of mixed norms in isotropic penalties encourages the joint sparsity of the directional derivatives at each pixel, thus encouraging isotropic smoothing. In contrast, the fully separable norm in the anisotropic penalty ensures the preservation of discontinuities, while continuing to smooth along the linelike features; this scheme thus enhances the linelike image characteristics analogous to standard TV. We also introduce efficient majorize-minimize algorithms to solve the resulting optimization problems. The numerical comparison of the proposed scheme with classical TV penalty, current second-degree methods, and wavelet algorithms clearly demonstrate the performance improvement. Specifically, the proposed algorithms minimize the staircase and ringing artifacts that are common with TV and wavelet schemes, while better preserving the singularities. We also observe that anisotropic HDTV penalty provides consistently improved reconstructions compared with the isotropic HDTV penalty.

We introduce a novel image regularization termed as multiple degree total variation (MDTV). This type of regularization combines the first and second degree directional derivatives, thus providing a good balance between preservation of edges and region smoothness. In order to solve the resulting optimization problem, we proposed a fast majorize minimize algorithm. We demonstrate the utility of the MDTV regularization in the context of image denoising and compressed sensing. We compare the proposed method with standard TV, and the state of the art higher degree methods, including higher degree total variation (HDTV) and total generalized variation (TGV) based schemes. Numerical results indicate that MDTV penalty provides improved image recovery performance.

The ℓ 1 and total variation (TV) penalties have been used successfully in many areas, and the combination of the ℓ 1 and TV penalties can lead to further improved performance. In this work, we investigate the mathematical theory and numerical algorithms for the ℓ 1 -TV model in the context of signal recovery: we derive the sample complexity of the ℓ 1 -TV model for recovering signals with sparsity and gradient sparsity. Also we propose a novel algorithm (PGM-ISTA) for the regularized ℓ 1 -TV problem, and establish its global convergence and parameter selection criteria. Furthermore, we construct a fast learned solver (LPGM-ISTA) by unrolling PGM-ISTA. The results for the experiment on ECG signals show the superior performance of LPGM-ISTA in terms of recovery accuracy and computational efficiency.

Purpose: To combine total variation (TV) and Hessian penalty in a structure adaptive way for cone-beam CT (CBCT) reconstruction. Methods: TV is a widely used first order penalty with good ability in suppressing noise and preserving edges but leads to the staircase effect in regions with smooth intensity transition. The second order Hessian penalty can effectively suppress the staircase effect with extra cost of blurring object edges. To take the best of both penalties we proposed a novel method to combine both for CBCT reconstruction in a structure adaptive way. The proposed method adaptively determined the weight of each penalty according to the geometry of local regions. An specially-designed exponent term with image gradient involved was used to characterize the local geometry such that the weights for Hessian and TV were 1 and 0 respectively at uniform local regions and 0 and 1 at edge regions. For other local regions the weights varied from 0 to 1. The objective functional was minimized using the majorzationminimization approach. We evaluated the proposed method on a modified 3D shepp-logan and a CatPhan 600 phantom. The full-width-at-halfmaximum (FWHM) and contrast-to-noise (CNR) were calculated. Results: For 3D shepp-logan the reconstructed images using TV had an obvious staircase effect while those using the proposed method and Hessian preserved the smooth transition regions well. FWHMs of the proposed method TV and Hessian penalty were 1.75 1.61 and 3.16 respectively, indicating that both TV and the proposed method is able to preserve edges. For CatPhan 600 CNR values of the proposed method were similar to those of TV and Hessian. Conclusion: The proposed method retains favorable properties of TV like preserving edges and also has the ability in better preserving gradual transition structure as Hessian does. All methods performs similarly in suppressing noise. This work was supported in part by National Natural Science Foundation of China (NNSFC) under Grant Nos.60971112 and 61375018 grants from the Cancer Prevention and Research Institute of Texas (RP130109 and RP110562-P2) National Institute of Biomedical Imaging and Bioengineering (R01 EB020366) and a grant from the American Cancer Society (RSG-13-326-01-CCE).

For solving color image recovery problems, we previously proposed an L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> vectorial total variation (L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> -VTV) as a regularization term considering the inter color channel dependency. However, the result images suffer from pseudo contours known as staircasing effect. For suppressing this, Bredies et al. proposed to add higher-order derivative terms to VTV. However, since it does not consider the inter channel dependency properly, it cannot reduce pseudo color noises on the edge regions. Based on these observations, we proposed a new convex regularization term L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> vectorial total generalized variation (L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> -VTGV) by combining two ideas: using L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> norm for penalizing the violation of the inter color channel dependency and introducing higher order derivative term. Furthermore, we address the effective numerical algorithm for various image recovery problems using L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> -VTGV as a regularization term. Experimental results shows that our proposed method can outperform the conventional methods.

Purpose:To develop a novel reconstruction method for X‐ray CT that can lead to accurate reconstruction at significantly reduced dose levels combining low X‐ray incident intensity and few views of projection data.Methods:The noise nature of the projection data at low X‐ray incident intensity was modeled and accounted by the weighted least‐squares (WLS) criterion. The total variation (TV) penalty was used to mitigate artifacts caused by few views of data. The first order primal‐dual (FOPD) algorithm was used to minimize TV in image domain, which avoided the difficulty of the non‐smooth objective function. The TV penalized WLS reconstruction was achieved by alternated FOPD TV minimization and projection onto convex sets (POCS) for data fidelity constraints. The proposed FOPD‐POCS method was evaluated using the FORBILD jaw phantom and the real cadaver head CT data.Results:The quantitative measures, root mean square error (RMSE) and contrast‐to‐noise ratio (CNR), demonstrate the superior denoising capability of WLS over LS‐based TV iterative reconstruction. The improvement of RMSE (WLS vs. LS) is 15%∼21% and that of CNR is 17%∼72% when the incident counts per ray are ranged from 1×105 to 1×103. In addition, the TV regularization can accurately reconstruct images from about 50 views of the jaw phantom. The FOPD‐POCS reconstruction reveals more structural details and suffers fewer artifacts in both the phantom and real head images. The FOPD‐POCS method also shows fast convergence at low X‐ray incident intensity.Conclusion:The new hybrid FOPD‐POCS method, based on TV penalized WLS, yields excellent image quality when the incident X‐ray intensity is low and the projection views are limited. The reconstruction is computationally efficient since the FOPD minimization of TV is applied only in the image domain. The characteristics of FOPD‐POCS can be exploited to significantly reduce radiation dose of X‐ray CT without compromising accuracy for diagnosis or treatment planning.

Sparse-view x-ray micro computed tomography (micro-CT) reconstruction algorithms via total variation (TV) optimize the data without introducing notable noise and artifacts, resulting in significant scanning time reduction while maintaining image quality. However, due to the piecewise constant assumption for the image, a conventional TV minimization often suffers from patchy artifacts in reconstructed images. Moreover, for lack of directional gradient in TV some directional information are lost. To obviate these drawbacks, in this study we develop a penalized weighted least-square (PWLS) strategy for micro-CT sparse-view image reconstruction by incorporating an adaptive weighted total variation in combination with an adaptive weighted diagonal total variation (AwTV+AwDTV) penalty term. The AwTV considers the vertical and horizontal gradients while the AwDTV uses the diagonal gradients. The associated weights which are defined based on the anisotropic edge properties of an image, are expressed as an exponential function and can be adaptively adjusted by the amount of the difference between voxel intensities to preserve the edge details. To evaluate the presented (AwTV+AwDTV)-PWLS algorithm, both qualitative and quantitative studies were performed by computer simulations and micro-CT data experiments. The Shepp-Logan phantom for computer simulation and the micro-CT water phantom and a rat skull for micro-CT experiments are employed to perform image reconstruction. To evaluate the performance of AwTV+AwDTV algorithm, we compared it with TV and AwTV reconstruction algorithms. The simulation results show that the presented (AwTV+AwDTV)-PWLS algorithm can achieve the lowest RMSE and highest PSNR, SSIM and MTF for different number of projections as compared to the AwTV and conventional TV algorithms. The micro-CT data results confirmed the superiority of the proposed (AwTV+AwDTV) method to the AwTV and TV methods for different number of projections.

In nuclear medicine, cardiac gated SPECT images are known to suffer from significantly increased noise owing to limited data counts. Consequently, spatial (and temporal) smoothing has been indispensable for suppressing the noise artifacts in SPECT reconstruction. However, recently we demonstrated that the benefit of spatial processing in motion-compensated reconstruction of gated SPECT (aka 4-D) could be outweighed by its adverse effects on the myocardium, which included degraded wall motion and perfusion defect detectability. In this work, we investigate whether we can alleviate these adverse effects by exploiting an alternative spatial smoothing prior in 4-D based on image total variation (TV). TV based prior is known to induce piecewise smoothing which can preserve edge features (such as boundaries of the heart wall) in reconstruction. However, it is not clear whether such a property would necessarily be beneficial for improving the accuracy of the myocardium in 4-D reconstruction. In particular, it is unknown whether it would adversely affect the detectability of perfusion defects that are small in size or low in contrast. In our evaluation study, we first use Monte Carlo simulated imaging with 4-D NURBS-based cardiac-torso (NCAT) phantom wherein the ground truth is known for quantitative comparison. We evaluated the accuracy of the reconstructed myocardium using a number of metrics, including regional and overall accuracy of the myocardium, accuracy of the phase activity curve (PAC) of the LV wall for wall motion, uniformity and spatial resolution of the LV wall, and detectability of perfusion defects using a channelized Hotelling observer (CHO). For lesion detection, we simulated perfusion defects with different sizes and contrast levels with the focus being on perfusion defects that are subtle. As a preliminary demonstration, we also tested on three sets of clinical acquisitions. From the quantitative results, it was demonstrated that TV smoothing could further reduce the error level in the myocardium in 4-D reconstruction along with motion-compensated temporal smoothing. In contrast to quadratic spatial smoothing, TV smoothing could reduce the noise level in the LV at a faster pace than the increase in the bias level, thereby achieving a net decrease in the error level. In particular, at the same noise level, TV smoothing could reduce the bias by about 30% compared to quadratic smoothing. Moreover, the CHO results indicate that TV could also improve the lesion detectability even when the lesion is small. The PAC results show that, at the same noise level, TV smoothing achieved lower temporal bias, which is also consistent with the improved spatial resolution of the LV in reconstruction. The improvement in blurring effects by TV was also observed in the clinical images.

Magnetic resonance (MR) imaging is considered as a very powerful imaging modality in clinical examination, but the process of image acquisition and transmission will be affected by noise, resulting in the degradation of imaging quality. In this paper, based on the Laplacian prior sparsity constraint and the nonconvex second order total variation (TV) penalty, we propose a MR images denoising model which consists of three terms. Specifically, in the first term, we use the L2-norm as the fidelity term to control the proximity between the observed image and the recovered MR image. Then, we introduce the Laplacian sparse prior constraint as the second term to mitigate the staircase artifacts in the recovered image. In the third term, we adopt the nonconvex second-order TV penalty to preserve important textures and edges. Finally, we use the alternating direction method of multipliers to solve the corresponding minimization problem. Comparative experiments on clinical data demonstrate the effectiveness of our approach in terms of PSNR and SSIM values.

In this work, we apply non-convex, sparsity exploiting regularization techniques to image reconstruction in computed tomography (CT).We modify the well-known total variation (TV) penalty to use a non-convex smooth hard threshold (SHT) penalty as opposed to the typical e1 norm. The SHT penalty is different from the p <1 norms in that it is bounded above and has bounded gradient as its argument approaches the zero vector. We propose a re-weighting scheme utilizing the Chambolle-Pock (CP) algorithm in an attempt to solve a data-error constrained optimization problem utilizing the SHT penalty and call the resulting algorithm SHTCP. We then demonstrate the algorithm on sparse-view reconstruction of a simulated breast phantom with noiseless and noisy data and compare the converged images to those generated by a CP algorithm solving the analogous data-error constrained problem utilizing the TV. We demonstrate that SHTCP allows for more accurate reconstruction in the case of sparse-view noisy data and, in the case of noiseless data, allows for accurate reconstruction from fewer views than its TV counterpart.

In this paper, an image recovery problem under the case of salt-and-pepper noise and data missing that degrade image quality is addressed if they are not effectively handled, where the salt-and-pepper noise as the impulsive noise is remodeled as a sparse signal due to its impulsiveness and the data missing pattern, denoted by a sparse vector, contains only zeros and ones to formulate the data missing. In particular, the salt-and-pepper noise and data missing are reformatted by their sparsity, respectively. The wavelet and framelet domains are explored to sparsely represent the image in order to accurately reconstruct the clean image. From the reformulations conducted and to recover the image, under one optimization framework, a joint estimation is developed to perform the image recovery, the salt-and-pepper noise suppression, and the missing patter estimation. To solve the optimization problem, two efficient solvers are developed to obtain the joint estimation solution, and they are based on the alternating direction method of multipliers (ADMM) and accelerated proximal gradient (APG). Finally, numerical studies verify that the joint estimation algorithm outperforms the state-of-the-art approaches in terms of both objective and subjective evaluation standards.

The use of machine-learning in neuroimaging offers new perspectives in early diagnosis and prognosis of brain diseases. Although such multivariate methods can capture complex relationships in the data, traditional approaches provide irregular (ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> penalty) or scattered (£1 penalty) predictive pattern with a very limited relevance. A penalty like Total Variation (TV) that exploits the natural 3D structure of the images can increase the spatial coherence of the weight map. However, TV penalization leads to non-smooth optimization problems that are hard to minimize. We propose an optimization framework that minimizes any combination of ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> , ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> , and TV penalties while preserving the exact ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> penalty. This algorithm uses Nesterov's smoothing technique to approximate the TV penalty with a smooth function such that the loss and the penalties are minimized with an exact accelerated proximal gradient algorithm. We propose an original continuation algorithm that uses successively smaller values of the smoothing parameter to reach a prescribed precision while achieving the best possible convergence rate. This algorithm can be used with other losses or penalties. The algorithm is applied on a classification problem on the ADNI dataset. We observe that the TV penalty does not necessarily improve the prediction but provides a major breakthrough in terms of support recovery of the predictive brain regions.

Penalized logspline density estimation using total variation penalty

The acquisition and transmission of magnetic resonance images are susceptible to noise, particularly impulse noise. Although the method based on the ℓ0-norm and overlapping group sparse total variation (ℓ0-OGSTV) is effective for impulse noise image restoration, it can only mitigate the staircase artifacts to a certain extent. To boost the impulse noise removal performance of ℓ0-OGSTV, we propose a new restoration model that consists of two terms. Specifically, in the first term, we keep using the ℓ0-norm as the data fidelity term to eliminate impulse noise. In the second term, we first introduce an overlapping group sparsity fractional-order total variation regularizer to eliminate staircase artifacts while preserving structural information. Then, we adopt the minimax-concave penalty to further accurately estimate the image edges. Finally, we employ an alternate direction method of multipliers to solve the proposed optimization model. Clinical experiments demonstrate its effectiveness in denoising medical images.

This paper considers the image recovery problem by taking group sparsity into account as the prior knowledge. This problem is formulated as a group sparse optimization over the intersection of a po...