Unsupervised Spatio-Temporal Mining for Burned Area Mapping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current fire mapping techniques face challenges in accurately and efficiently identifying burned areas due to the rarity of fire events, seasonal and geographical data heterogeneity, and the need for extensive labeled training data, which limits the effectiveness of supervised learning approaches and overlooks spatial context in classification.

Innovation Solution

A hybrid approach combining unsupervised learning with supervised techniques, using a region-based classification method that leverages spatial context and domain heuristics to classify spatial regions rather than individual pixels, and employs MODIS data products like Active Fire and Vegetation Index to determine fire probabilities and refine candidate burn events.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If supervised learning approaches are used for burned area mapping, then classification accuracy can be improved with sufficient labeled training data, but the rarity of fire events and heterogeneity in data across seasons and geographical locations make collecting sufficient labeled training data extremely difficult and costly

Engineering Contradiction:
Improveclassification accuracyVSAvoidlabeled training data
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The system uses unsupervised learning algorithms to automatically detect and cluster spatial-temporal patterns in remote sensing data without requiring human-labeled training data. The algorithm self-organizes the data into meaningful fire event detections based on inherent patterns, eliminating the need for manual annotation of training samples.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The system performs preliminary unsupervised clustering to identify candidate fire events before any supervised classification is applied. This preliminary action groups pixels into spatially contiguous regions based on spectral and temporal characteristics, creating pre-organized data structures that simplify subsequent analysis and reduce the need for extensive labeled data.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If pixel-based classification approaches are used, then processing speed can be maintained, but spatial context is ignored leading to reduced accuracy in identifying burned areas

Engineering Contradiction:
Improveprocessing speedVSAvoidburned area mapping accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The system merges spatially adjacent pixels into contiguous regions or objects based on spectral and temporal similarity. Instead of classifying pixels independently, the algorithm combines neighboring pixels that exhibit consistent fire-related patterns, creating spatially coherent burned area mappings that reflect actual fire boundaries.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The system transitions from two-dimensional pixel-level classification to three-dimensional spatio-temporal analysis by incorporating temporal dimensions into the clustering process. This adds a time dimension to the spatial analysis, allowing the system to distinguish between permanent and transient features while maintaining processing efficiency through unsupervised pattern recognition.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS9478038B2Unsupervised spatio-temporal data mining framework for burned area mapping
Publication Date: 2016.10.25 REGENTS OF THE UNIVERSITY OF MINNESOTA
  • US9478038B2 patent drawing
  • US9478038B2 patent drawing
  • US9478038B2 patent drawing

AI summary

A method reduces processing time required to identify locations burned by fire by receiving a feature value for each pixel in an image, each pixel representing a sub-area of a location. Pixels are then grouped based on similarities of the feature values to form candidate burn events. For each candidate burn event, a probability that the candidate burn event is a true burn event is determined based on at least one further feature value for each pixel in the candidate burn event. Candidate burn events that have a probability below a threshold are removed from further consideration as burn events to produce a set of remaining candidate burn events.