{"id":1910,"date":"2023-04-07T14:22:02","date_gmt":"2023-04-07T13:22:02","guid":{"rendered":"https:\/\/www.sfpt.fr\/hyperspectral\/?p=1910"},"modified":"2023-04-07T14:22:02","modified_gmt":"2023-04-07T13:22:02","slug":"sujet-de-these-optimisation-exacte-parcimonie-et-contraintes-avancees-pour-lanalyse-multi-solutions-de-donnees-hyperspectrales-de-mars","status":"publish","type":"post","link":"https:\/\/www.sfpt.fr\/hyperspectral\/?p=1910","title":{"rendered":"Sujet de th\u00e8se : Optimisation exacte, parcimonie et contraintes avanc\u00e9es pour l&#8217;analyse multi-solutions de donn\u00e9es hyperspectrales de Mars"},"content":{"rendered":"\n<p>Cette th\u00e8se financ\u00e9e vise \u00e0 formuler le probl\u00e8me d&#8217;analyse de donn\u00e9es&nbsp;hyperspectrales&nbsp;dans le formalisme de l&#8217;optimisation MIP (Mixed Integer&nbsp;Programming). Cette nouvelle approche permettra la r\u00e9solution exacte des probl\u00e8mes d\u2019estimation&nbsp;sous-jacents par des algorithmes d\u00e9di\u00e9s, l\u00e0 o\u00f9 les m\u00e9thodes existantes cumulent erreur de mod\u00e8le et&nbsp;erreur d&#8217;estimation par approches sous-optimales.&nbsp;La forte originalit\u00e9 de ces travaux r\u00e9side en un changement de paradigme o\u00f9, plut\u00f4t que de r\u00e9aliser&nbsp;l&#8217;estimation au sens classique de l&#8217;optimisation d&#8217;un crit\u00e8re \u00e0 solution unique (laquelle s\u2019av\u00e8re&nbsp;souvent ininterpr\u00e9table en raison du trop fort niveau de bruit sur les donn\u00e9es), les m\u00e9thodes&nbsp;d\u00e9velopp\u00e9es retourneront l&#8217;ensemble de solutions acceptables, par exemple l&#8217;ensemble exhaustif des&nbsp;solutions parcimonieuses compatibles avec le niveau de bruit donn\u00e9. Ces outils seront appliqu\u00e9s \u00e0 des donn\u00e9es de t\u00e9l\u00e9d\u00e9tection spatiale de la plan\u00e8te Mars.<br><br><\/p>\n\n\n\n<p>Lieu : LS2N, Ecole Centrale Nantes<br><br>Encadrant : S. Bourguignon (Ecole Centrale Nantes), F. Schmidt (Univ. Paris-Saclay)<br><br>Pour candidater :<br><a href=\"https:\/\/theses.doctorat-bretagneloire.fr\/sis\/campagne-2023#umr-cnrs-6004-laboratoire-des-sciences-du-numerique-de-nantes-ls2n\">https:\/\/theses.doctorat-bretagneloire.fr\/sis\/campagne-2023#umr-cnrs-6004-laboratoire-des-sciences-du-numerique-de-nantes-ls2n<\/a><br><br>D\u00e9tail du sujet :<br><a href=\"https:\/\/theses.doctorat-bretagneloire.fr\/sis\/campagne-2023\/optimisation-exacte-parcimonie-et-contra\/@@download\/pdf_fr\/analyse_multisolutions_Mars.pdf\">https:\/\/theses.doctorat-bretagneloire.fr\/sis\/campagne-2023\/optimisation-exacte-parcimonie-et-contra\/@@download\/pdf_fr\/analyse_multisolutions_Mars.pdf<\/a><br><br>Contact :&nbsp;S\u00e9bastien Bourguignon <a href=\"mailto:Sebastien.Bourguignon@ec-nantes.fr\">&lt;Sebastien.Bourguignon@ec-nantes.fr&gt;<\/a>,&nbsp;Frederic Schmidt <a href=\"mailto:frederic.schmidt@universite-paris-saclay.fr\">&lt;frederic.schmidt@universite-paris-saclay.fr&gt;<\/a><br><br>Date limite de candidature : 21 Avril 2023<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Cette th\u00e8se financ\u00e9e vise \u00e0 formuler le probl\u00e8me d&#8217;analyse de donn\u00e9es&nbsp;hyperspectrales&nbsp;dans le formalisme de l&#8217;optimisation MIP (Mixed Integer&nbsp;Programming). Cette nouvelle approche permettra la r\u00e9solution exacte des probl\u00e8mes d\u2019estimation&nbsp;sous-jacents par des algorithmes d\u00e9di\u00e9s, l\u00e0 o\u00f9 les m\u00e9thodes existantes cumulent erreur de mod\u00e8le et&nbsp;erreur d&#8217;estimation par approches sous-optimales.&nbsp;La forte originalit\u00e9 de ces travaux r\u00e9side en un changement &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.sfpt.fr\/hyperspectral\/?p=1910\" class=\"more-link\">Continuer la lecture<span class=\"screen-reader-text\"> de &laquo;&nbsp;Sujet de th\u00e8se : Optimisation exacte, parcimonie et contraintes avanc\u00e9es pour l&#8217;analyse multi-solutions de donn\u00e9es hyperspectrales de Mars&nbsp;&raquo;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_s2mail":"","footnotes":""},"categories":[1],"tags":[],"class_list":["post-1910","post","type-post","status-publish","format-standard","hentry","category-non-classe"],"_links":{"self":[{"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/posts\/1910","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1910"}],"version-history":[{"count":1,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/posts\/1910\/revisions"}],"predecessor-version":[{"id":1911,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=\/wp\/v2\/posts\/1910\/revisions\/1911"}],"wp:attachment":[{"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1910"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1910"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.sfpt.fr\/hyperspectral\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1910"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}