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:2501.00734

Help | Advanced Search

Computer Science > Computer Vision and Pattern Recognition

arXiv:2501.00734 (cs)
[Submitted on 1 Jan 2025 ]

Title: DDD: Discriminative Difficulty Distance for plant disease diagnosis

Title: DDD:用于植物疾病诊断的判别难度距离

Authors:Yuji Arima, Satoshi Kagiwada, Hitoshi Iyatomi
Abstract: Recent studies on plant disease diagnosis using machine learning (ML) have highlighted concerns about the overestimated diagnostic performance due to inappropriate data partitioning, where training and test datasets are derived from the same source (domain). Plant disease diagnosis presents a challenging classification task, characterized by its fine-grained nature, vague symptoms, and the extensive variability of image features within each domain. In this study, we propose the concept of Discriminative Difficulty Distance (DDD), a novel metric designed to quantify the domain gap between training and test datasets while assessing the classification difficulty of test data. DDD provides a valuable tool for identifying insufficient diversity in training data, thus supporting the development of more diverse and robust datasets. We investigated multiple image encoders trained on different datasets and examined whether the distances between datasets, measured using low-dimensional representations generated by the encoders, are suitable as a DDD metric. The study utilized 244,063 plant disease images spanning four crops and 34 disease classes collected from 27 domains. As a result, we demonstrated that even if the test images are from different crops or diseases than those used to train the encoder, incorporating them allows the construction of a distance measure for a dataset that strongly correlates with the difficulty of diagnosis indicated by the disease classifier developed independently. Compared to the base encoder, pre-trained only on ImageNet21K, the correlation higher by 0.106 to 0.485, reaching a maximum of 0.909.
Abstract: 最近使用机器学习(ML)进行植物疾病诊断的研究强调了由于数据划分不当而导致的诊断性能被高估的问题,其中训练集和测试集的数据来源于同一来源(领域)。 植物疾病诊断是一个具有挑战性的分类任务,其特点包括细粒度、模糊的症状以及每个领域内图像特征的广泛变异性。 在本研究中,我们提出了判别难度距离(DDD)的概念,这是一种新的度量标准,旨在量化训练集和测试集之间的领域差距,同时评估测试数据的分类难度。 DDD为识别训练数据中的不足多样性提供了有价值的工具,从而支持构建更加多样和稳健的数据集。 我们研究了在不同数据集上训练的多个图像编码器,并检查了通过编码器生成的低维表示测量的数据集之间的距离是否适合作为DDD度量标准。 该研究使用了来自27个领域的四种作物和34种疾病类别的244,063张植物疾病图像。 结果表明,即使测试图像来自与编码器训练时不同的作物或疾病,将其纳入可以构建一个与独立开发的疾病分类器所指示的诊断难度高度相关的数据集距离度量。 与仅在ImageNet21K上预训练的基础编码器相比,相关性提高了0.106至0.485,最高达到0.909。
Comments: 8 pages, 2 figures, 3 tables. Accepted at 4th Annual AAAI Workshop on AI to Accelerate Science and Engineering (AI2ASE)
Subjects: Computer Vision and Pattern Recognition (cs.CV) ; Machine Learning (cs.LG)
Cite as: arXiv:2501.00734 [cs.CV]
  (or arXiv:2501.00734v1 [cs.CV] for this version)
  https://doi.org/10.48550/arXiv.2501.00734
arXiv-issued DOI via DataCite

Submission history

From: Yuji Arima [view email]
[v1] Wed, 1 Jan 2025 05:34:59 UTC (286 KB)
Full-text links:

Access Paper:

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

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号