2007 International Conference on Machine Vision 2007
DOI: 10.1109/icmv.2007.4469287
|View full text |Cite
|
Sign up to set email alerts
|

Procrustes — based shape prior for parametric active contours

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2008
2008
2014
2014

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…One such example, [9] makes use of "landmark-based" shape analysis [7] to impose a shape prior based on the statistics of similarityinvariant point sets. Recent advancements in the modeling of shapes as continuous curves, given by elastic shape analysis, e.g.…”
Section: Past Work On Prior-driven Active Contoursmentioning
confidence: 99%
“…One such example, [9] makes use of "landmark-based" shape analysis [7] to impose a shape prior based on the statistics of similarityinvariant point sets. Recent advancements in the modeling of shapes as continuous curves, given by elastic shape analysis, e.g.…”
Section: Past Work On Prior-driven Active Contoursmentioning
confidence: 99%
“…The base shape s 0 is the mean shape and the vectors s i are the m eigenvectors corresponding to the m largest eigenvalues. Before applying PCA we can normalize the meshes using a Procrustes analysis [16] to remove variation due to a chosen global shape normalising transformation. Therefore the resulting PCA is only concerned with local, non-rigid shape deformation.…”
Section: Constrained Local Modelsmentioning
confidence: 99%
“…Charmi et al [5] have proposed a shape energy term according to distance between Fourier descriptors of evolving contour and a reference template. In our method [6], shape knowledge was introduced through a similarity measurement between evolving contour and Procrustes mean shape of desired object. This similarity is measured by full Procrustes distance between these two contours that is invariant with respect to similarity transformations (translation, scaling, and rotation) and is added to traditional energy function of snakes as an extra shape energy term.…”
Section: Introductionmentioning
confidence: 99%
“…The final contour in the current frame or a prediction by Kalman filtering will be chosen as initial contour for the next frame and will be fitted the boundary of desired object by minimizing the energy function of directional Procrustes snake. The minimizing process is done by greedy algorithm [6]. Greedy is a suboptimum and fast algorithm for minimizing the energy function of snakes.…”
Section: Introductionmentioning
confidence: 99%