.png){kind=icon}
Return
SuperPatchMatch: An Algorithm for Robust Correspondences Using Superpixel Patches
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2017.2708504.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Superpixels have become very popular in many computer vision applications. Nevertheless, they remain underexploited, since the superpixel decomposition may produce irregular and nonstable 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.
Keywords:
Patch-based method
superpixels
patches of superpixels
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
Cited Papers
ShareSaveShareSaveShareSaveNorthward oceanic heat transport in the main branch of the Norwegian Atlantic Current over the late Holocene.png)
The Holocene
The HoloceneIF0
PREAI
ShareSave
ShareSaveInterclass testing of object oriented softwareEighth IEEE International Conference on Engineering of Complex Computer Systems, 2002. Proceedings.OAAI
Eighth IEEE International Conference on Engineering of Complex Computer Systems, 2002. Proceedings.IF0
OAAIShareSave
View more