Subvoxel accurate graph search using non-Euclidean graph space

Graph search is attractive for the quantitative analysis of volumetric medical images, and especially for layered tissues, because it allows globally optimal solutions in low-order polynomial time. However, because nodes of graphs typically encode evenly distributed voxels of the volume with arcs co...

Full description

Saved in:
Bibliographic Details
Published inPloS one Vol. 9; no. 10; p. e107763
Main Authors Abràmoff, Michael D, Wu, Xiaodong, Lee, Kyungmoo, Tang, Li
Format Journal Article
LanguageEnglish
Published United States Public Library of Science 14.10.2014
Public Library of Science (PLoS)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Graph search is attractive for the quantitative analysis of volumetric medical images, and especially for layered tissues, because it allows globally optimal solutions in low-order polynomial time. However, because nodes of graphs typically encode evenly distributed voxels of the volume with arcs connecting orthogonally sampled voxels in Euclidean space, segmentation cannot achieve greater precision than a single unit, i.e. the distance between two adjoining nodes, and partial volume effects are ignored. We generalize the graph to non-Euclidean space by allowing non-equidistant spacing between nodes, so that subvoxel accurate segmentation is achievable. Because the number of nodes and edges in the graph remains the same, running time and memory use are similar, while all the advantages of graph search, including global optimality and computational efficiency, are retained. A deformation field calculated from the volume data adaptively changes regional node density so that node density varies with the inverse of the expected cost. We validated our approach using optical coherence tomography (OCT) images of the retina and 3-D MR of the arterial wall, and achieved statistically significant increased accuracy. Our approach allows improved accuracy in volume data acquired with the same hardware, and also, preserved accuracy with lower resolution, more cost-effective, image acquisition equipment. The method is not limited to any specific imaging modality and readily extensible to higher dimensions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Competing Interests: The authors of this manuscript have the following competing interests: Patent application for some of the authors assigned to the University of Iowa from which the authors may benefit (see statement below); Research Grants from NIH, Research to Prevent Blindness, PI Abramoff; American Diabetes Association travel grant to Abramoff; SPIE travel grant to Abramoff; Membership of the American Academy of Ophthalmology (Abramoff); Membership of the Macula Society (Abramoff); and Membership of ARVO (Abramoff, Tang). The patent application is as follows: U.S. Provisional Patent Application Serial No. 61/968,713, filed March 21, 2014. Title: Graph Search Using Non-Euclidean Deformed Graph. Inventors: Abramoff, Tang, and Wu. Filed by and assigned to the University of Iowa, Iowa City, Iowa. The inventors are all employed by the University of Iowa. There are no products or products in development associated with this patent application, nor consultancy. All authors confirm their adherence to all PLOS ONE policies on sharing data and materials, as detailed online in the guide for authors.
Conceived and designed the experiments: MDA. Performed the experiments: LT KL. Analyzed the data: MDA LT XW. Contributed reagents/materials/analysis tools: MDA KL. Wrote the paper: MDA LT.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0107763