GridShift: A Faster Mode-seeking Algorithm for Image Segmentation and Object Tracking

• URL: http://arxiv.org/abs/2206.02200v1
• Date: Sun, 5 Jun 2022 15:08:34 GMT
• Title: GridShift: A Faster Mode-seeking Algorithm for Image Segmentation and Object Tracking
• Authors: Abhishek Kumar, Oladayo S. Ajani, Swagatam Das, and Rammohan Mallipeddi
• Abstract summary: Mean shift (MS) is a popular mode-seeking algorithm for clustering and image segmentation. GridShift employs a grid-based approach for neighbor search, which is linear in the number of data points. The runtime of GridShift is linear in the number of active grid cells and exponential in the number of features.
• Score: 22.899276998185716
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In machine learning and computer vision, mean shift (MS) qualifies as one of the most popular mode-seeking algorithms used for clustering and image segmentation. It iteratively moves each data point to the weighted mean of its neighborhood data points. The computational cost required to find the neighbors of each data point is quadratic to the number of data points. Consequently, the vanilla MS appears to be very slow for large-scale datasets. To address this issue, we propose a mode-seeking algorithm called GridShift, with significant speedup and principally based on MS. To accelerate, GridShift employs a grid-based approach for neighbor search, which is linear in the number of data points. In addition, GridShift moves the active grid cells (grid cells associated with at least one data point) in place of data points towards the higher density, a step that provides more speedup. The runtime of GridShift is linear in the number of active grid cells and exponential in the number of features. Therefore, it is ideal for large-scale low-dimensional applications such as object tracking and image segmentation. Through extensive experiments, we showcase the superior performance of GridShift compared to other MS-based as well as state-of-the-art algorithms in terms of accuracy and runtime on benchmark datasets for image segmentation. Finally, we provide a new object-tracking algorithm based on GridShift and show promising results for object tracking compared to CamShift and meanshift++.

Related papers

• GridPull: Towards Scalability in Learning Implicit Representations from 3D Point Clouds [60.27217859189727]
  We propose GridPull to improve the efficiency of learning implicit representations from large scale point clouds. Our novelty lies in the fast inference of a discrete distance field defined on grids without using any neural components. We use uniform grids for a fast grid search to localize sampled queries, and organize surface points in a tree structure to speed up the calculation of distances to the surface.
  arXiv  Detail & Related papers  (2023-08-25T04:52:52Z)
• Large-Scale Multi-Hypotheses Cell Tracking Using Ultrametric Contours Maps [1.015920567871904]
  We describe a method for large-scale 3D cell-tracking through a segmentation selection approach. We show that this method achieves state-of-the-art results in 3D images from the cell tracking challenge. Our framework is flexible and supports segmentations from off-the-shelf cell segmentation models.
  arXiv  Detail & Related papers  (2023-08-08T18:41:38Z)
• HPointLoc: Point-based Indoor Place Recognition using Synthetic RGB-D Images [58.720142291102135]
  We present a novel dataset named as HPointLoc, specially designed for exploring capabilities of visual place recognition in indoor environment. The dataset is based on the popular Habitat simulator, in which it is possible to generate indoor scenes using both own sensor data and open datasets.
  arXiv  Detail & Related papers  (2022-12-30T12:20:56Z)
• CloudAttention: Efficient Multi-Scale Attention Scheme For 3D Point Cloud Learning [81.85951026033787]
  We set transformers in this work and incorporate them into a hierarchical framework for shape classification and part and scene segmentation. We also compute efficient and dynamic global cross attentions by leveraging sampling and grouping at each iteration. The proposed hierarchical model achieves state-of-the-art shape classification in mean accuracy and yields results on par with the previous segmentation methods.
  arXiv  Detail & Related papers  (2022-07-31T21:39:15Z)
• GPU-accelerated Faster Mean Shift with euclidean distance metrics [1.3507758562554621]
  Mean-shift algorithm is widely used to solve clustering problems. In previous research, we proposed a novel GPU-accelerated Faster Mean-shift algorithm. In this study, we extend and improve the previous algorithm to handle Euclidean distance metrics.
  arXiv  Detail & Related papers  (2021-12-27T20:18:24Z)
• MeanShift++: Extremely Fast Mode-Seeking With Applications to Segmentation and Object Tracking [40.662116703422846]
  MeanShift is a popular mode-seeking clustering algorithm used in a wide range of applications in machine learning. We propose MeanShift++, which uses a grid-based approach to speed up the mean shift step. The runtime is linear in the number of points and exponential in dimension, which makes MeanShift++ ideal on low-dimensional applications.
  arXiv  Detail & Related papers  (2021-04-01T07:14:11Z)
• SALA: Soft Assignment Local Aggregation for Parameter Efficient 3D Semantic Segmentation [65.96170587706148]
  We focus on designing a point local aggregation function that yields parameter efficient networks for 3D point cloud semantic segmentation. We explore the idea of using learnable neighbor-to-grid soft assignment in grid-based aggregation functions.
  arXiv  Detail & Related papers  (2020-12-29T20:16:37Z)
• Faster Mean-shift: GPU-accelerated clustering for cosine embedding-based cell segmentation and tracking [12.60841328582138]
  We propose a novel Faster Mean-shift algorithm, which tackles the computational bottleneck of embedding based cell segmentation and tracking. The proposed Faster Mean-shift algorithm achieved 7-10 times speedup compared to the state-of-the-art embedding based cell instance segmentation and tracking algorithm. Our Faster Mean-shift algorithm also achieved the highest computational speed compared to other GPU benchmarks with optimized memory consumption.
  arXiv  Detail & Related papers  (2020-07-28T14:52:51Z)
• Exploiting Multi-Layer Grid Maps for Surround-View Semantic Segmentation of Sparse LiDAR Data [2.6876976011647145]
  We consider the transformation of laser range measurements into a top-view grid map representation to approach the task of LiDAR-only semantic segmentation. We are exploiting a grid map framework to extract relevant information and represent them by using multi-layer grid maps. We compare single-layer and multi-layer approaches and demonstrate the benefit of a multi-layer grid map input.
  arXiv  Detail & Related papers  (2020-05-13T23:50:34Z)
• Real-Time High-Performance Semantic Image Segmentation of Urban Street Scenes [98.65457534223539]
  We propose a real-time high-performance DCNN-based method for robust semantic segmentation of urban street scenes. The proposed method achieves the accuracy of 73.6% and 68.0% mean Intersection over Union (mIoU) with the inference speed of 51.0 fps and 39.3 fps.
  arXiv  Detail & Related papers  (2020-03-11T08:45:53Z)

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.