Share Email Print

Proceedings Paper

Adaptive coding using matching pursuit in MRI
Author(s): Yong Man Ro; J. Y. Chung
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 24 June 1998
PDF: 8 pages
Proc. SPIE 3338, Medical Imaging 1998: Image Processing, (24 June 1998); doi: 10.1117/12.310866
Show Author Affiliations
Yong Man Ro, Information and Communication Univ. (South Korea)
J. Y. Chung, Information and Communication Univ. (South Korea)

Published in SPIE Proceedings Vol. 3338:
Medical Imaging 1998: Image Processing
Kenneth M. Hanson, Editor(s)

© SPIE. Terms of Use
Back to Top