Translator Disclaimer
27 March 2009 Shortest path refinement For HARP motion tracking
Author Affiliations +
Proceedings Volume 7259, Medical Imaging 2009: Image Processing; 72590V (2009) https://doi.org/10.1117/12.812620
Event: SPIE Medical Imaging, 2009, Lake Buena Vista (Orlando Area), Florida, United States
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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaofeng Liu, Ying Bai, and Jerry L. Prince "Shortest path refinement For HARP motion tracking", Proc. SPIE 7259, Medical Imaging 2009: Image Processing, 72590V (27 March 2009); https://doi.org/10.1117/12.812620
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top