Greedy Matching Algorithm

[Siavash Sakhavi]

In the greedy matching algorithm, I noticed that the algorithm finds the maximum value of a certain proposal and excludes that proposal for another ground-truth.

Isn't it better to solve a assignment problem instead so that you can get the maximum value of both proposals and have you tried it before? I'm guessing the nature of the "Greedy" is to avoid solving such a problem.

[Jan Hosang]

I have tried more elaborate matching algorithms, but they were too slow, especially for repeatability that was very noticeable.

An alternative could also be just to use the maximum overlap between each GT box and proposals and not exclude anything. This would make results slightly better, but it didn't change the overall trends when I tried. Using matching or not is just another choice during evaluation.

[Siavash Sakhavi]

Thanks for the reply

Actually what caused me to ask the question is that for a method we are
developing, when we don't use the greedy algorithm, the performance is high
but when we fit it to your code, the results are poorer.

After some analysis, I noticed some flaws in the method which can be the
reason of mismatch between our own results and the results from the code.

Thanks again.

On Tue, May 5, 2015 at 2:02 PM, Jan Hosang [e-mail] wrote:

I have tried more elaborate matching algorithms, but they were too slow,
especially for repeatability that was very noticeable.

An alternative could also be just to use the maximum overlap between each
GT box and proposals and not exclude anything. This would make results
slightly better, but it didn't change the overall trends when I tried.
Using matching or not is just another choice during evaluation.

Reply to this email directly or view it on GitHub
#3 (comment)
.

---

Siavash Sakhavi http://www.linkedin.com/in/siavashsakhavi