Graph-Based Image Tag Propagation via Markov Random Field

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Manual image annotation is time-consuming, and existing automatic approaches are not always reliable due to the semantic gap between low-level visual features and high-level semantic concepts, making it difficult to organize large collections of images effectively.

Innovation Solution

A graph-based framework that exploits visual similarity between images and tag correlation within individual images, using a semi-supervised learning approach with a Gaussian Markov Random Field (MRF) to propagate tag likelihood values from labeled to unlabeled images, allowing for efficient automatic tagging with a small portion of user-supplied labels.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If manual image annotation is used, then tagging reliability is improved, but time consumption increases significantly

Engineering Contradiction:
Improvetagging reliabilityVSAvoidtime consumption
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system enables automatic self-annotation of images by leveraging visual similarity and tag correlation. Labeled images automatically provide tags to unlabeled images through the graph-based propagation mechanism, eliminating the need for manual annotation while maintaining high tagging reliability through the semi-supervised learning approach

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent introduces an intermediary graph structure that mediates between labeled and unlabeled images. The graph-based framework propagates tag likelihood values through edges connecting similar images, serving as an intermediary mechanism that transfers annotation information without requiring direct manual labeling of each image

Inventive Principle:
Principle #24Intermediary (Mediator)

2Loss of time

If automatic tagging approaches are used, then time consumption is reduced, but tagging reliability decreases due to semantic gap

Engineering Contradiction:
Improvetime consumptionVSAvoidtagging reliability
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The system incorporates feedback mechanisms where tag likelihood values are iteratively propagated and updated through the graph structure. The semi-supervised learning algorithm continuously refines tag assignments based on visual similarity and tag correlation, using feedback from labeled images to improve the accuracy of automatic tagging for unlabeled images

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent segments the image annotation task into two distinct groups: labeled images that provide ground truth information and unlabeled images that need annotation. This segmentation allows the system to leverage the reliable labels from a subset of images to automatically annotate the remaining images, bridging the semantic gap through graph-based propagation

Inventive Principle:
Principle #1Segmentation

3Productivity

If graph-based semi-supervised learning is used, then tagging efficiency is improved with small portion of labels, but system complexity increases

Engineering Contradiction:
Improvetagging efficiencyVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system applies partial action by requiring only a small portion of images to be manually labeled rather than all images. The graph-based propagation mechanism then extends this partial labeling to cover the entire image collection, achieving high tagging efficiency without requiring extensive manual annotation of every image

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS9146941B2Image tag pair graph for image annotation
Publication Date: 2015.09.29 ADOBE INC
  • US9146941B2 patent drawing
  • US9146941B2 patent drawing
  • US9146941B2 patent drawing

AI summary

An approach is described for automatically tagging a single image or multiple images. The approach, in one example embodiment, is based on a graph-based framework that exploits both visual similarity between images and tag correlation within individual images. The problem is formulated in the context of semi-supervised learning, where a graph modeled as a Gaussian Markov Random Field (MRF) is solved by minimizing an objective function (the image tag score function) using an iterative approach. The iterative approach, in one embodiment, comprises: (1) fixing tags and propagating image tag likelihood values from labeled images to unlabeled images, and (2) fixing images and propagating image tag likelihood based on tag correlation.