Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Model complexity #1240

Closed
1 task done
wsw321 opened this issue Jan 8, 2024 · 2 comments
Closed
1 task done

Model complexity #1240

wsw321 opened this issue Jan 8, 2024 · 2 comments
Labels
question Further information is requested Stale

Comments

@wsw321
Copy link

wsw321 commented Jan 8, 2024

Search before asking

  • I have searched the Yolo Tracking issues and found no similar bug report.

Question

May I ask how to calculate the complexity of the tracking algorithm? In addition to calculating the parameters of the detection model and feature extraction model, do we need to calculate anything else?

@wsw321 wsw321 added the question Further information is requested label Jan 8, 2024
@mikel-brostrom
Copy link
Owner

mikel-brostrom commented Jan 8, 2024

This has no easy answers. But let's try to brake this down. The tracking algorithm consists of basically four parts: appearance description extraction, camera motion compensation, kalman filter updates and multi-step association.

  • The appearance description extraction part is tricky as the complexity of the models do not scale linearly with the input pixels. The complexity of a CNN is more nuanced and depends on several factors: stride, pooling, convolutional layers, their kernels... There is not easy way of calculating this without looking very deep into the specific architecture.

  • The Big O notation for camera motion compensation can vary widely depending on the specific algorithm. Methods based on optical flow are slower than feature-based methods

  • The Kalman Filter complexity primarily depends on the state and observation vector.

  • The association part is solved by the Hungarian Algorithm. Each association subproblem (high confidence, low confidence for example) is solved using the Hungarian algorithm.

Copy link

👋 Hello, this issue has been automatically marked as stale because it has not had recent activity. Please note it will be closed if no further activity occurs.
Feel free to inform us of any other issues you discover or feature requests that come to mind in the future. Pull Requests (PRs) are also always welcomed!

@github-actions github-actions bot added the Stale label Jan 19, 2024
@github-actions github-actions bot closed this as not planned Won't fix, can't repro, duplicate, stale Jan 22, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
question Further information is requested Stale
Projects
None yet
Development

No branches or pull requests

2 participants