基于改进对偶Hahn矩不变性的高效图像分类

Rachid Benouini, Imad Batioua, Zaineb Bahaoui, Khalid Zenkouar, H. Qjidaa
{"title":"基于改进对偶Hahn矩不变性的高效图像分类","authors":"Rachid Benouini, Imad Batioua, Zaineb Bahaoui, Khalid Zenkouar, H. Qjidaa","doi":"10.1109/ISACV.2018.8354034","DOIUrl":null,"url":null,"abstract":"The discrete orthogonal moments and moment invariants are powerful descriptors for image analysis and computer vision. However, until now obtaining moment invariants had always needed much computation time and numerical accuracy, which has not been resolved well. Therefore, the main purpose of this paper is to introduce an efficient set of discrete orthogonal moment invariants, named Improved dual Hahn Moment Invariants (IDHMI). The proposed IDHMI are based on a recursive methods for the computation of dual-Hahn polynomials coefficients. These recursive methods permits the fast and accurate computation of the dual Hahn Moment Invariants. In fact, this new set can be used to extract invariant shape features regardless the change of shape's orientation, size and position. Consequently, a series of numerical experiment are performed in order to evaluate the performance of the proposed moment invariants, with regard to the numerical stability, computational time and recognition accuracy. The theoretical and experimental results clearly show the applicability and the efficiency of the proposed method.","PeriodicalId":184662,"journal":{"name":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient image classification by using improved dual Hahn Moment Invariants\",\"authors\":\"Rachid Benouini, Imad Batioua, Zaineb Bahaoui, Khalid Zenkouar, H. Qjidaa\",\"doi\":\"10.1109/ISACV.2018.8354034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The discrete orthogonal moments and moment invariants are powerful descriptors for image analysis and computer vision. However, until now obtaining moment invariants had always needed much computation time and numerical accuracy, which has not been resolved well. Therefore, the main purpose of this paper is to introduce an efficient set of discrete orthogonal moment invariants, named Improved dual Hahn Moment Invariants (IDHMI). The proposed IDHMI are based on a recursive methods for the computation of dual-Hahn polynomials coefficients. These recursive methods permits the fast and accurate computation of the dual Hahn Moment Invariants. In fact, this new set can be used to extract invariant shape features regardless the change of shape's orientation, size and position. Consequently, a series of numerical experiment are performed in order to evaluate the performance of the proposed moment invariants, with regard to the numerical stability, computational time and recognition accuracy. The theoretical and experimental results clearly show the applicability and the efficiency of the proposed method.\",\"PeriodicalId\":184662,\"journal\":{\"name\":\"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)\",\"volume\":\"160 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISACV.2018.8354034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Intelligent Systems and Computer Vision (ISCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACV.2018.8354034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

离散正交矩和矩不变量是图像分析和计算机视觉的有力描述符。然而,矩不变量的获取一直需要大量的计算时间和数值精度,这一问题一直没有得到很好的解决。因此,本文的主要目的是引入一组有效的离散正交矩不变量,称为改进对偶Hahn矩不变量(IDHMI)。所提出的IDHMI是基于双hahn多项式系数的递归计算方法。这些递归方法可以快速准确地计算对偶Hahn矩不变量。事实上,这个新的集合可以用来提取不受形状方向、大小和位置变化影响的不变形状特征。因此,为了评估所提出的矩不变量在数值稳定性、计算时间和识别精度方面的性能,进行了一系列的数值实验。理论和实验结果表明了该方法的适用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient image classification by using improved dual Hahn Moment Invariants
The discrete orthogonal moments and moment invariants are powerful descriptors for image analysis and computer vision. However, until now obtaining moment invariants had always needed much computation time and numerical accuracy, which has not been resolved well. Therefore, the main purpose of this paper is to introduce an efficient set of discrete orthogonal moment invariants, named Improved dual Hahn Moment Invariants (IDHMI). The proposed IDHMI are based on a recursive methods for the computation of dual-Hahn polynomials coefficients. These recursive methods permits the fast and accurate computation of the dual Hahn Moment Invariants. In fact, this new set can be used to extract invariant shape features regardless the change of shape's orientation, size and position. Consequently, a series of numerical experiment are performed in order to evaluate the performance of the proposed moment invariants, with regard to the numerical stability, computational time and recognition accuracy. The theoretical and experimental results clearly show the applicability and the efficiency of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信