3260 papers • 126 benchmarks • 313 datasets
Models that learn to label each image (i.e. cluster the dataset into its ground truth classes) without seeing the ground truth labels. Under the online scenario, data is in the form of streams, i.e., the whole dataset could not be accessed at the same time and the model should be able to make cluster assignments for new data without accessing the former data. Image Credit: Online Clustering by Penalized Weighted GMM
(Image credit: Papersgraph)
These leaderboards are used to track progress in online-clustering-5
No benchmarks available.
Use these libraries to find online-clustering-5 models and implementations
No datasets available.
No subtasks available.
We address the problem of face clustering in long, real world videos. This is a challenging task because faces in such videos exhibit wide variability in scale, pose, illumination, expressions, and may also be partially occluded. The majority of the existing face clustering algorithms are offline, i.e., they assume the availability of the entire data at once. However, in many practical scenarios, complete data may not be available at the same time or may be too large to process or may exhibit significant variation in the data distribution over time. We propose an online clustering algorithm that processes data sequentially in short segments of variable length. The faces detected in each segment are either assigned to an existing cluster or are used to create a new one. Our algorithm uses several spatiotemporal constraints, and a convolutional neural network (CNN) to obtain a robust representation of the faces in order to achieve high clustering accuracy on two benchmark video databases (82.1 % and 93.8%). Despite being an online method (usually known to have lower accuracy), our algorithm achieves comparable or better results than state-of-the-art offline and online methods.
It is found that when the data is projected into a feature space with a dimensionality of the target cluster number, the rows and columns of its feature matrix correspond to the instance and cluster representation, respectively.
This work proposes a Cross-view consistency objective with an Online Clustering mechanism (CrOC) to discover and segment the semantics of the views, thereby elegantly bypassing the issue of content not represented in both views and the ambiguous matching of objects from one crop to the other.
A novel algorithm, called Links, designed to perform online clustering on unit vectors in a high-dimensional Euclidean space is presented, which has been successfully applied to embedding vectors generated from face images or voice recordings for the purpose of recognizing people.
We consider an online decision making setting known as contextual bandit problem, and propose an approach for improving contextual bandit performance by using an adaptive feature extraction (representation learning) based on online clustering. Our approach starts with an off-line pre-training on unlabeled history of contexts (which can be exploited by our approach, but not by the standard contextual bandit), followed by an online selection and adaptation of encoders. Specifically, given an input sample (context), the proposed approach selects the most appropriate encoding function to extract a feature vector which becomes an input for a contextual bandit, and updates both the bandit and the encoding function based on the context and on the feedback (reward). Our experiments on a variety of datasets, and both in stationary and non-stationary environments of several kinds demonstrate clear advantages of the proposed adaptive representation learning over the standard contextual bandit based on "raw" input contexts.
An effective and unsupervised face Re-ID system which simultaneously re-identifies multiple faces for HRI is presented which employs Deep Convolutional Neural Networks to extract features, and an online clustering algorithm to determine the face's ID.
The Self-Taught Associative Memory (STAM) architecture is proposed, and two recent continual learning models, Memory Aware Synapses and Gradient Episodic Memories (GEM), are compared after adapting them in the UPL setting.
A new dynamic online k-means algorithm is proposed that is both computationally-efficient and yields significantly better performance at smaller memory sizes; this approach is validated on classic reinforcement learning environments and Atari games.
An online clustering method called Contrastive Clustering (CC) which explicitly performs the instance- and cluster-level contrastive learning and jointly learns representations and cluster assignments in an end-to-end manner is proposed.
A group-aware Label Transfer (GLT) algorithm is proposed, which enables the online interaction and mutual promotion of pseudo-label prediction and representation learning and can better correct the noisy pseudo label in an online fashion and narrow down the search space of the target identity.
Adding a benchmark result helps the community track progress.