Constrained Spectral Clustering on Face Annotation System

Face clustering is a common feature in face annotation system like intelligent photo albums and photo management systems. But unsupervised clustering algorithms perform poorly and researchers turn to work with constrained clustering algorithms that take the user interactions as constraints. Mostly, the constraints are pairwise constraints in the form of Must-Link or Cannot-Link, which can be easily integrated in spectral clustering algorithm. In this paper, we propose a design of face annotation system that can generate more informative constraints and better use constraints with constrained spectral clustering. And we examine the system in a lab situation dataset and a real-live dataset, of which results demonstrate the effectiveness of our method.

[1]  Dan Klein,et al.  Spectral Learning , 2003, IJCAI.

[2]  Andy Harter,et al.  Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[3]  Ian Davidson,et al.  Flexible constrained spectral clustering , 2010, KDD.

[4]  Raymond J. Mooney,et al.  Integrating constraints and metric learning in semi-supervised clustering , 2004, ICML.

[5]  Yuandong Tian,et al.  EasyAlbum: an interactive photo annotation system based on face clustering and re-ranking , 2007, CHI.

[6]  Dale Schuurmans,et al.  Fast normalized cut with linear constraints , 2009, CVPR.

[7]  Camille Roth,et al.  Natural Scales in Geographical Patterns , 2017, Scientific Reports.

[8]  Patrick Lambert,et al.  Semi-supervised spectral clustering with automatic propagation of pairwise constraints , 2015, 2015 13th International Workshop on Content-Based Multimedia Indexing (CBMI).

[9]  Fernando De la Torre,et al.  Supervised Descent Method and Its Applications to Face Alignment , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[11]  Myra Spiliopoulou,et al.  C-DBSCAN: Density-Based Clustering with Constraints , 2009, RSFDGrC.

[12]  Xin Liu,et al.  Document clustering based on non-negative matrix factorization , 2003, SIGIR.

[13]  Andrew McCallum,et al.  Semi-Supervised Clustering with User Feedback , 2003 .

[14]  Ian Davidson,et al.  Measuring Constraint-Set Utility for Partitional Clustering Algorithms , 2006, PKDD.

[15]  Andrew Zisserman,et al.  Very Deep Convolutional Networks for Large-Scale Image Recognition , 2014, ICLR.

[16]  Arindam Banerjee,et al.  Semi-supervised Clustering by Seeding , 2002, ICML.

[17]  Zhenguo Li,et al.  Constrained clustering via spectral regularization , 2009, CVPR.

[18]  Claire Cardie,et al.  Proceedings of the Eighteenth International Conference on Machine Learning, 2001, p. 577–584. Constrained K-means Clustering with Background Knowledge , 2022 .

[19]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[20]  Jörg Sander,et al.  Semi-supervised Density-Based Clustering , 2009, 2009 Ninth IEEE International Conference on Data Mining.