WeChat Mini Program
Old Version Features

MeanShift++: Extremely Fast Mode-Seeking with Applications to Segmentation and Object Tracking

Computer Vision and Pattern Recognition (CVPR)(2021)CCF A

Waymo

Cited 26|Views81
Abstract
MeanShift is a popular mode-seeking clustering algorithm used in a wide range of applications in machine learning. However, it is known to be prohibitively slow, with quadratic runtime per iteration. We propose MeanShift++, an extremely fast mode-seeking algorithm based on MeanShift that uses a grid-based approach to speed up the mean shift step, replacing the computationally expensive neighbors search with a density-weighted mean of adjacent grid cells. In addition, we show that this grid-based technique for density estimation comes with theoretical guarantees. The runtime is linear in the number of points and exponential in dimension, which makes MeanShift++ ideal on low-dimensional applications such as image segmentation and object tracking. We provide extensive experimental analysis showing that MeanShift++ can be more than 10,000x faster than MeanShift with competitive clustering results on benchmark datasets and nearly identical image segmentations as MeanShift. Finally, we show promising results for object tracking.
More
Translated text
Key words
Biased Signaling
PDF
Bibtex
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
  • Pretraining has recently greatly promoted the development of natural language processing (NLP)
  • We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
  • We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
  • The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
  • Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Try using models to generate summary,it takes about 60s
Must-Reading Tree
Example
Using MRT to find the research sequence of this paper
Related Papers

Towards Real-Time Visual Tracking in Mobile Robots

2022 3rd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE) 2022

被引用0

UEQMS: UMAP Embedded Quick Mean Shift Algorithm for High Dimensional Clustering.

THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 7 2023

被引用5

Texture Atlas Compression Based on Repeated Content Removal.

PROCEEDINGS OF THE SIGGRAPH ASIA 2023 CONFERENCE PAPERS 2023

被引用0

High-Speed Parallel Segmentation Algorithms of Meanshift for Litchi Canopies Based on Spark and Hadoop

Hongyi Xiong,Jianhua Wang, Yiming Xiao, Fangjun Xiao, Renhuang Huang, Licong Hong, Bofei Wu, Jinfeng Zhou,Yongbin Long,Yubin Lan
Advances in Complex Systems 2024

被引用0

Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:论文提出了一种名为MeanShift++的快速模式寻找算法,通过基于网格的方法加速MeanShift算法的均值漂移步骤,并在图像分割和目标跟踪等低维应用中展现了显著性能提升。

方法】:MeanShift++算法使用网格化方法代替了计算成本较高的邻域搜索,通过计算相邻网格单元的密度加权均值来加速均值漂移过程,并提供了密度估计的理论保证。

实验】:作者在多个基准数据集上进行了实验,证明了MeanShift++算法在聚类结果上与MeanShift相当,且在图像分割上与MeanShift几乎相同,同时在对象跟踪上展示了有前景的结果。数据集名称未在摘要中提及,但实验结果说明了算法的优越性能。