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

Implement functionality for the segmentation-free paradigm #2

Open
sfikas opened this issue Sep 3, 2016 · 0 comments
Open

Implement functionality for the segmentation-free paradigm #2

sfikas opened this issue Sep 3, 2016 · 0 comments

Comments

@sfikas
Copy link
Owner

sfikas commented Sep 3, 2016

Related issues

  1. what happens if a detector returns 0 hits for a query ? p at X should be 0 -- we need to 'punish' this detector since it evidently failed .
  • what if a detector returns a set of bboxes B, where a subset S of B contains bboxes that correspond to hits for a single query ? Solution: Only one of the bboxes in S should count as a hit.
  • The reason is that if we count more than one bbox in S as a hit, (1) the effectiveness of this detector appears to be boosted (when it really isn't) (2) we open the possibility for a detector to cheat, just by submitting a S with large |S|.
  • we should keep only the 'best' hit in S, in some well-defined sense.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant