Markov surfaces: A probabilistic framework for user-assisted three-dimensional image segmentation
Cited 0 times inCited 1 times in
- Markov surfaces: A probabilistic framework for user-assisted three-dimensional image segmentation
- Pan, Yongsheng; Jeong, Won-Ki; Whitaker, Ross
- Issue Date
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- COMPUTER VISION AND IMAGE UNDERSTANDING, v.115, no.10, pp.1375 - 1383
- This paper presents Markov surfaces, a probabilistic algorithm for user-assisted segmentation of elongated structures in 3D images. The 3D segmentation problem is formulated as a path-finding problem, where path probabilities are described by Markov chains. Users define points, curves, or regions on 2D image slices, and the algorithm connects these user-defined features in a way that respects the underlying elongated structure in data. Transition probabilities in the Markov model are derived from intensity matches and interslice correspondences, which are generated from a slice-to-slice registration algorithm. Bezier interpolations between paths are applied to generate smooth surfaces. Subgrid accuracy is achieved by linear interpolations of image intensities and the interslice correspondences. Experimental results on synthetic and real data demonstrate that Markov surfaces can segment regions that are defined by texture, nearby context, and motion. A parallel implementation on a streaming parallel computer architecture, a graphics processor, makes the method interactive for 3D data.
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.