人工智能
聚类分析
无监督学习
模式识别(心理学)
计算机科学
特征(语言学)
特征学习
特征向量
完整的链接聚类
人工神经网络
机器学习
相关聚类
树冠聚类算法
语言学
哲学
作者
Yi Zheng,Yong Zhou,Jiaqi Zhao,Ying Chen,Rui Yao,Bing Liu,Abdulmotaleb El Saddik
摘要
In person re-identification (Re-ID) , the data annotation cost of supervised learning, is huge and it cannot adapt well to complex situations. Therefore, compared with supervised deep learning methods, unsupervised methods are more in line with actual needs. In unsupervised learning, a key to solving Re-ID is to find a standard that can effectively distinguish the difference (distance) between the features of images belonging to different pedestrian identities. However, there are some differences in the images captured by different cameras (such as brightness, angle, etc.). It is well known that the training of neural networks is mainly based on the distance between features, while in unsupervised learning, especially in unsupervised learning methods based on hierarchical clustering, the distance between features plays a more important role in the clustering phase. We improve the accuracy of a deep learning method based on hierarchical clustering under fully unsupervised conditions, starting from both feature and distance metrics. First, we propose to use spherical features, by normalizing the images in the feature space, to weaken the structural differences (length) between features, while saving the feature differences (direction) between different identities. Then, we use the sum of squared errors (SSE) as a regularization term to balance different cluster states. We evaluate our method on four large-scale Re-ID datasets, and experiments show that our method achieves better results than the state-of-the-art unsupervised methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI