1. Subvoxel Accurate Graph Search Using Non-Euclidean Graph Space.

    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 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 ...

    Read Full Article

    Login to comment.

  1. Categories

    1. Applications:

      Art, Cardiology, Dentistry, Dermatology, Developmental Biology, Gastroenterology, Gynecology, Microscopy, NDE/NDT, Neurology, Oncology, Ophthalmology, Other Non-Medical, Otolaryngology, Pulmonology, Urology
    2. Business News:

      Acquisition, Clinical Trials, Funding, Other Business News, Partnership, Patents
    3. Technology:

      Broadband Sources, Probes, Tunable Sources
    4. Miscellaneous:

      Jobs & Studentships, Student Theses, Textbooks
  2. Topics Mentioned

  3. Authors