-
Notifications
You must be signed in to change notification settings - Fork 19
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
Question on Heuristic Routing Strategy #14
Comments
|
I've been exploring the implementation of the heuristic routing strategy within your project and came across a specific operation that piqued my curiosity. Specifically, I noticed that the strategy doesn't directly utilize the first bounding box (IOU score index 0) prediction result for routing decisions. Instead, there seems to be an operation where the initial mask prediction result is modified by subtracting 1000 from it.
Could you please clarify the underlying principle behind this approach? I'm particularly interested in understanding:
The rationale for not using the first BBox prediction result as-is for heuristic routing.
The significance and expected impact of subtracting 1000 from the initial mask prediction result.
I believe understanding this could greatly enhance my comprehension of the heuristic routing strategy's design and its implications on the system's overall performance.
Looking forward to your insights.
Thank you for your time and consideration.
The text was updated successfully, but these errors were encountered: