Pith. sign in

REVIEW 3 major objections 5 minor 53 references

Second-order Non-local Attention Networks for Person Re-identification

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Person re-identification improves when a covariance matrix of feature-map positions is used as an attention map, allowing distant body parts to be correlated without explicit part partitions.

desk verdict SONA-Net reports competitive re-ID numbers, but the core attention module is likely a global-context residual due to double normalization, not second-order non-local attention. read the letter →

arxiv 1909.00295 v1 pith:BJFKXD4O submitted 2019-08-31 cs.CV cs.AIcs.LG

Bryan (Ning) Xia , Yuan Gong , Yizhe Zhang , Christian Poellabauer This is my paper · ORCID
classification cs.CVcs.AIcs.LG
keywords personre-identificationnon-localattentionsecond-orderstatisticscovariancematrixDropBlockdilatedResNet50part-basedmodelssurveillance
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Person re-identification—matching the same person across different cameras—often fails when the network only looks at rigidly divided image parts. This paper argues that a network can do better by directly modeling long-range relationships between distant locations of its feature map, using second-order statistics rather than hand-designed part partitions. To that end it introduces a Second-order Non-local Attention (SONA) module, which computes a covariance matrix of the feature tensor and uses it as an attention map. Combined with a generalized DropBlock+ module and a dilated ResNet50 backbone, the method matches or beats previous best results on Market1501, CUHK03, and DukeMTMC-reID; the ablation studies attribute the major gain to the SONA module itself. The reason this matters is that re-identification systems would become less dependent on part alignment and more automatically driven by the data.

What carries the argument

The load-bearing object is the SONA module, a non-local attention mechanism built from second-order feature statistics. Given a feature map $x \in \mathbb{R}^{h\times w\times c}$, the module flattens the spatial dimensions, reduces channels with a $1\times1$ convolution to $c/r$, computes the covariance matrix $\Sigma = \theta(x)\bar{I}\theta(x)^{T}$ with the centering operator $\bar{I} = \frac{1}{c/r}(I - \frac{1}{c/r}\mathbf{1})$, scales it by $1/\sqrt{c/r}$, passes it through a softmax, and multiplies the result by a second reduced feature projection $g(x)$; a $1\times1$ convolution restores the channel count and the output is added back to the input as a residual. This turns the correlation between any two spatial positions into an attention weight, so the network can relate a shoe logo to a watch, for example, without an explicit part partition. The two supporting modifications are DropBlock+, a dropout variant that erases contiguous rectangular regions of the feature map with variable block sizes, and a dilated ResNet50 whose later stages keep a larger spatial feature map for the attention to operate on.

What would settle it

Run the closest prior model and SONA-Net from the same codebase, same data split, same augmentation, and same evaluation script, with four seeds each; if the prior model matches or beats SONA-Net on CUHK03 labeled under those conditions, the claimed state-of-the-art improvement collapses. A cheaper check is to compare the ablation gap—with and without SONA—against the standard deviation across the four published runs.

Watch

Extended reading notes

Core claim

The paper's central claim is that modeling second-order feature statistics—specifically the covariance between spatial positions in a convolutional feature map—as an attention map gives a person re-identification network a more general way to encode non-local part-to-part relationships than explicit part partitioning. The SONA module reduces the channel dimension, computes the covariance matrix of the spatial features, applies a scaled softmax to produce attention weights, and uses those weights to re-weight a parallel feature projection, added back as a residual. In the authors' experiments this module, together with a variable-size DropBlock+ regularizer and a dilated ResNet50 backbone, produces results equal to or better than previous state-of-the-art methods on all three benchmark datasets. The largest improvement appears on the CUHK03 dataset with the new protocol, where the reported mean mAP rises by about 2.3 points over the closest prior method, while gains on Market1501 and DukeMTMC-reID are smaller or mixed.

Load-bearing premise

The argument's load-bearing premise is that the previously published results it compares against were produced under equivalent data splits, augmentation, optimizer settings, and evaluation code, because the reported differences between the methods are small enough that protocol variation could change the ranking.

