DDD: Discriminative Difficulty Distance for plant disease diagnosis
Yuji Arima, Satoshi Kagiwada, Hitoshi Iyatomi

TL;DR
This paper introduces Discriminative Difficulty Distance (DDD), a new metric to measure the domain gap and classification difficulty in plant disease diagnosis datasets, helping to improve dataset diversity and robustness.
Contribution
The study proposes DDD as a novel metric for quantifying domain differences and diagnosis difficulty, validated across extensive plant disease image datasets.
Findings
DDD correlates strongly with diagnosis difficulty.
Pre-trained encoders enhance the accuracy of DDD.
Dataset diversity impacts classification performance.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSmart Agriculture and AI
MethodsBalanced Selection
