Centre de documentation
scientifique

Midrange geometric interactions for semantic segmentation / Julia Diebold in International journal of computer vision, vol 117 n° 3 (May 2016)  

Public [article]  inInternational journal of computer vision > vol 117 n° 3 (May 2016) . - pp 199 - 225 Titre : Midrange geometric interactions for semantic segmentation Type de document : Article/Communication Auteurs : Julia Diebold, Auteur ; Claudia Nieuwenhuis, Auteur ; Daniel Cremers, Auteur Année de publication : 2016 Article en page(s) : pp 199 - 225 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes IGN] contrainte géométrique [Termes IGN] direction de visée [Termes IGN] segmentation d'image [Termes IGN] valeur moyenne Résumé : (Auteur) In this article we introduce the concept of midrange geometric constraints into semantic segmentation. We call these constraints ‘midrange’ since they are neither global constraints, which take into account all pixels without any spatial limitation, nor are they local constraints, which only regard single pixels or pairwise relations. Instead, the proposed constraints allow to discourage the occurrence of labels in the vicinity of each other, e.g., ‘wolf’ and ‘sheep’. ‘Vicinity’ encompasses spatial distance as well as specific spatial directions simultaneously, e.g., ‘plates’ are found directly above ‘tables’, but do not fly over them. It is up to the user to specifically define the spatial extent of the constraint between each two labels. Such constraints are not only interesting for scene segmentation, but also for part-based articulated or rigid objects. The reason is that object parts such as for example arms, torso and legs usually obey specific spatial rules, which are among the few things that remain valid for articulated objects over many images and which can be expressed in terms of the proposed midrange constraints, i.e. closeness and/or direction. We show, how midrange geometric constraints are formulated within a continuous multi-label optimization framework, and we give a convex relaxation, which allows us to find globally optimal solutions of the relaxed problem independent of the initialization. Numéro de notice : A2016--140 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1007%2Fs11263-015-0828-7 En ligne : https://doi.org/10.1007/s11263-015-0828-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85868 [article]