论文标题
进行后处理人员重新识别的进行性双边式驱动模型
Progressive Bilateral-Context Driven Model for Post-Processing Person Re-Identification
论文作者
论文摘要
大多数现有的人重新识别方法通过提取强大的视觉特征并学习判别性指标来计算成对相似性。由于视觉歧义,这些基于内容的方法仅基于它们之间的相似性来决定成对关系,因此不可避免地会产生次优的排名列表。取而代之的是,通过探索样本的丰富上下文信息,可以沿着基础数据歧管的地质路径更准确地估计成对相似性。在本文中,我们提出了一种轻巧的后处理人员重新识别方法,其中成对度量由样本与对应物的上下文之间的关系以一种无监督的方式确定。我们将点对点比较转换为双侧点对点比较。样本的上下文由其邻居样本组成,具有两种不同的定义方式:一阶上下文和第二阶上下文,用于计算顺序的成对相似性,从而导致渐进的后处理模型。对四个大尺度人重新识别基准数据集进行的实验表明,(1)通过用作基于内容的人重新识别方法的后处理程序,可以始终如一地实现更高的精度,显示出其最先进的结果,(2)提出的轻量级方法仅需要6毫米效率,以最大程度地将较高的效率效果效果,以最大程度地效果一个效果。代码可在以下网址提供:https://github.com/123ci/pbcmodel。
Most existing person re-identification methods compute pairwise similarity by extracting robust visual features and learning the discriminative metric. Owing to visual ambiguities, these content-based methods that determine the pairwise relationship only based on the similarity between them, inevitably produce a suboptimal ranking list. Instead, the pairwise similarity can be estimated more accurately along the geodesic path of the underlying data manifold by exploring the rich contextual information of the sample. In this paper, we propose a lightweight post-processing person re-identification method in which the pairwise measure is determined by the relationship between the sample and the counterpart's context in an unsupervised way. We translate the point-to-point comparison into the bilateral point-to-set comparison. The sample's context is composed of its neighbor samples with two different definition ways: the first order context and the second order context, which are used to compute the pairwise similarity in sequence, resulting in a progressive post-processing model. The experiments on four large-scale person re-identification benchmark datasets indicate that (1) the proposed method can consistently achieve higher accuracies by serving as a post-processing procedure after the content-based person re-identification methods, showing its state-of-the-art results, (2) the proposed lightweight method only needs about 6 milliseconds for optimizing the ranking results of one sample, showing its high-efficiency. Code is available at: https://github.com/123ci/PBCmodel.