Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [56 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01432116
Contributor : Rémi Giraud <>
Submitted on : Friday, June 9, 2017 - 12:42:31 AM
Last modification on : Thursday, March 12, 2020 - 3:06:24 PM

File

Giraud_TIP_SPM.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, Institute of Electrical and Electronics Engineers, 2017, ⟨10.1109/TIP.2017.2708504⟩. ⟨hal-01432116⟩

Share

Metrics

Record views

546

Files downloads

2195