Daniel S. Weller

Daniel S. Weller

Auto-generated profile, based on publicly available information

Daniel S. Weller

Department of Biomedical Engineering University of Virginia Charlottesville Virginia

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 April 2013 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Open access
DWDaniel S. Weller
Daniel S. Weller
JPJonathan R. Polimeni
Jonathan R. Polimeni
LGLeo Grady
Leo Grady
LWLawrence L. Wald
Lawrence L. Wald
EAElfar Adalsteinsson
Elfar Adalsteinsson
VGVivek K. Goyal
Vivek K. Goyal
The amount of calibration data needed to produce images of adequate quality can prevent auto-calibrating parallel imaging reconstruction methods like generalized autocalibrating partially parallel acquisitions (GRAPPA) from achieving a high total acceleration factor. To improve the quality of calibration when the number of auto-calibration signal (ACS) lines is restricted, we propose a sparsity-promoting regularized calibration method that finds a GRAPPA kernel consistent with the ACS fit equations that yields jointly sparse reconstructed coil channel images. Several experiments evaluate the performance of the proposed method relative to unregularized and existing regularized calibration methods for both low-quality and underdetermined fits from the ACS lines. These experiments demonstrate that the proposed method, like other regularization methods, is capable of mitigating noise amplification, and in addition, the proposed method is particularly effective at minimizing coherent aliasing artifacts caused by poor kernel calibration in real data. Using the proposed method, we can increase the total achievable acceleration while reducing degradation of the reconstructed image better than existing regularized calibration methods.

1 February 2014 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
DWDaniel S. Weller
Daniel S. Weller
SRSathish Ramani
Sathish Ramani
JFJeffrey A. Fessler
Jeffrey A. Fessler
SPIRiT (iterative self-consistent parallel imaging reconstruction), and its sparsity-regularized variant L 1 -SPIRiT, are compatible with both Cartesian and non-Cartesian magnetic resonance imaging sampling trajectories. However, the non-Cartesian framework is more expensive computationally, involving a nonuniform Fourier transform with a nontrivial Gram matrix. We propose a novel implementation of the regularized reconstruction problem using variable splitting, alternating minimization of the augmented Lagrangian, and careful preconditioning. Our new method based on the alternating direction method of multipliers converges much faster than existing methods because of the preconditioners' heightened effectiveness. We demonstrate such rapid convergence substantially improves image quality for a fixed computation time. Our framework is a step forward towards rapid non-Cartesian L 1 -SPIRiT reconstructions.

5 November 2015 in IEEE Transactions on Computational Imaging
Verified
Journal Article
Closed access
DWDaniel S. Weller
Daniel S. Weller
APAyelet Pnueli
Ayelet Pnueli
GDGilad Divon
Gilad Divon
OROri Radzyner
Ori Radzyner
YEYonina C. Eldar
Yonina C. Eldar
JFJeffrey A. Fessler
Jeffrey A. Fessler
This paper proposes a general framework for reconstructing sparse images from undersampled (squared)magnitude data corrupted with outliers and noise. This phase retrieval method uses a layered approach, combining repeated minimization of a convex majorizer (surrogate for a nonconvex objective function), and iterative optimization of that majorizer using a preconditioned variant of the alternating direction method of multipliers (ADMM). Since phase retrieval is nonconvex, this implementation uses multiple initial majorization vectors. The introduction of a robust 1-norm data fit term that is better adapted to outliers exploits the generality of this framework. The derivation also describes a normalization scheme for the regularization parameter and a known adaptive heuristic for the ADMM penalty parameter. Both 1-D Monte Carlo tests and 2-D image reconstruction simulations suggest the proposed framework, with the robust data fit term, reduces the reconstruction error for data corrupted with both outliers and additive noise, relative to competing algorithms having the same total computation.

19 August 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
HLHaoyi Liang
Haoyi Liang
DWDaniel S. Weller
Daniel S. Weller
Image quality assessment (IQA) is traditionally classified into full-reference (FR) IQA, reduced-reference (RR) IQA, and no-reference (NR) IQA according to the amount of information required from the original image. Although NR-IQA and RR-IQA are widely used in practical applications, room for improvement still remains because of the lack of the reference image. Inspired by the fact that in many applications, such as parameter selection for image restoration algorithms, a series of distorted images are available, the authors propose a novel comparison-based IQA (C-IQA) framework. The new comparison-based framework parallels FR-IQA by requiring two input images and resembles NR-IQA by not using the original image. As a result, the new comparison-based approach has more application scenarios than FR-IQA does, and takes greater advantage of the accessible information than the traditional single-input NR-IQA does. Further, C-IQA is compared with other state-of-the-art NR-IQA methods and another RR-IQA method on two widely used IQA databases. Experimental results show that C-IQA outperforms the other methods for parameter selection, and the parameter trimming framework combined with C-IQA saves the computation of iterative image reconstruction up to 80%.

