2022
DOI: 10.3390/s22197267
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Circle Detection Algorithm Based on Information Compression

Abstract: Circle detection is a fundamental problem in computer vision. However, conventional circle detection algorithms are usually time-consuming and sensitive to noise. In order to solve these shortcomings, we propose a fast circle detection algorithm based on information compression. First, we introduce the idea of information compression, which compresses the circular information on the image into a small number of points while removing some of the noise through sharpness estimation and orientation filtering. Then… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…The improved CHT-based algorithm [60] has improved in terms of computational accuracy, but it still consumes a lot of memory and is slow in real-time applications. In addition, although other optimized circle detection algorithms have been proposed [61,62], they still cannot solve the constraints between computational accuracy and efficiency better. In practical applications, we note that most circle detection algorithms require high-quality circular targets; particularly, in the presence of noise the circumference of the circle often becomes less clear, which reduces the recognition quality of the algorithm.…”
Section: Template Matching Algorithmmentioning
confidence: 99%
“…The improved CHT-based algorithm [60] has improved in terms of computational accuracy, but it still consumes a lot of memory and is slow in real-time applications. In addition, although other optimized circle detection algorithms have been proposed [61,62], they still cannot solve the constraints between computational accuracy and efficiency better. In practical applications, we note that most circle detection algorithms require high-quality circular targets; particularly, in the presence of noise the circumference of the circle often becomes less clear, which reduces the recognition quality of the algorithm.…”
Section: Template Matching Algorithmmentioning
confidence: 99%
“…These parameters provide a comprehensive description of the circle in three-dimensional space. Ramlee et al use circle detection to detect outliers in their research [29,30], which is similar to our aim to detect burr defects on the circular edge of contact lens.…”
mentioning
confidence: 91%
“…Angle-Aided Circle Detection was proposed to solve the problem of computational complexity and invalid accumulation by dividing the image into sub-regions for sampling edge points. Another method for reducing the amount of calculation was image compression, which was suggested as a method to reduce candidate points [23]. Last but not the least, edge segmentation, which is one of the methods for classifying different types of edges [24], was proposed.…”
Section: Introductionmentioning
confidence: 99%