Super-BPD: Super Boundary-to-Pixel Direction for Fast Image Segmentation

• URL: http://arxiv.org/abs/2006.00303v1
• Date: Sat, 30 May 2020 16:00:54 GMT
• Title: Super-BPD: Super Boundary-to-Pixel Direction for Fast Image Segmentation
• Authors: Jianqiang Wan, Yang Liu, Donglai Wei, Xiang Bai, Yongchao Xu
• Abstract summary: We propose a fast image segmentation method based on a novel super boundary-to-pixel direction (super-BPD) In the BPD, nearby pixels from different regions have opposite directions departing from each other, and adjacent pixels in the same region have directions pointing to the other or each other. We make use of such property to partition an image into super-BPDs, which are novel informative superpixels with robust direction similarity for fast grouping into segmentation regions.
• Score: 60.72044848490725
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Image segmentation is a fundamental vision task and a crucial step for many applications. In this paper, we propose a fast image segmentation method based on a novel super boundary-to-pixel direction (super-BPD) and a customized segmentation algorithm with super-BPD. Precisely, we define BPD on each pixel as a two-dimensional unit vector pointing from its nearest boundary to the pixel. In the BPD, nearby pixels from different regions have opposite directions departing from each other, and adjacent pixels in the same region have directions pointing to the other or each other (i.e., around medial points). We make use of such property to partition an image into super-BPDs, which are novel informative superpixels with robust direction similarity for fast grouping into segmentation regions. Extensive experimental results on BSDS500 and Pascal Context demonstrate the accuracy and efficency of the proposed super-BPD in segmenting images. In practice, the proposed super-BPD achieves comparable or superior performance with MCG while running at ~25fps vs. 0.07fps. Super-BPD also exhibits a noteworthy transferability to unseen scenes. The code is publicly available at https://github.com/JianqiangWan/Super-BPD.

Related papers

• Object Segmentation-Assisted Inter Prediction for Versatile Video Coding [53.91821712591901]
  We propose an object segmentation-assisted inter prediction method (SAIP), where objects in the reference frames are segmented by some advanced technologies. With a proper indication, the object segmentation mask is translated from the reference frame to the current frame as the arbitrary-shaped partition of different regions. We show that the proposed method achieves up to 1.98%, 1.14%, 0.79%, and on average 0.82%, 0.49%, 0.37% BD-rate reduction for common test sequences.
  arXiv  Detail & Related papers  (2024-03-18T11:48:20Z)
• Adaptive Superpixel for Active Learning in Semantic Segmentation [34.0733215363568]
  We propose a superpixel-based active learning framework, which collects a dominant label per superpixel instead of pixel-wise annotations. Obtaining a dominant label per superpixel drastically reduces annotators' burden as it requires fewer clicks. We also devise a sieving mechanism that identifies and excludes potentially noisy annotations from learning.
  arXiv  Detail & Related papers  (2023-03-29T16:07:06Z)
• 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)
• SIN:Superpixel Interpolation Network [9.046310874823002]
  Traditional algorithms and deep learning-based algorithms are two main streams in superpixel segmentation. In this paper, we propose a deep learning-based superpixel segmentation algorithm SIN which can be integrated with downstream tasks in an end-to-end way.
  arXiv  Detail & Related papers  (2021-10-17T02:21:11Z)
• HERS Superpixels: Deep Affinity Learning for Hierarchical Entropy Rate Segmentation [0.0]
  We propose a two-stage graph-based framework for superpixel segmentation. In the first stage, we introduce an efficient Deep Affinity Learning network that learns pairwise pixel affinities. In the second stage, we propose a highly efficient superpixel method called Hierarchical Entropy Rate (HERS)
  arXiv  Detail & Related papers  (2021-06-07T16:20:04Z)
• Deep Superpixel Cut for Unsupervised Image Segmentation [0.9281671380673306]
  We propose a deep unsupervised method for image segmentation, which contains the following two stages. First, a Superpixelwise Autoencoder (SuperAE) is designed to learn the deep embedding and reconstruct a smoothed image, then the smoothed image is passed to generate superpixels. Second, we present a novel clustering algorithm called Deep Superpixel Cut (DSC), which measures the deep similarity between superpixels and formulates image segmentation as a soft partitioning problem.
  arXiv  Detail & Related papers  (2021-03-10T13:07:41Z)
• 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)
• Dual Pixel Exploration: Simultaneous Depth Estimation and Image Restoration [77.1056200937214]
  We study the formation of the DP pair which links the blur and the depth information. We propose an end-to-end DDDNet (DP-based Depth and De Network) to jointly estimate the depth and restore the image.
  arXiv  Detail & Related papers  (2020-12-01T06:53:57Z)
• SegFix: Model-Agnostic Boundary Refinement for Segmentation [75.58050758615316]
  We present a model-agnostic post-processing scheme to improve the boundary quality for the segmentation result that is generated by any existing segmentation model. Motivated by the empirical observation that the label predictions of interior pixels are more reliable, we propose to replace the originally unreliable predictions of boundary pixels by the predictions of interior pixels.
  arXiv  Detail & Related papers  (2020-07-08T17:08:08Z)
• Superpixel Segmentation using Dynamic and Iterative Spanning Forest [0.0]
  We present Dynamic ISF (DISF) -- a method based on the following steps. As compared to other seed-based superpixel methods, DISF is more likely to find relevant seeds. It also introduces dynamic arc-weight estimation in the ISF framework for more effective superpixel delineation.
  arXiv  Detail & Related papers  (2020-07-08T16:46:58Z)

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.