Searcharxiv⌕ Search

arXiv · 2611.08542

RapidMitDet: Boosting Computational Efficiency for Mitosis Detection via Magnification Alignment

Abstract

Automated mitosis detection is a critical research focus, enabling pathologists to rapidly assess mitotic indices for tumor malignancy evaluation. However, most of the existing detection approaches suffer from significant computational inefficiency due to the giga-pixel image resolution of Whole-Slide Images (WSIs), which greatly hinders their clinical applicability. In this study, we propose RapidMitDet, a computational efficient mitosis detection approach. Our method employs a coarse-to-fine framework, first identifying mitotic candidates at lower magnification and then confirming them at higher magnification. In the coarse-detection stage, we introduce magnification-aligned knowledge distillation to reduce the information gap between magnification levels while minimizing the performance degradation in the lower magnification detection model. In the subsequent fine-classification stage, we propose adaptive triplet learning (ATL) to optimize infomative sample selection, thereby enhancing discrimination between mitotic and non-mitotic instances. Experimental results show that RapidMitDet achieves the optimal accuracy-efficiency balance at 20x magnification, improving computational speed by up to 5.62 times over the latest state-of-the-art (SOTA) methods. Due to its lightweight model design, RapidMitDet can also deliver efficient detection at higher magnification (40x) while achieving even higher detection performance. In WSI-level evaluations, our method shows strong agreement with pathologists' diagnoses (ICCs: 0.879 (40x), 0.822 (20x)) while maintaining superior efficiency, highlighting its potential for clinical application. Code is available at https://github.com/logincat/RapidMitDet

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Longfei Wang, Jiatai Lin, Junyu Guo, Chaoqun Chen, Danyi Li, Lili Zhai, Jingqi Huang, Tianpeng Deng, Zhenwei Shi, Ying Wang, Changhong Liang, Xiaojing Guo, Li Liang, Zaiyi Liu, Chu Han. 2026-11-05. RapidMitDet: Boosting Computational Efficiency for Mitosis Detection via Magnification Alignment. https://arxiv.org/abs/2611.08542

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Cytology Dataset for Early Detection of Oral Squamous Cell Carcinoma

Oral squamous cell carcinoma OSCC is a major global health burden, particularly in several regions across Asia, Africa, and South America, where it accounts for a significant proportion of cancer cases. Early detection dramatically improves outcomes, with stage I cancers achieving up to 90 percent survival. However, traditional diagnosis based on histopathology has limited accessibility in low-resource settings because it is invasive, resource-intensive, and reliant on expert pathologists. On the other hand, oral cytology of brush biopsy offers a minimally invasive and lower cost alternative, provided that the remaining challenges, inter observer variability and unavailability of expert pathologists can be addressed using artificial intelligence. Development and validation of robust AI solutions requires access to large, labeled, and multi-source datasets to train high capacity models that generalize across domain shifts. We introduce the first large and multicenter oral cytology dataset, comprising annotated slides stained with Papanicolaou(PAP) and May-Grunwald-Giemsa(MGG) protocols, collected from ten tertiary medical centers in India. The dataset is labeled and annotated by expert pathologists for cellular anomaly classification and detection, is designed to advance AI driven diagnostic methods. By filling the gap in publicly available oral cytology datasets, this resource aims to enhance automated detection, reduce diagnostic errors, and improve early OSCC diagnosis in resource-constrained settings, ultimately contributing to reduced mortality and better patient outcomes worldwide.

eess.IV↗

StreamAZ: Line-by-Line SAR Focusing with State Space Models

Conventional focusing methods for Synthetic Aperture Radar (SAR) employ block-wise processing efficiently but remain latency-heavy processes that prevent the realisation of a closed-loop cognitive SAR system. We present an online SAR image-formation framework, StreamAZ, that treats sensing as a stream and produces focused images in a line by line fashion. Our method uses a tiny state-space surrogate model trained with teacher-student distillation and multi-stage losses. We evaluate the method on real SAR data from Maya4, a Sentinel-1-derived dataset containing raw, range-compressed, range-cell-migration-corrected, and azimuth-compressed products. Relative to a linewise digital-signal-processing baseline, our framework delivers approximately 70$\times$ lower latency and 130$\times$ lower memory use; on a single AMD CPU core it processes one row in 16 ms with a memory footprint of 6 MB whilst maintaining a focusing quality high enough to support downstream decisions, which we illustrate with vessel detection and flood-mapping tasks.

eess.IV↗

Decoder-Guided Lossy Contour Coding Via Anchor Refinement

Object contours serve as compact structural priors for many receiver-side vision tasks such as image super-resolution, edge-conditioned generation, and machine vision. When such tasks are deployed over a bandwidth-limited channel, the sender transmits the high-quality object contour as structural side information to guide reconstruction at the receiver, while-to save bandwidth-only a low-quality reference such as a downsampled image or base-layer reconstruction is delivered. As a result, the decoder can already extract a coarse contour from this reference at no transmission cost, creating an encoder-decoder asymmetry: the fine contour must be coded and sent, yet a free coarse version is available at the decoder. This asymmetry is ignored by existing contour codecs such as JBIG2 and chain coding, which are lossless, symmetric, and offer no rate-distortion control, leading to high bitrates. In this paper, we propose a coarse-to-fine contour coding framework that models a high-quality contour as a structured geometric refinement of the decoder-available coarse contour. The encoder extracts ordered anchors along the fine contour and performs adaptive anchor skipping under a distortion constraint. The decoder then reconstructs the contour by using the coarse prior to guide anchor connectivity. This formulation enables lossy contour compression with an explicit rate-distortion trade-off. Experiments show 54.5%-66.9% bitrate reduction over methods without decoder-side guidance, and up to 5 times savings over JBIG2, while preserving high geometric accuracy.

eess.IV↗