Return to search

On continuous maximum flow image segmentation algorithm

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

Identiferoai:union.ndltd.org:CCSD/oai:tel.archives-ouvertes.fr:tel-00786914
Date28 March 2012
CreatorsMarak, Laszlo
PublisherUniversité Paris-Est
Source SetsCCSD theses-EN-ligne, France
Languagefra
Detected LanguageEnglish
TypePhD thesis

Page generated in 0.0024 seconds