Image Series Segmentation and Improved MC Algorithm
A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the...
Saved in:
Published in | Shanghai jiao tong da xue xue bao Vol. 13; no. 1; pp. 102 - 106 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Heidelberg
Shanghai Jiaotong University Press
01.02.2008
Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Shanghai 200030, China |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by ,experimental results. |
---|---|
Bibliography: | 31-1943/U image series; active contour; image segmentation; isosuface; marching cubes image series image segmentation active contour TP391 marching cubes isosuface ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1007-1172 1995-8188 |
DOI: | 10.1007/s12204-008-0102-z |