2005
DOI: 10.1016/j.imavis.2004.06.007
|View full text |Cite
|
Sign up to set email alerts
|

Exact medial axis with euclidean distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
52
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 54 publications
(52 citation statements)
references
References 15 publications
0
52
0
Order By: Relevance
“…Implement a new "exact medial axis" algorithm (Couprie et al 2007, Saúde et al 2006) for creating a 3-D skeleton, based on Remy and Thiel (2005). This will avoid having to choose along which axis a skeletal slice-stack should be constructed, avoid skeletal artifacts such as those arising from folds lying along a slice, increase accuracy and reduce inconsistencies across acquisitions and orientations, and result in much faster processing times.…”
Section: Student Projectmentioning
confidence: 99%
“…Implement a new "exact medial axis" algorithm (Couprie et al 2007, Saúde et al 2006) for creating a 3-D skeleton, based on Remy and Thiel (2005). This will avoid having to choose along which axis a skeletal slice-stack should be constructed, avoid skeletal artifacts such as those arising from folds lying along a slice, increase accuracy and reduce inconsistencies across acquisitions and orientations, and result in much faster processing times.…”
Section: Student Projectmentioning
confidence: 99%
“…There are many algorithms for target symmetry axes extraction, such as the Euclidean distance algorithm (Remy & Thiel, 2005), neural network algorithm (Fukushima & Kikuchi, 2006), minimal inertia algorithm (Gong et al, 2001), etc. Among these, both the Euclidean distance algorithm and neural network algorithm are more applicable to complex images and are more complicated with regard to image processing, while the moment of inertia method has the characteristic of a simple operation.…”
Section: Location Of An Apple's Picking Pointmentioning
confidence: 99%
“…Algorithms to compute both LUT and T (R) are given by Rémy and Thiel in arbitrary dimension for chamfer norms and SED [9,10], with code available in dimensions 2 to 6 in [11]. In recent papers, Normand andÉvenou have proposed a faster method for chamfer norms in 2D and 3D based on a polytope representation of chamfer balls [12,13].…”
Section: Introductionmentioning
confidence: 99%