An Evaluation of Image Texture Descriptors and their Invariant Properties

Roxana Sipos-Lascu, L. Dioşan
{"title":"An Evaluation of Image Texture Descriptors and their Invariant Properties","authors":"Roxana Sipos-Lascu, L. Dioşan","doi":"10.1109/SYNASC57785.2022.00052","DOIUrl":null,"url":null,"abstract":"Image processing applications include image classification, image segmentation, image synthesis and many others. Each such task depends on extracting an effective set of features to characterize the images, and texture analysis has proven to output some of the most valuable features. For this reason, image texture analysis has been an actively researched topic and numerous methods have been proposed, each of them having its advantages and limitations. In practical applications, it is impossible to ensure that all images have the same scale, rotation, viewpoint, etc., so texture analysis methods should ideally be invariant. This study inspects the most commonly used operators for extracting textural features, tests their accuracy in classifying the Kylberg texture dataset, and evaluates their invariant properties by the means of various synthetically transformed images. By conducting this analysis, we identified the shortcomings of the existing approaches, and will be able to address them in our future work by formulating some improvements to existing operators to increase their accuracy and to make them invariant to a larger set of transformations.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Image processing applications include image classification, image segmentation, image synthesis and many others. Each such task depends on extracting an effective set of features to characterize the images, and texture analysis has proven to output some of the most valuable features. For this reason, image texture analysis has been an actively researched topic and numerous methods have been proposed, each of them having its advantages and limitations. In practical applications, it is impossible to ensure that all images have the same scale, rotation, viewpoint, etc., so texture analysis methods should ideally be invariant. This study inspects the most commonly used operators for extracting textural features, tests their accuracy in classifying the Kylberg texture dataset, and evaluates their invariant properties by the means of various synthetically transformed images. By conducting this analysis, we identified the shortcomings of the existing approaches, and will be able to address them in our future work by formulating some improvements to existing operators to increase their accuracy and to make them invariant to a larger set of transformations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图像纹理描述符及其不变性的评估
图像处理的应用包括图像分类、图像分割、图像合成等。每个这样的任务都依赖于提取一组有效的特征来描述图像,纹理分析已经被证明可以输出一些最有价值的特征。因此,图像纹理分析一直是一个活跃的研究课题,并提出了许多方法,每种方法都有其优点和局限性。在实际应用中,不可能保证所有图像都具有相同的尺度、旋转、视点等,因此纹理分析方法最好是不变的。本研究考察了最常用的纹理特征提取算子,测试了它们在Kylberg纹理数据集分类中的准确性,并通过各种综合变换图像评估了它们的不变性。通过进行此分析,我们确定了现有方法的缺点,并将能够在我们未来的工作中通过制定对现有操作符的一些改进来解决它们,以提高它们的准确性,并使它们对更大的转换集保持不变。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FERPModels: A Certification Framework for Expansion-Based QBF Solving Reducing Adversarial Vulnerability Using GANs Fully-adaptive Model for Broadcasting with Universal Lists An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem* IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1