SVDNet for Pedestrian Retrieval

2017 IEEE International Conference on Computer Vision (ICCV)(2017)

引用 926|浏览222
暂无评分
摘要
This paper proposes the SVDNet for retrieval problems, with focus on the application of person re-identification (re-ID). We view each weight vector within a fully connected (FC) layer in a convolutional neuron network (CNN) as a projection basis. It is observed that the weight vectors are usually highly correlated. This problem leads to correlations among entries of the FC descriptor, and compromises the retrieval performance based on the Euclidean distance. To address the problem, this paper proposes to optimize the deep representation learning process with Singular Vector Decomposition (SVD). Specifically, with the restraint and relaxation iteration (RRI) training scheme, we are able to iteratively integrate the orthogonality constraint in CNN training, yielding the so-called SVDNet. We conduct experiments on the Market-1501, CUHK03, and Duke datasets, and show that RRI effectively reduces the correlation among the projection vectors, produces more discriminative FC descriptors, and significantly improves the re-ID accuracy. On the Market-1501 dataset, for instance, rank-1 accuracy is improved from 55.3% to 80.5% for CaffeNet, and from 73.8% to 82.3% for ResNet-50.
更多
查看译文
关键词
discriminative FC descriptors,projection vectors,DukeMTMC-reID datasets,CNN training,RRI,Singular Vector Decomposition,deep representation learning process,Euclidean distance,retrieval performance,FC descriptor,projection basis,convolutional neuron network,fully connected layer,weight vector,person re-identification,retrieval problems,pedestrian retrieval,SVDNet,Market-1501 dataset
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要