Comparative studies on proximal algorithms for 3D MRI reconstruction = 3차원 MRI 영상 복원을 위한 proxy 근접 알고리즘 비교 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 532
  • Download : 0
Compressive sensing (CS) theory has been extensively investigated to reduce MRI scan time and reconstruct high resolution images from down-sampled k-space data by exploiting the sparsity of image in finite difference or transform domain. Recently, many high performance proximal algorithms such as a fast iterative shrinkage-thresholding algorithm (FISTA), alternating direction method of multipliers (ADMM), or a primal-dual algorithm have been considerably studied. However, depending on computing platforms, not only the rate of convergence but also memory usage are very important optimization factors. Hence, the main goal of this study is to perform comparative studies of these algorithms in terms of convergence speed and memory usages in the case of various type penalized 3D CS-MRI experiments including total variation, wavelet transform and patch-based low rank approximation. Our analysis and experimental results showed strength and weakness of each algorithm according to applications.
Advisors
Ye, Jong-Chulresearcher예종철
Description
한국과학기술원 : 바이오및뇌공학과,
Publisher
한국과학기술원
Issue Date
2013
Identifier
566280/325007  / 020114351
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 바이오및뇌공학과, 2013.8, [ v, 43 p. ]

Keywords

proximal algorithm; 자기공명영상; 압축센싱 이론; proxy 근접 알고리즘; primal-dual algorithm; ADMM; CS-MRI; FISTA

URI
http://hdl.handle.net/10203/196304
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=566280&flag=dissertation
Appears in Collection
BiS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0