Foreground-Background Segmentation via Probabilistic Fusion

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Real-time separation of foreground layers from background in video sequences is challenging due to errors in segmentation based on motion, color, or contrast alone, and existing methods require computational efficiency for live streaming, which is not adequately met by conventional techniques.

Innovation Solution

A method that probabilistically fuses motion, color, and contrast information to infer foreground and background layers, using a likelihood of motion learned from training data and an optimization algorithm like graph cut for efficient segmentation, eliminating the need for pixel velocities and reducing errors.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If segmentation is based on motion, color, or contrast alone, then the segmentation process is simple, but segmentation errors occur and accuracy is insufficient

Engineering Contradiction:
Improvesegmentation accuracyVSAvoidsegmentation process complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent combines multiple segmentation cues (motion likelihood, color likelihood, and contrast likelihood) into a unified segmentation framework. By merging these different types of information through probabilistic fusion and energy minimization, the system achieves higher segmentation accuracy than any single cue could provide alone, while maintaining computational efficiency through the graph cut optimization algorithm.

Inventive Principle:
Principle #5Merging (Combining)

2Productivity

If conventional segmentation methods are used, then the process is computationally efficient, but real-time live streaming speed is not achieved

Engineering Contradiction:
Improvelive streaming speedVSAvoidsegmentation quality
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent changes the computational parameters and optimization approach to achieve real-time performance. By formulating segmentation as an energy minimization problem with specific energy terms (motion, color, contrast) and using graph cut optimization, the system achieves both high segmentation quality and real-time processing speed, enabling live background substitution applications.

Inventive Principle:
Principle #35Parameter changes

3Measurement precision

If pixel velocities are used for motion estimation, then motion information is obtained, but computational complexity and errors increase

Engineering Contradiction:
Improvemotion information accuracyVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent extracts and uses only the essential motion information (motion likelihood) without computing full pixel velocities. By taking out the critical motion cue and representing it as a likelihood probability rather than precise velocity vectors, the system reduces computational complexity and avoids the errors associated with optical flow estimation while maintaining sufficient motion information for accurate segmentation.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS7676081B2Image segmentation of foreground from background layers
Publication Date: 2010.03.09 MICROSOFT TECHNOLOGY LICENSING LLC
  • US7676081B2 patent drawing
  • US7676081B2 patent drawing
  • US7676081B2 patent drawing

AI summary

Segmentation of foreground from background layers in an image may be provided by a segmentation process which may be based on one or more factors including motion, color, contrast, and the like. Color, motion, and optionally contrast information may be probabilistically fused to infer foreground and/or background layers accurately and efficiently. A likelihood of motion vs. non-motion may be automatically learned from training data and then fused with a contrast-sensitive color model. Segmentation may then be solved efficiently by an optimization algorithm such as a graph cut.