Share Email Print

Proceedings Paper

Shortest path refinement For HARP motion tracking
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

Harmonic phase (HARP) motion analysis is widely used in the analysis of tagged magnetic resonance images of the heart. HARP motion tracking can yield gross errors, however, when there is a large amount of motion between successive time frames. Methods that use spatial continuity of motion - so-called refinement methods - have previously been reported to reduce these errors. This paper describes a new refinement method based on shortest-path computations. The method uses a graph representation of the image and seeks an optimal tracking order from a specified seed to each point in the image by solving a single source shortest path problem. This minimizes the potential for path dependent solutions which are found in other refinement methods. Experiments on cardiac motion tracking shows that the proposed method can track the whole tissue more robustly and is also computationally efficient.

Paper Details

Date Published: 27 March 2009
PDF: 9 pages
Proc. SPIE 7259, Medical Imaging 2009: Image Processing, 72590V (27 March 2009); doi: 10.1117/12.812620
Show Author Affiliations
Xiaofeng Liu, Johns Hopkins Univ. (United States)
Ying Bai, Johns Hopkins Univ. (United States)
Jerry L. Prince, Johns Hopkins Univ. (United States)

Published in SPIE Proceedings Vol. 7259:
Medical Imaging 2009: Image Processing
Josien P. W. Pluim; Benoit M. Dawant, Editor(s)

© SPIE. Terms of Use
Back to Top