Shortest path refinement for motion estimation from tagged MR images

Xiaofeng Liu, Jerry Ladd Prince

Research output: Contribution to journalArticle

Abstract

Magnetic resonance tagging makes it possible to measure the motion of tissues such as muscles in the heart and tongue. The harmonic phase (HARP) method largely automates the process of tracking points within tagged MR images, permitting many motion properties to be computed. However, HARP tracking can yield erroneous motion estimates due to 1) large deformations between image frames, 2) through-plane motion, and 3) tissue boundaries. Methods that incorporate the spatial continuity of motionso-called refinement or flood-filling methodshave previously been reported to reduce tracking errors. This paper presents 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 errors for those path dependent solutions that are found in other refinement methods. In addition to this, tracking in the presence of through-plane motion is improved by introducing synthetic tags at the reference time (when the tissue is not deformed). Experimental results on both tongue and cardiac images show that the proposed method can track the whole tissue more robustly and is also computationally efficient.

Original languageEnglish (US)
Article number5432997
Pages (from-to)1560-1572
Number of pages13
JournalIEEE Transactions on Medical Imaging
Volume29
Issue number8
DOIs
StatePublished - Aug 2010

Fingerprint

Motion estimation
Tissue
Tongue
Magnetic resonance
Seed
Muscle
Seeds
Myocardium
Magnetic Resonance Spectroscopy

Keywords

  • Dijkstra's algorithm
  • harmonic phase (HARP)
  • magnetic resonance (MR) tagging
  • motion tracking
  • shortest path

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Radiological and Ultrasound Technology
  • Software

Cite this

Shortest path refinement for motion estimation from tagged MR images. / Liu, Xiaofeng; Prince, Jerry Ladd.

In: IEEE Transactions on Medical Imaging, Vol. 29, No. 8, 5432997, 08.2010, p. 1560-1572.

Research output: Contribution to journalArticle

@article{a830919ed46b44678d3b0a0e6e8000d4,
title = "Shortest path refinement for motion estimation from tagged MR images",
abstract = "Magnetic resonance tagging makes it possible to measure the motion of tissues such as muscles in the heart and tongue. The harmonic phase (HARP) method largely automates the process of tracking points within tagged MR images, permitting many motion properties to be computed. However, HARP tracking can yield erroneous motion estimates due to 1) large deformations between image frames, 2) through-plane motion, and 3) tissue boundaries. Methods that incorporate the spatial continuity of motionso-called refinement or flood-filling methodshave previously been reported to reduce tracking errors. This paper presents 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 errors for those path dependent solutions that are found in other refinement methods. In addition to this, tracking in the presence of through-plane motion is improved by introducing synthetic tags at the reference time (when the tissue is not deformed). Experimental results on both tongue and cardiac images show that the proposed method can track the whole tissue more robustly and is also computationally efficient.",
keywords = "Dijkstra's algorithm, harmonic phase (HARP), magnetic resonance (MR) tagging, motion tracking, shortest path",
author = "Xiaofeng Liu and Prince, {Jerry Ladd}",
year = "2010",
month = "8",
doi = "10.1109/TMI.2010.2045509",
language = "English (US)",
volume = "29",
pages = "1560--1572",
journal = "IEEE Transactions on Medical Imaging",
issn = "0278-0062",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Shortest path refinement for motion estimation from tagged MR images

AU - Liu, Xiaofeng

AU - Prince, Jerry Ladd

PY - 2010/8

Y1 - 2010/8

N2 - Magnetic resonance tagging makes it possible to measure the motion of tissues such as muscles in the heart and tongue. The harmonic phase (HARP) method largely automates the process of tracking points within tagged MR images, permitting many motion properties to be computed. However, HARP tracking can yield erroneous motion estimates due to 1) large deformations between image frames, 2) through-plane motion, and 3) tissue boundaries. Methods that incorporate the spatial continuity of motionso-called refinement or flood-filling methodshave previously been reported to reduce tracking errors. This paper presents 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 errors for those path dependent solutions that are found in other refinement methods. In addition to this, tracking in the presence of through-plane motion is improved by introducing synthetic tags at the reference time (when the tissue is not deformed). Experimental results on both tongue and cardiac images show that the proposed method can track the whole tissue more robustly and is also computationally efficient.

AB - Magnetic resonance tagging makes it possible to measure the motion of tissues such as muscles in the heart and tongue. The harmonic phase (HARP) method largely automates the process of tracking points within tagged MR images, permitting many motion properties to be computed. However, HARP tracking can yield erroneous motion estimates due to 1) large deformations between image frames, 2) through-plane motion, and 3) tissue boundaries. Methods that incorporate the spatial continuity of motionso-called refinement or flood-filling methodshave previously been reported to reduce tracking errors. This paper presents 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 errors for those path dependent solutions that are found in other refinement methods. In addition to this, tracking in the presence of through-plane motion is improved by introducing synthetic tags at the reference time (when the tissue is not deformed). Experimental results on both tongue and cardiac images show that the proposed method can track the whole tissue more robustly and is also computationally efficient.

KW - Dijkstra's algorithm

KW - harmonic phase (HARP)

KW - magnetic resonance (MR) tagging

KW - motion tracking

KW - shortest path

UR - http://www.scopus.com/inward/record.url?scp=77955326780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955326780&partnerID=8YFLogxK

U2 - 10.1109/TMI.2010.2045509

DO - 10.1109/TMI.2010.2045509

M3 - Article

C2 - 20304720

AN - SCOPUS:77955326780

VL - 29

SP - 1560

EP - 1572

JO - IEEE Transactions on Medical Imaging

JF - IEEE Transactions on Medical Imaging

SN - 0278-0062

IS - 8

M1 - 5432997

ER -