A rank-order distance based clustering algorithm for face tagging

@article{Zhu2011ARD,
  title={A rank-order distance based clustering algorithm for face tagging},
  author={Chunhui Zhu and Fang Wen and Jian Sun},
  journal={CVPR 2011},
  year={2011},
  pages={481-488}
}
We present a novel clustering algorithm for tagging a face dataset (e. g., a personal photo album). The core of the algorithm is a new dissimilarity, called Rank-Order distance, which measures the dissimilarity between two faces using their neighboring information in the dataset. The Rank-Order distance is motivated by an observation that faces of the same person usually share their top neighbors. Specifically, for each face, we generate a ranking order list by sorting all other faces in the… Expand
Face Clustering: Representation and Pairwise Constraints
TLDR
A clustering algorithm, Conditional Pairwise Clustering (ConPaC), which directly estimates the adjacency matrix only based on the similarities between face images, and can naturally incorporate pairwise constraints to work in a semi-supervised way that leads to improved clustering performance. Expand
A Proximity-Aware Hierarchical Clustering of Faces
TLDR
An unsupervised face clustering algorithm called “Proximity-Aware Hierarchical Clustering” (PAHC) that exploits the local structure of deep representations that can be applied to curate a set of large-scale and noisy training dataset while maintaining sufficient amount of images and their variations due to nuisance factors. Expand
Proximity-Aware Hierarchical Clustering of unconstrained faces
TLDR
The proposedPAHC clustering algorithm has the potential to be applied to actively learn robust deep face representations by first harvesting sufficient number of unseen face images through curation of large-scale dataset, e.g. the MS-Celeb-1 M dataset. Expand
A Graph Based Unsupervised Feature Aggregation for Face Recognition
TLDR
This paper proposes a graph-based unsupervised feature aggregation method for face recognition that uses the inter-connection between pairs with a directed graph approach to refine the pair-wise scores. Expand
Clustering Millions of Faces by Identity
TLDR
An approximate Rank-Order clustering algorithm is presented that performs better than popular clustering algorithms (k-Means and Spectral) and an internal per-cluster quality measure is developed to rank individual clusters for manual exploration of high quality clusters that are compact and isolated. Expand
Cluster Optimization using Appropriate Nearest Neighbour
In this postulation, presents the clustering of facial images using machine learning algorithm such as nearest neighbor and approximate rank order clustering. Clustering is a technique forExpand
Rank Pooling for Image set Based Face Recognition
TLDR
This paper builds on a robust feature embedding network which maximizes the clustering coefficient in the embedding space and uses a novel rank pooling algorithm to infer the identity of a person from an image set to improve recognition accuracy. Expand
Linkage Based Face Clustering via Graph Convolution Network
TLDR
This paper presents an accurate and scalable approach to the face clustering task, and shows that the proposed method does not need the number of clusters as prior, is aware of noises and outliers, and can be extended to a multi-view version for more accurate clustering accuracy. Expand
Combining Feature Extraction and Clustering for Better Face Recognition
  • S. Afra, R. Alhajj
  • Computer Science
  • Social Network Based Big Data Analysis and Applications
  • 2018
TLDR
Experimental results show the effectiveness of Rank Order clustering in terms of accuracy for small datasets while its run time performance degrades for larger datasets, and OpenFace performed the best in describing face images, especially on large datasets compared to other feature extraction techniques. Expand
Learning to Cluster Faces via Transformer
TLDR
In this paper, the well-known Transformer is repurpose and introduced a Face Transformer for supervised face clustering and can generate more robust node and edge representations compared to existing methods. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Locally Linear Models on Face Appearance Manifolds with Application to Dual-Subspace Based Classification
  • Wei-liang Fan, D. Yeung
  • Computer Science
  • 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)
  • 2006
TLDR
This paper proposes a novel nonparametric method that first extracts discriminating local models via clustering according to some distance measure on the appearance manifold to cluster similar face images together and shows that out method significantly outperforms other methods. Expand
Face recognition based on image sets
  • Hakan Cevikalp, B. Triggs
  • Mathematics, Computer Science
  • 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 2010
TLDR
A novel method for face recognition from image sets that combines kernel trick and robust methods to discard input points that are far from the fitted model, thus handling complex and nonlinear manifolds of face images. Expand
Face recognition with learning-based descriptor
  • Zhimin Cao, Qi Yin, Xiaoou Tang, Jian Sun
  • Mathematics, Computer Science
  • 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 2010
TLDR
This work proposes a pose-adaptive matching method that uses pose-specific classifiers to deal with different pose combinations of the matching face pair, and finds that a simple normalization mechanism after PCA can further improve the discriminative ability of the descriptor. Expand
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
TLDR
A novel clustering technique that addresses problems with varying densities and high dimensionality, while the use of core points handles problems with shape and size, and a number of optimizations that allow the algorithm to handle large data sets are discussed. Expand
A Face Annotation Framework with Partial Clustering and Interactive Labeling
TLDR
Experimental results show that the proposed annotation framework can significantly reduce the face annotation workload and is superior to existing solutions in the literature. Expand
CURE: an efficient clustering algorithm for large databases
TLDR
This work proposes a new clustering algorithm called CURE that is more robust to outliers, and identifies clusters having non-spherical shapes and wide variances in size, and demonstrates that random sampling and partitioning enable CURE to not only outperform existing algorithms but also to scale well for large databases without sacrificing clustering quality. Expand
Which faces to tag: Adding prior constraints into active learning
TLDR
An algorithm is introduced that guides the user to tag faces in the best possible order during a face recognition assisted tagging scenario using a probabilistic discriminative model that models the posterior distributions by propagating label information using a message passing scheme. Expand
Cure: An Efficient Clustering Algorithm for Large Databases
TLDR
It is demonstrated that random sampling and partitioning enable CURE to not only outperform existing algorithms but also to scale well for large databases without sacrificing clustering quality. Expand
Manifold-Manifold Distance with application to face recognition based on image set
TLDR
The proposed MMD method outperforms the competing methods on the task of Face Recognition based on Image Set, and a novel manifold learning approach is proposed, which expresses a manifold by a collection of local linear models, each depicted by a subspace. Expand
Automated annotation of human faces in family albums
TLDR
The experimental evaluation has been conducted within a family album of few thousands of photographs and the results show that the proposed approach is effective and efficient in automated face annotation in family albums. Expand
...
1
2
3
...