Papers › ABD-Net: Attentive but Diverse Person Re-Identification

ABD-Net: Attentive but Diverse Person Re-Identification

3 Aug 2019ICCV 2019 10arXiv:1908.01114archive 2025-07-28

Tianlong Chen, Shaojin Ding, Jingyi Xie, Ye Yuan, Wuyang Chen, Yang Yang, Zhou Ren, Zhangyang Wang

Attention mechanism has been shown to be effective for person re-identification (Re-ID). However, the learned attentive feature embeddings which are often not naturally diverse nor uncorrelated, will compromise the retrieval performance based on the Euclidean distance. We advocate that enforcing diversity could greatly complement the power of attention. To this end, we propose an Attentive but Diverse Network (ABD-Net), which seamlessly integrates attention modules and diversity regularization throughout the entire network, to learn features that are representative, robust, and more discriminative. Specifically, we introduce a pair of complementary attention modules, focusing on channel aggregation and position awareness, respectively. Furthermore, a new efficient form of orthogonality constraint is derived to enforce orthogonality on both hidden activations and weights. Through careful ablation studies, we verify that the proposed attentive and diverse terms each contributes to the performance gains of ABD-Net. On three popular benchmarks, ABD-Net consistently outperforms existing state-of-the-art methods.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1908.01114")

Code

Syntology Ran 1 of 9 code samples harvested from 2 repositories linked to this paper; 8 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 0 ran; community (archive-listed): 2 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

TAMU-VITA/ABD-Net officialmentioned in papermentioned on GitHubpytorchMIT report
hsfzxjy/dprn mentioned on GitHubpytorchMIT report
vita-group/abd-net mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 1 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
8unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

accuracy TAMU-VITA/ABD-Net/eval_acc.py official repository unverified MIT (permissive) · 3df4aa63387c76b9 · report
eval_cuhk03 TAMU-VITA/ABD-Net/torchreid/eval_metrics.py official repository unverified MIT (permissive) · d100118814161b20 · report
eval_market1501 TAMU-VITA/ABD-Net/torchreid/eval_metrics.py official repository unverified MIT (permissive) · acf991f06281a336 · report
evaluate_py TAMU-VITA/ABD-Net/torchreid/eval_metrics.py official repository unverified MIT (permissive) · 6c4da11cacaff831 · report
image_dataset_kwargs TAMU-VITA/ABD-Net/args.py official repository unverified MIT (permissive) · 5f8bea4ece1b7392 · report
optimizer_kwargs TAMU-VITA/ABD-Net/args.py official repository unverified MIT (permissive) · 22c90ccd7fb0837e · report
video_dataset_kwargs TAMU-VITA/ABD-Net/args.py official repository unverified MIT (permissive) · 80e8979a34588e76 · report
read_image hsfzxjy/dprn/torchreid/dataset_loader.py community (archive-listed) ran MIT (permissive) · e3cbae59cb5ed741 · report
test_classification hsfzxjy/dprn/train_multi.py community (archive-listed) unverified MIT (permissive) · f3c281ab55579fc0 · report

Tasks

DiversityPerson Re-IdentificationRetrieval

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Person Re-Identification DukeMTMC-reID ABD-Net (ResNet-50) Rank-1 89.0 #53 of 94 Archive leaderboard report
Person Re-Identification DukeMTMC-reID ABD-Net (ResNet-50) mAP 78.59 #53 of 94 Archive leaderboard report
Person Re-Identification MSMT17 ABD-Net (ResNet-50) Rank-1 82.3 #31 of 43 Archive leaderboard report
Person Re-Identification MSMT17 ABD-Net (ResNet-50) mAP 60.8 #31 of 43 Archive leaderboard report
Person Re-Identification Market-1501 ABD-Net (ResNet-50) Rank-1 95.6 #51 of 135 Archive leaderboard report
Person Re-Identification Market-1501 ABD-Net (ResNet-50) mAP 88.28 #51 of 135 Archive leaderboard report
Person Re-Identification Market-1501-C ABD-Net Rank-1 29.65 #15 of 22 Archive leaderboard report
Person Re-Identification Market-1501-C ABD-Net mAP 9.81 #15 of 22 Archive leaderboard report
Person Re-Identification Market-1501-C ABD-Net mINP 0.26 #15 of 22 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConvolutionGlobal Average PoolingKaiming InitializationMax PoolingReLUResidual BlockResidual Connection

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections