SuperPatchMatch: an Algorithm for Robust Correspondences using Superpixel Patches - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2017

SuperPatchMatch: an Algorithm for Robust Correspondences using Superpixel Patches

Abstract

Superpixels have become very popular in many computer vision applications. Nevertheless, they remain underexploited since the superpixel decomposition may produce irregular and non stable segmentation results due to the dependency to the image content. In this paper, we first introduce a novel structure, a superpixel-based patch, called SuperPatch. The proposed structure, based on superpixel neighborhood, leads to a robust descriptor since spatial information is naturally included. The generalization of the PatchMatch method to SuperPatches, named SuperPatchMatch, is introduced. Finally, we propose a framework to perform fast segmentation and labeling from an image database, and demonstrate the potential of our approach since we outperform, in terms of computational cost and accuracy, the results of state-of-the-art methods on both face labeling and medical image segmentation.
Fichier principal
Vignette du fichier
Giraud_TIP_SPM.pdf (11.65 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01432116 , version 3 (09-06-2017)

Identifiers

Cite

Rémi Giraud, Vinh-Thong Ta, Aurélie Bugeau, Pierrick Coupé, Nicolas Papadakis. SuperPatchMatch: an Algorithm for Robust Correspondences using Superpixel Patches. IEEE Transactions on Image Processing, 2017, ⟨10.1109/TIP.2017.2708504⟩. ⟨hal-01432116⟩

Collections

CNRS ANR
602 View
1105 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More