Editorial extensions

If this is right

  • A direct corollary is that SONA's benefit is not tied to a specific part partition scheme, so the module should transfer to new backbones in person re-identification.
  • Because the largest gain is on CUHK03, where detection boxes are least reliable, the method is most valuable exactly where part misalignment is worst.
  • The reported overhead of roughly 0.55 ms per image means the attention module can be added without a serious cost to real-time inference.
  • The ablation that removes SONA while keeping DropBlock+ shows only a small performance shift, so the attention mechanism itself, not the regularizer, is what should be improved or extended.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper's tests, the same covariance-attention block could be dropped into other vision tasks—semantic segmentation, action recognition, object detection—where long-range dependencies matter, but that transfer remains to be demonstrated.
  • The channel reduction factor $r=2$ and the restriction to second-order statistics are implementation choices; varying $r$ or testing third-order statistics would show whether the gains scale with the order of the statistics.
  • The paper's own numbers show the advantage is dataset-dependent: on Market1501 and DukeMTMC-reID the gap to the closest prior method is within the reported standard deviations, while on CUHK03 it is not. So the headline claim should be read as a strong result on the hardest dataset and a comparable result elsewhere.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces Second-order Non-local Attention (SONA), an attention module that computes a cross-position covariance matrix from a channel-reduced feature map and uses it to reweight features after early ResNet stages, with a residual connection. The full model, SONA-Net, combines a dilated ResNet50 backbone, a generalized variable-size DropBlock+ in the local branch, multi-loss training, and SONA injected after stages 2 and/or 3. It is evaluated on Market1501, CUHK03, and DukeMTMC-reID under the standard protocols, reporting mean and standard deviation over four runs for mAP, Rank-1, Rank-5, and Rank-10. The paper claims state-of-the-art or comparable performance on all three benchmarks and attributes the major performance gain to SONA.

Significance. The empirical study is carefully executed in several respects: each configuration is run four times with reported standard deviations, the ablation table separates the contributions of the baseline, DropBlock, DropBlock+, BFE, and SONA, and inference overhead is measured. If the SONA mechanism operated as described, the module would be a simple, plug-in way to capture long-range part-to-part dependencies, and the CUHK03 improvements (about 2.3 mAP over Pyramid-Net) would be practically meaningful. However, the conceptual claim is not yet established: the mathematical description of SONA appears to make the attention distribution nearly uniform, and no comparison with a first-order non-local block or attention-logit statistics is provided to show that second-order correlations are the active ingredient.

major comments (3)
  1. [Section 2.2, Eqs. (1)-(3)] The attention logits are double-normalized. The matrix \bar I in Eq. (1) already includes a 1/(c/r) = 1/d factor, so \Sigma is a scaled covariance whose entries are of order 1/sqrt(d) for weakly correlated channels after the BatchNorm and LeakyReLU, and at most of order 1/sqrt(d) even under strong correlations. Dividing again by sqrt(c/r) in Eq. (2) makes the pre-softmax logits typically of order 1/d (roughly 0.001 for d=1024), which over hw=768 positions yields a nearly uniform softmax. The output z then approaches a global average of g(x) and is nearly independent of the spatial position. This contradicts the Section 3.4 claim that 'the major performance gain is from the use of our proposed SONA' as a non-local correlation mechanism and leaves the distinctive behavior in Figure 3 unexplained. Please either correct the normalization (remove the extra 1/sqrt(d) division or drop the 1/d factor from \bar I) and report the resulting attention statistics, or provide evidence that the attention maps are non-degenerate under the current equations.
  2. [Section 3.3, Tables 2-4] The abstract and Section 3.3 state that the method performs 'equally to or better than state-of-the-art', but Table 3 shows SONA2+3-Net on DukeMTMC-reID with mAP 78.28 (standard deviation 0.11) versus Pyramid-Net's 79.0, which is lower. More fundamentally, the comparisons with Pyramid-Net, MGN, and BFE use published single-run numbers rather than re-running those models under the same data splits, augmentation, optimizer, and evaluation code. Since the differences on Duke and Market1501 are small (at most about 0.7 mAP), protocol variation could reverse the ranking. The state-of-the-art claim should be either supported by equivalent-protocol baselines or softened to 'competitive with' on datasets where the mean is not strictly higher.
  3. [Section 2.2 and Section 3.4] The paper does not compare SONA against a first-order non-local block (for example, the non-local network of reference [40]) with matched capacity, nor does it report the distribution of attention logits. Without such evidence, even setting the normalization issue aside, the assertion that second-order statistics are the reason for the observed gains is not substantiated; the improvement could come from the extra parameters, the residual global context, or the specific placement. Please add a matched first-order non-local ablation or an analysis of the attention logits and maps.
minor comments (5)
  1. [Abstract] The abstract's 'equally to or better than state-of-the-art' is stronger than the DukeMTMC mAP numbers support; this wording should be revised to match the results.
  2. [References] Reference [8] in Section 3.2 should point to ResNet [11], not the Cutout paper; in addition, references [30] and [31] appear to be duplicate entries of the same paper.
  3. [Section 3.3] The CUHK03 discussion contains a typo, 'Pyramind-Net', which should be 'Pyramid-Net'.
  4. [Section 2.2, Eq. (1)] The notation in Eq. (1), where \bar I is defined with both an identity matrix and an all-ones matrix denoted by the same symbol '1', is ambiguous; please use \mathbf{I} and \mathbf{1} with explicit dimensions.
  5. [Table 5] The ablation table would be easier to read if the rows were grouped or annotated to indicate which components are included in each variant, because the names BL, BL+DB, BL+DB+, BL+BFE, BL+SONA2, and BL+BFE+SONA2 do not make the inclusions obvious at a glance.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: SONA is an end-to-end trained module evaluated on held-out benchmarks, and no central claim reduces to a fitted input or self-citation.

full rationale

The paper's central claim is empirical: SONA-Net with second-order non-local attention, DropBlock+, and a dilated ResNet50 reaches competitive or state-of-the-art person re-identification accuracy. The derivation chain is Eqs. (1)-(3): a covariance matrix is computed from projected feature vectors, scaled, passed through softmax to weight g(x), and added as a residual. No parameter in this chain is fitted to the target benchmarks' test labels; the module is trained end-to-end on training splits and evaluated on held-out query/gallery sets. The ablation in Sec. 3.4 (Baseline vs Baseline+DB+ vs Baseline+SONA) is a standard controlled comparison, not a prediction derived from a fitted constant. The citations to [15] and [38] for covariance normalization and softmax scaling are external prior work and are not used to forbid alternatives or to define the target result. The comparison with Pyramid-Net, MGN, and BFE uses published numbers under nominally the same evaluation protocols; any protocol mismatch is a fairness or correctness risk, not circularity. Likewise, the concern about the double normalization in Eq. (2) attacks whether the module implements meaningful non-local attention; even if valid, it would show the mechanism is ineffective or mis-scaled, not that the result is equivalent to its inputs by construction. Therefore no circular step is identifiable, and the score is 0.

Assumptions & free parameters 8 free parameters · 5 assumptions · 0 invented entities

The central claim rests on standard deep learning assumptions: a pretrained backbone, chosen loss functions, and a set of hand-set hyperparameters. The only paper-specific assumption is that covariance attention in early stages captures useful part-to-part correlations, which is supported only by ablations and visualizations. No free parameters are fitted to the target metric; they are conventional training choices.

