My implimentation of object tracking by miminizing the Eucledean distance between centroids of bounding boxes between consicutive frames.
These are the steps that occ in this object tracking algorithm.
-
Find Bounding boxes using any algorithm.(Here Ill be using basic face haarcascades)
-
Find the centroids of the bounding boxes every frame.
-
Calculate the distance between the centroids of consicutive frames.
-
For every Centroid find the centroid which is closest, and mark it the same id.
What things you need to install the software and how to install them
Give examples
A step by step series of examples that tell you how to get a development env running
Install the Requirements:
pip install -r requirements.txt
Say what the step will be
Give the example
And repeat
until finished
End with an example of getting some data out of the system or using it for a little demo
Explain how to run the automated tests for this system
Explain what these tests test and why
Give an example
Explain what these tests test and why
Give an example
Add additional notes about how to deploy this on a live system
Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests.
We use SemVer for versioning. For the versions available, see the tags on this repository.
- Atharva Gundawar - Initial work - Github handle
See also the list of contributors who participated in this project.
This project is licensed under the MIT License - see the LICENSE.md file for details
- Hat tip to anyone whose code was used
- Inspiration
- etc