| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 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 interest is not sharp. In this case, the gradient based algorithms could obtaine broken edges and the region based approaches could extract too much or too little pixels. In both cases, we cannot find the correct closed contour for the region of interest. The active contour approaches were designed to calculate the boundary directly. Unfortunately, depending on the designing philosophy, a snake is either hard to handle the concave case or very sensitive to noises. In this thesis, a method similar to the active contour approach is developed. The method needs to know the region where the true boundary locates. The computational geometry and graph algorithm are the employed to find a contour that best approximates the true boundary. Many experiments on different medical images were conducted. Most of them demonstrated good results.
|
|---|