free parameters (8)
  • SONA channel reduction factor r = 2
    Chosen by hand in Section 2.2; controls the dimensionality of theta(x) and g(x) and the covariance size.
  • DropBlock+ block height = 5
    Set in Section 3.2; controls the size of erased blocks in the local branch.
  • DropBlock+ block width = 8
    Set in Section 3.2; controls the size of erased blocks in the local branch.
  • DropBlock+ gamma = 0.1
    Set in Section 3.2; controls the drop probability in the mask.
  • Mini-batch identities = 32
    Set in Section 3.2; number of identities sampled per batch.
  • Images per identity in mini-batch = 4
    Set in Section 3.2; number of images per sampled identity.
  • Learning rate schedule = 1e-4 warm-up, 1e-3, decays to 1e-4 at epoch 200 and 1e-5 at 300; 400 epochs
    Set in Section 3.2; standard warm-up and decay schedule used for all datasets.
  • Input image size = 384x128
    Set in Section 3.2; larger than typical ImageNet input to retain resolution.
assumptions (5)
  • standard math Matrix operations in Eq. 1 through Eq. 3 are differentiable and yield valid gradients for the network weights.
    The SONA module relies on standard matrix multiplication, softmax, and residual addition; no non-standard differentiation is used.
  • domain assumption ImageNet-pretrained ResNet50 provides a good initialization for person re-ID features.
    Stated in Section 3.2: the backbone is initialized with ImageNet weights; this is an empirical assumption common in re-ID.
  • domain assumption Batch hard triplet loss and label-smoothed cross-entropy loss are sufficient training objectives for person re-ID.
    Adopted in Section 2.1 with citations; the paper does not test other loss combinations.
  • ad hoc to paper Feature-map positions after stages 2 and 3 of the dilated ResNet50 correspond to useful local semantic cues, and covariance attention at those positions captures non-local part-to-part correlations.
    Section 2.2 and Figure 3 motivate this, but no formal analysis is given. The ablation shows late-stage placement hurts, suggesting the assumption is specific to early layers.
  • ad hoc to paper Variable-size DropBlock+ is a beneficial regularization without harming representation learning.
    Section 3.4 ablates BL+DB+ versus BL+DB, but the superiority is small and not statistically tested.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Second-order Non-local Attention Networks for Person Re-identification." pith.science (2026). https://pith.science/paper/BJFKXD4O

@misc{pith2026190900295,
  author       = {Pith},
  title        = {Pith review of: Second-order Non-local Attention Networks for Person Re-identification},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BJFKXD4O}},
  note         = {Machine review of arXiv:1909.00295}
}
read the original abstract

Recent efforts have shown promising results for person re-identification by designing part-based architectures to allow a neural network to learn discriminative representations from semantically coherent parts. Some efforts use soft attention to reallocate distant outliers to their most similar parts, while others adjust part granularity to incorporate more distant positions for learning the relationships. Others seek to generalize part-based methods by introducing a dropout mechanism on consecutive regions of the feature map to enhance distant region relationships. However, only few prior efforts model the distant or non-local positions of the feature map directly for the person re-ID task. In this paper, we propose a novel attention mechanism to directly model long-range relationships via second-order feature statistics. When combined with a generalized DropBlock module, our method performs equally to or better than state-of-the-art results for mainstream person re-identification datasets, including Market1501, CUHK03, and DukeMTMC-reID.

Figures

Figures reproduced from arXiv: 1909.00295 by the authors.

