Interactive Segmentation With Incremental Watershed Cuts - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Interactive Segmentation With Incremental Watershed Cuts

Résumé

In this article, we propose an incremental method for computing seeded watershed cuts for interactive image segmentation. We propose an algorithm based on the hierarchical image representation called the binary partition tree to compute a seeded watershed cut. We show that this algorithm fits perfectly in an interactive segmentation process by handling user interactions, seed addition or removal, in time linear with respect to the number of affected pixels. Run time comparisons with several state-of-the-art interactive and noninteractive watershed methods show that the proposed method can handle user interactions much faster than previous methods, thus improving the user experience on large images.
Fichier principal
Vignette du fichier
lebon.pdf (3.27 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04069187 , version 1 (14-04-2023)
hal-04069187 , version 2 (18-09-2023)
hal-04069187 , version 3 (04-12-2023)

Identifiants

  • HAL Id : hal-04069187 , version 1

Citer

Quentin Lebon, Josselin Lefèvre, Jean Cousty, Benjamin Perret. Interactive Segmentation With Incremental Watershed Cuts. Iberoamerican Congress on Pattern Recognition (CIARP), Inês Domingues; Verónica Vasconcelos, Nov 2023, Coimbra, Portugal. ⟨hal-04069187v1⟩
162 Consultations
113 Téléchargements

Partager

Gmail Facebook X LinkedIn More