arXiv subjects

Di Guo

Publications and source records attributed to Di Guo.

86 records · Page 5Linked to original sources

arXiv2020

A Guaranteed Convergence Analysis for the Projected Fast Iterative Soft-Thresholding Algorithm in Parallel MRI

The boom of non-uniform sampling and compressed sensing techniques dramatically alleviates the lengthy data acquisition problem of magnetic resonance imaging. Sparse reconstruction, thanks to its fast computation and promising performance, has attracted researchers to put numerous efforts on it and has been adopted in commercial scanners. To perform sparse reconstruction, choosing a proper algorithm is essential in providing satisfying results and saving time in tuning parameters. The pFISTA, a simple and efficient algorithm for sparse reconstruction, has been successfully extended to parallel imaging. However, its convergence criterion is still an open question. And the existing convergence criterion of single-coil pFISTA cannot be applied to the parallel imaging pFISTA, which, therefore, imposes confusions and difficulties on users about determining the only parameter - step size. In this work, we provide the guaranteed convergence analysis of the parallel imaging version pFISTA to solve the two well-known parallel imaging reconstruction models, SENSE and SPIRiT. Along with the convergence analysis, we provide recommended step size values for SENSE and SPIRiT reconstructions to obtain fast and promising reconstructions. Experiments on in vivo brain images demonstrate the validity of the convergence criterion. Besides, experimental results show that compared to using backtracking and power iteration to determine the step size, our recommended step size achieves more than five times acceleration in reconstruction time in most tested cases.

eess.IV↗

arXiv2020

Review and Prospect: NMR Spectroscopy Denoising & Reconstruction with Low Rank Hankel Matrices and Tensors

Nuclear Magnetic Resonance (NMR) spectroscopy is an important analytical tool in chemistry, biology, and life science, but it suffers from relatively low sensitivity and long acquisition time. Thus, improving the apparent signal-to-noise ratio and accelerating data acquisition become indispensable. In this review, we summarize the recent progress on low rank Hankel matrix and tensor methods, that exploit the exponential property of free induction decay signals, to enable effective denoising and spectra reconstruction. We also outline future developments that are likely to make NMR spectroscopy a far more powerful technique.

physics.chem-ph↗

arXiv2020

Towards Embodied Scene Description

Embodiment is an important characteristic for all intelligent agents (creatures and robots), while existing scene description tasks mainly focus on analyzing images passively and the semantic understanding of the scenario is separated from the interaction between the agent and the environment. In this work, we propose the Embodied Scene Description, which exploits the embodiment ability of the agent to find an optimal viewpoint in its environment for scene description tasks. A learning framework with the paradigms of imitation learning and reinforcement learning is established to teach the intelligent agent to generate corresponding sensorimotor activities. The proposed framework is tested on both the AI2Thor dataset and a real world robotic platform demonstrating the effectiveness and extendability of the developed method.

cs.RO↗

arXiv2020

Review and Prospect: Deep Learning in Nuclear Magnetic Resonance Spectroscopy

Since the concept of Deep Learning (DL) was formally proposed in 2006, it had a major impact on academic research and industry. Nowadays, DL provides an unprecedented way to analyze and process data with demonstrated great results in computer vision, medical imaging, natural language processing, etc. In this Minireview, we summarize applications of DL in Nuclear Magnetic Resonance (NMR) spectroscopy and outline a perspective for DL as entirely new approaches that are likely to transform NMR spectroscopy into a much more efficient and powerful technique in chemistry and life science.

physics.med-ph↗

arXiv2019

pISTA-SENSE-ResNet for Parallel MRI Reconstruction

Magnetic resonance imaging has been widely applied in clinical diagnosis, however, is limited by its long data acquisition time. Although imaging can be accelerated by sparse sampling and parallel imaging, achieving promising reconstruction images with a fast reconstruction speed remains a challenge. Recently, deep learning approaches have attracted a lot of attention for its encouraging reconstruction results but without a proper interpretability. In this letter, to enable high-quality image reconstruction for the parallel magnetic resonance imaging, we design the network structure from the perspective of sparse iterative reconstruction and enhance it with the residual structure. The experimental results of a public knee dataset show that compared with the optimization-based method and the latest deep learning parallel imaging methods, the proposed network has less error in reconstruction and is more stable under different acceleration factors.

eess.IV↗

arXiv2019

Image Reconstruction with Low-rankness and Self-consistency of k-space Data in Parallel MRI

Parallel magnetic resonance imaging has served as an effective and widely adopted technique for accelerating scans. The advent of sparse sampling offers aggressive acceleration, allowing flexible sampling and better reconstruction. Nevertheless, faithfully reconstructing the image from limited data still poses a challenging task. Recent low-rank reconstruction methods exhibit superiority in providing a high-quality image. However, none of them employ the routinely acquired calibration data for improving image quality in parallel magnetic resonance imaging. In this work, an image reconstruction approach named STDLR-SPIRiT was proposed to explore the simultaneous two-directional low-rankness (STDLR) in the k-space data and to mine the data correlation from multiple receiver coils with the iterative self-consistent parallel imaging reconstruction (SPIRiT). The reconstruction problem was then solved with a singular value decomposition-free numerical algorithm. Experimental results of phantom and brain imaging data show that the proposed method outperforms the state-of-the-art methods in terms of suppressing artifacts and achieving the lowest error. Moreover, the proposed method exhibits robust reconstruction even when the auto-calibration signals are limited in parallel imaging. Overall the proposed method can be exploited to achieve better image quality for accelerated parallel magnetic resonance imaging.

physics.med-ph↗

arXiv2019

Accelerated Nuclear Magnetic Resonance Spectroscopy with Deep Learning

Nuclear magnetic resonance (NMR) spectroscopy serves as an indispensable tool in chemistry and biology but often suffers from long experimental time. We present a proof-of-concept of application of deep learning and neural network for high-quality, reliable, and very fast NMR spectra reconstruction from limited experimental data. We show that the neural network training can be achieved using solely synthetic NMR signal, which lifts the prohibiting demand for a large volume of realistic training data usually required in the deep learning approach.

physics.med-ph↗

arXiv2018

Vandermonde Factorization of Hankel Matrix for Complex Exponential Signal Recovery -- Application in Fast NMR Spectroscopy

Many signals are modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging. This paper studies the problem of recovering exponential signals from a random subset of samples. We exploit the Vandermonde structure of the Hankel matrix formed by the exponential signal and formulate signal recovery as Hankel matrix completion with Vandermonde factorization (HVaF). A numerical algorithm is developed to solve the proposed model and its sequence convergence is analyzed theoretically. Experiments on synthetic data demonstrate that HVaF succeeds over a wider regime than the state-of-the-art nuclear-normminimization-based Hankel matrix completion method, while has a less restriction on frequency separation than the state-of-the-art atomic norm minimization and fast iterative hard thresholding methods. The effectiveness of HVaF is further validated on biological magnetic resonance spectroscopy data.

eess.SP↗

arXiv2018

LOCld65, A Dual-Channel VCSEL Driver ASIC For Detector Front-End Readout

We present the design and the test results of a dual-channel Vertical-Cavity Surface-Emitting Laser (VCSEL) driver ASIC LOCld65 for detector front-end readout. LOCld65 is designed in a commercial 65-nm CMOS technology with a power supply of 1.2 V. LOCld65 contains two separate channels with the same structure and the two channels share an I2C slave. Each channel consists of an input amplifier, four stages of limiting amplifiers (LAs), a high-current output driver, and a bias-current generator. In order to extend the bandwidth, the input amplifier uses an inductive peaking technique and the LAs use a shared inductive peaking technique. The input amplifier and the output driver each utilize a Continuous-Time Linear Equalizer (CTLE). The LAs employ active feedback. The modulation current, the bias current, the peaking strength of the CTLEs, and the feedback strength of LAs are programmable through an I2C interface. In order to protect from the radiation damage, the I2C slave is implemented with triple modular redundancy. Each channel of LOCld65 is tested to operate up to 14 Gbps with typical power dissipations (the VCSEL included) of 68.3 mW/channel and 62.1 mW/channel at the VCSEL voltages of 3.3 V and 2.5 V, respectively. LOCld65 survives 4.9 kGy(SiO2). LOCld65 is an excellent match for the serializer-deserializer ASIC lpGBT in single- or dual-channel optical transmitters in HL-LHC upgrade applications.

physics.ins-det↗

arXiv2018

Development and Characterization of a 3.2 Gb/s Serial Link Transmitter for CMOS Image Sensors in Subatomic Physics Experiments

This paper presents development and characterization of a 3.2 Gb/s serial link transmitter for CMOS image sensors. The transmitter incorporates Reed-Solomon code to achieve low error rate in the harsh environment of subatomic physics experiments. Pre-emphasis is implemented in the transmitter, allowing data transmission over low-mass cables. It is fabricated in a 0.18 $μm$ CMOS image process as a standalone chip to characterize its performance, with the core area of 1.8 $mm^2$. A frame data rate of $3\cdot10^{-12}$ with a confidence level of 94.5$\%$ was measured through an FPGA based receiver. The measured nominal power consumption is 135 mW. The transmitter functions normally after irradiated with 4.5 Mrad TID.

