New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

05/27/2015
by   Jean Cousty, et al.
0

We study three representations of hierarchies of partitions: dendrograms (direct representations), saliency maps, and minimum spanning trees. We provide a new bijection between saliency maps and hierarchies based on quasi-flat zones as used in image processing and characterize saliency maps and minimum spanning trees as solutions to constrained minimization problems where the constraint is quasi-flat zones preservation. In practice, these results form a toolkit for new hierarchical methods where one can choose the most convenient representation. They also invite us to process non-image data with morphological hierarchies.

READ FULL TEXT
research
02/22/2020

Compression with wildcards: All spanning trees

By processing all minimal cutsets of a graph G, and by using novel wildc...
research
05/11/2021

A Stronger Lower Bound on Parametric Minimum Spanning Trees

We prove that, for an undirected graph with n vertices and m edges, each...
research
03/10/2023

Clustering with minimum spanning trees: How good can it be?

Minimum spanning trees (MSTs) provide a convenient representation of dat...
research
08/11/2021

Edge Partitions of Complete Geometric Graphs (Part 1)

In this paper, we disprove the long-standing conjecture that any complet...
research
07/05/2022

Clustered Saliency Prediction

We present a new method for image salience prediction, Clustered Salienc...
research
07/13/2020

LSQT: Low-Stretch Quasi-Trees for Bundling and Layout

We introduce low-stretch trees to the visualization community with LSQT,...
research
01/30/2018

An Iterative Spanning Forest Framework for Superpixel Segmentation

Superpixel segmentation has become an important research problem in imag...

Please sign up or login with your details

Forgot password? Click here to reset