\contentsline {subsection}{\numberline {2.4.4}Les filtres par patches}{22}{subsection.2.4.4}
\contentsline {section}{\numberline {2.5}Les techniques de segmentation}{23}{section.2.5}
\contentsline {subsection}{\numberline {2.5.1}Analyse d'histogramme}{23}{subsection.2.5.1}
-\contentsline {subsection}{\numberline {2.5.2}Analyse de graphe}{24}{subsection.2.5.2}
-\contentsline {subsection}{\numberline {2.5.3}kernel-means, mean-shift et d\IeC {\'e}riv\IeC {\'e}s}{26}{subsection.2.5.3}
+\contentsline {subsection}{\numberline {2.5.2}Partitionnement de graphe}{25}{subsection.2.5.2}
+\contentsline {subsection}{\numberline {2.5.3}kernel-means, mean-shift et apparent\IeC {\'e}s}{26}{subsection.2.5.3}
\contentsline {subsection}{\numberline {2.5.4}Les contours actifs, ou \textit {snakes}}{28}{subsection.2.5.4}
\contentsline {subsection}{\numberline {2.5.5}M\IeC {\'e}thodes hybrides}{30}{subsection.2.5.5}
-\contentsline {section}{\numberline {2.6}L'\IeC {\'e}tat de l'art des impl\IeC {\'e}mentations GPU}{31}{section.2.6}
-\contentsline {chapter}{\numberline {3}La segmentation orient\IeC {\'e}e r\IeC {\'e}gions dans les images bruit\IeC {\'e}es}{33}{chapter.3}
-\contentsline {section}{\numberline {3.1}Pr\IeC {\'e}sentation - existant}{33}{section.3.1}
-\contentsline {section}{\numberline {3.2}La parall\IeC {\`e}lisation du snake polygonal}{33}{section.3.2}
-\contentsline {chapter}{\numberline {4}Le filtrage des images sur GPU}{35}{chapter.4}
-\contentsline {section}{\numberline {4.1}Algorithme de r\IeC {\'e}duction de bruit par recherche des lignes de niveaux}{35}{section.4.1}
-\contentsline {section}{\numberline {4.2}Filtre m\IeC {\'e}dian}{35}{section.4.2}
-\contentsline {section}{\numberline {4.3}Filtres de convolution}{35}{section.4.3}
-\contentsline {chapter}{\numberline {5}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{37}{chapter.5}
+\contentsline {section}{\numberline {2.6}Les impl\IeC {\'e}mentations GPU des techniques de segmentation}{31}{section.2.6}
+\contentsline {subsection}{\numberline {2.6.1}Calcul d'histogramme}{31}{subsection.2.6.1}
+\contentsline {subsection}{\numberline {2.6.2}Partitionnement de graphe}{32}{subsection.2.6.2}
+\contentsline {subsection}{\numberline {2.6.3}K-means, mean-shift et apparent\IeC {\'e}s}{32}{subsection.2.6.3}
+\contentsline {subsection}{\numberline {2.6.4}Snakes et Level set}{34}{subsection.2.6.4}
+\contentsline {subsection}{\numberline {2.6.5}Algorithmes hybrides}{37}{subsection.2.6.5}
+\contentsline {chapter}{\numberline {3}La segmentation orient\IeC {\'e}e r\IeC {\'e}gions dans les images bruit\IeC {\'e}es}{39}{chapter.3}
+\contentsline {section}{\numberline {3.1}Pr\IeC {\'e}sentation - existant}{39}{section.3.1}
+\contentsline {section}{\numberline {3.2}La parall\IeC {\`e}lisation du snake polygonal}{39}{section.3.2}
+\contentsline {chapter}{\numberline {4}Le filtrage des images sur GPU}{41}{chapter.4}
+\contentsline {section}{\numberline {4.1}Algorithme de r\IeC {\'e}duction de bruit par recherche des lignes de niveaux}{41}{section.4.1}
+\contentsline {section}{\numberline {4.2}Filtre m\IeC {\'e}dian}{41}{section.4.2}
+\contentsline {section}{\numberline {4.3}Filtres de convolution}{41}{section.4.3}
+\contentsline {chapter}{\numberline {5}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{43}{chapter.5}