Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Robust tracking algorithm with designed marker for limited-power computer
Loading...
Thumbnail Image

Robust tracking algorithm with designed marker for limited-power computer

Author(s)
Siriteerakul, Teera
Gullayanon, Rutchanee
Date Issued
March 23, 2016
Type
Conference Paper
DOI
10.1109/KST.2016.7440529
Abstract
Object tracking is an important part of many visual systems. The robot navigation task, for example, does not only require a robust and accurate tracking, but also need the tracking module to perform in real-time. This may not be a problem with hi-end robotic system with powerful computing unit. However, in the case of mobile robot where the computing and the battery power are limited, there are only a few tracking methods available. Thus, we propose an algorithm, coupled with a designed marker, for fast and stable tracking. The proposed algorithm utilizes robustness of Hough Circle Transform to detect candidate locations for the marker. Then, all the detected locations are filtered by known properties of the designed marker until we have the correct location. An experiment done on Raspberry PI shows that the marker can be detected robustly with sufficient speed.
Citation
2016 8th International Conference on Knowledge and Smart Technology Kst 2016, 245-248, 2016
Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback