# An Adaptive Directional Haar Framelet-Based Reconstruction Algorithm for Parallel Magnetic Resonance Imaging

@article{Li2016AnAD, title={An Adaptive Directional Haar Framelet-Based Reconstruction Algorithm for Parallel Magnetic Resonance Imaging}, author={Yan-Ran Li and Raymond H. Chan and Lixin Shen and Yung-Chin Hsu and Wen-Yih Isaac Tseng}, journal={SIAM J. Imaging Sci.}, year={2016}, volume={9}, pages={794-821} }

Parallel magnetic resonance imaging (pMRI) is a technique to accelerate the magnetic resonance imaging process. The problem of reconstructing an image from the collected pMRI data is ill-posed. Regularization is needed to make the problem well-posed. In this paper, we first construct a two-dimensional tight framelet system whose filters have the same support as the orthogonal Haar filters and are able to detect edges of an image in the horizontal, vertical, and $\pm 45^o$ directions. This…

## Figures from this paper

## 11 Citations

Parallel magnetic resonance imaging reconstruction algorithm by three-dimension directional Haar tight framelet regularization

- PhysicsOptical Engineering + Applications
- 2019

A pMRI optimization model by regularizing the 3DHF features on the 3-D coil image data is proposed to reduce the aliasing artifacts caused by the downsampling operation in the k-space (Fourier) domain, which can be solved by alternating direction method of multipliers (ADMM) scheme.

Regularization with multilevel non-stationary tight framelets for image restoration

- Computer Science, MathematicsApplied and Computational Harmonic Analysis
- 2021

Quasi-tight framelets with high vanishing moments derived from arbitrary refinable functions

- Mathematics, Computer Science
- 2020

Quasi-tight Framelets with Directionality or High Vanishing Moments Derived from Arbitrary Refinable Functions

- Mathematics, Computer ScienceArXiv
- 2018

The notion of a quasi-tight framelet is introduced, which is a dual framelet, but behaves almost like a tight framelet and can always derive from the arbitrary M-refinable function a compactly supported quasi- Tight framelet in L_2(R^d) with the highest possible order of vanishing moments.

Directional Compactly supported Box Spline Tight Framelets with Simple Structure

- Mathematics, Computer ScienceArXiv
- 2017

This paper constructs a directional compactly supported box spline tight framelet with simple structure such that all the high-pass filters in its underlying Tight framelet filter bank have only two nonzero coefficients with opposite signs.

Convolutional Neural Networks for Spherical Signal Processing via Spherical Haar Tight Framelets

- Computer ScienceArXiv
- 2022

A convolutional neural network model for spherical signal denoising which employs the fast framelet decomposition and reconstruction algorithms is proposed which outperforms threshold methods, and processes strong generalization and robustness properties.

Digital Affine Shear Filter Banks With 2-Layer Structure and Their Applications in Image Processing

- EngineeringIEEE Transactions on Image Processing
- 2018

Digital affine shear filter banks with 2-layer structure (DAS-2 filter banks) are constructed and are shown to be with the perfect reconstruction property. The implementation of digital affine shear…

Directional compactly supported box spline tight framelets with simple geometric structure

- MathematicsAppl. Math. Lett.
- 2019

Adaptive directional Haar tight framelets on bounded domains for digraph signal representations

- Computer ScienceArXiv
- 2020

It is shown that the adaptive directional Haar tight framelet systems can be used for digraph signal representations.

Tight Wavelet Filter Banks with Prescribed Directions

- Geology
- 2022

Constructing tight wavelet filter banks with prescribed directions is challenging. This paper presents a systematic method for designing a tight wavelet filter bank, given any prescribed directions.…

## References

SHOWING 1-10 OF 51 REFERENCES

A wavelet-based regularized reconstruction algorithm for SENSE parallel MRI with applications to neuroimaging

- MathematicsMedical Image Anal.
- 2011

Parallel imaging reconstruction using automatic regularization

- MathematicsMagnetic resonance in medicine
- 2004

A reconstruction algorithm based on Tikhonov regularization is presented that reduces the SNR loss due to geometric correlations in the spatial information from the array coil elements.

An image space approach to Cartesian based parallel MR imaging with total variation regularization

- MathematicsMedical Image Anal.
- 2012

Computational Acceleration for MR Image Reconstruction in Partially Parallel Imaging

- Computer ScienceIEEE Transactions on Medical Imaging
- 2011

Experimental results on clinical partially parallel imaging data demonstrate that the proposed algorithm requires much fewer iterations and/or less computational cost than recently developed operator splitting and Bregman operator splitting methods, to get similar or even better quality of reconstructed images.

High‐resolution image reconstruction with displacement errors: A framelet approach

- Computer ScienceInt. J. Imaging Syst. Technol.
- 2004

This article designs tight framelets and derive a tight‐framelet algorithm with symmetric boundary conditions that work for both odd and even L, and an analysis of the convergence of the algorithms is given.

Parallel MR imaging

- PhysicsJournal of magnetic resonance imaging : JMRI
- 2012

The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath‐hold times resulting in fewer motion‐corrupted examinations and recent advancements and promising research in parallel imaging are briefly reviewed.

Joint image reconstruction and sensitivity estimation in SENSE (JSENSE)

- Computer ScienceMagnetic resonance in medicine
- 2007

The problem of error propagation in the sequential procedure of sensitivity estimation followed by image reconstruction in existing methods, such as sensitivity encoding (SENSE) and simultaneous acquisition of spatial harmonics (SMASH), is considered and reformulates the image reconstruction problem as a joint estimation of the coil sensitivities and the desired image, which is solved by an iterative optimization algorithm.

Model-Based Image Reconstruction for MRI

- Computer ScienceIEEE Signal Processing Magazine
- 2010

The use of iterative algorithms for model-based MR image reconstruction based on appropriate models can improve image quality, but at the price of increased computation.

Undersampled radial MRI with multiple coils. Iterative image reconstruction using a total variation constraint

- PhysicsMagnetic resonance in medicine
- 2007

An iterative reconstruction method for undersampled radial MRI which is based on a nonlinear optimization, allows for the incorporation of prior knowledge with use of penalty functions, and deals with data from multiple coils is developed.