Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2402.10595

Help | Advanced Search

Computer Science > Computer Vision and Pattern Recognition

arXiv:2402.10595 (cs)
[Submitted on 16 Feb 2024 (v1) , last revised 11 Aug 2025 (this version, v2)]

Title: Compact and De-biased Negative Instance Embedding for Multi-Instance Learning on Whole-Slide Image Classification

Title: 多实例学习的紧凑且去偏负样本嵌入用于全幻灯片图像分类

Authors:Joohyung Lee, Heejeong Nam, Kwanhyung Lee, Sangchul Hahn
Abstract: Whole-slide image (WSI) classification is a challenging task because 1) patches from WSI lack annotation, and 2) WSI possesses unnecessary variability, e.g., stain protocol. Recently, Multiple-Instance Learning (MIL) has made significant progress, allowing for classification based on slide-level, rather than patch-level, annotations. However, existing MIL methods ignore that all patches from normal slides are normal. Using this free annotation, we introduce a semi-supervision signal to de-bias the inter-slide variability and to capture the common factors of variation within normal patches. Because our method is orthogonal to the MIL algorithm, we evaluate our method on top of the recently proposed MIL algorithms and also compare the performance with other semi-supervised approaches. We evaluate our method on two public WSI datasets including Camelyon-16 and TCGA lung cancer and demonstrate that our approach significantly improves the predictive performance of existing MIL algorithms and outperforms other semi-supervised algorithms. We release our code at https://github.com/AITRICS/pathology_mil.
Abstract: 全切片图像(WSI)分类是一项具有挑战性的任务,因为1)来自WSI的图像块缺乏注释,且2)WSI具有不必要的变异性,例如染色协议。 最近,多实例学习(MIL)取得了显著进展,使得可以基于切片级别的注释而不是图像块级别的注释进行分类。 然而,现有的MIL方法忽略了正常切片的所有图像块都是正常的这一事实。 利用这一免费注释,我们引入了一个半监督信号,以消除切片间的变异性并捕捉正常图像块内的共同变化因素。 由于我们的方法与MIL算法是正交的,我们在最近提出的MIL算法基础上评估了我们的方法,并与其他半监督方法进行了性能比较。 我们在两个公开的WSI数据集上进行了评估,包括Camelyon-16和TCGA肺癌数据集,并证明我们的方法显著提高了现有MIL算法的预测性能,并优于其他半监督算法。 我们将在https://github.com/AITRICS/pathology_mil发布我们的代码。
Comments: Accepted to ICASSP 2024
Subjects: Computer Vision and Pattern Recognition (cs.CV)
Cite as: arXiv:2402.10595 [cs.CV]
  (or arXiv:2402.10595v2 [cs.CV] for this version)
  https://doi.org/10.48550/arXiv.2402.10595
arXiv-issued DOI via DataCite

Submission history

From: Joohyung Lee [view email]
[v1] Fri, 16 Feb 2024 11:28:50 UTC (1,335 KB)
[v2] Mon, 11 Aug 2025 04:29:32 UTC (1,173 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.CV
< prev   |   next >
new | recent | 2024-02
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号