Fast circle detection algorithm for markers based on YOLOv4-tiny and completeness ranking
DOI:
Author:
Affiliation:

Clc Number:

TP391. 4;TN98

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Aiming at the low detection efficiency of existing circle detection algorithms in high-resolution marker images, this paper proposes a new type of rapid circle detection algorithm for markers. First, the YOLOv4-tiny algorithm is used to quickly locate the markers in the image to filter out the background interference, and then use the proposed arc completeness sorting method to screen out candidate circles with different completeness from the markers, and finally filter through the distance and direction angle constraints. And fit all the marker circles. This paper conducts experiments based on high-resolution marker images. The experimental results show that this algorithm has extremely fast detection speed. When the detection accuracy is basically unchanged, the detection time of this algorithm is only 11% of the EDcircle algorithm and 5. 0% of the AAMED algorithm. It provides an efficient solution for tasks such as visual positioning and calibration that require rapid positioning of markers.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: March 06,2023
  • Published: