4.6 Article

Interactive Deep Learning for Shelf Life Prediction of Muskmelons Based on an Active Learning Approach

Journal

SENSORS
Volume 22, Issue 2, Pages -

Publisher

MDPI
DOI: 10.3390/s22020414

Keywords

deep learning; quality monitoring; agriculture; active learning

Funding

  1. German Federal Ministry of Education and Research (BMBF)

Ask authors/readers for more resources

This paper studies the applicability of active learning in grading 'Galia' muskmelons based on their shelf life. The proposed k-Determinantal Point Processes (k-DPP) method allows for better exploration of the data distribution while achieving the same results as uncertainty-based methods. Diversity-based acquisition is recommended when labeled samples are scarce to achieve better exploration.
A pivotal topic in agriculture and food monitoring is the assessment of the quality and ripeness of agricultural products by using non-destructive testing techniques. Acoustic testing offers a rapid in situ analysis of the state of the agricultural good, obtaining global information of its interior. While deep learning (DL) methods have outperformed state-of-the-art benchmarks in various applications, the reason for lacking adaptation of DL algorithms such as convolutional neural networks (CNNs) can be traced back to its high data inefficiency and the absence of annotated data. Active learning is a framework that has been heavily used in machine learning when the labelled instances are scarce or cumbersome to obtain. This is specifically of interest when the DL algorithm is highly uncertain about the label of an instance. By allowing the human-in-the-loop for guidance, a continuous improvement of the DL algorithm based on a sample efficient manner can be obtained. This paper seeks to study the applicability of active learning when grading 'Galia' muskmelons based on its shelf life. We propose k-Determinantal Point Processes (k-DPP), which is a purely diversity-based method that allows to take influence on the exploration within the feature space based on the chosen subset k. While getting coequal results to uncertainty-based approaches when k is large, we simultaneously obtain a better exploration of the data distribution. While the implementation based on eigendecomposition takes up a runtime of O(n(3)), this can further be reduced to O(n & BULL;poly(k)) based on rejection sampling. We suggest the use of diversity-based acquisition when only a few labelled samples are available, allowing for better exploration while counteracting the disadvantage of missing the training objective in uncertainty-based methods following a greedy fashion.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available