Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)
DOI: 10.1109/cvpr.2000.855849
|View full text |Cite
|
Sign up to set email alerts
|

Robust and efficient skeletal graphs

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 64 publications
(43 citation statements)
references
References 16 publications
0
43
0
Order By: Relevance
“…The graph itself captures the network topology, while the network geometry is encoded by decorating the vertices and edges with geometrical information. The conversion is performed by computing the shock locus of the distance function using the method of [5,8], extended to deal with multiple, multiplyconnected components. The method identifies the shock points by finding out the limiting behaviour of the average outward flux of the distance function as the region enclosing the shock point shrinks to zero.…”
Section: Extraction Methodsmentioning
confidence: 99%
“…The graph itself captures the network topology, while the network geometry is encoded by decorating the vertices and edges with geometrical information. The conversion is performed by computing the shock locus of the distance function using the method of [5,8], extended to deal with multiple, multiplyconnected components. The method identifies the shock points by finding out the limiting behaviour of the average outward flux of the distance function as the region enclosing the shock point shrinks to zero.…”
Section: Extraction Methodsmentioning
confidence: 99%
“…It applies a vector field on the distance function-surface and traces the discontinuities of this vector field. Dimitrov et al [14] added a homotopy preserving thinning algorithm in 2D. In [13] they present the mathematics needed for deriving the singularities, i.e.…”
Section: Hamilton Jacobi Skeletonsmentioning
confidence: 99%
“…The grey prediction model is based on the known data and unknown parameters in the system to establish the concrete model of the system development law [7]. According to the fiber grey value and the characteristics that grey value difference between the background region and the interior of the fiber is relatively large; the grey prediction model is used to extract the strong edge of the fiber edge.…”
Section: A Strong Edge Extractionmentioning
confidence: 99%