Afficher la notice abrégée

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorGIRAUD, Rémi
hal.structure.identifierInstitut Polytechnique de Bordeaux [Bordeaux INP]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorTA, Vinh-Thong
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorPAPADAKIS, Nicolas
dc.date.accessioned2024-04-04T03:06:52Z
dc.date.available2024-04-04T03:06:52Z
dc.date.issued2018-01-15
dc.identifier.issn1077-3142
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193377
dc.description.abstractEnSuperpixel decomposition methods are widely used in computer vision and image processing frameworks. By reducing the set of pixels to process, the computational burden can be drastically reduced. For most superpixel methods, a trade-off is computed between 1) color homogeneity, 2) adherence to the image contours and 3) shape regularity of the decomposition. In this paper, we propose an iterative framework that jointly enforces all these aspects and provides accurate and robust Superpixels with Contour Adherence using Linear Path (SCALP). The resulting superpixels adhere to the image contours while their regularity is enforced. During the decomposition process , we propose to compute the color distance along the linear path between the pixel and the corresponding superpixel barycenter. A contour prior is also considered on this path to prevent the crossing of image boundaries when associating a pixel to a superpixel. Finally, in order to improve the clustering accuracy and the robustness to noise, we integrate the pixel neighborhood information in the decomposition, while preserving the same computational complexity. SCALP is extensively evaluated on the standard Berkeley segmentation dataset, and the obtained results outperform the ones of state-of-the-art methods in terms of superpixel and contour detection metrics. The method is also extended to generate volume supervoxels, and evaluated on 3D MRI segmentation.
dc.description.sponsorshipGeneralized Optimal Transport Models for Image processing - ANR-16-CE33-0010
dc.language.isoen
dc.publisherElsevier
dc.subject.enSegmentation
dc.subject.enColor and contour features
dc.subject.enSuperpixel
dc.title.enRobust Superpixels using Color and Contour Features along Linear Path
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Vision par ordinateur et reconnaissance de formes [cs.CV]
dc.subject.halInformatique [cs]/Traitement des images
bordeaux.journalComputer Vision and Image Understanding
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-01510063
hal.version5
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01510063v5
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Computer%20Vision%20and%20Image%20Understanding&rft.date=2018-01-15&rft.eissn=1077-3142&rft.issn=1077-3142&rft.au=GIRAUD,%20R%C3%A9mi&TA,%20Vinh-Thong&PAPADAKIS,%20Nicolas&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée