relecture vlad de 0 a 70

[these_gilles.git] / THESE / these.out

diff --git a/THESE/these.out b/THESE/these.out
index b735b6db5b85fbeefa67e7a4fa5023cfaa6b8b9a..33e4ba2ee9b3ae86d1e89f8f11ec1055577838d5 100644 (file)
--- a/THESE/these.out
+++ b/THESE/these.out
@@ -5,6 +5,7 @@
 \BOOKMARK [2][]{subsection.2.2.1}{2.2.1 Le mat\351riel}{section.2.2}
 \BOOKMARK [2][]{subsection.2.2.2}{2.2.2 Le logiciel}{section.2.2}
 \BOOKMARK [2][]{subsection.2.2.3}{2.2.3 L'occupancy}{section.2.2}
+\BOOKMARK [1][]{section.2.3}{2.3 Synth\350se des contraintes d'impl\351mentation}{chapter.2}
 \BOOKMARK [0][]{chapter.3}{3 Mod\350les d'image et de bruits - notations}{}
 \BOOKMARK [1][]{section.3.1}{3.1 Mod\350le d'image bruit\351e}{chapter.3}
 \BOOKMARK [1][]{section.3.2}{3.2 Mod\350les de bruit}{chapter.3}
@@ -26,19 +27,20 @@
 \BOOKMARK [2][]{subsection.4.2.3}{4.2.3 Le filtre bilat\351ral}{section.4.2}
 \BOOKMARK [2][]{subsection.4.2.4}{4.2.4 Les filtres par patches}{section.4.2}
 \BOOKMARK [0][]{chapter.5}{5 Les techniques de segmentation des images}{}
-\BOOKMARK [1][]{section.5.1}{5.1 Les techniques de segmentation}{chapter.5}
-\BOOKMARK [2][]{subsection.5.1.1}{5.1.1 Analyse d'histogramme}{section.5.1}
-\BOOKMARK [2][]{subsection.5.1.2}{5.1.2 Partitionnement de graphe}{section.5.1}
-\BOOKMARK [2][]{subsection.5.1.3}{5.1.3 kernel-means, mean-shift et apparent\351s}{section.5.1}
-\BOOKMARK [2][]{subsection.5.1.4}{5.1.4 Les contours actifs, ou snakes}{section.5.1}
-\BOOKMARK [2][]{subsection.5.1.5}{5.1.5 M\351thodes hybrides}{section.5.1}
-\BOOKMARK [1][]{section.5.2}{5.2 Les impl\351mentations des techniques de segmentation sur GPU}{chapter.5}
-\BOOKMARK [2][]{subsection.5.2.1}{5.2.1 Calcul d'histogramme}{section.5.2}
+\BOOKMARK [1][]{section.5.1}{5.1 Introduction}{chapter.5}
+\BOOKMARK [1][]{section.5.2}{5.2 Les techniques de segmentation orient\351es r\351gions}{chapter.5}
+\BOOKMARK [2][]{subsection.5.2.1}{5.2.1 Analyse d'histogramme}{section.5.2}
 \BOOKMARK [2][]{subsection.5.2.2}{5.2.2 Partitionnement de graphe}{section.5.2}
-\BOOKMARK [2][]{subsection.5.2.3}{5.2.3 K-means, mean-shift et apparent\351s}{section.5.2}
-\BOOKMARK [2][]{subsection.5.2.4}{5.2.4 Level set et snakes}{section.5.2}
-\BOOKMARK [2][]{subsection.5.2.5}{5.2.5 Algorithmes hybrides}{section.5.2}
-\BOOKMARK [1][]{section.5.3}{5.3 Conclusion}{chapter.5}
+\BOOKMARK [2][]{subsection.5.2.3}{5.2.3 kernel-means, mean-shift et apparent\351s}{section.5.2}
+\BOOKMARK [1][]{section.5.3}{5.3 Les techniques de segmentation par contours actifs, ou snakes}{chapter.5}
+\BOOKMARK [2][]{subsection.5.3.1}{5.3.1 M\351thodes hybrides}{section.5.3}
+\BOOKMARK [1][]{section.5.4}{5.4 Les impl\351mentations des techniques de segmentation sur GPU}{chapter.5}
+\BOOKMARK [2][]{subsection.5.4.1}{5.4.1 Calcul d'histogramme}{section.5.4}
+\BOOKMARK [2][]{subsection.5.4.2}{5.4.2 Partitionnement de graphe}{section.5.4}
+\BOOKMARK [2][]{subsection.5.4.3}{5.4.3 K-means, mean-shift et apparent\351s}{section.5.4}
+\BOOKMARK [2][]{subsection.5.4.4}{5.4.4 Level set et snakes}{section.5.4}
+\BOOKMARK [2][]{subsection.5.4.5}{5.4.5 Algorithmes hybrides}{section.5.4}
+\BOOKMARK [1][]{section.5.5}{5.5 Conclusion}{chapter.5}
 \BOOKMARK [0][]{chapter.6}{6 La segmentation par snake polygonal orient\351 r\351gions}{}
 \BOOKMARK [1][]{section.6.1}{6.1 Introduction}{chapter.6}
 \BOOKMARK [1][]{section.6.2}{6.2 Pr\351sentation de l'algorithme}{chapter.6}