LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

SuperPatchMatch: An Algorithm for Robust Correspondences Using Superpixel Patches

Photo by usgs from unsplash

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… Click to show full abstract

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: image; robust correspondences; superpatchmatch algorithm; using superpixel; algorithm robust; correspondences using

Journal Title: IEEE Transactions on Image Processing
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.