In this study, we address the problems encountered by incremental face clustering. Without the benefit of having observed the entire data distribution, incremental face clustering is more challenging than static datas...In this study, we address the problems encountered by incremental face clustering. Without the benefit of having observed the entire data distribution, incremental face clustering is more challenging than static dataset clustering. Conventional methods rely on the statistical information of previous clusters to improve the efficiency of incremental clustering;thus, error accumulation may occur. Therefore, this study proposes to predict the summaries of previous data directly from data distribution via supervised learning. Moreover, an efficient framework to cluster previous summaries with new data is explored. Although learning summaries from original data costs more than those from previous clusters, the entire framework consumes just a little bit more time because clustering current data and generating summaries for new data share most of the calculations. Experiments show that the proposed approach significantly outperforms the existing incremental face clustering methods, as evidenced by the improvement of average F-score from 0.644 to 0.762. Compared with state-of-the-art static face clustering methods, our method can yield comparable accuracy while consuming much less time.展开更多
Over the last fifteen years, face recognition has become a popular area of research in image analysis and one of the most successful applications of machine learning and understanding. To enhance the classification ra...Over the last fifteen years, face recognition has become a popular area of research in image analysis and one of the most successful applications of machine learning and understanding. To enhance the classification rate of the image recognition, several techniques are introduced, modified and combined. The suggested model extracts the features using Fourier-Gabor filter, selects the best features using signal to noise ratio, deletes or modifies anomalous images using fuzzy c-mean clustering, uses kernel least square and optimizes it by using wild dog pack optimization. To compare the suggested method with the previous methods, four datasets are used. The results indicate that the suggested methods without fuzzy clustering and with fuzzy clustering outperform state- of-art methods for all datasets.展开更多
大规模人脸聚类不仅要求高效的人脸特征,还要求聚类算法在保持高准确率的同时耗时短.本文通过构建卷积神经网络高效提取人脸特征,并采用经典K-means算法和现阶段新颖的CFSFDP(Clustering by Fast Search and Find of Density Peaks)算...大规模人脸聚类不仅要求高效的人脸特征,还要求聚类算法在保持高准确率的同时耗时短.本文通过构建卷积神经网络高效提取人脸特征,并采用经典K-means算法和现阶段新颖的CFSFDP(Clustering by Fast Search and Find of Density Peaks)算法进行大规模人脸聚类.实验在聚类数目递增的情况下进行,并通过随机指标(Rand Index,RI)、信息熵、F1-measure和混淆矩阵可视化来综合评估聚类的质量.结果表明,在大规模人脸聚类的情况下,卷积神经网络特征融合K-means的人脸聚类算法速度和准确率均优于CFSFDP算法.这一结论对大规模人脸聚类的实际应用具有重要的指导意义.展开更多
基金supported by the National Natural Science Foundation of China (Nos. 61701277 and 61771288)the State Key Development Program in13th Five-Year (Nos. 2016YFB0801301, 044007008, and 2016YFB1001005)supported by the National Engineering Laboratory for Intelligent Video Analysis and Application of China。
文摘In this study, we address the problems encountered by incremental face clustering. Without the benefit of having observed the entire data distribution, incremental face clustering is more challenging than static dataset clustering. Conventional methods rely on the statistical information of previous clusters to improve the efficiency of incremental clustering;thus, error accumulation may occur. Therefore, this study proposes to predict the summaries of previous data directly from data distribution via supervised learning. Moreover, an efficient framework to cluster previous summaries with new data is explored. Although learning summaries from original data costs more than those from previous clusters, the entire framework consumes just a little bit more time because clustering current data and generating summaries for new data share most of the calculations. Experiments show that the proposed approach significantly outperforms the existing incremental face clustering methods, as evidenced by the improvement of average F-score from 0.644 to 0.762. Compared with state-of-the-art static face clustering methods, our method can yield comparable accuracy while consuming much less time.
文摘Over the last fifteen years, face recognition has become a popular area of research in image analysis and one of the most successful applications of machine learning and understanding. To enhance the classification rate of the image recognition, several techniques are introduced, modified and combined. The suggested model extracts the features using Fourier-Gabor filter, selects the best features using signal to noise ratio, deletes or modifies anomalous images using fuzzy c-mean clustering, uses kernel least square and optimizes it by using wild dog pack optimization. To compare the suggested method with the previous methods, four datasets are used. The results indicate that the suggested methods without fuzzy clustering and with fuzzy clustering outperform state- of-art methods for all datasets.
文摘大规模人脸聚类不仅要求高效的人脸特征,还要求聚类算法在保持高准确率的同时耗时短.本文通过构建卷积神经网络高效提取人脸特征,并采用经典K-means算法和现阶段新颖的CFSFDP(Clustering by Fast Search and Find of Density Peaks)算法进行大规模人脸聚类.实验在聚类数目递增的情况下进行,并通过随机指标(Rand Index,RI)、信息熵、F1-measure和混淆矩阵可视化来综合评估聚类的质量.结果表明,在大规模人脸聚类的情况下,卷积神经网络特征融合K-means的人脸聚类算法速度和准确率均优于CFSFDP算法.这一结论对大规模人脸聚类的实际应用具有重要的指导意义.
