Metraipolis › archive › dc_009c57ff3029
BiHashFormer: Hash-Driven Dual-Branch Transformer for Efficient Object Detection in HRW Shots — arXiv:2610.39937
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39937
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:42:13.551Z
- SHA-256 of the archived text
c84eec60f94994b3acdea54f92fb8600dde3db5a5d9ebe6ce2842abf2a52d156- Stable URL of this page
https://metraipolis.com/documento/dc_009c57ff3029
How to cite
BiHashFormer: Hash-Driven Dual-Branch Transformer for Efficient Object Detection in HRW Shots — arXiv:2610.39937 — arXiv (en), https://arxiv.org/abs/2610.39937 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_009c57ff3029 (Metraipolis archive dc_009c57ff3029, sha256 c84eec60f94994b3acdea54f92fb8600dde3db5a5d9ebe6ce2842abf2a52d156)
BibTeX
@misc{dc009c57ff3029,
title = {BiHashFormer: Hash-Driven Dual-Branch Transformer for Efficient Object Detection in HRW Shots — arXiv:2610.39937},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39937},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_009c57ff3029; sha256 c84eec60f94994b3acdea54f92fb8600dde3db5a5d9ebe6ce2842abf2a52d156},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39937. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recent advances in gigapixel-level imaging have brought High-Resolution Wide shots to the forefront of research. However, these images present significant challenges: extreme sparsity of foreground, gigapixel-level resolutions and interleaving of foreground and background. This causes traditional detectors and attention mechanisms to be hindered by background, resulting in inefficiency and inaccuracy. To tackle this problem, we propose BiHashFormer, a dual sparsified branch transformer built on hashing. RoI Selector will predict the foreground proportion for top-k selecting target-containing windows. The compression branch processes windows selected and refines attention into HashAttention by discarding half of the key-value pairs, reducing cost and improving efficiency. The compensation branch uses HashMiner to perform low-cost hash searches in the remaining regions, recovering features of missed objects. Experiments confirm that the selection relationship in HashAttention is one-way and reveal the preference of different queries for keys. In experiments on the gigapixel benchmark PANDA, BiHashFormer reduces 37.5% backbone FLOPs while improving AP50 to 81.0%. Moreover, this parallel dual-branch structure allows the model to avoid inference delays caused by inter-branch dependencies, while achieving much greater stability than single-branch models, specially with low rates of RoI selection. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.CV, nuovi lavori del giorno). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2610.39937 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:16:43.960Z dalla pagina https://arxiv.org/list/cs.CV/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).