On minimum spanning tree streaming for hierarchical segmentation

Archive ouverte

Gigli, Leonardo | Velasco-Forero, Santiago | Marcotegui, Beatriz

Edité par CCSD ; Elsevier -

International audience. The minimum spanning tree (MST) is one the most popular data structure used to extract hierarchical information from images. This work addresses MST construction in streaming for images. First, we focus on the problem of computing a MST of the union of two graphs with a non-empty intersection. Then we show how our solution can be applied to streaming images. The proposed solution relies on the decomposition of the data in two parts. One stable that does not change in the future. This can be stocked or used for further treatments. The other unstable needs further information before becoming stable. The correctness of proposed algorithm has been proven and confirmed in the case of morphological segmentation of remote sensing images.

Suggestions

Du même auteur

Road Segmentation on low resolution Lidar point clouds for autonomous vehicles

Archive ouverte | Gigli, Leonardo | CCSD

ISPRS 2020. International audience. Point cloud datasets for perception tasks in the context of autonomous driving often rely on high resolution 64-layer Light Detection and Ranging (LIDAR) scanners. They are expens...

End-to-End Similarity Learning and Hierarchical Clustering for unfixed size datasets

Archive ouverte | Gigli, Leonardo | CCSD

International audience. Hierarchical clustering (HC) is a powerful tool in data analysis since it allows discovering patterns in the observed data at different scales. Similarity-based HC methods take as input a fix...

SHREC'20 track: Retrieval of digital surfaces with similar geometric reliefs

Archive ouverte | Thompson, Elia, Moscoso | CCSD

International audience. This paper presents the methods that have participated in the SHREC'20 contest on retrieval of surface patches with similar geometric reliefs and 1 the analysis of their performance over the ...

Chargement des enrichissements...