-
## Problem
Cannot-link constraints are currently hard-coded in `OnlineSpeakerClustering`. If a segmentation model over-segments speakers, it may be better to rely on speaker embeddings instead to d…
-
- [x] Binary Search
- [x] Quicksort
- [x] Merge Sort
- [ ] Suffix Array
- [ ] Knuth-Morris-Pratt Algorithm (KMP)
- [ ] Rabin-Karp Algorithm
- [ ] Tries
- [ ] Depth First Traversal of a graph
- […
-
Hi @jamespayor
Thank you very much for making this performance-oriented version of the Hungarian algorithm publicly available. I am interested in writing up a ROS 2 Humble wrapper package to integ…
-
Hi, I found you refer to paper "Tracking Multiple People Online and in Real Time", which use "AL-ICM" method to solve correlation clustering problem, do you have the software which implements "AL-ICM"…
-
When I input :profit_matrix = np.array([[0.47341415,0.50526756,0.5631776 ,0.55596864,0.5414672,0.5414672],
[0.6781792,0.23801588,0.20288624,0.55276686,0.109804,0.109804],
[0.42393875…
-
More than 10x slower than random
-
The auto-label feature works really nice. However, for bigger projects (like a thesis or book) one may want to structure the labels a bit more and e.g. preappend the label for the section. It would be…
-
Hello, thank you for your really interesting work!
We wanted to clarify the evaluation procedure from the paper. Could you indicate if the following interpretation is correct or incorrect? If it is…
-
When I applied it, I found that if the person squatted down or only exposed the upper body, the target could not be effectively tracked.
Is there any quick way to improve it?
-
Hello,
I have a question regarding the optimisation of HOTA for matchings with the Hungarian algorithm.
Aside from MOT performance, I would like to use TrackEval to obtain raw framewise detectio…