基于异常值检测技术和高斯混合模型的椰枣果实自动识别

Q4 Computer Science
Oussama Aiadi, M. L. Kherfi, Belal Khaldi
{"title":"基于异常值检测技术和高斯混合模型的椰枣果实自动识别","authors":"Oussama Aiadi, M. L. Kherfi, Belal Khaldi","doi":"10.5565/REV/ELCVIA.1041","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a method for automatically recognizing different date varieties. The presence of outlier samples could significantly degrade the recognition outcomes. Therefore, we separately prune samples of each variety from outliers using the Pruning Local Distance-based Outlier Factor (PLDOF) method. Samples of the same variety could have several visual appearances because of the noticeable variation in terms of their visual characteristics. Thus, in order to take this intra-variation into account, we model each variety with a Gaussian Mixture Model (GMM), where each component within the GMM corresponds to one visual appearance. Expectation-Maximization (EM) algorithm was used for parameters estimation and Davies-Bouldin index was used to automatically and precisely estimate the number of components (i.e., appearances). Compared to the related studies, the proposed method 1) is capable to recognize samples though the noticeable variation, in terms of maturity stage and hardness degree, within some varieties; 2) achieves a high recognition rate in spite of the presence of outlier samples; 3) is capable to distinguish between the highly confusing varieties; 4) is fully automatic, as it does not require neither physical measurements nor human assistance. For testing purposes, we introduce a new benchmark which includes the highest number of varieties (11) compared to the previous studies. Experiments show that our method has significantly outperformed several methods, where a high recognition rate of 97.8% has been reached.","PeriodicalId":38711,"journal":{"name":"Electronic Letters on Computer Vision and Image Analysis","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Automatic Date Fruit Recognition Using Outlier Detection Techniques and Gaussian Mixture Models\",\"authors\":\"Oussama Aiadi, M. L. Kherfi, Belal Khaldi\",\"doi\":\"10.5565/REV/ELCVIA.1041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a method for automatically recognizing different date varieties. The presence of outlier samples could significantly degrade the recognition outcomes. Therefore, we separately prune samples of each variety from outliers using the Pruning Local Distance-based Outlier Factor (PLDOF) method. Samples of the same variety could have several visual appearances because of the noticeable variation in terms of their visual characteristics. Thus, in order to take this intra-variation into account, we model each variety with a Gaussian Mixture Model (GMM), where each component within the GMM corresponds to one visual appearance. Expectation-Maximization (EM) algorithm was used for parameters estimation and Davies-Bouldin index was used to automatically and precisely estimate the number of components (i.e., appearances). Compared to the related studies, the proposed method 1) is capable to recognize samples though the noticeable variation, in terms of maturity stage and hardness degree, within some varieties; 2) achieves a high recognition rate in spite of the presence of outlier samples; 3) is capable to distinguish between the highly confusing varieties; 4) is fully automatic, as it does not require neither physical measurements nor human assistance. For testing purposes, we introduce a new benchmark which includes the highest number of varieties (11) compared to the previous studies. Experiments show that our method has significantly outperformed several methods, where a high recognition rate of 97.8% has been reached.\",\"PeriodicalId\":38711,\"journal\":{\"name\":\"Electronic Letters on Computer Vision and Image Analysis\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Letters on Computer Vision and Image Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5565/REV/ELCVIA.1041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Letters on Computer Vision and Image Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5565/REV/ELCVIA.1041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 9

摘要

本文提出了一种自动识别不同日期的方法。异常样本的存在会显著降低识别结果。因此,我们使用基于局部距离的离群因子(PLDOF)方法对每个品种的样本从离群值中分别进行修剪。同一品种的样品可能有几种视觉外观,因为它们的视觉特征有明显的变化。因此,为了考虑到这种内部变化,我们用高斯混合模型(GMM)对每个品种进行建模,其中GMM中的每个成分对应于一个视觉外观。采用期望最大化(EM)算法进行参数估计,采用Davies-Bouldin指数自动精确地估计成分数(即外观)。与相关研究相比,本文提出的方法1)能够识别样品,尽管某些品种在成熟度和硬度上存在明显差异;2)在存在离群样本的情况下仍能获得较高的识别率;3)能够区分高度混淆的品种;4)是全自动的,因为它既不需要物理测量也不需要人工协助。为了测试目的,我们引入了一个新的基准,与之前的研究相比,它包含了最多的品种(11)。实验表明,该方法明显优于几种方法,识别率高达97.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automatic Date Fruit Recognition Using Outlier Detection Techniques and Gaussian Mixture Models
In this paper, we propose a method for automatically recognizing different date varieties. The presence of outlier samples could significantly degrade the recognition outcomes. Therefore, we separately prune samples of each variety from outliers using the Pruning Local Distance-based Outlier Factor (PLDOF) method. Samples of the same variety could have several visual appearances because of the noticeable variation in terms of their visual characteristics. Thus, in order to take this intra-variation into account, we model each variety with a Gaussian Mixture Model (GMM), where each component within the GMM corresponds to one visual appearance. Expectation-Maximization (EM) algorithm was used for parameters estimation and Davies-Bouldin index was used to automatically and precisely estimate the number of components (i.e., appearances). Compared to the related studies, the proposed method 1) is capable to recognize samples though the noticeable variation, in terms of maturity stage and hardness degree, within some varieties; 2) achieves a high recognition rate in spite of the presence of outlier samples; 3) is capable to distinguish between the highly confusing varieties; 4) is fully automatic, as it does not require neither physical measurements nor human assistance. For testing purposes, we introduce a new benchmark which includes the highest number of varieties (11) compared to the previous studies. Experiments show that our method has significantly outperformed several methods, where a high recognition rate of 97.8% has been reached.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Letters on Computer Vision and Image Analysis
Electronic Letters on Computer Vision and Image Analysis Computer Science-Computer Vision and Pattern Recognition
CiteScore
2.50
自引率
0.00%
发文量
19
审稿时长
12 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信