Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Michael Petrongolo is active.

Publication


Featured researches published by Michael Petrongolo.


Medical Physics | 2014

Iterative image‐domain decomposition for dual‐energy CT

Tianye Niu; Xue Dong; Michael Petrongolo; Lei Zhu

PURPOSE Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. METHODS The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term. RESULTS On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. CONCLUSIONS The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.


Physics in Medicine and Biology | 2014

Accelerated barrier optimization compressed sensing (ABOCS) for CT reconstruction with improved convergence

Tianye Niu; Xiaojing Ye; Quentin Fruhauf; Michael Petrongolo; Lei Zhu

Recently, we proposed a new algorithm of accelerated barrier optimization compressed sensing (ABOCS) for iterative CT reconstruction. The previous implementation of ABOCS uses gradient projection (GP) with a Barzilai-Borwein (BB) step-size selection scheme (GP-BB) to search for the optimal solution. The algorithm does not converge stably due to its non-monotonic behavior. In this paper, we further improve the convergence of ABOCS using the unknown-parameter Nesterov (UPN) method and investigate the ABOCS reconstruction performance on clinical patient data. Comparison studies are carried out on reconstructions of computer simulation, a physical phantom and a head-and-neck patient. In all of these studies, the ABOCS results using UPN show more stable and faster convergence than those of the GP-BB method and a state-of-the-art Bregman-type method. As shown in the simulation study of the Shepp-Logan phantom, UPN achieves the same image quality as those of GP-BB and the Bregman-type methods, but reduces the iteration numbers by up to 50% and 90%, respectively. In the Catphan©600 phantom study, a high-quality image with relative reconstruction error (RRE) less than 3% compared to the full-view result is obtained using UPN with 17% projections (60 views). In the conventional filtered-backprojection reconstruction, the corresponding RRE is more than 15% on the same projection data. The superior performance of ABOCS with the UPN implementation is further demonstrated on the head-and-neck patient. Using 25% projections (91 views), the proposed method reduces the RRE from 21% as in the filtered backprojection (FBP) results to 7.3%. In conclusion, we propose UPN for ABOCS implementation. As compared to GP-BB and the Bregman-type methods, the new method significantly improves the convergence with higher stability and fewer iterations.


Computational and Mathematical Methods in Medicine | 2013

Low-dose and scatter-free cone-beam CT imaging using a stationary beam blocker in a single scan: phantom studies.

Xue Dong; Michael Petrongolo; Tianye Niu; Lei Zhu

Excessive imaging dose from repeated scans and poor image quality mainly due to scatter contamination are the two bottlenecks of cone-beam CT (CBCT) imaging. Compressed sensing (CS) reconstruction algorithms show promises in recovering faithful signals from low-dose projection data but do not serve well the needs of accurate CBCT imaging if effective scatter correction is not in place. Scatter can be accurately measured and removed using measurement-based methods. However, these approaches are considered unpractical in the conventional FDK reconstruction, due to the inevitable primary loss for scatter measurement. We combine measurement-based scatter correction and CS-based iterative reconstruction to generate scatter-free images from low-dose projections. We distribute blocked areas on the detector where primary signals are considered redundant in a full scan. Scatter distribution is estimated by interpolating/extrapolating measured scatter samples inside blocked areas. CS-based iterative reconstruction is finally carried out on the undersampled data to obtain scatter-free and low-dose CBCT images. With only 25% of conventional full-scan dose, our method reduces the average CT number error from 250 HU to 24 HU and increases the contrast by a factor of 2.1 on Catphan 600 phantom. On an anthropomorphic head phantom, the average CT number error is reduced from 224 HU to 10 HU in the central uniform area.


IEEE Transactions on Medical Imaging | 2015

Noise Suppression for Dual-Energy CT Through Entropy Minimization

Michael Petrongolo; Lei Zhu

