2006
DOI: 10.1117/12.642167
|View full text |Cite
|
Sign up to set email alerts
|

Real-time detection of elliptic shapes for automated object recognition and object tracking

Abstract: The detection of varying 2D shapes is a recurrent task for Computer Vision applications, and camera based object recognition has become a standard procedure. Due to the discrete nature of digital images and aliasing effects, shape recognition can be complicated. There are many existing algorithms that discuss the identification of circles and ellipses, but they are very often limited in flexibility or speed or require high quality input data. Our work considers the application of shape recognition for processe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 20 publications
0
18
0
Order By: Relevance
“…In [8] different colony segmentation methods have been compared. In [9] complex shape recognition has been addressed for colony detection. In [7] a neural network approach to estimate the number of colonies included in confluent growth segments is proposed.…”
Section: Related Workmentioning
confidence: 99%
“…In [8] different colony segmentation methods have been compared. In [9] complex shape recognition has been addressed for colony detection. In [7] a neural network approach to estimate the number of colonies included in confluent growth segments is proposed.…”
Section: Related Workmentioning
confidence: 99%
“…If s only contains arcs which belong to a common ellipse, then c s must be the inner point of each arc of s. Arcs of s will not belong to a common ellipse if c s is not the inner point of any arc of s. For example, in Fig. 13 (g), e 1 , e 2 , e 3 , and e 4 can be clustered to a set because the set center P 1 is the inner point of e 1 , e 2 , e 3 , and e 4 while e 1 , e 2 , e 3 , e 4 , and e 5 cannot be grouped together since P 2 is not the inner point of e 5 .…”
Section: Clustering Arcsmentioning
confidence: 99%
“…(g) e 1 , e 2 , e 3 , and e 4 can be clustered to a set but e 1 , e 2 , e 3 , e 4 , and e 5 cannot be clustered. The detailed procedures about how to cluster candidate elliptic arcs into groups are shown in Algorithm 3 .…”
Section: Clustering Arcsmentioning
confidence: 99%
See 1 more Smart Citation
“…To facilitate efficient computation, methods such as "Uprite" [21] and "arc finding" [13], [19], [26] have been proposed. Nevertheless, both methods have their individual defects.…”
Section: Introductionmentioning
confidence: 99%