64 citations · 132 across the 8 of their papers we have counts for
10 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…
Atlas-based automated detection of swim bladder in Medaka embryo
Diane Genest, Marc Léonard, Jean Cousty +2
Fish embryo models are increasingly being used both for the assessment of chemicals efficacy and potential toxicity. This article proposes a methodology to automatically detect the…
VOIDD: automatic vessel of intervention dynamic detection in PCI procedures
Ketan Bacchuwar, Jean Cousty, Régis Vaillant +1
In this article, we present the work towards improving the overall workflow of the Percutaneous Coronary Interventions (PCI) procedures by capacitating the imaging instruments to p…