Segmentation d'images par l'algorithme des flot maximum continu

Abstract : In recent years, with the advance of computing equipment and image acquisition techniques, the sizes, dimensions and content of acquired images have increased considerably. Unfortunately as time passes there is a steadily increasing gap between the classical and parallel programming paradigms and their actual performance on modern computer hardware. In this thesis we consider in depth one particular algorithm, the continuous maximum flow computation. We review in detail why this algorithm is useful and interesting, and we propose efficient and portable implementations on various architectures. We also examine how it performs in the terms of segmentation quality on some recent problems of materials science and nano-scale biology
Document type :
Complete list of metadatas

Cited literature [83 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Monday, February 11, 2013 - 9:22:12 AM
Last modification on : Tuesday, February 18, 2020 - 10:28:39 AM
Long-term archiving on: Sunday, May 12, 2013 - 3:54:43 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00786914, version 1


Laszlo Marak. Segmentation d'images par l'algorithme des flot maximum continu. Autre [cs.OH]. Université Paris-Est, 2012. Français. ⟨NNT : 2012PEST1093⟩. ⟨tel-00786914⟩



Record views


Files downloads