Closed satwikkottur closed 9 years ago
BTW, caffe
has this link for SelSearch in python - https://github.com/sergeyk/selective_search_ijcv_with_python
Background based occupancy filtering implemented. Check candidates/CandidatesSizeMapDemo.m for details.
Thanks! I'll try all 3 once we figure out the deployment
Writing candidates to DB is revised and works with commit 2d60cb4fa6458c5541f85b91c490e80241605df9.
Function filterCandidatesBackground.m
was moved to CandidatesBase
from CandidatesSizemap
, and now is used in all algorithms.
SelSearch produces terrible candidates as of now. It's clear even without evaluation.
Can you please document the database structure here? It keeps changing causing confusion and inconsistencies.
Sure, sorry for the confusion.
How about I put it to the README.md
and will keep it updated?
No worries :)
Both candidate types capture around half of the patches (very approximate, just by looking at them). Looks like we need to come up with some better combined method.
Even the background based method is not able to give reasonable candidates ?
Secondly, did you finish correcting DatabaseWriter ? Or is it still left to be corrected ?
If yes, I will try to access background video and save background filtered candidates.
Even the background based method is not able to give reasonable candidates ?
Nope, The Sel-Serach ones tend to take only a part of car in to a candidate, or a much bigger patch
Secondly, did you finish correcting DatabaseWriter ? Or is it still left to be corrected ? If yes, I will try to access background video and save background filtered candidates.
Everything is done in respect to DatabaseWriter
. That is, the background filter works fine. The sizemap
-based candidates are not flexible enough to adjust to variations of sizes and positions. And if you did adjust, there would be so many of them.
What exactly do you mean by adjust to variations in size and position ? Isn't the sizemap an inherent want to link position and size ?
Perhaps, we wouldn't be doing a great job with respect to buses, trucks, etc. but the average traffic of cars might still be better compared to SelectiveSearch. Your views ?
On the second look at sizemap
results I see it a little better, but recall is totally not 100%.
Right now I feel the problems with sizemap
algorithm is that 1) it gives bigger boxes usually, 2) some cars look displaced to the lane map, 3) on the image border it's difficult
It's easier to show I think. Commit 197c89f9c7bce07dd2b6d61f852380365f983ef2 brings file src/learning/examples/EvaluateDetections.py
. If you run it as is, you will see candidates (red) and ground truth (blue).
I also realized I made a mistake and didnt commit src/candidates/DatabaseWriterDemo.m
and src/io/DatabaseWriter.m
before. That's why you asked about them in your comment, and I couldn't understand:) They are committed too now.
Yo, selective search kind of candidates are inherently present in Faster-RCNN. For this reason, probably further work in this area should probably be done inside Faster-RCNN package. @satwikkottur, what do you think?
Makes sense. Selective search is definitely the best way to go in our scenario. Might have to pursue this direction. Quite interesting actually.
Closing this issue as candidates are a part of Faster-RCNN
Selecting candidates is an important step in converting the task of detection into classification.
Following are tried:
Resources