A Distributed Approximate Nearest Neighbor Method for Real-Time Face Recognition

• URL: http://arxiv.org/abs/2005.05824v2
• Date: Thu, 27 Aug 2020 22:14:18 GMT
• Title: A Distributed Approximate Nearest Neighbor Method for Real-Time Face Recognition
• Authors: Aysan Aghazadeh, Maryam Amirmazlaghani
• Abstract summary: This paper proposes a distributed approximate nearest neighbor (ANN) method for real-time face recognition using a big dataset. The proposed approach is based on using a clustering method to separate the dataset into different clusters and on specifying the importance of each cluster. Experimental results confirm the efficiency of the proposed method and its out-performance in terms of accuracy and the processing time.
• Score: 2.8935588665357077
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nowadays, face recognition and more generally image recognition have many applications in the modern world and are widely used in our daily tasks. This paper aims to propose a distributed approximate nearest neighbor (ANN) method for real-time face recognition using a big dataset that involves a lot of classes. The proposed approach is based on using a clustering method to separate the dataset into different clusters and on specifying the importance of each cluster by defining cluster weights. To this end, reference instances are selected from each cluster based on the cluster weights using a maximum likelihood approach. This process leads to a more informed selection of instances, so it enhances the performance of the algorithm. Experimental results confirm the efficiency of the proposed method and its out-performance in terms of accuracy and the processing time.

Related papers

• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology [0.0]
  Time-series clustering serves as a powerful data mining technique for time-series data in the absence of prior knowledge about clusters. This study proposes a novel time-series clustering method that leverages an annealing machine.
  arXiv  Detail & Related papers  (2023-05-26T05:58:14Z)
• Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentation [65.268245109828]
  Online deep clustering refers to the joint use of a feature extraction network and a clustering model to assign cluster labels to each new data point or batch as it is processed. While faster and more versatile than offline methods, online clustering can easily reach the collapsed solution where the encoder maps all inputs to the same point and all are put into a single cluster. We propose a method that does not require data augmentation, and that, differently from existing methods, regularizes the hard assignments.
  arXiv  Detail & Related papers  (2023-03-29T08:23:26Z)
• A One-shot Framework for Distributed Clustered Learning in Heterogeneous Environments [54.172993875654015]
  The paper proposes a family of communication efficient methods for distributed learning in heterogeneous environments. One-shot approach, based on local computations at the users and a clustering based aggregation step at the server is shown to provide strong learning guarantees. For strongly convex problems it is shown that, as long as the number of data points per user is above a threshold, the proposed approach achieves order-optimal mean-squared error rates in terms of the sample size.
  arXiv  Detail & Related papers  (2022-09-22T09:04:10Z)
• On Mitigating Hard Clusters for Face Clustering [48.39472979642971]
  Face clustering is a promising way to scale up face recognition systems using large-scale unlabeled face images. We introduce two novel modules, Neighborhood-Diffusion-based Density (NDDe) and Transition-Probability-based Distance (TPDi) Our experiments on multiple benchmarks show that each module contributes to the final performance of our method.
  arXiv  Detail & Related papers  (2022-07-25T03:55:15Z)
• Learn to Cluster Faces via Pairwise Classification [8.42777116250725]
  Face clustering plays an essential role in exploiting massive unlabeled face data. We formulate the face clustering task as a pairwise relationship classification task, avoiding the memory-consuming learning on large-scale graphs. Our method achieves state-of-the-art performances on several public clustering benchmarks at the fastest speed.
  arXiv  Detail & Related papers  (2022-05-26T02:50:32Z)
• Anomaly Clustering: Grouping Images into Coherent Clusters of Anomaly Types [60.45942774425782]
  We introduce anomaly clustering, whose goal is to group data into coherent clusters of anomaly types. This is different from anomaly detection, whose goal is to divide anomalies from normal data. We present a simple yet effective clustering framework using a patch-based pretrained deep embeddings and off-the-shelf clustering methods.
  arXiv  Detail & Related papers  (2021-12-21T23:11:33Z)
• Clustering Plotted Data by Image Segmentation [12.443102864446223]
  Clustering algorithms are one of the main analytical methods to detect patterns in unlabeled data. In this paper, we present a wholly different way of clustering points in 2-dimensional space, inspired by how humans cluster data. Our approach, Visual Clustering, has several advantages over traditional clustering algorithms.
  arXiv  Detail & Related papers  (2021-10-06T06:19:30Z)
• Learning the Precise Feature for Cluster Assignment [39.320210567860485]
  We propose a framework which integrates representation learning and clustering into a single pipeline for the first time. The proposed framework exploits the powerful ability of recently developed generative models for learning intrinsic features. Experimental results show that the performance of the proposed method is superior, or at least comparable to, the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-11T04:08:54Z)
• Efficient Large-Scale Face Clustering Using an Online Mixture of Gaussians [1.3101369903953806]
  We present an online gaussian mixture-based clustering method (OGMC) for large-scale online face clustering. Using feature vectors (f-vectors) extracted from the incoming faces, OGMC generates clusters that may be connected to others depending on their proximity and robustness. Experimental results show that the proposed approach outperforms state-of-the-art clustering methods on large-scale face clustering benchmarks.
  arXiv  Detail & Related papers  (2021-03-31T17:59:38Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)

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.