返回
An Efficient Density-based clustering algorithm for face groping
DOI:10.1016/j.neucom.2021.07.074.png)
摘要
En 中文
This paper focuses on the following problem: Given a large number of unlabeled face images, group them into individual clusters, and the number of clusters cannot be known in advance. To this end, an Efficient Density-based clustering incorporated with the model of Graph partitioning (EDG) is proposed. 1. Inspired by the progress of graph partitioning clustering, a novel criterion that can be seen as a variant of the Normalized-cut model is employed to measure the similarity between two samples. 2. We only consider the similarities and connections on a subset of all possible pairs, i.e. the top-K nearest neighbors for each sample. Therefore, the computing and storage costs are linear w.r.t. the number of samples. In order to assess the performance of EDG on face images, extensive experiments based on a two-stage framework have been conducted on 19 benchmark datasets (14 middle-scale and 5 large-scale) from the literature. The experimental results have shown the effectiveness and robustness of our model, com-pared with the state-of-the-art methods. [code] (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Fast clustering
Linkage-based
Density-based
Graph partitioning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density EstimatesRnn-dbscan: 使用反向最近邻密度估计的基于密度的聚类算法
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
Deep Expectation of Real and Apparent Age from a Single Image Without Facial Landmarks从没有面部标志的单个图像对真实年龄和表观年龄的深刻期望
Perfluorohexyloctane Eye Drops for Dry Eye Disease Associated With Meibomian Gland Dysfunction in Chinese Patients全氟己基辛烷滴眼液治疗中国患者与睑板腺功能障碍相关的干眼病
An Improved DBSCAN Algorithm Based on the Neighbor Similarity and Fast Nearest Neighbor Query
IEEE ACCESS
IF3.6

