4.6 Article

Tea category identification based on optimal wavelet entropy and weighted k-Nearest Neighbors algorithm

期刊

MULTIMEDIA TOOLS AND APPLICATIONS
卷 77, 期 3, 页码 3745-3759

出版社

SPRINGER
DOI: 10.1007/s11042-016-3931-z

关键词

Optimal wavelet entropy; Weighted k-Nearest Neighbors; Tea category identification; Pattern recognition

资金

  1. NSFC [61602250]
  2. Natural Science Foundation of Jiangsu Province [BK20150983]
  3. Open Project Program of the State Key Lab of CADAMP
  4. CG, Zhejiang University [A1616]
  5. Open Research Fund of Hunan Provincial Key Laboratory of Network Investigational Technology [2016WLZC013]
  6. Open Fund of Fujian Provincial Key Laboratory of Data Intensive Computing [BD201607]

向作者/读者索取更多资源

Tea category classification is of vital importance to industrial applications. We developed a tea-category identification system based on machine learning and computer vision with the aim of classifying different tea types automatically and accurately. 75 photos of three categories of tea were obtained with 3-CCD digital camera, they are green, black, and oolong. After preprocessing, we obtained 7 coefficient subbands using 2-level wavelet transform, and extracted the entropies from the coefficient subbands as the features. Finally, a weighted k-Nearest Neighbors algorithm was trained for the classification. The experiment results over 5 x 5-fold cross validation showed that the proposed approach achieved sensitivities of 95.2 %, 90.4 %, and 98.4 %, for green, oolong, and black tea, respectively. We obtained an overall accuracy of 94.7 %. The average time to identify a new image was merely 0.0491 s. Our method is accurate and efficient in identifying tea categories.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据