Texture Superpixel Clustering from Patch-based Nearest Neighbor Matching

• URL: http://arxiv.org/abs/2003.04414v1
• Date: Mon, 9 Mar 2020 21:11:21 GMT
• Title: Texture Superpixel Clustering from Patch-based Nearest Neighbor Matching
• Authors: R\'emi Giraud, Yannick Berthoumieu
• Abstract summary: We propose a new Nearest Neighbor-based Superpixel Clustering (NNSC) method to generate texture-aware superpixels in a limited computational time.
• Score: 2.84279467589473
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Superpixels are widely used in computer vision applications. Nevertheless, decomposition methods may still fail to efficiently cluster image pixels according to their local texture. In this paper, we propose a new Nearest Neighbor-based Superpixel Clustering (NNSC) method to generate texture-aware superpixels in a limited computational time compared to previous approaches. We introduce a new clustering framework using patch-based nearest neighbor matching, while most existing methods are based on a pixel-wise K-means clustering. Therefore, we directly group pixels in the patch space enabling to capture texture information. We demonstrate the efficiency of our method with favorable comparison in terms of segmentation performances on both standard color and texture datasets. We also show the computational efficiency of NNSC compared to recent texture-aware superpixel methods.

Related papers

• Superpixels algorithms through network community detection [0.0]
  Community detection is a powerful tool from complex networks analysis that finds applications in various research areas. Superpixels aim at representing the image at a smaller level while preserving as much as possible original information. We study the efficiency of superpixels computed by state-of-the-art community detection algorithms on a 4-connected pixel graph.
  arXiv  Detail & Related papers  (2023-08-27T13:13:28Z)
• Image Reconstruction using Superpixel Clustering and Tensor Completion [21.088385725444944]
  Our method divides the image into several regions that capture important textures or semantics and selects a representative pixel from each region to store. We propose two smooth tensor completion algorithms that can effectively reconstruct different types of images from the selected pixels.
  arXiv  Detail & Related papers  (2023-05-16T16:00:48Z)
• Unsupervised Superpixel Generation using Edge-Sparse Embedding [18.92698251515116]
  partitioning an image into superpixels based on the similarity of pixels with respect to features can significantly reduce data complexity and improve subsequent image processing tasks. We propose a non-convolutional image decoder to reduce the expected number of contrasts and enforce smooth, connected edges in the reconstructed image. We generate edge-sparse pixel embeddings by encoding additional spatial information into the piece-wise smooth activation maps from the decoder's last hidden layer and use a standard clustering algorithm to extract high quality superpixels.
  arXiv  Detail & Related papers  (2022-11-28T15:55:05Z)
• Probabilistic Deep Metric Learning for Hyperspectral Image Classification [91.5747859691553]
  This paper proposes a probabilistic deep metric learning framework for hyperspectral image classification. It aims to predict the category of each pixel for an image captured by hyperspectral sensors. Our framework can be readily applied to existing hyperspectral image classification methods.
  arXiv  Detail & Related papers  (2022-11-15T17:57:12Z)
• Efficient Multiscale Object-based Superpixel Framework [62.48475585798724]
  We propose a novel superpixel framework, named Superpixels through Iterative CLEarcutting (SICLE) SICLE exploits object information being able to generate a multiscale segmentation on-the-fly. It generalizes recent superpixel methods, surpassing them and other state-of-the-art approaches in efficiency and effectiveness according to multiple delineation metrics.
  arXiv  Detail & Related papers  (2022-04-07T15:59:38Z)
• Saliency Enhancement using Superpixel Similarity [77.34726150561087]
  Saliency Object Detection (SOD) has several applications in image analysis. Deep-learning-based SOD methods are among the most effective, but they may miss foreground parts with similar colors. We introduce a post-processing method, named textitSaliency Enhancement over Superpixel Similarity (SESS) We demonstrate that SESS can consistently and considerably improve the results of three deep-learning-based SOD methods on five image datasets.
  arXiv  Detail & Related papers  (2021-12-01T17:22:54Z)
• Generating Superpixels for High-resolution Images with Decoupled Patch Calibration [82.21559299694555]
  Patch Networks (PCNet) is designed to efficiently and accurately implement high-resolution superpixel segmentation. DPC takes a local patch from the high-resolution images and dynamically generates a binary mask to impose the network to focus on region boundaries. In particular, DPC takes a local patch from the high-resolution images and dynamically generates a binary mask to impose the network to focus on region boundaries.
  arXiv  Detail & Related papers  (2021-08-19T10:33:05Z)
• Implicit Integration of Superpixel Segmentation into Fully Convolutional Networks [11.696069523681178]
  We propose a way to implicitly integrate a superpixel scheme into CNNs. Our proposed method hierarchically groups pixels at downsampling layers and generates superpixels. We evaluate our method on several tasks such as semantic segmentation, superpixel segmentation, and monocular depth estimation.
  arXiv  Detail & Related papers  (2021-03-05T02:20:26Z)
• AINet: Association Implantation for Superpixel Segmentation [82.21559299694555]
  We propose a novel textbfAssociation textbfImplantation (AI) module to enable the network to explicitly capture the relations between the pixel and its surrounding grids. Our method could not only achieve state-of-the-art performance but maintain satisfactory inference efficiency.
  arXiv  Detail & Related papers  (2021-01-26T10:40:13Z)
• Superpixel Segmentation Based on Spatially Constrained Subspace Clustering [57.76302397774641]
  We consider each representative region with independent semantic information as a subspace, and formulate superpixel segmentation as a subspace clustering problem. We show that a simple integration of superpixel segmentation with the conventional subspace clustering does not effectively work due to the spatial correlation of the pixels. We propose a novel convex locality-constrained subspace clustering model that is able to constrain the spatial adjacent pixels with similar attributes to be clustered into a superpixel.
  arXiv  Detail & Related papers  (2020-12-11T06:18:36Z)
• Multi-Scale Superpatch Matching using Dual Superpixel Descriptors [0.6875312133832078]
  Over-segmentation into superpixels is a very effective dimensionality reduction strategy, enabling fast dense image processing. The inherent irregularity of the image decomposition compared to standard hierarchical multi-resolution schemes is a problem. We introduce the dual superpatch, a novel superpixel neighborhood descriptor.
  arXiv  Detail & Related papers  (2020-03-09T22:04:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.