跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 06:41 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 07:20 — 2026-11-22 07:20(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
新论文 · v1arXiv:2611.25283

Persistent Identity in Person Tracking: Online Enrollment and Registered Recognition

Ratha Siv, Matei Mancas, Bernard Gosselin

原文摘要

We extend PoseTReID with online appearance-bank matching (Gallery) and a residual-conflict guard for registered SVM recognition. All methods use supplied ground-truth (GT) person boxes. We average all-box assessment IDF1/HOTA equally across videos. On six SportsMOT clips, StrongSORT leads standalone trackers (79.44/84.72%) and exceeds both Gallery variants. Over eleven videos, Gallery AIN (83.29/85.44%) and COPE (84.66/86.38%) exceed standalone trackers with complete results. This lead depends on two retrospectively added GTA development compilations and is absent on the original nine videos. Registered SVMs lead both cohorts among complete results, with AIN at 95.72/94.82% over eleven videos. They use every GT crop from approximately 20% of frames, including future appearances. On MOT20-03, registered AIN reached 96.80% IDF1 and assigned the correct enrolled name to 90.72% of assessment GT observations. Gallery and standalone trackers receive no per-video labelled enrollment. Both identity routes restore identities across internal title cards, but Gallery trails SORT on three videos (four in HOTA) and both SVMs trail SORT on MOT16-04/MOT20-03. Under six-clip persistent-only scoring, native Gallery gains 2.39 percentage points in mean IDF1 over a matched control, with lower correct-P coverage and 5.02 times as many encoder attempts. Pose gating is mixed; the guard's metric effect is not isolated.

cs.CV

版本更新 · v2arXiv:2610.35948

Native Rectangular Linear Assignment with Implicit Rejection: A Jonker-Volgenant Solver without Square Expansion

Ratha Siv, Raphael Reme, Matei Mancas, Bernard Gosselin

原文摘要

Rectangular assignment with a uniform unmatched penalty is often implemented by expanding the cost matrix. We integrate established rectangular Jonker-Volgenant principles and implicit rejection with float64 working arithmetic and reusable workspaces in Rust (JVRUST), hybrid Rust/C++ (JVHYBRID) and C++ (JVCPP). A campaign evaluates laprust/lapcpp 1.2.0 and LAPX 0.13.0 in four Windows/Linux and Python environments. Each environment contains 302 cases: 3,286 complete-call timing conditions with five inputs and three rounds, plus 91 memory conditions with five fresh-process trials. Against the matching compact SciPy reference, all three native implementations exceed a 3% advantage on all 102 required cases; JVRUST and JVCPP do so on 163-165 and 163-166 of 166 optional cases, respectively. Controlled comparisons qualify these gains by representation, initialization, sparsity, batching and orientation. Assignment-replay gains attenuate in tracker updates, and equal replay objectives do not imply identical tracking outputs. A separate 67-case Windows LSAPE study examines related transformations within Hungarian code. The contribution is software integration and reproducible performance characterization. Adverse results are retained; no algorithmic priority, statistical significance or universal solver ranking is claimed. The initialization policy was developed using related workload families, so the campaign is not a held-out test of heuristic optimality.

cs.MS