Medical Image Segmentation using Shortest Path algorithm
碩士 === 國立交通大學 === 資訊科學系 === 91 === Image segmentation is to separate the desired region of interest from an image. We then need to calculate a closed contour to enclose the region of interest. Many of the segmentation algorithm cannot work well when the boundary of the region of the inter...
Main Authors: | Shih-Hsien Yang, 楊士賢 |
---|---|
Other Authors: | Yu-Tai Ching |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/78942177550789249333 |
Similar Items
-
Shortest paths calculations, and applications to medical imaging
by: Péchaud, Mickaël
Published: (2009) -
Shortest-Time Path Algorithm Based on Ant Colony Algorithm and Intersection Delay
by: Yu-Hsien Yang, et al.
Published: (2013) -
Fast algorithms for shortest paths
by: Moffat, Alistair
Published: (2013) -
An investigation of shortest paths algorithms
by: Tabatabai, Bijan Oni
Published: (1987) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01)