Figure 1
Figure 1. Illustration of second-order non-local attention for per [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The overall architecture of the proposed SONA-Net for the person re-ID task. The orange colored flow serves as global supervision [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Examples of non-local covariant attention heatmaps with [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

53 extracted references · 44 canonical work pages

  1. [40]

    Non-local neural networks

    Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaim- ing He. Non-local neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recogni- tion, pages 7794–7803, 2018. 2

    work page 2018

  2. [1]

    Looking be- yond appearances: Synthetic training data for deep cnns in re-identification

    Igor Barros Barbosa, Marco Cristani, Barbara Caputo, Alek- sander Rognhaugen, and Theoharis Theoharis. Looking be- yond appearances: Synthetic training data for deep cnns in re-identification. Computer Vision and Image Understand- ing, 167:50–62, 2018. 6

    work page 2018

  3. [2]

    Multiple-shot person re- identification by hpe signature

    Loris Bazzani, Marco Cristani, Alessandro Perina, Michela Farenzena, and Vittorio Murino. Multiple-shot person re- identification by hpe signature. In 2010 20th Interna- tional Conference on Pattern Recognition, pages 1413–1416. IEEE, 2010. 1

    work page 2010

  4. [3]

    Group consistent similarity learning via deep crf for person re-identification

    Dapeng Chen, Dan Xu, Hongsheng Li, Nicu Sebe, and Xiao- gang Wang. Group consistent similarity learning via deep crf for person re-identification. In Proceedings of the IEEE Con- ference on Computer Vision and Pattern Recognition, pages 8649–8658, 2018. 1, 6

    work page 2018

  5. [4]

    Person re- identification by deep learning multi-scale representations

    Yanbei Chen, Xiatian Zhu, and Shaogang Gong. Person re- identification by deep learning multi-scale representations. In Proceedings of the IEEE International Conference on Computer Vision, pages 2590–2600, 2017. 6

    work page 2017

  6. [5]

    Batch DropBlock Network for Person Re-identification and Beyond

    Zuozhuo Dai, Mingqiang Chen, Siyu Zhu, and Ping Tan. Batch feature erasing for person re-identification and be- yond. arXiv preprint arXiv:1811.07130 , 2018. 1, 2, 3, 6, 7, 8

    work page Pith review arXiv 2018

  7. [6]

    Consistent re-identification in a camera net- work

    Abir Das, Anirban Chakraborty, and Amit K Roy- Chowdhury. Consistent re-identification in a camera net- work. In European conference on computer vision , pages 330–345. Springer, 2014. 1

    work page 2014

  8. [7]

    Imagenet: A large-scale hierarchical image database

    Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In 2009 IEEE conference on computer vision and pattern recognition, pages 248–255. Ieee, 2009. 5

    2009

Show all 53 references
  1. [8]

    Improved regular- ization of convolutional neural networks with cutout

    Terrance DeVries and Graham W Taylor. Improved regular- ization of convolutional neural networks with cutout. arXiv preprint arXiv:1708.04552, 2017. 5

    2017 arXiv

  2. [9]

    Deep transfer learning for person re-identification

    Mengyue Geng, Yaowei Wang, Tao Xiang, and Yonghong Tian. Deep transfer learning for person re-identification. arXiv preprint arXiv:1611.05244, 2016. 6

    2016 arXiv

  3. [10]

    Dropblock: A regularization method for convolutional networks

    Golnaz Ghiasi, Tsung-Yi Lin, and Quoc V Le. Dropblock: A regularization method for convolutional networks. In Advances in Neural Information Processing Systems , pages 10750–10760, 2018. 2, 3

    2018

  4. [11]

    Deep residual learning for image recognition

    Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceed- ings of the IEEE conference on computer vision and pattern recognition, pages 770–778, 2016. 3

    2016

  5. [12]

    In de- fense of the triplet loss for person re-identification

    Alexander Hermans, Lucas Beyer, and Bastian Leibe. In de- fense of the triplet loss for person re-identification. arXiv preprint arXiv:1703.07737, 2017. 3, 6

    2017 arXiv

  6. [13]

    Adversarially occluded samples for per- son re-identification

    Houjing Huang, Dangwei Li, Zhang Zhang, Xiaotang Chen, and Kaiqi Huang. Adversarially occluded samples for per- son re-identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages 5098– 5107, 2018. 6

    2018

  7. [14]

    Adam: A method for stochastic optimization

    Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 ,

    arXiv

  8. [15]

    To- wards faster training of global covariance pooling networks by iterative matrix square root normalization

    Peihua Li, Jiangtao Xie, Qilong Wang, and Zilin Gao. To- wards faster training of global covariance pooling networks by iterative matrix square root normalization. In Proceed- ings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 947–955, 2018. 2, 4

    2018

  9. [16]

    Is second-order information helpful for large-scale visual recognition? In Proceedings of the IEEE International Con- ference on Computer Vision, pages 2070–2078, 2017

    Peihua Li, Jiangtao Xie, Qilong Wang, and Wangmeng Zuo. Is second-order information helpful for large-scale visual recognition? In Proceedings of the IEEE International Con- ference on Computer Vision, pages 2070–2078, 2017. 2

    2017

  10. [17]

    Deep- reid: Deep filter pairing neural network for person re- identification

    Wei Li, Rui Zhao, Tong Xiao, and Xiaogang Wang. Deep- reid: Deep filter pairing neural network for person re- identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages 152–159,

  11. [18]

    Person re- identification by deep joint learning of multi-loss classifica- tion

    Wei Li, Xiatian Zhu, and Shaogang Gong. Person re- identification by deep joint learning of multi-loss classifica- tion. arXiv preprint arXiv:1705.04724, 2017. 6

    2017 arXiv

  12. [19]

    Harmonious at- tention network for person re-identification

    Wei Li, Xiatian Zhu, and Shaogang Gong. Harmonious at- tention network for person re-identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2285–2294, 2018. 6, 7

    2018

  13. [20]

    Learning locally-adaptive de- cision functions for person verification

    Zhen Li, Shiyu Chang, Feng Liang, Thomas S Huang, Lian- gliang Cao, and John R Smith. Learning locally-adaptive de- cision functions for person verification. InProceedings of the IEEE Conference on Computer Vision and Pattern Recogni- tion, pages 3610–3617, 2013. 1, 3

    2013

  14. [21]

    Per- son re-identification by local maximal occurrence represen- tation and metric learning

    Shengcai Liao, Yang Hu, Xiangyu Zhu, and Stan Z Li. Per- son re-identification by local maximal occurrence represen- tation and metric learning. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 2197–2206, 2015. 1

    2015

  15. [22]

    Bilinear cnn models for fine-grained visual recognition

    Tsung-Yu Lin, Aruni RoyChowdhury, and Subhransu Maji. Bilinear cnn models for fine-grained visual recognition. In Proceedings of the IEEE international conference on com- puter vision, pages 1449–1457, 2015. 2

    2015

  16. [23]

    Hydraplus-net: Attentive deep features for pedestrian analysis

    Xihui Liu, Haiyu Zhao, Maoqing Tian, Lu Sheng, Jing Shao, Shuai Yi, Junjie Yan, and Xiaogang Wang. Hydraplus-net: Attentive deep features for pedestrian analysis. In Proceed- ings of the IEEE international conference on computer vi- sion, pages 350–359, 2017. 6

    2017

  17. [24]

    Domain transfer support vector ranking for person re-identification without target camera label information

    Andy J Ma, Pong C Yuen, and Jiawei Li. Domain transfer support vector ranking for person re-identification without target camera label information. In Proceedings of the IEEE international conference on computer vision , pages 3567– 3574, 2013. 1

    2013

  18. [25]

    Hierarchical gaussian descriptor for person re- identification

    Tetsu Matsukawa, Takahiro Okabe, Einoshin Suzuki, and Yoichi Sato. Hierarchical gaussian descriptor for person re- identification. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 1363–1372,

  19. [26]

    Pcca: A new approach for distance learning from sparse pairwise constraints

    Alexis Mignon and Fr ´ed´eric Jurie. Pcca: A new approach for distance learning from sparse pairwise constraints. In 2012 IEEE conference on computer vision and pattern recogni- tion, pages 2666–2672. IEEE, 2012. 1

    2012

  20. [27]

    Automatic differentiation in pytorch

    Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Al- ban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in pytorch. 2017. 5

    2017

  21. [28]

    Local fisher discriminant analysis for pedestrian re-identification

    Sateesh Pedagadi, James Orwell, Sergio Velastin, and Boghos Boghossian. Local fisher discriminant analysis for pedestrian re-identification. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 3318–3325, 2013. 1

    2013

  22. [29]

    Performance measures and a data set for multi-target, multi-camera tracking

    Ergys Ristani, Francesco Solera, Roger Zou, Rita Cucchiara, and Carlo Tomasi. Performance measures and a data set for multi-target, multi-camera tracking. InEuropean Conference on Computer Vision, pages 17–35. Springer, 2016. 5

    2016

  23. [30]

    Deep group-shuffling random walk for person re-identification

    Yantao Shen, Hongsheng Li, Tong Xiao, Shuai Yi, Dapeng Chen, and Xiaogang Wang. Deep group-shuffling random walk for person re-identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages 2265–2274, 2018. 1

    2018

  24. [31]

    Deep group-shuffling random walk for person re-identification

    Yantao Shen, Hongsheng Li, Tong Xiao, Shuai Yi, Dapeng Chen, and Xiaogang Wang. Deep group-shuffling random walk for person re-identification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages 2265–2274, 2018. 6

    2018

  25. [32]

    Dual attention matching network for context-aware feature sequence based person re-identification

    Jianlou Si, Honggang Zhang, Chun-Guang Li, Jason Kuen, Xiangfei Kong, Alex C Kot, and Gang Wang. Dual attention matching network for context-aware feature sequence based person re-identification. In Proceedings of the IEEE Con- ference on Computer Vision and Pattern Recognition...

    2018

  26. [33]

    Pose-driven deep convolutional model for per- son re-identification

    Chi Su, Jianing Li, Shiliang Zhang, Junliang Xing, Wen Gao, and Qi Tian. Pose-driven deep convolutional model for per- son re-identification. In Proceedings of the IEEE Interna- tional Conference on Computer Vision , pages 3960–3969,

  27. [34]

    Svdnet for pedestrian retrieval

    Yifan Sun, Liang Zheng, Weijian Deng, and Shengjin Wang. Svdnet for pedestrian retrieval. In Proceedings of the IEEE International Conference on Computer Vision, pages 3800– 3808, 2017. 1, 6, 7

    2017

  28. [35]

    Beyond part models: Person retrieval with refined part pooling (and a strong convolutional baseline)

    Yifan Sun, Liang Zheng, Yi Yang, Qi Tian, and Shengjin Wang. Beyond part models: Person retrieval with refined part pooling (and a strong convolutional baseline). In Pro- ceedings of the European Conference on Computer Vision (ECCV), pages 480–496, 2018. 1, 2, 3, 5, 6, 7

    2018

  29. [36]

    Rethinking the inception archi- tecture for computer vision

    Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna. Rethinking the inception archi- tecture for computer vision. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 2818–2826, 2016. 3

    2016

  30. [37]

    Multi-region bilinear convolutional neural networks for per- son re-identification

    Evgeniya Ustinova, Yaroslav Ganin, and Victor Lempitsky. Multi-region bilinear convolutional neural networks for per- son re-identification. In 2017 14th IEEE International Con- ference on Advanced Video and Signal Based Surveillance (AVSS), pages 1–6. IEEE, 2017. 6

    2017

  31. [38]

    Attention is all you need

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszko- reit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Advances in Neural Information Processing Systems, pages 5998–6008, 2017. 2, 4

    2017

  32. [39]

    Learning discriminative features with multiple granu- larities for person re-identification

    Guanshuo Wang, Yufeng Yuan, Xiong Chen, Jiwei Li, and Xi Zhou. Learning discriminative features with multiple granu- larities for person re-identification. In 2018 ACM Multime- dia Conference on Multimedia Conference , pages 274–282. ACM, 2018. 1, 2, 5, 6, 7, 8

    2018

  33. [41]

    Glad: Global-local-alignment descriptor for pedes- trian retrieval

    Longhui Wei, Shiliang Zhang, Hantao Yao, Wen Gao, and Qi Tian. Glad: Global-local-alignment descriptor for pedes- trian retrieval. In Proceedings of the 25th ACM international conference on Multimedia, pages 420–428. ACM, 2017. 6

    2017

  34. [42]

    Bag of tricks for image classifica- tion with convolutional neural networks

    Junyuan Xie, Tong He, Zhi Zhang, Hang Zhang, Zhongyue Zhang, and Mu Li. Bag of tricks for image classifica- tion with convolutional neural networks. arXiv preprint arXiv:1812.01187, 2018. 3

    2018 arXiv

  35. [43]

    Local convolutional neural networks for person re-identification

    Jiwei Yang, Xu Shen, Xinmei Tian, Houqiang Li, Jianqiang Huang, and Xian-Sheng Hua. Local convolutional neural networks for person re-identification. In 2018 ACM Multi- media Conference on Multimedia Conference , pages 1074–

    2018

  36. [44]

    Deep representation learning with part loss for person re-identification

    Hantao Yao, Shiliang Zhang, Richang Hong, Yongdong Zhang, Changsheng Xu, and Qi Tian. Deep representation learning with part loss for person re-identification. IEEE Transactions on Image Processing, 2019. 6

    2019

  37. [45]

    Dilated residual networks

    Fisher Yu, Vladlen Koltun, and Thomas Funkhouser. Dilated residual networks. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 472–480,

  38. [46]

    Compact generalized non-local network

    Kaiyu Yue, Ming Sun, Yuchen Yuan, Feng Zhou, Errui Ding, and Fuxin Xu. Compact generalized non-local network. In Advances in Neural Information Processing Systems , pages 6511–6520, 2018. 2

    2018

  39. [47]

    Deep mutual learning

    Ying Zhang, Tao Xiang, Timothy M Hospedales, and Huchuan Lu. Deep mutual learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recogni- tion, pages 4320–4328, 2018. 6

    2018

  40. [48]

    Deeply-learned part-aligned representations for person re- identification

    Liming Zhao, Xi Li, Yueting Zhuang, and Jingdong Wang. Deeply-learned part-aligned representations for person re- identification. In Proceedings of the IEEE International Conference on Computer Vision, pages 3219–3228, 2017. 6

    2017

  41. [49]

    A coarse-to-fine pyrami- dal model for person re-identification via multi-loss dynamic training

    Feng Zheng, Xing Sun, Xinyang Jiang, Xiaowei Guo, Zongqiao Yu, and Feiyue Huang. A coarse-to-fine pyrami- dal model for person re-identification via multi-loss dynamic training. arXiv preprint arXiv:1810.12193, 2018. 1, 2, 5, 6, 7, 8

    2018 arXiv

  42. [50]

    Scalable person re-identification: A benchmark

    Liang Zheng, Liyue Shen, Lu Tian, Shengjin Wang, Jing- dong Wang, and Qi Tian. Scalable person re-identification: A benchmark. In Proceedings of the IEEE International Conference on Computer Vision, pages 1116–1124, 2015. 4, 5

    2015

  43. [51]

    Unlabeled sam- ples generated by gan improve the person re-identification baseline in vitro

    Zhedong Zheng, Liang Zheng, and Yi Yang. Unlabeled sam- ples generated by gan improve the person re-identification baseline in vitro. In Proceedings of the IEEE International Conference on Computer Vision, pages 3754–3762, 2017. 4, 5

    2017

  44. [52]

    Pedestrian alignment network for large-scale person re-identification

    Zhedong Zheng, Liang Zheng, and Yi Yang. Pedestrian alignment network for large-scale person re-identification. IEEE Transactions on Circuits and Systems for Video Tech- nology, 2018. 1, 6, 7

    2018

  45. [53]

    Re- ranking person re-identification with k-reciprocal encoding

    Zhun Zhong, Liang Zheng, Donglin Cao, and Shaozi Li. Re- ranking person re-identification with k-reciprocal encoding. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 1318–1327, 2017. 4, 5, 7

    2017

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.