Shortest path refinement for motion estimation from tagged MR images.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 20304720.
- Also identified by DOI 10.1109/TMI.2010.2045509 and PMC identifier 3766638.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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 motion--so-called refinement or flood-filling methods--have 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.
Medical subject headings
- Algorithms
- Image Processing, Computer-Assisted
- Magnetic Resonance Imaging
- Signal Processing, Computer-Assisted