Adaptive coding using matching pursuit in MRI

Yong Man Ro; J. Y. Chung

doi:10.1117/12.310866

24 June 1998 Adaptive coding using matching pursuit in MRI

Yong Man Ro, J. Y. Chung

Proceedings Volume 3338, Medical Imaging 1998: Image Processing; (1998) https://doi.org/10.1117/12.310866
Event: Medical Imaging '98, 1998, San Diego, CA, United States

Abstract

An adaptive coding is proposed for magnetic resonance (MR) imaging. In this paper, we propose an adaptive coding using the matching pursuit algorithm to the MR imaging. The matching pursuit algorithm is performed with the dictionary consisting windowed Fourier basis set to achieve adaptive coding. Image domain is segmented into several groups. Since the image signal is divided into small scale, the matching pursuit with the segmented signal is more effective than that with whole image domain. Since matching pursuit is a greedy algorithm to find waveforms which are the best match for an object-signal, the signal can be decomposed with a few iterations thereby resulting reduction of imaging time. Computer simulations and experiments are performed to verify the proposed technique.

Citation Download Citation

Yong Man Ro and J. Y. Chung "Adaptive coding using matching pursuit in MRI", Proc. SPIE 3338, Medical Imaging 1998: Image Processing, (24 June 1998); https://doi.org/10.1117/12.310866

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available