Anchor-Free Target Detection via Probability Update
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current target detection methods in computer vision require prior knowledge of targets and generate numerous invalid anchor boxes, wasting resources and struggling with dense target detection due to the need for preset anchor boxes and direct removal of potential target points with high probability values.
Innovation Solution
A target detection method that determines detection points and probability values within an image using a trained target network model, updates probability values based on distance thresholds, and compares these values to detect targets without preset anchor boxes, effectively handling dense target scenarios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If preset anchor boxes are used for target detection, then detection coverage is improved, but computational waste increases due to numerous invalid anchor boxes
Solution Approach 1:
The patent extracts and removes the problematic preset anchor box mechanism from the detection system. Instead of using predetermined anchor boxes that generate many invalid candidates, the invention directly identifies potential target regions through detection points and probability values, eliminating the computational overhead of processing numerous invalid anchor boxes while maintaining detection coverage.
Solution Approach 2:
The patent changes the fundamental parameters of the detection approach by shifting from a fixed anchor box framework to a dynamic probability-based detection point system. This parameter change allows the system to adapt to different target densities and distributions without being constrained by predetermined box sizes and positions, thereby reducing computational waste while preserving detection effectiveness.
2Productivity
If direct removal of potential target points with high probability values is used, then processing speed is improved, but detection accuracy deteriorates in dense target scenarios
Solution Approach 1:
The patent introduces dynamics into the detection process by implementing an iterative probability update mechanism. Instead of statically removing high-probability points, the system dynamically adjusts probability values based on distance thresholds and iterative refinement, allowing it to adapt to dense target scenarios where targets may be closely spaced. This dynamic approach maintains processing speed while improving detection accuracy in challenging scenarios.
Solution Approach 2:
The patent incorporates feedback mechanisms through iterative probability updates. Detection points that initially appear to be false positives can have their probabilities re-evaluated in subsequent iterations based on their spatial relationships with other detected targets. This feedback loop ensures that valid targets in dense scenarios are not incorrectly discarded, thereby maintaining detection accuracy while preserving processing efficiency.
3Measurement precision
If probability values are updated based on distance thresholds, then detection accuracy for dense targets is improved, but computational complexity increases
Solution Approach 1:
The patent segments the computational process into distinct stages: initial detection point identification, probability calculation, distance threshold evaluation, and iterative refinement. By dividing the complex task of dense target detection into these manageable segments, the system can apply optimization at each stage, reducing overall computational complexity while maintaining high detection accuracy through systematic probability updates.
Data Source
AI summary
A target detection method includes: determining detection points corresponding to regions in an image to be detected and a probability value of a target in a region corresponding to each detection point according to the image to be detected; screening out a first detection point having a maximum probability value, and second detection point(s) having probability value(s) less than the probability value of the first detection point and greater than or equal to a probability threshold; if a first distance between each second detection point and the first detection point is greater than or equal to a distance threshold, updating an original probability value of the second detection point to obtain an updated probability value; comparing the updated probability value with the probability threshold to obtain a comparison result; and determining whether a new target in a region corresponding to the second detection point according to the comparison result.


