SparseFocus: Learning-based One-shot Autofocus for Microscopy with Sparse Content
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916606262640640 |
|---|---|
| author | Zhai, Yongping Fu, Xiaoxi Su, Qiang Hu, Jia Zhang, Yake Zhou, Yunfeng Zhang, Chaofan Li, Xiao Wang, Wenxin Wu, Dongdong Yan, Shen |
| author_facet | Zhai, Yongping Fu, Xiaoxi Su, Qiang Hu, Jia Zhang, Yake Zhou, Yunfeng Zhang, Chaofan Li, Xiao Wang, Wenxin Wu, Dongdong Yan, Shen |
| contents | Autofocus is necessary for high-throughput and real-time scanning in microscopic imaging. Traditional methods rely on complex hardware or iterative hill-climbing algorithms. Recent learning-based approaches have demonstrated remarkable efficacy in a one-shot setting, avoiding hardware modifications or iterative mechanical lens adjustments. However, in this paper, we highlight a significant challenge that the richness of image content can significantly affect autofocus performance. When the image content is sparse, previous autofocus methods, whether traditional climbing-hill or learning-based, tend to fail. To tackle this, we propose a content-importance-based solution, named SparseFocus, featuring a novel two-stage pipeline. The first stage measures the importance of regions within the image, while the second stage calculates the defocus distance from selected important regions. To validate our approach and benefit the research community, we collect a large-scale dataset comprising millions of labelled defocused images, encompassing both dense, sparse and extremely sparse scenarios. Experimental results show that SparseFocus surpasses existing methods, effectively handling all levels of content sparsity. Moreover, we integrate SparseFocus into our Whole Slide Imaging (WSI) system that performs well in real-world applications. The code and dataset will be made available upon the publication of this paper. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_06452 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | SparseFocus: Learning-based One-shot Autofocus for Microscopy with Sparse Content Zhai, Yongping Fu, Xiaoxi Su, Qiang Hu, Jia Zhang, Yake Zhou, Yunfeng Zhang, Chaofan Li, Xiao Wang, Wenxin Wu, Dongdong Yan, Shen Computer Vision and Pattern Recognition Quantitative Methods Autofocus is necessary for high-throughput and real-time scanning in microscopic imaging. Traditional methods rely on complex hardware or iterative hill-climbing algorithms. Recent learning-based approaches have demonstrated remarkable efficacy in a one-shot setting, avoiding hardware modifications or iterative mechanical lens adjustments. However, in this paper, we highlight a significant challenge that the richness of image content can significantly affect autofocus performance. When the image content is sparse, previous autofocus methods, whether traditional climbing-hill or learning-based, tend to fail. To tackle this, we propose a content-importance-based solution, named SparseFocus, featuring a novel two-stage pipeline. The first stage measures the importance of regions within the image, while the second stage calculates the defocus distance from selected important regions. To validate our approach and benefit the research community, we collect a large-scale dataset comprising millions of labelled defocused images, encompassing both dense, sparse and extremely sparse scenarios. Experimental results show that SparseFocus surpasses existing methods, effectively handling all levels of content sparsity. Moreover, we integrate SparseFocus into our Whole Slide Imaging (WSI) system that performs well in real-world applications. The code and dataset will be made available upon the publication of this paper. |
| title | SparseFocus: Learning-based One-shot Autofocus for Microscopy with Sparse Content |
| topic | Computer Vision and Pattern Recognition Quantitative Methods |
| url | https://arxiv.org/abs/2502.06452 |