1 February 2018 in Journal of Cardiovascular Magnetic Resonance
Verified
Journal Article
Open access
PDF file
RZRuixi Zhou
Ruixi Zhou
WHWei Huang
Wei Huang
YYYang Yang
Yang Yang
XCXiao Chen
Xiao Chen
DWDaniel S. Weller
Daniel S. Weller
MSMichael Salerno
Michael Salerno
Cardiovascular magnetic resonance (CMR) stress perfusion imaging provides important diagnostic and prognostic information in coronary artery disease (CAD). Current clinical sequences have limited temporal and/or spatial resolution, and incomplete heart coverage. Techniques such as k-t principal component analysis (PCA) or k-t sparcity and low rank structure (SLR), which rely on the high degree of spatiotemporal correlation in first-pass perfusion data, can significantly accelerate image acquisition mitigating these problems. However, in the presence of respiratory motion, these techniques can suffer from significant degradation of image quality. A number of techniques based on non-rigid registration have been developed. However, to first approximation, breathing motion predominantly results in rigid motion of the heart. To this end, a simple robust motion correction strategy is proposed for k-t accelerated and compressed sensing (CS) perfusion imaging. A simple respiratory motion compensation (MC) strategy for k-t accelerated and compressed-sensing CMR perfusion imaging to selectively correct respiratory motion of the heart was implemented based on linear k-space phase shifts derived from rigid motion registration of a region-of-interest (ROI) encompassing the heart. A variable density Poisson disk acquisition strategy was used to minimize coherent aliasing in the presence of respiratory motion, and images were reconstructed using k-t PCA and k-t SLR with or without motion correction. The strategy was evaluated in a CMR-extended cardiac torso digital (XCAT) phantom and in prospectively acquired first-pass perfusion studies in 12 subjects undergoing clinically ordered CMR studies. Phantom studies were assessed using the Structural Similarity Index (SSIM) and Root Mean Square Error (RMSE). In patient studies, image quality was scored in a blinded fashion by two experienced cardiologists. In the phantom experiments, images reconstructed with the MC strategy had higher SSIM (p < 0.01) and lower RMSE (p < 0.01) in the presence of respiratory motion. For patient studies, the MC strategy improved k-t PCA and k-t SLR reconstruction image quality (p < 0.01). The performance of k-t SLR without motion correction demonstrated improved image quality as compared to k-t PCA in the setting of respiratory motion (p < 0.01), while with motion correction there is a trend of better performance in k-t SLR as compared with motion corrected k-t PCA. Our simple and robust rigid motion compensation strategy greatly reduces motion artifacts and improves image quality for standard k-t PCA and k-t SLR techniques in setting of respiratory motion due to imperfect breath-holding.

2 July 2013 in Magnetic Resonance in Medicine
Verified
Journal Article
Open access
PDF file
DWDaniel S. Weller
Daniel S. Weller
SRSathish Ramani
Sathish Ramani
JNJon-Fredrik Nielsen
Jon-Fredrik Nielsen
JFJeffrey A. Fessler
Jeffrey A. Fessler
Purpose Regularizing parallel magnetic resonance imaging (MRI) reconstruction significantly improves image quality but requires tuning parameter selection. We propose a Monte Carlo method for automatic parameter selection based on Stein's unbiased risk estimate that minimizes the multichannel k‐space mean squared error (MSE). We automatically tune parameters for image reconstruction methods that preserve the undersampled acquired data, which cannot be accomplished using existing techniques. Theory We derive a weighted MSE criterion appropriate for data‐preserving regularized parallel imaging reconstruction and the corresponding weighted Stein's unbiased risk estimate. We describe a Monte Carlo approximation of the weighted Stein's unbiased risk estimate that uses two evaluations of the reconstruction method per candidate parameter value. Methods We reconstruct images using the denoising sparse images from GRAPPA using the nullspace method (DESIGN) and L1 iterative self‐consistent parallel imaging (L1‐SPIRiT). We validate Monte Carlo Stein's unbiased risk estimate against the weighted MSE. We select the regularization parameter using these methods for various noise levels and undersampling factors and compare the results to those using MSE‐optimal parameters. Results Our method selects nearly MSE‐optimal regularization parameters for both DESIGN and L1‐SPIRiT over a range of noise levels and undersampling factors. Conclusion The proposed method automatically provides nearly MSE‐optimal choices of regularization parameters for data‐preserving nonlinear parallel MRI reconstruction methods. Magn Reson Med 71:1760–1770, 2014.