Probabilistic Object Detection via Greedy Inference

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing object detection methods rely on heuristic assumptions, leading to false positives and false negatives due to their inability to adapt to varying situations, and often require human intervention to adjust parameters.

Innovation Solution

An object detection system that uses a probabilistic framework to determine object locations by deriving a probabilistic model based on voting elements, employing a greedy algorithm to maximize the joint probability of hypotheses, and incorporating a penalty factor to discourage false positives, thereby eliminating the need for heuristic assumptions and human intervention.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If heuristic assumptions are used to simplify object detection, then the detection process becomes more manageable, but false positives and false negatives increase and adaptability to different situations decreases

Engineering Contradiction:
Improvedetection process complexityVSAvoiddetection accuracy
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent replaces heuristic assumptions with a probabilistic graphical model that uses probability theory and statistical inference. Instead of relying on manual heuristic rules, the system models object detection as a probabilistic inference problem where voting elements from multiple detectors are combined through a graphical model to produce reliable detection results, thereby eliminating the need for hand-crafted heuristics while improving accuracy and adaptability.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent transforms the detection process by changing from fixed heuristic parameters to probabilistic parameters that can be dynamically adjusted. The graphical model allows detection thresholds and confidence levels to be derived from probability distributions, enabling the system to adapt to different situations by adjusting probabilistic parameters rather than relying on static heuristic assumptions.

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If heuristic assumptions are used in object detection, then the detection process can be simplified, but the system fails to adapt to different types of situations

Engineering Contradiction:
Improvedetection method complexityVSAvoidadaptability to different situations
Core Design Contradiction:
Device complexityVSAdaptability or versatility

Solution Approach 1:

The probabilistic graphical model serves as a universal framework that can accommodate multiple types of detectors and object categories. The model structure remains the same regardless of the specific application, allowing the system to adapt to different situations by changing the input voting elements and model parameters rather than requiring different heuristic assumptions for each case.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The system transitions from static heuristic assumptions to dynamic probabilistic reasoning. The graphical model allows detection results to be updated as new evidence becomes available, and the probabilistic nature enables the system to adapt its confidence levels and detection thresholds based on the specific characteristics of each detection scenario.

Inventive Principle:
Principle #15Dynamics

3Productivity

If existing object detection methods are used, then detection can be performed quickly, but human intervention is required to adjust parameters and reduce false positives

Engineering Contradiction:
Improvedetection speedVSAvoidhuman intervention requirement
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The probabilistic graphical model enables the detection system to automatically adjust its parameters and optimize performance without human intervention. The model derives detection thresholds and confidence levels from the probabilistic relationships between voting elements, allowing the system to self-tune and adapt to different scenarios automatically, eliminating the need for manual parameter adjustment while maintaining high detection speed.

Inventive Principle:
Principle #25Self-service

4Device complexity

If heuristic assumptions are made about objects and background, then detection can be simplified, but false positives become unavoidable

Engineering Contradiction:
Improvedetection method complexityVSAvoidfalse positives
Core Design Contradiction:
Device complexityVSObject-generated harmful factors

Solution Approach 1:

The patent replaces heuristic assumptions with a probabilistic graphical model that uses probability theory to combine evidence from multiple detectors. This substitution eliminates the need for hand-crafted heuristics that cause false positives, as the model naturally handles uncertainty and combines multiple sources of evidence through probabilistic inference, thereby reducing false positives while maintaining computational efficiency.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS8953888B2Detecting and localizing multiple objects in images using probabilistic inference
Publication Date: 2015.02.10 MICROSOFT TECHNOLOGY LICENSING LLC
  • US8953888B2 patent drawing
  • US8953888B2 patent drawing
  • US8953888B2 patent drawing

AI summary

An object detection system is disclosed herein. The object detection system allows detection of one or more objects of interest using a probabilistic model. The probabilistic model may include voting elements usable to determine which hypotheses for locations of objects are probabilistically valid. The object detection system may apply an optimization algorithm such as a simple greedy algorithm to find hypotheses that optimize or maximize a posterior probability or log-posterior of the probabilistic model or a hypothesis receiving a maximal probabilistic vote from the voting elements in a respective iteration of the algorithm. Locations of detected objects may then be ascertained based on the found hypotheses.