Shortest path refinement for HARP motion tracking

Xiaofeng Liu, Ying Bai, Jerry L. Prince

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationMedical Imaging 2009 - Image Processing
DOIs
StatePublished - Dec 15 2009
EventMedical Imaging 2009 - Image Processing - Lake Buena Vista, FL, United States
Duration: Feb 8 2009Feb 10 2009

Publication series

NameProgress in Biomedical Optics and Imaging - Proceedings of SPIE
Volume7259
ISSN (Print)1605-7422

Other

OtherMedical Imaging 2009 - Image Processing
Country/TerritoryUnited States
CityLake Buena Vista, FL
Period2/8/092/10/09

Keywords

  • Dijkstra's algorithm
  • HARP
  • Motion tracking
  • Refinement
  • Single source shortest path problem

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Atomic and Molecular Physics, and Optics
  • Biomaterials
  • Radiology Nuclear Medicine and imaging

Fingerprint

Dive into the research topics of 'Shortest path refinement for HARP motion tracking'. Together they form a unique fingerprint.

Cite this