Justin P. Haldar

Justin P. Haldar

Auto-generated profile, based on publicly available information

Justin P. Haldar

Signal and Image Processing Institute, Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
5 December 2013 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
JHJustin P. Haldar
Justin P. Haldar
Recent theoretical results on low-rank matrix reconstruction have inspired significant interest in low-rank modeling of MRI images. Existing approaches have focused on higher-dimensional scenarios with data available from multiple channels, timepoints, or image contrasts. The present work demonstrates that single-channel, single-contrast, single-timepoint k-space data can also be mapped to low-rank matrices when the image has limited spatial support or slowly varying phase. Based on this, we develop a novel and flexible framework for constrained image reconstruction that uses low-rank matrix modeling of local k-space neighborhoods (LORAKS). A new regularization penalty and corresponding algorithm for promoting low-rank are also introduced. The potential of LORAKS is demonstrated with simulated and experimental data for a range of denoising and sparse-sampling applications. LORAKS is also compared against state-of-the-art methods like homodyne reconstruction, l1-norm minimization, and total variation minimization, and is demonstrated to have distinct features and advantages. In addition, while calibration-based support and phase constraints are commonly used in existing methods, the LORAKS framework enables calibrationless use of these constraints.

7 May 2015 in Magnetic Resonance in Medicine
Verified
Journal Article
Closed access
PDF file
JHJustin P. Haldar
Justin P. Haldar
JZJingwei Zhuo
Jingwei Zhuo

21 March 2009 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
JHJustin P. Haldar
Justin P. Haldar
DHDiego Hernando
Diego Hernando
Algorithms to construct/recover low-rank matrices satisfying a set of linear equality constraints have important applications in many signal processing contexts. Recently, theoretical guarantees for minimum-rank matrix recovery have been proven for nuclear norm minimization (NNM), which can be solved using standard convex optimization approaches. While nuclear norm minimization is effective, it can be computationally demanding. In this work, we explore the use of the powerfactorization (PF) algorithm as a tool for rank-constrained matrix recovery. Empirical results indicate that incremented-rank PF is significantly more successful than NNM at recovering low-rank matrices, in addition to being faster.

4 October 2018 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
BZBo Zhao
Bo Zhao
JHJustin P. Haldar
Justin P. Haldar
CLCongyu Liao
Congyu Liao
DMDan Ma
Dan Ma
YJYun Jiang
Yun Jiang
LWLawrence L. Wald
Lawrence L. Wald
Magnetic resonance (MR) fingerprinting is a new quantitative imaging paradigm, which simultaneously acquires multiple MR tissue parameter maps in a single experiment. In this paper, we present an estimation-theoretic framework to perform experiment design for MR fingerprinting. Specifically, we describe a discrete-time dynamic system to model spin dynamics, and derive an estimation-theoretic bound, i.e., the Cramér-Rao bound (CRB), to characterize the signal-to-noise ratio (SNR) efficiency of an MR fingerprinting experiment. We then formulate an optimal experiment design problem, which determines a sequence of acquisition parameters to encode MR tissue parameters with the maximal SNR efficiency, while respecting the physical constraints and other constraints from the image decoding/reconstruction process. We evaluate the performance of the proposed approach with numerical simulations, phantom experiments, and in vivo experiments. We demonstrate that the optimized experiments substantially reduce data acquisition time and/or improve parameter estimation. For example, the optimized experiments achieve about a factor of two improvement in the accuracy of T2 maps, while keeping similar or slightly better accuracy of T1 maps. Finally, as a remarkable observation, we find that the sequence of optimized acquisition parameters appears to be highly structured rather than randomly/pseudo-randomly varying as is prescribed in the conventional MR fingerprinting experiments.

1 January 2010
Verified
Conference Paper
Closed access
JHJustin P. Haldar
Justin P. Haldar
ZLZhi-Pei Liang
Zhi-Pei Liang
There has been significant recent interest in fast imaging with sparse sampling. Conventional imaging methods are based on Shannon-Nyquist sampling theory. As such, the number of required samples often increases exponentially with the dimensionality of the image, which limits achievable resolution in high-dimensional scenarios. The partially-separable function (PSF) model has previously been proposed to enable sparse data sampling in this context. Existing methods to leverage PSF structure utilize tailored data sampling strategies, which enable a specialized two-step reconstruction procedure. This work formulates the PSF reconstruction problem using the matrix-recovery framework. The explicit matrix formulation provides new opportunities for data acquisition and image reconstruction with rank constraints. Theoretical results from the emerging field of low-rank matrix recovery (which generalizes theory from sparse-vector recovery) and our empirical results illustrate the potential of this new approach.

8 November 2017 in Cerebral Cortex
Verified
Journal Article
Closed access
PDF file
AHAssal Habibi
Assal Habibi
ADAntonio Damasio
Antonio Damasio
BIBeatriz Ilari
Beatriz Ilari
RVRyan Veiga
Ryan Veiga
AJAnand A Joshi
Anand A Joshi
HDHanna Damasio
Hanna Damasio
Several studies comparing adult musicians and nonmusicians have shown that music training is associated with structural brain differences. It is not been established, however, whether such differences result from pre-existing biological traits, lengthy musical training, or an interaction of the two factors, or if comparable changes can be found in children undergoing music training. As part of an ongoing longitudinal study, we investigated the effects of music training on the developmental trajectory of children’s brain structure, over two years, beginning at age 6. We compared these children with children of the same socio-economic background but either involved in sports training or not involved in any systematic after school training. We established at the onset that there were no pre-existing structural differences among the groups. Two years later we observed that children in the music group showed (1) a different rate of cortical thickness maturation between the right and left posterior superior temporal gyrus, and (2) higher fractional anisotropy in the corpus callosum, specifically in the crossing pathways connecting superior frontal, sensory, and motor segments. We conclude that music training induces macro and microstructural brain changes in school-age children, and that those changes are not attributable to pre-existing biological traits.