2010 3rd International Conference on Computer Science and Information Technology 2010
DOI: 10.1109/iccsit.2010.5564932
|View full text |Cite
|
Sign up to set email alerts
|

Clustering of ellipses based on their distinctiveness: An aid to ellipse detection algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…Ellipse detection can be established using reduced quantization-free parameters space [4] or by analyzing of principal components [5]. Basically, three stable points are needed to fit an ellipse on the object contour [6][7][8]. Meanwhile the accuracy of ellipse detection highly depends on accurate detection of the object contour which is a difficult task in many cases dealing with embryo images.…”
Section: Computer Vision Methodsmentioning
confidence: 99%
“…Ellipse detection can be established using reduced quantization-free parameters space [4] or by analyzing of principal components [5]. Basically, three stable points are needed to fit an ellipse on the object contour [6][7][8]. Meanwhile the accuracy of ellipse detection highly depends on accurate detection of the object contour which is a difficult task in many cases dealing with embryo images.…”
Section: Computer Vision Methodsmentioning
confidence: 99%
“…Thus, after a brief review of existing techniques, a novel method is proposed. There exist various ad hoc methods based on the explicit ellipse parameters (a, b, x c , y c , and ψ) [30,113] or by measuring the distance only at one specific point (e.g., via the Hausdorff distance [132,136]), though none of these are similarity invariants. Moreover, these methods have changing geometric meaning as the two ellipses change shape and relative orientation.…”
Section: Similarity Invariance: D(a I mentioning
confidence: 99%
“…Moreover, Qi et al method [14] is able to consume quite small running time. The reasons behind this are mainly due to its usage of projective invariant for effectively pruning straight edges, fast arc selection strategy, and simple clustering [14], [36]. In contrast to Qi et al method accelerating detection speed at the risk of generating duplicates surrounding a common ground truth, our method employs a more useful and yet relatively more time-consuming hierarchical clustering method for ellipse candidates, which could reduce the false positives significantly.…”
Section: B Experiments On Real-world Datasetsmentioning
confidence: 99%