Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001
DOI: 10.1109/cvpr.2001.990511
|View full text |Cite
|
Sign up to set email alerts
|

Model-based curve evolution technique for image segmentation

Abstract: W e propose a model-based curve evolution technique for segmentation of images containing known object types. I n particular, motivated by the work of Leventon, Grimson, and Faugeras [4], we derive a parametric model for a n implicit representation of the segmenting curve by applying principal component analgsis to a collection of signed distance representations of the training data. The parameters of this representution are then calculated to minimize a n objective function for segmentation. W e found the res… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
151
0

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 131 publications
(152 citation statements)
references
References 8 publications
1
151
0
Order By: Relevance
“…Each object in the image can be segmented independently according to its shape prior and image gray level information. This formulation corresponds to previous work [7], [9].…”
Section: Whenmentioning
confidence: 99%
“…Each object in the image can be segmented independently according to its shape prior and image gray level information. This formulation corresponds to previous work [7], [9].…”
Section: Whenmentioning
confidence: 99%
“…Such PCA based representations of level set functions have been successfully applied for the construction of statistical shape priors in [12,21,17]. It should be pointed out that the application of PCA to the embedding function has certain limitations.…”
Section: A Compact Low-dimensional Representationmentioning
confidence: 99%
“…Leventon et al [12] modeled the embedding function by principal component analysis (PCA) of a set of training shapes and added appropriate driving terms to the level set evolution equation. Tsai et al [21] suggested a more efficient formulation, where optimization is performed directly within the subspace of the first few eigenmodes. Rousson et al [17] introduced shape information on the variational level.…”
Section: Introductionmentioning
confidence: 99%
“…Independent of each other, Chan and Vese [3] and Tsai et al [21] proposed level set implementations of the Mumford-Shah functional. The boundary between object and background is represented by the zero-level set of a signed distance function ϕ : Ω → R [15].…”
Section: Introductionmentioning
confidence: 99%