Skip to Main content Skip to Navigation
Conference papers

Une méthode de réduction exacte pour la segmentation par graph cuts

Abstract : From now on, graph cuts are a standard in the computer vision community. However, their huge memory consumption remains a challenging problem since underlying graphs contains billions of nodes and even more edges. Except some exact methods [14, 10, 5], the heuristics in the literature can only obtain an approached solution [12, 8]. First, we present a new strategy for reducing exactly these graphs : the graph is built by adding nodes which satisfy locally a given condition and corresponds in a narrow band around the segmented object edges. The experiments presented for segmenting gray-levels and color images highlight low memory usage and show a low distance between segmentations. We also present an application of this method for segmenting lung tumors in CT images.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00596724
Contributor : Peter Sturm <>
Submitted on : Sunday, May 29, 2011 - 9:47:06 PM
Last modification on : Friday, June 11, 2021 - 12:36:02 PM
Long-term archiving on: : Friday, November 9, 2012 - 1:56:26 PM

File

paper08.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00596724, version 1

Citation

Nicolas Lermé, François Malgouyres, Lucas Létocart, Jean-Marie Rocchisani. Une méthode de réduction exacte pour la segmentation par graph cuts. ORASIS - Congrès des jeunes chercheurs en vision par ordinateur, INRIA Grenoble Rhône-Alpes, Jun 2011, Praz-sur-Arly, France. ⟨inria-00596724⟩

Share

Metrics

Record views

332

Files downloads

373