1995
DOI: 10.1109/34.387505
|View full text |Cite
|
Sign up to set email alerts
|

Digitized circular arcs: characterization and parameter estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

1996
1996
2014
2014

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 47 publications
(21 citation statements)
references
References 32 publications
0
21
0
Order By: Relevance
“…[15], and errors occur if the window size is not locally adequate. Moreover, the accuracy of previously reported methods is not uniformly satisfactory [14][15][16]. We devised a multiplewindow curve fitting algorithm for digital curvature estimation leading to very accurate results and robust to signal variations and noise.…”
Section: Multiple-scale Fibre-level Features Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…[15], and errors occur if the window size is not locally adequate. Moreover, the accuracy of previously reported methods is not uniformly satisfactory [14][15][16]. We devised a multiplewindow curve fitting algorithm for digital curvature estimation leading to very accurate results and robust to signal variations and noise.…”
Section: Multiple-scale Fibre-level Features Extractionmentioning
confidence: 99%
“…Recent results indicate that the number of inflection points (at which the sign of the curvature changes) and curvature along the fibre or vessel are relevant tortuosity definitions [13], hence we include them in our dictionary of features. Accurate curvature estimation from samples is a well-known tricky task [14][15][16]. Two main issues are window size selection and accuracy.…”
Section: Multiple-scale Fibre-level Features Extractionmentioning
confidence: 99%
“…In the space that is dual to the parameters space, a plane separating two sets of n 3D points is searched using tools coming from computational geometry [22]. In [18,9,14,27,23] a 2D point belonging to the intersection of n 2 half-planes is searched in the original plane using either brute-force algorithms [9,14,27] or tools coming from computational geometry [18,23].…”
Section: Discussion and Perspectivesmentioning
confidence: 99%
“…On the other side, the digital circles and the digital circular arcs are on of the basic objects considered in image processing and shape analys. For more results we refer to [4].…”
Section: How Efficiently An Original Circle Can Be Reconstructed Frommentioning
confidence: 99%