MRI reconstruction from partial k-space data by iterative stationary wavelet transform thresholding
|
|
- Julia Farmer
- 6 years ago
- Views:
Transcription
1 MRI reconstruction from partial k-space data by iterative stationary wavelet transform thresholding Mohammad H. Kayvanrad 1,2, Charles A. McKenzie 1,2,3, Terry M. Peters 1,2,3 1 Robarts Research Institute, Western University, Canada 2 Biomedical Engineerin, Western University, Canada 3 Medical Biophysics, Western University, Canada Abstract. One approach to accelerating data acquisition in magnetic resonance imaging is acquisition of partial k-space data and recovery of missing data based on the sparsity of the image in the wavelet transform domain. We hypothesize that the application of stationary wavelet transform (SWT) thresholding as a sparsity-promoting operation results in improved artifact removal performance in comparison with the regular decimated wavelet transform (DWT). On this grounds, we develop an iterative SWT thresholding reconstruction. We demonstrate that an acceleration factor of 3 can be achieved using this approach on a human brain scan while only suffering a 9.61% penalty in signal to noise ratio without compromising the spatial resolution of the image. 1 Introduction Patient comfort and cost considerations limit the number of different examinations that can be performed on a patient in an MR scanner to those that can be implemented in a maximum min time period. There is, therefore, a strong desire to reduce the acquisition time without compromising the quality of the acquired images. In addition to hardware-based parallel imaging techniques [10], which demonstrate impressive reduction in the acquisition time, a complementary approach to reducing the MRI acquisition time is acquisition of partial k-space data and use of the sparsity of the image in a transform domain, e.g., wavelet, as an a priori reconstruction constraint to interpolate the missing data [11]. This is commonly referred to as compressed sensing or compressive sampling (CS) [3]. In this paper, we consider the same problem of reconstruction of MR images from under-sampled k-space data based on their sparsity in the wavelet transform domain. Nevertheless, while this work can be categorized under CS in the sense that it involves reconstruction of an object from under-sampled observations based on a sparsity constraint, our reconstruction approach is not based on the conventional norm-minimization approaches commonly used for CS. In fact, our iterative reconstruction algorithm is similar to the Papoulis-Gerchberg reconstruction algorithm [12]. However, for the sake of completeness and due to its relevance, let us briefly review the literature of CS:
2 In this paper we assume any point on the k-space grid is either sampled or replaced by zero, and denote under-sampling by a linear operation, U F, defined on the Fourier space, F. The relationship between the fully-sampled k-spaced data, F F, and the under-sampled k-space data, F u F, can be expressed as: F u = U F F (1) Assume an under-sampled set of k-space data, F u, corresponding to an unknown fully-sampled k-space dataset, F. Equation (1) describes the relationship between F u and F. The objective of CS is to reconstruct F, or equivalently in the spatial domain, f, from the under-sampled k-space data, F u, based on an a priori sparsity constraint. f = F F is the spatial domain representation of F, where F is the Fourier transform operation and denotes the adjoint operation. Assume there exists an orthogonal sparsifying transform, Ψ, to the sparse domain. It is very common to assume Ψ is a wavelet transform since MR images have a sparse representation in this domain. Wavelet sparsity, often measured in terms of an l p -norm (1 p 2), is often incorporated as a regularizing penalty term in order to solve the above problem [6]. Also, It has been shown that the addition of a finite difference penalty term, usually referred to as total variation (TV), improves the reconstruction quality [2]. The problem can be cast in a constrained optimization framework: min Ψf lp + αt V (f ) s.t. U F Ff F u l2 < ɛ (2) f where f denotes the solution and α is a constant. Although the solution to this problem may be found using a general-purpose optimizer [2], [11], use of iterative thresholding algorithms is also a common approach to computing the solution [6], [8], [1]. We note once more that while, our objective is to reconstruct MR images from under-sampled k-space data based on the wavelet sparsity of the images, we don t follow the conventional CS reconstruction by optimizing norm penalty terms (e.g., l 1 or TV). Our reconstruction algorithm is similar to the Papoulis-Gerchberg reconstruction, and is not intended to optimize any particular norm. This is important to note for a clear understanding of the methods and the results described in this paper. The results are, however, compared with those obtained by conventional CS methods, as one may naturally expect. For the sake of clarity, especially since it was mentioned that our reconstruction is similar to the Papoulis-Gerchberg (P-G) reconstruction algorithm, it will be helpful to also have a few words on the relation between our reconstruction and P-G before proceeding to a detailed explanation of the reconstruction algorithm and the rationale behind it. The P-G algorithm was originally developed for reconstruction from partial spatial or frequency domain data with a finite support constraint in the other domain. The signal is reconstructed by alternating between these domains to re-enforce the data and support constraints in the corresponding domains. This algorithm has been also used for MRI reconstruction from limited k-space observations with the assumption of a finite spatial
3 support constraint on the image [4], [9], [13]. However, as we describe in section 3, a similar reconstruction can be obtained with the assumption of a wavelet sparsity constraint (equivalent to the support constraint in P-G). Similar to the P-G algorithm, the image is reconstructed by alternating between the frequency domain and the wavelet domain to re-enforce the known k-space data and sparsity constraints, respectively. Besides the domain on which these constraints are defined (wavelet vs. spatial), they also differ in the sense that while a known finite support can be considered a hard constraint, wavelet sparsity is a soft constraint. We hypothesize that the application of stationary wavelet transform (SWT) thresholding as a sparsity-promoting operation results in improved artifact removal performance in comparison with the regular decimated wavelet transform (DWT) (section 2). The rationale is based on the observation that better de-noising/artifact-removal performance can be achieved by SWT thresholding compared to DWT due to the translation-invariance of SWT [5]. On this grounds we develop a SWT iterative thresholding algorithm by alternating between the frequency domain, in which the k-space data constraint is re-enforced, and the SWT domain, in which the sparsity constraint is re-enforced (section 3). 2 SWT thresholding reconstruction Thresholding is a well-established technique for denoising [7] and sparse recovery [6]. It has been shown that denoising with the regular decimated wavelet transform (DWT) sometimes results in visual artifacts. Some of these artifacts are attributed to the lack of translation invariance of the wavelet basis and can be eliminated by the application of stationary wavelet transform (SWT) [5]. Although use of SWT thresholding in place of DWT thresholding is very well established for denoising applications, it seems to have been neglected in sparse recovery applications. In the discussion that follows we demonstrate the advantages of SWT thresholding over DWT thresholding as a sparsity-promoting operation for sparse recovery by some point spread function (PSF) analysis. With many pulse sequences one may not achieve further time savings by under-sampling in the readout (k x ) direction since the samples in the readout direction are usually acquired within a single repetition time, T R. Therefore, assuming full sampling in the readout direction, the problem reduces to a 1D (for 2D MRI) or 2D (for 3D MRI) interpolation problem in the phase encode (k y and k z ) directions. In this paper, we consider the 2D MRI case and assume k-space is under-sampled in the phase-encode (k y ) direction only. Therefore, it is sufficient to consider a delta input in the y direction only for the sake of our PSF analysis. We assume a pre-allocated grid of size M N and let f(m, n) = δ(n) be a discrete delta function in the y direction in the spatial domain, where m M/2 and n N/2. Note that, for simplicity, we assume the { origin is 1; n = 0 located at the center of the grid. δ is the Dirac delta function, δ(n) = 0; n 0.
4 Transforming f(m, n) to the Fourier domain, under-sampling, and transforming back to the spatial domain result in the under-sampling PSF, f u, in the spatial domain (figure 1(a)): f u = F U F Ff (3) Consider the wavelet decomposition of f u using decimated and stationary wavelet transforms: C DW T = Ψ DW T f u, and C SW T = Ψ SW T f u, where Ψ DW T and Ψ SW T are the (orthogonal) decimated and stationary wavelet transforms and C DW T and C SW T are the corresponding wavelet decomposition coefficients, respectively. Assume a level-dependent thresholding operation, γ, acting on the decomposition coefficients: CDW T = γ{c DW T }, and C SW T = γ{c SW T }. The corresponding PSFs are computed by wavelet reconstruction of the thresholded coefficients: fdw T = ΨDW C T DW T, and f SW T = ΨSW C T SW T (figures 1(b) and 1(c)). The signal-to-alias ratio, defined as the energy of the peak (signal) to the energy of the side-lobe (alias), provides a quantitative means of comparing these functions with each other and with the original aliasing PSF, f u. Apparently, a higher signal-to-alias ratio, achieved by SWT thresholding, indicates less aliasing interference (SWT signal-to-alias ratio > DWT signal-to-alias ratio > Aliased signal-to-alias ratio). Since we are mainly working with stationary wavelet transforms, from now on we drop the subscripts for stationary wavelet transform. Also, in order to simplify our notations, let us define a SWT thresholding operation, Γ, such that f = Γ {f u } (4) 3 Methods In section 2 we showed that the signal-to-alias ratio can be increased by the application of a thresholding operation to the SWT coefficients of the aliased image. Assume an under-sampled image f u corresponding to an under-sampled k-space dataset F u. Starting with f u as the initial estimate to the solution, a better estimate is achieved by removing some of the aliasing artifacts by the thresholding (sparsity-promoting) operation: g (1) = Γ {f u }. The superscript denotes the iteration number, i.e., the first iteration. We employ the same notation to denote the iteration number throughout this section. Nonetheless, both under-sampling (U F ) and thresholding (Γ ) operations reduce the energy of the image. Consequently, g (1) has reduced energy compared to f u and f u has reduced energy compared to f. 4 In addition, while thresholding should have revealed more features of the image by removing some of the aliasing artifacts, it may as well have affected the known k-space samples. 4 In fact, f u = F F U has the minimum energy among all the solutions consistent with the k-space data since we assume the unobserved k-space samples are simply replaced by zero in F U. This is usually called a minimum-energy reconstruction.
5 (a) Aliasing PSF (signal-to-alias ratio = 0.505) (b) DWT (signal-to-alias ratio = 0.585) (c) SWT (signal-to-alias ratio = 0.685) Fig. 1. Point spread functions (PSF) resulting from k-space under-sampling (1(a) ) followed by the application of DWT (1(b)) and SWT (1(c)) thresholding on the aliased impulse input image. Mathematically, F u = U F F U F G (1), where G (1) = Fg (1) is the Fourier transform of g (1). In words, if G (1) is under-sampled in the same way k-space was, i.e., U F G (1), it will not necessarily be consistent with the original k-space data. Therefore, before further progress, the known k-space samples are recovered: F (1) = G (1) U F G (1) + F u. Note that F (1) has higher energy than F u, since some of the unknown coefficients, which are replaced by zeros in F u, take an estimated value in F (1). f (1) is a better estimate to f than f u. This estimate can be improved by repeating the above procedure in a an iterative manner. That is, at the nth iteration starting with the latest estimate at the previous iteration, f (n 1), the next estimate is achieved by a sparsity-promoting operation, g (n) = Γ {f (n 1) } (5)
6 followed by recovery of the known k-space samples, F (n) = G (n) U F G (n) + F u (6) Combining these two operations, and noting f (n) = F F (n), the iterations can be expressed as f (n) = Γ {f (n 1) } F U F FΓ {f (n 1) } + F F u (7) The iterations are initialized with the minimum-energy reconstruction, f (0) = f u, and continue until a convergence criterion, e.g., changes lass than a certain threshold, f (n) f (n 1) / f (n) < ɛ, or a maximum number of iterations is reached. A whole-brain scan of a volunteer was acquired at 3T, with a 32-channel head coil, using fast spin echo (FSE), with the following parameters: TR/TE = 3600ms/80ms, ETL = 15, Grid size = 256x256 (resolution = 1mm), Number slices = 68 (slice thickness = 2mm). Human data used in this work were acquired using a protocol approved by the institutional Office of Research Ethics. The fully-sampled dataset is used as the gold standard. Each slice is randomly under-sampled with a Gaussian pdf with a zero mean (corresponding to the center of k-space, i.e., the zero frequency) along the phase-encode (K y ) direction (see section 1). The under-sampling pattern is chosen by following the Monte Carlo experiments described in [11] to make the experiments repeatable. The under-sampled set of data in each slice is reconstructed by iterative SWT thresholding and by direct l 1 + TV optimization. 4 Results The results indicate that an acceleration factor of 3 can be achieved while only suffering 9.61% in the signal-to-noise ratio (SNR) (Figures 2(a), 2(c), and 3(b)). Note that although the aliasing artifacts are due to k-space under-sampling and are not noise, we include these artifacts in noise and use SNR as a quantitative measure of reconstruction quality in addition to RMSE. The results also show noticeable improvement over reconstruction by l 1 + TV optimization, performed using the code supplement to [11] (figures 2(d) and 3(c)). Reconstruction by SWT thresholing also results in better reconstruction quality compared to low-resolution sampling with the same under-sampling factor (figures 2(b) and 3(a)). Nevertheless, while in [11] it is shown that reconstruction by l 1 + TV optimization results in higher reconstruction quality compared to low-resolution sampling at an acceleration of 2.4, it seems the reconstruction quality degrades compare to low-resolution sampling at an acceleration of 3. 5 Discussion While MRI data used in this paper were acquired using a fast spin echo pulse sequence, this does not affect the generality of the described methods and they can
7 (a) Fully-sampled (b) Low resolution (c) SWT thresholding (d) l1 and TV (SNR=28.4 a.u.) (SNR=18.9 a.u.) (SNR=25.6 a.u.) optimization (SNR=6.48 a.u.) Fig. 2. Reconstruction from under-sampled (under-sampling factor = 3) k-space data. 2(a) Fully-sampled k-space (Gold standard) 2(b) Low resolution image 2(c) Reconstruction by iterative SWT thresholding 2(d) Reconstruction by l1 and TV optimization. be used to accelerate acquisition with other pulse sequences as well. Although a whole brain scan with the described resolution can be acquired in about 6 minutes using fast spin echo, a time that is quite reasonable for a clinical MRI, an acceleration ratio of 3, illustrated in the results, will reduce the acquisition time to 2 minutes without noticeably reducing the reconstruction quality. Once additional acquisitions are added to the scan session, the time savings will become noticeable not only from a patient-comfort perspective, also because the time savings will enable us to run additional acquisitions to acquire more information, which is valuable for diagnosis/treatment purposes. 6 Conclusion We hypothesize that the aliasing artifacts due to random k-space under-sampling show noise-like characteristics. Since stationary wavelet transform (SWT) thresholding is commonly used for denoising to eliminate the pseudo-gibbs artifacts associated with the translation-variance of the decimated wavelet transform, and based on the above hypothesis, we propose to use iterative SWT thresholding for reconstruction of under-sampled MRI data. The results indicate that an acceleration factor of 3 can be achieved while only suffering a 9.61% penalty in signal-to-noise ratio (SNR), also exhibiting a noticeable improvement compared to low-resolution sampling and reconstruction by l1 + TV optimization. References 1. Thomas Blumensath and Mike E. Davies. Iterative hard thresholding for compressed sensing. Applied and Computational Harmonic Analysis, 27(3): , November 2009.
8 (a) Low resolution (b) SWT thresholding (RMSE=0.0100) optimization (c) l1 and TV (RMSE=0.0279) (RMSE=0.0469) Fig. 3. Difference images and normalized root mean square error (RMSE) values with respect to the gold standard. The images are normalized to [0,1] before computing the RMSE values. 2. E.J. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. Information Theory, IEEE Transactions on, 52(2): , E.J. Candes and M.B. Wakin. An introduction to compressive sampling. Signal Processing Magazine, IEEE, 25(2):21 30, Arvidas B Cheryauka, James N Lee, Alexei A Samsonov, Michel Defrise, and Grant T Gullberg. MRI diffusion tensor reconstruction with PROPELLER data acquisition. Magnetic Resonance Imaging, 22(2): , February PMID: R. R Coifman and D. L Donoho. Translation-invariant de-noising. 103: , I. Daubechies, M. Defrise, and C. De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics, 57(11): , November D. L Donoho. De-noising by soft-thresholding. IEEE Transactions on Information Theory, 41(3): , May Massimo Fornasier and Holger Rauhut. Iterative thresholding algorithms. Applied and Computational Harmonic Analysis, 25(2): , September C I Haupt, N Schuff, M W Weiner, and A A Maudsley. Removal of lipid artifacts in 1H spectroscopic imaging by data extrapolation. Magnetic Resonance in Medicine: Official Journal of the Society of Magnetic Resonance in Medicine / Society of Magnetic Resonance in Medicine, 35(5): , May PMID: David J Larkman and Rita G Nunes. Parallel magnetic resonance imaging. Physics in Medicine and Biology, 52(7):R15 R55, April Michael Lustig, David Donoho, and John M. Pauly. Sparse MRI: the application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine, 58(6): , December A. Papoulis. A new algorithm in spectral analysis and band-limited extrapolation. IEEE Transactions on Circuits and Systems, 22(9): , September S.K. Plevritis and A. Macovski. Spectral extrapolation of spatially bounded images [MRI application]. Medical Imaging, IEEE Transactions on, 14(3): , September 1995.
Weighted-CS for reconstruction of highly under-sampled dynamic MRI sequences
Weighted- for reconstruction of highly under-sampled dynamic MRI sequences Dornoosh Zonoobi and Ashraf A. Kassim Dept. Electrical and Computer Engineering National University of Singapore, Singapore E-mail:
More informationG Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine. Compressed Sensing
G16.4428 Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine Compressed Sensing Ricardo Otazo, PhD ricardo.otazo@nyumc.org Compressed
More informationCompressed Sensing for Rapid MR Imaging
Compressed Sensing for Rapid Imaging Michael Lustig1, Juan Santos1, David Donoho2 and John Pauly1 1 Electrical Engineering Department, Stanford University 2 Statistics Department, Stanford University rapid
More informationOptimal Sampling Geometries for TV-Norm Reconstruction of fmri Data
Optimal Sampling Geometries for TV-Norm Reconstruction of fmri Data Oliver M. Jeromin, Student Member, IEEE, Vince D. Calhoun, Senior Member, IEEE, and Marios S. Pattichis, Senior Member, IEEE Abstract
More informationStationary wavelet transform for under-sampled MRI reconstruction.
Western University Scholarship@Western Robarts Imaging Publications Robarts Research Institute 2014 Stationary wavelet transform for under-sampled MRI reconstruction. Mohammad H Kayvanrad A Jonathan McLeod
More informationSparse sampling in MRI: From basic theory to clinical application. R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology
Sparse sampling in MRI: From basic theory to clinical application R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology Objective Provide an intuitive overview of compressed sensing
More informationCompressed Sensing Algorithm for Real-Time Doppler Ultrasound Image Reconstruction
Mathematical Modelling and Applications 2017; 2(6): 75-80 http://www.sciencepublishinggroup.com/j/mma doi: 10.11648/j.mma.20170206.14 ISSN: 2575-1786 (Print); ISSN: 2575-1794 (Online) Compressed Sensing
More informationIncoherent noise suppression with curvelet-domain sparsity Vishal Kumar, EOS-UBC and Felix J. Herrmann, EOS-UBC
Incoherent noise suppression with curvelet-domain sparsity Vishal Kumar, EOS-UBC and Felix J. Herrmann, EOS-UBC SUMMARY The separation of signal and noise is a key issue in seismic data processing. By
More informationEfficient MR Image Reconstruction for Compressed MR Imaging
Efficient MR Image Reconstruction for Compressed MR Imaging Junzhou Huang, Shaoting Zhang, and Dimitris Metaxas Division of Computer and Information Sciences, Rutgers University, NJ, USA 08854 Abstract.
More informationCollaborative Sparsity and Compressive MRI
Modeling and Computation Seminar February 14, 2013 Table of Contents 1 T2 Estimation 2 Undersampling in MRI 3 Compressed Sensing 4 Model-Based Approach 5 From L1 to L0 6 Spatially Adaptive Sparsity MRI
More informationSupplemental Material for Efficient MR Image Reconstruction for Compressed MR Imaging
Supplemental Material for Efficient MR Image Reconstruction for Compressed MR Imaging Paper ID: 1195 No Institute Given 1 More Experiment Results 1.1 Visual Comparisons We apply all methods on four 2D
More information29 th NATIONAL RADIO SCIENCE CONFERENCE (NRSC 2012) April 10 12, 2012, Faculty of Engineering/Cairo University, Egypt
K1. High Performance Compressed Sensing MRI Image Reconstruction Ahmed Abdel Salam, Fadwa Fawzy, Norhan Shaker, Yasser M.Kadah Biomedical Engineering, Cairo University, Cairo, Egypt, ymk@k-space.org Computer
More informationCompressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI
1 Compressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI Kevin T. Looby klooby@stanford.edu ABSTRACT The temporal resolution necessary for dynamic contrast enhanced (DCE) magnetic resonance
More informationAutomated Aperture GenerationQuantitative Evaluation of Ape
. Objectives Approaches Randomness Reconstructing Images from K-space References Automated Aperture Generation Quantitative Evaluation of Aperture April 5, 011 . Objectives Approaches Randomness Reconstructing
More informationRandomized sampling strategies
Randomized sampling strategies Felix J. Herrmann SLIM Seismic Laboratory for Imaging and Modeling the University of British Columbia SLIM Drivers & Acquisition costs impediments Full-waveform inversion
More informationThe Benefit of Tree Sparsity in Accelerated MRI
The Benefit of Tree Sparsity in Accelerated MRI Chen Chen and Junzhou Huang Department of Computer Science and Engineering, The University of Texas at Arlington, TX, USA 76019 Abstract. The wavelet coefficients
More informationDeconvolution with curvelet-domain sparsity Vishal Kumar, EOS-UBC and Felix J. Herrmann, EOS-UBC
Deconvolution with curvelet-domain sparsity Vishal Kumar, EOS-UBC and Felix J. Herrmann, EOS-UBC SUMMARY We use the recently introduced multiscale and multidirectional curvelet transform to exploit the
More informationIterative CT Reconstruction Using Curvelet-Based Regularization
Iterative CT Reconstruction Using Curvelet-Based Regularization Haibo Wu 1,2, Andreas Maier 1, Joachim Hornegger 1,2 1 Pattern Recognition Lab (LME), Department of Computer Science, 2 Graduate School in
More informationIntroduction. Wavelets, Curvelets [4], Surfacelets [5].
Introduction Signal reconstruction from the smallest possible Fourier measurements has been a key motivation in the compressed sensing (CS) research [1]. Accurate reconstruction from partial Fourier data
More informationSignal Reconstruction from Sparse Representations: An Introdu. Sensing
Signal Reconstruction from Sparse Representations: An Introduction to Compressed Sensing December 18, 2009 Digital Data Acquisition Suppose we want to acquire some real world signal digitally. Applications
More informationCompressive Sensing for Multimedia. Communications in Wireless Sensor Networks
Compressive Sensing for Multimedia 1 Communications in Wireless Sensor Networks Wael Barakat & Rabih Saliba MDDSP Project Final Report Prof. Brian L. Evans May 9, 2008 Abstract Compressive Sensing is an
More informationA Novel Iterative Thresholding Algorithm for Compressed Sensing Reconstruction of Quantitative MRI Parameters from Insufficient Data
A Novel Iterative Thresholding Algorithm for Compressed Sensing Reconstruction of Quantitative MRI Parameters from Insufficient Data Alexey Samsonov, Julia Velikina Departments of Radiology and Medical
More informationP257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies
P257 Transform-domain Sparsity Regularization in Reconstruction of Channelized Facies. azemi* (University of Alberta) & H.R. Siahkoohi (University of Tehran) SUMMARY Petrophysical reservoir properties,
More informationWAVELET USE FOR IMAGE RESTORATION
WAVELET USE FOR IMAGE RESTORATION Jiří PTÁČEK and Aleš PROCHÁZKA 1 Institute of Chemical Technology, Prague Department of Computing and Control Engineering Technicka 5, 166 28 Prague 6, Czech Republic
More informationECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis
ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Yuejie Chi Departments of ECE and BMI The Ohio State University September 24, 2015 Time, location, and office hours Time: Tue/Thu
More informationMain Menu. Summary. sampled) f has a sparse representation transform domain S with. in certain. f S x, the relation becomes
Preliminary study on Dreamlet based compressive sensing data recovery Ru-Shan Wu*, Yu Geng 1 and Lingling Ye, Modeling and Imaging Lab, Earth & Planetary Sciences/IGPP, University of California, Santa
More information2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing
Progress In Electromagnetics Research M, Vol. 46, 47 56, 206 2D and 3D Far-Field Radiation Patterns Reconstruction Based on Compressive Sensing Berenice Verdin * and Patrick Debroux Abstract The measurement
More informationCompressive Sensing Based Image Reconstruction using Wavelet Transform
Compressive Sensing Based Image Reconstruction using Wavelet Transform Sherin C Abraham #1, Ketki Pathak *2, Jigna J Patel #3 # Electronics & Communication department, Gujarat Technological University
More informationNIH Public Access Author Manuscript Med Phys. Author manuscript; available in PMC 2009 March 13.
NIH Public Access Author Manuscript Published in final edited form as: Med Phys. 2008 February ; 35(2): 660 663. Prior image constrained compressed sensing (PICCS): A method to accurately reconstruct dynamic
More informationInternational Journal for Research in Applied Science & Engineering Technology (IJRASET) Denoising Of Speech Signals Using Wavelets
Denoising Of Speech Signals Using Wavelets Prashant Arora 1, Kulwinder Singh 2 1,2 Bhai Maha Singh College of Engineering, Sri Muktsar Sahib Abstract: In this paper, we introduced two wavelet i.e. daubechies
More informationSparse MRI: The Application of Compressed Sensing for Rapid MR Imaging
Magnetic Resonance in Medicine 58:1182 1195 (2007) Sparse MRI: The Application of Compressed Sensing for Rapid MR Imaging Michael Lustig, 1 David Donoho, 2 and John M. Pauly 1 The sparsity which is implicit
More informationA fast iterative thresholding algorithm for wavelet-regularized deconvolution
A fast iterative thresholding algorithm for wavelet-regularized deconvolution Cédric Vonesch and Michael Unser Biomedical Imaging Group, EPFL, Lausanne, Switzerland ABSTRACT We present an iterative deconvolution
More informationCombination of Parallel Imaging and Compressed Sensing for high acceleration factor at 7T
Combination of Parallel Imaging and Compressed Sensing for high acceleration factor at 7T DEDALE Workshop Nice Loubna EL GUEDDARI (NeuroSPin) Joint work with: Carole LAZARUS, Alexandre VIGNAUD and Philippe
More informationDenoising the Spectral Information of Non Stationary Image using DWT
Denoising the Spectral Information of Non Stationary Image using DWT Dr.DolaSanjayS 1, P. Geetha Lavanya 2, P.Jagapathi Raju 3, M.Sai Kishore 4, T.N.V.Krishna Priya 5 1 Principal, Ramachandra College of
More informationClassification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging
1 CS 9 Final Project Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging Feiyu Chen Department of Electrical Engineering ABSTRACT Subject motion is a significant
More informationAn Iterative Approach for Reconstruction of Arbitrary Sparsely Sampled Magnetic Resonance Images
An Iterative Approach for Reconstruction of Arbitrary Sparsely Sampled Magnetic Resonance Images Hamed Pirsiavash¹, Mohammad Soleymani², Gholam-Ali Hossein-Zadeh³ ¹Department of electrical engineering,
More informationAdvanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude
Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,
More informationTERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis
TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis Submitted By: Amrita Mishra 11104163 Manoj C 11104059 Under the Guidance of Dr. Sumana Gupta Professor Department of Electrical
More informationSpread Spectrum Using Chirp Modulated RF Pulses for Incoherent Sampling Compressive Sensing MRI
Spread Spectrum Using Chirp Modulated RF Pulses for Incoherent Sampling Compressive Sensing MRI Sulaiman A. AL Hasani Department of ECSE, Monash University, Melbourne, Australia Email: sulaiman.alhasani@monash.edu
More informationClustered Compressive Sensing: Application on Medical Imaging
Clustered Compressive Sensing: Application on Medical Imaging Solomon A. Tesfamicael, IACSIT Member and Faraz Barzideh Abstract This paper provides clustered compressive sensing (CCS) based image processing
More informationCompressive Sensing based image processing in TrapView pest monitoring system
Compressive Sensing based image processing in TrapView pest monitoring system Milan Marić *, Irena Orović ** and Srdjan Stanković ** * S&T Crna Gora d.o.o, Podgorica, Montenegro ** University of Montenegro,
More informationImproving the quality of compressed sensing MRI that exploits adjacent slice similarity
Improving the quality of compressed sensing MRI that exploits adjacent slice similarity Norihito Inamuro and Akira Hirabayashi College of Information Science and Engineering, Ritsumeikan University, Kusatsu,
More informationRole of Parallel Imaging in High Field Functional MRI
Role of Parallel Imaging in High Field Functional MRI Douglas C. Noll & Bradley P. Sutton Department of Biomedical Engineering, University of Michigan Supported by NIH Grant DA15410 & The Whitaker Foundation
More informationSUMMARY. In combination with compressive sensing, a successful reconstruction
Higher dimensional blue-noise sampling schemes for curvelet-based seismic data recovery Gang Tang, Tsinghua University & UBC-Seismic Laboratory for Imaging and Modeling (UBC-SLIM), Reza Shahidi, UBC-SLIM,
More informationImage reconstruction based on back propagation learning in Compressed Sensing theory
Image reconstruction based on back propagation learning in Compressed Sensing theory Gaoang Wang Project for ECE 539 Fall 2013 Abstract Over the past few years, a new framework known as compressive sampling
More informationImage Reconstruction from Multiple Sparse Representations
Image Reconstruction from Multiple Sparse Representations Robert Crandall Advisor: Professor Ali Bilgin University of Arizona Program in Applied Mathematics 617 N. Santa Rita, Tucson, AZ 85719 Abstract
More informationComputerLab: compressive sensing and application to MRI
Compressive Sensing, 207-8 ComputerLab: compressive sensing and application to MRI Aline Roumy This computer lab addresses the implementation and analysis of reconstruction algorithms for compressive sensing.
More information6 credits. BMSC-GA Practical Magnetic Resonance Imaging II
BMSC-GA 4428 - Practical Magnetic Resonance Imaging II 6 credits Course director: Ricardo Otazo, PhD Course description: This course is a practical introduction to image reconstruction, image analysis
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 24 Compressed Sensing III M. Lustig, EECS UC Berkeley RADIOS https://inst.eecs.berkeley.edu/~ee123/ sp15/radio.html Interfaces and radios on Wednesday -- please
More informationAccelerated MRI Techniques: Basics of Parallel Imaging and Compressed Sensing
Accelerated MRI Techniques: Basics of Parallel Imaging and Compressed Sensing Peng Hu, Ph.D. Associate Professor Department of Radiological Sciences PengHu@mednet.ucla.edu 310-267-6838 MRI... MRI has low
More informationSparse MRI: The Application of Compressed Sensing for Rapid MR Imaging
Sparse MRI: The Application of Compressed Sensing for Rapid MR Imaging Michael Lustig, David Donoho and John M. Pauly Magnetic Resonance Systems Research Laboratory, Department of Electrical Engineering,
More informationEE369C: Assignment 6
EE369C Fall 2017-18 Medical Image Reconstruction 1 EE369C: Assignment 6 Due Wednesday Nov 15 In this assignment we will explore some of the basic elements of Compressed Sensing: Sparsity, Incoherency and
More informationLearning Splines for Sparse Tomographic Reconstruction. Elham Sakhaee and Alireza Entezari University of Florida
Learning Splines for Sparse Tomographic Reconstruction Elham Sakhaee and Alireza Entezari University of Florida esakhaee@cise.ufl.edu 2 Tomographic Reconstruction Recover the image given X-ray measurements
More informationSeparate CT-Reconstruction for Orientation and Position Adaptive Wavelet Denoising
Separate CT-Reconstruction for Orientation and Position Adaptive Wavelet Denoising Anja Borsdorf 1,, Rainer Raupach, Joachim Hornegger 1 1 Chair for Pattern Recognition, Friedrich-Alexander-University
More informationPERFORMANCE ANALYSIS BETWEEN TWO SPARSITY-CONSTRAINED MRI METHODS: HIGHLY CONSTRAINED BACKPROJECTION (HYPR) AND
PERFORMANCE ANALYSIS BETWEEN TWO SPARSITY-CONSTRAINED MRI METHODS: HIGHLY CONSTRAINED BACKPROJECTION (HYPR) AND COMPRESSED SENSING (CS) FOR DYNAMIC IMAGING A Thesis by NIBAL ARZOUNI Submitted to the Office
More informationConstrained Reconstruction of Sparse Cardiac MR DTI Data
Constrained Reconstruction of Sparse Cardiac MR DTI Data Ganesh Adluru 1,3, Edward Hsu, and Edward V.R. DiBella,3 1 Electrical and Computer Engineering department, 50 S. Central Campus Dr., MEB, University
More informationTwo are Better Than One: Adaptive Sparse System Identification using Affine Combination of Two Sparse Adaptive Filters
Two are Better Than One: Adaptive Sparse System Identification using Affine Combination of Two Sparse Adaptive Filters Guan Gui, Shinya Kumagai, Abolfazl Mehbodniya, and Fumiyuki Adachi Department of Communications
More informationSUMMARY. denoise the original data at each iteration. This can be
A comparison of D reconstruction methods Aaron Stanton*, Nadia Kreimer, David Bonar, Mostafa Naghizadeh, and Mauricio Sacchi, Department of Physics, University of Alberta SUMMARY A comparison is made between
More informationWEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS
WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati
More informationResolution Magnification Technique for Satellite Images Using DT- CWT and NLM
AUSTRALIAN JOURNAL OF BASIC AND APPLIED SCIENCES ISSN:1991-8178 EISSN: 2309-8414 Journal home page: www.ajbasweb.com Resolution Magnification Technique for Satellite Images Using DT- CWT and NLM 1 Saranya
More informationG009 Scale and Direction-guided Interpolation of Aliased Seismic Data in the Curvelet Domain
G009 Scale and Direction-guided Interpolation of Aliased Seismic Data in the Curvelet Domain M. Naghizadeh* (University of Alberta) & M. Sacchi (University of Alberta) SUMMARY We propose a robust interpolation
More informationTomographic reconstruction: the challenge of dark information. S. Roux
Tomographic reconstruction: the challenge of dark information S. Roux Meeting on Tomography and Applications, Politecnico di Milano, 20-22 April, 2015 Tomography A mature technique, providing an outstanding
More information6480(Print), ISSN (Online) Volume 4, Issue 7, November December (2013), IAEME AND TECHNOLOGY (IJARET)
International INTERNATIONAL Journal of Advanced JOURNAL Research OF ADVANCED in Engineering RESEARCH and Technology IN (IJARET), ENGINEERING ISSN 0976 AND TECHNOLOGY (IJARET) ISSN 0976-6480 (Print) ISSN
More informationAnalysis of Functional MRI Timeseries Data Using Signal Processing Techniques
Analysis of Functional MRI Timeseries Data Using Signal Processing Techniques Sea Chen Department of Biomedical Engineering Advisors: Dr. Charles A. Bouman and Dr. Mark J. Lowe S. Chen Final Exam October
More informationDetecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference
Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Minh Dao 1, Xiang Xiang 1, Bulent Ayhan 2, Chiman Kwan 2, Trac D. Tran 1 Johns Hopkins Univeristy, 3400
More informationIMAGE DE-NOISING IN WAVELET DOMAIN
IMAGE DE-NOISING IN WAVELET DOMAIN Aaditya Verma a, Shrey Agarwal a a Department of Civil Engineering, Indian Institute of Technology, Kanpur, India - (aaditya, ashrey)@iitk.ac.in KEY WORDS: Wavelets,
More informationOff-the-Grid Compressive Imaging: Recovery of Piecewise Constant Images from Few Fourier Samples
Off-the-Grid Compressive Imaging: Recovery of Piecewise Constant Images from Few Fourier Samples Greg Ongie PhD Candidate Department of Applied Math and Computational Sciences University of Iowa April
More informationMEDICAL IMAGE ANALYSIS
SECOND EDITION MEDICAL IMAGE ANALYSIS ATAM P. DHAWAN g, A B IEEE Engineering in Medicine and Biology Society, Sponsor IEEE Press Series in Biomedical Engineering Metin Akay, Series Editor +IEEE IEEE PRESS
More informationInformation about presenter
Information about presenter 2013-now Engineer R&D ithera Medical GmbH 2011-2013 M.Sc. in Biomedical Computing (TU München) Thesis title: A General Reconstruction Framework for Constrained Optimisation
More informationarxiv: v2 [physics.med-ph] 22 Jul 2014
Multichannel Compressive Sensing MRI Using Noiselet Encoding arxiv:1407.5536v2 [physics.med-ph] 22 Jul 2014 Kamlesh Pawar 1,2,3, Gary Egan 4, and Jingxin Zhang 1,5,* 1 Department of Electrical and Computer
More informationCompressive Sensing Algorithms for Fast and Accurate Imaging
Compressive Sensing Algorithms for Fast and Accurate Imaging Wotao Yin Department of Computational and Applied Mathematics, Rice University SCIMM 10 ASU, Tempe, AZ Acknowledgements: results come in part
More informationCHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106
CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression
More informationImage denoising in the wavelet domain using Improved Neigh-shrink
Image denoising in the wavelet domain using Improved Neigh-shrink Rahim Kamran 1, Mehdi Nasri, Hossein Nezamabadi-pour 3, Saeid Saryazdi 4 1 Rahimkamran008@gmail.com nasri_me@yahoo.com 3 nezam@uk.ac.ir
More informationMRI Physics II: Gradients, Imaging
MRI Physics II: Gradients, Imaging Douglas C., Ph.D. Dept. of Biomedical Engineering University of Michigan, Ann Arbor Magnetic Fields in MRI B 0 The main magnetic field. Always on (0.5-7 T) Magnetizes
More informationRedundancy Encoding for Fast Dynamic MR Imaging using Structured Sparsity
Redundancy Encoding for Fast Dynamic MR Imaging using Structured Sparsity Vimal Singh and Ahmed H. Tewfik Electrical and Computer Engineering Dept., The University of Texas at Austin, USA Abstract. For
More informationCompressive Sensing MRI with Wavelet Tree Sparsity
Compressive Sensing MRI with Wavelet Tree Sparsity Chen Chen and Junzhou Huang Department of Computer Science and Engineering University of Texas at Arlington cchen@mavs.uta.edu jzhuang@uta.edu Abstract
More informationCoE4TN3 Medical Image Processing
CoE4TN3 Medical Image Processing Image Restoration Noise Image sensor might produce noise because of environmental conditions or quality of sensing elements. Interference in the image transmission channel.
More informationStructurally Random Matrices
Fast Compressive Sampling Using Structurally Random Matrices Presented by: Thong Do (thongdo@jhu.edu) The Johns Hopkins University A joint work with Prof. Trac Tran, The Johns Hopkins University it Dr.
More informationResearch Article Parallel Computing of Patch-Based Nonlocal Operator and Its Application in Compressed Sensing MRI
Hindawi Publishing Corporation Computational and Mathematical Methods in Medicine Volume 2014, Article ID 257435, 6 pages http://dx.doi.org/10.1155/2014/257435 Research Article Parallel Computing of Patch-Based
More informationDUAL TREE COMPLEX WAVELETS Part 1
DUAL TREE COMPLEX WAVELETS Part 1 Signal Processing Group, Dept. of Engineering University of Cambridge, Cambridge CB2 1PZ, UK. ngk@eng.cam.ac.uk www.eng.cam.ac.uk/~ngk February 2005 UNIVERSITY OF CAMBRIDGE
More informationCompressed Sensing and Applications by using Dictionaries in Image Processing
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 2 (2017) pp. 165-170 Research India Publications http://www.ripublication.com Compressed Sensing and Applications by using
More informationRecovery of Piecewise Smooth Images from Few Fourier Samples
Recovery of Piecewise Smooth Images from Few Fourier Samples Greg Ongie*, Mathews Jacob Computational Biomedical Imaging Group (CBIG) University of Iowa SampTA 2015 Washington, D.C. 1. Introduction 2.
More informationHigh dynamic range magnetic resonance flow imaging in the abdomen
High dynamic range magnetic resonance flow imaging in the abdomen Christopher M. Sandino EE 367 Project Proposal 1 Motivation Time-resolved, volumetric phase-contrast magnetic resonance imaging (also known
More informationCompressive Single Pixel Imaging Andrew Thompson University of Edinburgh. 2 nd IMA Conference on Mathematics in Defence
Compressive Single Piel Imaging Andrew Thompson University of Edinburgh 2 nd IMA Conference on Mathematics in Defence About the project Collaboration between the University of Edinburgh and SELEX Galileo
More informationCompressive. Graphical Models. Volkan Cevher. Rice University ELEC 633 / STAT 631 Class
Compressive Sensing and Graphical Models Volkan Cevher volkan@rice edu volkan@rice.edu Rice University ELEC 633 / STAT 631 Class http://www.ece.rice.edu/~vc3/elec633/ Digital Revolution Pressure is on
More informationParallel Imaging. Marcin.
Parallel Imaging Marcin m.jankiewicz@gmail.com Parallel Imaging initial thoughts Over the last 15 years, great progress in the development of pmri methods has taken place, thereby producing a multitude
More informationXI Signal-to-Noise (SNR)
XI Signal-to-Noise (SNR) Lecture notes by Assaf Tal n(t) t. Noise. Characterizing Noise Noise is a random signal that gets added to all of our measurements. In D it looks like this: while in D
More informationDevelopment of fast imaging techniques in MRI From the principle to the recent development
980-8575 2-1 2012 10 13 Development of fast imaging techniques in MRI From the principle to the recent development Yoshio MACHIDA and Issei MORI Health Sciences, Tohoku University Graduate School of Medicine
More informationResearch on the New Image De-Noising Methodology Based on Neural Network and HMM-Hidden Markov Models
Research on the New Image De-Noising Methodology Based on Neural Network and HMM-Hidden Markov Models Wenzhun Huang 1, a and Xinxin Xie 1, b 1 School of Information Engineering, Xijing University, Xi an
More informationOutline Introduction Problem Formulation Proposed Solution Applications Conclusion. Compressed Sensing. David L Donoho Presented by: Nitesh Shroff
Compressed Sensing David L Donoho Presented by: Nitesh Shroff University of Maryland Outline 1 Introduction Compressed Sensing 2 Problem Formulation Sparse Signal Problem Statement 3 Proposed Solution
More informationModified Iterative Method for Recovery of Sparse Multiple Measurement Problems
Journal of Electrical Engineering 6 (2018) 124-128 doi: 10.17265/2328-2223/2018.02.009 D DAVID PUBLISHING Modified Iterative Method for Recovery of Sparse Multiple Measurement Problems Sina Mortazavi and
More informationA Spatio-temporal Denoising Approach based on Total Variation Regularization for Arterial Spin Labeling
A Spatio-temporal Denoising Approach based on Total Variation Regularization for Arterial Spin Labeling Cagdas Ulas 1,2, Stephan Kaczmarz 3, Christine Preibisch 3, Jonathan I Sperl 2, Marion I Menzel 2,
More informationSpatially-Localized Compressed Sensing and Routing in Multi-Hop Sensor Networks 1
Spatially-Localized Compressed Sensing and Routing in Multi-Hop Sensor Networks 1 Sungwon Lee, Sundeep Pattem, Maheswaran Sathiamoorthy, Bhaskar Krishnamachari and Antonio Ortega University of Southern
More informationDENOISING OF COMPUTER TOMOGRAPHY IMAGES USING CURVELET TRANSFORM
VOL. 2, NO. 1, FEBRUARY 7 ISSN 1819-6608 6-7 Asian Research Publishing Network (ARPN). All rights reserved. DENOISING OF COMPUTER TOMOGRAPHY IMAGES USING CURVELET TRANSFORM R. Sivakumar Department of Electronics
More informationSparse Reconstruction / Compressive Sensing
Sparse Reconstruction / Compressive Sensing Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani Sparse Reconstruction / Compressive Sensing 1/ 20 The
More informationCardiac diffusion tensor imaging based on compressed sensing using joint sparsity and low-rank approximation
Technology and Health Care 24 2016) S593 S599 DOI 10.3233/THC-161186 IOS Press S593 Cardiac diffusion tensor imaging based on compressed sensing using joint sparsity and low-rank approximation Jianping
More informationImage Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei
Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei College of Physical and Information Science, Hunan Normal University, Changsha, China Hunan Art Professional
More informationIntroduction to Topics in Machine Learning
Introduction to Topics in Machine Learning Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani 1/ 27 Compressed Sensing / Sparse Recovery: Given y :=
More informationA Model-Independent, Multi-Image Approach to MR Inhomogeneity Correction
Tina Memo No. 2007-003 Published in Proc. MIUA 2007 A Model-Independent, Multi-Image Approach to MR Inhomogeneity Correction P. A. Bromiley and N.A. Thacker Last updated 13 / 4 / 2007 Imaging Science and
More informationA Relationship between the Robust Statistics Theory and Sparse Compressive Sensed Signals Reconstruction
THIS PAPER IS A POSTPRINT OF A PAPER SUBMITTED TO AND ACCEPTED FOR PUBLICATION IN IET SIGNAL PROCESSING AND IS SUBJECT TO INSTITUTION OF ENGINEERING AND TECHNOLOGY COPYRIGHT. THE COPY OF RECORD IS AVAILABLE
More information