On Minimum Spanning Tree Streaming for Image Analysis

Abstract

This work addresses minimum spanning tree (MST) construction in streaming for images. We study the problem of computation a MST on streaming in which image columns from a continuous stream are processed in blocks of a given size. The correctness of proposed algorithm is proved and confirmed in the case of morphological segmentation of remote sensing images.

On minimum spanning tree streaming for hierarchical segmentation

“…We only prove that the second method returns a MST. For a proof of the first method please refer to our previous work (Gigli et al, 2018). We show that the graph…”

“…e-mail: name.surname@mines-paristech.fr (Leonardo Gigli) This paper is an extended version of the work published by Gigli et al (2018). The original paper addresses the problem of computing a MST on image streaming .…”

Component trees for image sequences and streams

“…In the literature, this problem of trees changing over time is known as the dynamic tree problem (Sleator and Tarjan, 1983). Our image streaming algorithms rely on temporal based streaming while there are other perspectives such as spatial image streaming (Gigli et al, 2018). As a related work, authors proposed streaming graph for video segmentation in (de Souza et al, 2015).…”