-
Notifications
You must be signed in to change notification settings - Fork 73
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
Multiple bounding box regressor to avoid id switch #86
Comments
incase google drive link is not accessible here is github link for video |
Hi, thanks for your attention. It's quite a good question since the occlusion and similar objects are the two main obstacles of MixFormer. If you want to regress multiple bounding boxes, there is a simple solution: substituting the corner head with center-based head or query-based head. So that you can obtains multiple objects bounding boxes with high confidence score. |
The mentioned query-based head is like DETR, which predict a bounding box and a confidence score. But you should re-train the model in tracking dataset or your own dataset. |
Thank you for sharing key insight on implementing the bbox-regressor i will try to implement it and if i can get reasonable results would like to create a pull request. |
Hello i am continuing on your work by crating an ensemble of MixFormer and conventional kalman filter to handle cases like
currently i am using only one EKF instance which tracks the object and mixformer's output is considered as model update which in turn predicts error/jump for tracked object.
This process is giving some reliable results but is prune to large error.
One way around is to maintain multiple track-lets for all objects which match the template in given search space thus we can match the tracklet of out selected object with EKF's prediction.
So is there any way to regress multiple bounding boxes for given template as we also have the option to have multiple templates. i.e get bounding box for all objects which match with the given template.
this video shows the said problem
The text was updated successfully, but these errors were encountered: