Search Results for author: Alberto Bailoni

Found 8 papers, 2 papers with code

Joint Semantic Instance Segmentation on Graphs with the Semantic Mutex Watershed

no code implementations ECCV 2020 Steffen Wolf, Yuyan Li, Constantin Pape, Alberto Bailoni, Anna Kreshuk, Fred A. Hamprecht

Semantic instance segmentation is the task of simultaneously partitioning an image into distinct segments while associating each pixel with a class label.

graph partitioning Instance Segmentation +3

Proposal-Free Volumetric Instance Segmentation from Latent Single-Instance Masks

no code implementations10 Sep 2020 Alberto Bailoni, Constantin Pape, Steffen Wolf, Anna Kreshuk, Fred A. Hamprecht

This work introduces a new proposal-free instance segmentation method that builds on single-instance segmentation masks predicted across the entire image in a sliding window style.

Instance Segmentation Segmentation +1

The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation

no code implementations29 Dec 2019 Steffen Wolf, Yuyan Li, Constantin Pape, Alberto Bailoni, Anna Kreshuk, Fred A. Hamprecht

Semantic instance segmentation is the task of simultaneously partitioning an image into distinct segments while associating each pixel with a class label.

graph partitioning Instance Segmentation +3

DISCo: Deep learning, Instance Segmentation, and Correlations for cell segmentation in calcium imaging

1 code implementation21 Aug 2019 Elke Kirschbaum, Alberto Bailoni, Fred A. Hamprecht

In order to use the data gained with calcium imaging, it is necessary to extract individual cells and their activity from the recordings.

Cell Segmentation Clustering +3

GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation

no code implementations CVPR 2022 Alberto Bailoni, Constantin Pape, Nathan Hütsch, Steffen Wolf, Thorsten Beier, Anna Kreshuk, Fred A. Hamprecht

We propose a theoretical framework that generalizes simple and fast algorithms for hierarchical agglomerative clustering to weighted graphs with both attractive and repulsive interactions between the nodes.

Clustering graph partitioning +3

The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning

no code implementations25 Apr 2019 Steffen Wolf, Alberto Bailoni, Constantin Pape, Nasim Rahaman, Anna Kreshuk, Ullrich Köthe, Fred A. Hamprecht

Unlike seeded watershed, the algorithm can accommodate not only attractive but also repulsive cues, allowing it to find a previously unspecified number of segments without the need for explicit seeds or a tunable threshold.

Clustering graph partitioning +1

The Mutex Watershed: Efficient, Parameter-Free Image Partitioning

no code implementations ECCV 2018 Steffen Wolf, Constantin Pape, Alberto Bailoni, Nasim Rahaman, Anna Kreshuk, Ullrich Kothe, FredA. Hamprecht

Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments; or equivalently, the task of detecting closed contours in an image.

Clustering graph partitioning +1

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