In dual energy CT (DECT), noise amplification during signal decomposition significantly limits the utility of basis material images. Since clinically relevant objects typically contain a limited number of different materials, we propose an Image-domain Decomposition method through Entropy Minimization (IDEM) for noise suppression in DECT. Pixels of decomposed images are first linearly transformed into 2D clusters of data points, which are highly asymmetric due to strong signal correlation. An optimal axis is identified in the 2D space via numerical search such that the projection of data clusters onto the axis has minimum entropy. Noise suppression is performed on each image pixel by estimating the center-of-mass value of each data cluster along the direction perpendicular to the projection axis. The IDEM method is distinct from other noise suppression techniques in that it does not suppress pixel noise by reducing spatial variation between neighboring pixels. As supported by studies on Catphan©600 and anthropomorphic head phantoms, this feature endows our algorithm with a unique capability of reducing noise standard deviation on DECT decomposed images by approximately one order of magnitude while preserving spatial resolution and image noise power spectra (NPS). Compared with a filtering method and recently developed iterative method at the same level of noise suppression, the IDEM algorithm obtains high-resolution images with less artifacts. It also maintains accuracy of electron density measurements with less than 2% bias error. The IDEM method effectively suppresses noise of DECT for quantitative use, with appealing features on preservation of image spatial resolution and NPS.


Medical Physics | 2016

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Joseph Harms; Tonghe Wang; Michael Petrongolo; Tianye Niu; Lei Zhu

PURPOSE Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). METHODS The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. RESULTS On the line-pair slice of the Catphan(©)600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan(©)600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to -52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. CONCLUSIONS The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.


Journal of X-ray Science and Technology | 2014

Iterative CT reconstruction via minimizing adaptively reweighted total variation

Lei Zhu; Tianye Niu; Michael Petrongolo

BACKGROUND Iterative reconstruction via total variation (TV) minimization has demonstrated great successes in accurate CT imaging from under-sampled projections. When projections are further reduced, over-smoothing artifacts appear in the current reconstruction especially around the structure boundaries. OBJECTIVE We propose a practical algorithm to improve TV-minimization based CT reconstruction on very few projection data. METHOD Based on the theory of compressed sensing, the L-0 norm approach is more desirable to further reduce the projection views. To overcome the computational difficulty of the non-convex optimization of the L-0 norm, we implement an adaptive weighting scheme to approximate the solution via a series of TV minimizations for practical use in CT reconstruction. The weight on TV is initialized as uniform ones, and is automatically changed based on the gradient of the reconstructed image from the previous iteration. The iteration stops when a small difference between the weighted TV values is observed on two consecutive reconstructed images. RESULTS We evaluate the proposed algorithm on both a digital phantom and a physical phantom. Using 20 equiangular projections, our method reduces reconstruction errors in the conventional TV minimization by a factor of more than 5, with improved spatial resolution. CONCLUSIONS By adaptively reweighting TV in iterative CT reconstruction, we successfully further reduce the projection number for the same or better image quality.


Medical Physics | 2014

TU-F-18A-02: Iterative Image-Domain Decomposition for Dual-Energy CT.

Tianye Niu; Xue Dong; Michael Petrongolo; L Zhu

PURPOSE Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical value. Existing de-noising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. We propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. METHODS The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. It includes the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. Performance is evaluated using an evaluation phantom (Catphan 600) and an anthropomorphic head phantom. Results are compared to those generated using direct matrix inversion with no noise suppression, a de-noising method applied on the decomposed images, and an existing algorithm with similar formulation but with an edge-preserving regularization term. RESULTS On the Catphan phantom, our method retains the same spatial resolution as the CT images before decomposition while reducing the noise standard deviation of decomposed images by over 98%. The other methods either degrade spatial resolution or achieve less low-contrast detectability. Also, our method yields lower electron density measurement error than direct matrix inversion and reduces error variation by over 97%. On the head phantom, it reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. CONCLUSION We propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. The proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability. This work is supported by a Varian MRA grant.


