首页> 外文期刊>Multimedia Tools and Applications >Tea category identification based on optimal wavelet entropy and weighted k-Nearest Neighbors algorithm
【24h】

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

机译:基于最优小波熵和加权k最近邻算法的茶类识别

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:茶的分类对工业应用至关重要。我们基于机器学习和计算机视觉开发了一种茶类别识别系统,旨在自动准确地对不同类型的茶进行分类。使用3-CCD数码相机获得了三类茶的75张照片,分别是绿色,黑色和乌龙茶。经过预处理,我们使用2级小波变换获得了7个系数子带,并从系数子带中提取熵作为特征。最后,训练了加权k最近邻算法进行分类。在5 x 5倍交叉验证中的实验结果表明,该方法对绿茶,乌龙茶和红茶的灵敏度分别达到95.2%,90.4%和98.4%。我们获得了94.7%的总体准确度。识别新图像的平均时间仅为0.0491 s。我们的方法准确有效地识别茶叶种类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号