physics.ins-det↗

arXiv2017

Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals

Signals are generally modeled as a superposition of exponential functions in spectroscopy of chemistry, biology and medical imaging. For fast data acquisition or other inevitable reasons, however, only a small amount of samples may be acquired and thus how to recover the full signal becomes an active research topic. But existing approaches can not efficiently recover $N$-dimensional exponential signals with $N\geq 3$. In this paper, we study the problem of recovering N-dimensional (particularly $N\geq 3$) exponential signals from partial observations, and formulate this problem as a low-rank tensor completion problem with exponential factor vectors. The full signal is reconstructed by simultaneously exploiting the CANDECOMP/PARAFAC structure and the exponential structure of the associated factor vectors. The latter is promoted by minimizing an objective function involving the nuclear norm of Hankel matrices. Experimental results on simulated and real magnetic resonance spectroscopy data show that the proposed approach can successfully recover full signals from very limited samples and is robust to the estimated tensor rank.

stat.ML↗

arXiv2015

Fast Multi-class Dictionaries Learning with Geometrical Directions in MRI Reconstruction

Objective: Improve the reconstructed image with fast and multi-class dictionaries learning when magnetic resonance imaging is accelerated by undersampling the k-space data. Methods: A fast orthogonal dictionary learning method is introduced into magnetic resonance image reconstruction to providing adaptive sparse representation of images. To enhance the sparsity, image is divided into classified patches according to the same geometrical direction and dictionary is trained within each class. A new sparse reconstruction model with the multi-class dictionaries is proposed and solved using a fast alternating direction method of multipliers. Results: Experiments on phantom and brain imaging data with acceleration factor up to 10 and various undersampling patterns are conducted. The proposed method is compared with state-of-the-art magnetic resonance image reconstruction methods. Conclusion: Artifacts are better suppressed and image edges are better preserved than the compared methods. Besides, the computation of the proposed approach is much faster than the typical K-SVD dictionary learning method in magnetic resonance image reconstruction. Significance: The proposed method can be exploited in undersapmled magnetic resonance imaging to reduce data acquisition time and reconstruct images with better image quality.

cs.CV↗

arXiv2015

Projected Iterative Soft-thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging

Compressed sensing has shown great potentials in accelerating magnetic resonance imaging. Fast image reconstruction and high image quality are two main issues faced by this new technology. It has been shown that, redundant image representations, e.g. tight frames, can significantly improve the image quality. But how to efficiently solve the reconstruction problem with these redundant representation systems is still challenging. This paper attempts to address the problem of applying iterative soft-thresholding algorithm (ISTA) to tight frames based magnetic resonance image reconstruction. By introducing the canonical dual frame to construct the orthogonal projection operator on the range of the analysis sparsity operator, we propose a projected iterative soft-thresholding algorithm (pISTA) and further accelerate it by incorporating the strategy proposed by Beck and Teboulle in 2009. We theoretically prove that pISTA converges to the minimum of a function with a balanced tight frame sparsity. Experimental results demonstrate that the proposed algorithm achieves better reconstruction than the widely used synthesis sparse model and the accelerated pISTA converges faster or comparable to the state-of-art smoothing FISTA. One major advantage of pISTA is that only one extra parameter, the step size, is introduced and the numerical solution is stable to it in terms of image reconstruction errors, thus allowing easily setting in many fast magnetic resonance imaging applications.

physics.med-ph↗

arXiv2013

Spread spectrum compressed sensing MRI using chirp radio frequency pulses

Compressed sensing has shown great potential in reducing data acquisition time in magnetic resonance imaging (MRI). Recently, a spread spectrum compressed sensing MRI method modulates an image with a quadratic phase. It performs better than the conventional compressed sensing MRI with variable density sampling, since the coherence between the sensing and sparsity bases are reduced. However, spread spectrum in that method is implemented via a shim coil which limits its modulation intensity and is not convenient to operate. In this letter, we propose to apply chirp (linear frequency-swept) radio frequency pulses to easily control the spread spectrum. To accelerate the image reconstruction, an alternating direction algorithm is modified by exploiting the complex orthogonality of the quadratic phase encoding. Reconstruction on the acquired data demonstrates that more image features are preserved using the proposed approach than those of conventional CS-MRI.

cs.CV↗