IEEE Transactions on Medical Imaging | 2015

Erratum to “Noise Suppression for Dual-Energy CT Through Entropy Minimization”

Michael Petrongolo; Lei Zhu

Presents corrections to, “Noise suppression for dual-energy CT through entropy minimization,” (Petrongolo, M. and Zhu, L., IEEE Trans. Med. Imag., vol. 34, no. 11, pp. 2286–2297, Nov. 2015).


Medical Physics | 2014

TH‐A‐18C‐07: Noise Suppression in Material Decomposition for Dual‐Energy CT

Xue Dong; Michael Petrongolo; Tonghe Wang; L Zhu

PURPOSE A general problem of dual-energy CT (DECT) is that the decomposition is sensitive to noise in the two sets of dual-energy projection data, resulting in severely degraded qualities of decomposed images. We have previously proposed an iterative denoising method for DECT. Using a linear decomposition function, the method does not gain the full benefits of DECT on beam-hardening correction. In this work, we expand the framework of our iterative method to include non-linear decomposition models for noise suppression in DECT. METHODS We first obtain decomposed projections, which are free of beam-hardening artifacts, using a lookup table pre-measured on a calibration phantom. First-pass material images with high noise are reconstructed from the decomposed projections using standard filter-backprojection reconstruction. Noise on the decomposed images is then suppressed by an iterative method, which is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, we include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. Analytical formulae are derived to compute the variance-covariance matrix from the measured decomposition lookup table. RESULTS We have evaluated the proposed method via phantom studies. Using non-linear decomposition, our method effectively suppresses the streaking artifacts of beam-hardening and obtains more uniform images than our previous approach based on a linear model. The proposed method reduces the average noise standard deviation of two basis materials by one order of magnitude without sacrificing the spatial resolution. CONCLUSION We propose a general framework of iterative denoising for material decomposition of DECT. Preliminary phantom studies have shown the proposed method improves the image uniformity and reduces noise level without resolution loss. In the future, we will perform more phantom studies to further validate the performance of the purposed method. This work is supported by a Varian MRA grant.


Proceedings of SPIE | 2016

Noise suppression for energy-resolved CT using similarity-based non-local filtration

Joe Harms; Tonghe Wang; Michael Petrongolo; Lei Zhu

In energy-resolved CT, images are reconstructed independently at different energy levels, resulting in images with different qualities but the same structures. We propose a similarity-based non-local filtration method to extract structural information from these images for noise suppression. For each pixel, we calculate its similarity to other pixels based on CT number. The calculation is repeated on each image at different energy levels and similarity values are averaged to generate a similarity matrix. Noise suppression is achieved by multiplying the image vector by the similarity matrix. Multiple scans on a tabletop CT system are used to simulate 6-channel energy-resolved CT, with energies ranging from 75 to 125 kVp. Phantom studies show that the proposed method improves average contrast-to-noise ratio (CNR) of seven materials on the 75 kVp image by a factor of 22. Compared with averaging CT images for noise suppression, our method achieves a higher CNR and reduces the CT number error of iodine solutions from 16.5% to 3.5% and the overall image root of mean-square error (RMSE) from 3.58% to 0.93%. On the phantom with line-pair structures, our algorithm reduces noise standard deviation (STD) by a factor of 23 while maintaining 7 lp/cm spatial resolution. Additionally, anthropomorphic head phantom studies show noise STD reduction by a factor or 26 with no loss of spatial resolution. The noise suppression achieved by the similarity-based method is clinically attractive, especially for CNRs of iodine in contrast-enhanced CT.

Collaboration


Dive into the Michael Petrongolo's collaboration.

Top Co-Authors

Avatar

Lei Zhu

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

L Zhu

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Xue Dong

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Tonghe Wang

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Joe Harms

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Joseph Harms

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Quentin Fruhauf

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Xiaojing Ye

Georgia Institute of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge