Search Results for author: Jean Cousty

Found 7 papers, 2 papers with code

Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees

1 code implementation5 Oct 2022 Josselin Lefèvre, Jean Cousty, Benjamin Perret, Harold Phelippeau

Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed.

Efficient Multiscale Object-based Superpixel Framework

1 code implementation7 Apr 2022 Felipe Belém, Benjamin Perret, Jean Cousty, Silvio J. F. Guimarães, Alexandre Falcão

Superpixel segmentation can be used as an intermediary step in many applications, often to improve object delineation and reduce computer workload.

Object Segmentation +1

Component Tree Loss Function: Definition and Optimization

no code implementations20 Jan 2021 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 conjunction with recent machine learning approaches such as neural networks.

BIG-bench Machine Learning

Atlas-based automated detection of swim bladder in Medaka embryo

no code implementations16 Feb 2019 Diane Genest, Marc Léonard, Jean Cousty, Noémie De Crozé, Hugues Talbot

An automated random forest clas-sifier is built from these descriptors in order to classify embryos with and without a swim bladder.

Bladder Segmentation Segmentation

VOIDD: automatic vessel of intervention dynamic detection in PCI procedures

no code implementations12 Oct 2017 Ketan Bacchuwar, Jean Cousty, Régis Vaillant, Laurent Najman

We present the automatic VOIDD algorithm to detect the vessel of intervention which is going to be treated during the procedure by combining information from the vessel image with contrast agent injection and images acquired during guidewire tip navigation.

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

no code implementations27 May 2015 Jean Cousty, Laurent Najman, Yukiko Kenmochi, Silvio Guimarães

We study three representations of hierarchies of partitions: dendrograms (direct representations), saliency maps, and minimum spanning trees.

A graph-based mathematical morphology reader

no code implementations30 Apr 2014 Laurent Najman, Jean Cousty

This survey paper aims at providing a "literary" anthology of mathematical morphology on graphs.

Survey

Cannot find the paper you are looking for? You can Submit a new open access paper.