10 citations · 31 across the 5 of their papers we have counts for
6 papers
Playing with Kruskal: algorithms for flat and hierarchical watershed cuts
Jean Cousty, Laurent Najman, Benjamin Perret +1
In the framework of edge-weighted graphs, watersheds have proven to be linked to well-known optimization problems, as Minimum Spanning Tree, which allowed the design of efficient a…
Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees
Josselin Lefèvre, Jean Cousty, Benjamin Perret +1
Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed. However, clas…
Efficient Multiscale Object-based Superpixel Framework
Felipe Belém, Benjamin Perret, Jean Cousty +2
Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload. However, classical methods do no…
Component Tree Loss Function: Definition and Optimization
Benjamin Perret, Jean Cousty
In this article, we propose a method to design loss functions based on component trees which can be optimized by gradient descent algorithms and which are therefore usable in conju…
Ultrametric Fitting by Gradient Descent
Giovanni Chierchia, Benjamin Perret
We study the problem of fitting an ultrametric distance to a dissimilarity graph in the context of hierarchical cluster analysis. Standard hierarchical clustering methods are speci…
Simultaneous multi-band detection of Low Surface Brightness galaxies with Markovian modelling
B. Vollmer, B. Perret, M. Petremand +7
We present an algorithm for the detection of Low Surface Brightness (LSB) galaxies in images, called MARSIAA (MARkovian Software for Image Analysis in Astronomy), which is based on…