paper-with-me

Papers

Density-Based Clustering with Kernel Diffusion

2021-10-11 · Chao Zheng, Yingjie Chen, Chong Chen, Jianqiang Huang, Xian-Sheng Hua

Finding a suitable density function is essential for density-based clustering algorithms such as DBSCAN and DPC. A naive density corresponding to the indicator function of a unit $d$-dimensional Euclidean ball is commonly used in these algorithms. Such density suffers from capturing local features in complex datasets. To tackle this issue, we propose a new kernel diffusion density function, which is adaptive to data of varying local distributional characteristics and smoothness. Furthermore, we develop a surrogate that can be efficiently computed in linear time and space and prove that it is asymptotically equivalent to the kernel diffusion density function. Extensive empirical experiments on benchmark and large-scale face image datasets show that the proposed approach not only achieves a significant improvement over classic density-based clustering algorithms but also outperforms the state-of-the-art face clustering methods by a large margin.

📄 PDF Abstract BibTeX arXiv:2110.05096

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringFace Clustering

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Kernel clustering: density biases and solutions

2017-05-16 · Dmitrii Marin, Meng Tang, Ismail Ben Ayed, Yuri Boykov

Kernel methods are popular in clustering due to their generality and discriminating power. However, we show that many kernel clustering criteria have density biases theoretically explaining some practically significant a…

Clustering

Diffusion $K$-means clustering on manifolds: provable exact recovery via semidefinite relaxations

2019-03-11 · Xiaohui Chen, Yun Yang

We introduce the {\it diffusion $K$-means} clustering method on Riemannian submanifolds, which maximizes the within-cluster connectedness based on the diffusion distance. The diffusion $K$-means constructs a random walk …

Clustering

Adaptive Clustering Using Kernel Density Estimators

2017-08-17 · Ingo Steinwart, Bharath K. Sriperumbudur, Philipp Thomann

We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algo…

Clustering

HyperVAttention: Efficient Sparse Attention with Spatio-Temporal Clustering for Video Diffusion

2026-07-03 · Dongyeun Lee, Amir Zandieh, Vahab Mirrokni, Junmo Kim 외 arxiv

Video Diffusion Transformers (VDiTs) have demonstrated significant capabilities in high-fidelity video generation. However, their ability to produce long-duration videos is fundamentally constrained by the quadratic comp…

Text-to-Video Generation

$CrowdDiff$: Multi-hypothesis Crowd Density Estimation using Diffusion Models

2023-03-22 · Yasiru Ranasinghe, Nithin Gopalakrishnan Nair, Wele Gedara Chaminda Bandara, Vishal M. Patel

Crowd counting is a fundamental problem in crowd analysis which is typically accomplished by estimating a crowd density map and summing over the density values. However, this approach suffers from background noise accumu…

Contour DetectionCrowd CountingDensity Estimation