Tek, H.
Akova, F.
Ayvaci, A.
Imaging & Visualization, Siemens Corp. Res. Inc., Princeton, NJ, USA
This paper appears in: Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on Publication Date: 20-25 June 2005
Volume: 2
On page(s):
361
- 368 vol. 2
ISSN: 1063-6919
ISBN: 0-7695-2372-2
Digital Object Identifier: 10.1109/CVPR.2005.300
Current Version Published: 2005-07-25
Abstract
In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region based deformable models. Traditionally, watersheds are computed in the whole image and then some region merging techniques are applied on them to reach the segmentation of structures. We propose that watershed regions can be used as operators in region-based deformable models. These regions are computed only when the deformable models reach them. Then, they are added to (or subtracted from) the deformable models via a measure computed from two terms: (i) statistical fit of regions to the models, region competition; (ii) smoothness of such fits, smoothness constraint. The proposed algorithm is computationally efficient because it operates on regions instead of pixels. In addition, this algorithm allows better boundary localization due to the edge information brought by watersheds. Moreover, the proposed algorithm can handle topological changes, e.g., split or merge, during the evolutions without an additional embedded surface as in the case of level set formulation. Furthermore, structure-based smoothness of segmented objects is obtained by using the smoothness term computed from the alignment of regions. We illustrate the efficiency and accuracy of the proposed technique on several medical data such as MRA and CTA data.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
