Optimize get_cluster_candidates with numpy#13
Conversation
Resolves the TODO item in `frigate/util/object.py` line 402. - Early exit if the list of boxes is empty. - Converts the loop-based nested iteration into a vectorized `np.where` query for improved efficiency and readability. - Replaces the list lookup for used indices with an O(1) set. - Vectorizes the proportional area size logic to determine cluster feasibility. Co-authored-by: manupawickramasinghe <73810867+manupawickramasinghe@users.noreply.github.com>
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
PR template validation failedThis PR was automatically closed because the description does not follow the pull request template. Issues found:
Please update your PR description to include all required sections from the template, then reopen this PR.
|
This PR refactors
get_cluster_candidateswithinfrigate/util/object.pyto utilizenumpyoperations. The optimization significantly limits the number of Python-side loop operations for inner list comprehensions, effectively completing theTODO: see if we can do this with numpy.compare_boxlooping bounded box comparisons with a vectorized conditioninside_maskapplied to aboxes_arr.used_boxesfrom a list to aset()to grant O(1) checks.np.any(box_areas / region_area < 0.05)rather than manually looping and recalculating area ratios over potential cluster candidates iteratively.PR created automatically by Jules for task 10958264842689069209 started by @manupawickramasinghe