3D Objects Retrieval using Geodesic Distance Based on Eikonal equation

Driss Naji, M. Fakir, O. Bencharef
{"title":"3D Objects Retrieval using Geodesic Distance Based on Eikonal equation","authors":"Driss Naji, M. Fakir, O. Bencharef","doi":"10.11591/IJEECS.V15.I3.PP597-604","DOIUrl":null,"url":null,"abstract":"Recently, shape-based matching and retrieval of 3D polygonal models has become one of the most fundamental problems in computer vision. Dealing with families of objects instead of a single one may impose further challenges on regular geometric algorithms. In this paper we focus on the classification of 3D objects based on their geodesic distance & path calculated on a mesh using an iterative algorithm for solving the Eikonal equation. For the classification process, we use both Multiclass Support Vector Machine (M-SVM) classifier,K-Nearest Neighbors (KNN), Decision Tree (DT) and Artificial Neural Networks (ANN) to better evaluate our descriptors. We illustrate the potential of extracted characteristics by two 3D benchmarks. The recognition rates achieved in all experiments show that a small number of curve between 9 and 12 can correctly categorize a family of 3D objects.","PeriodicalId":247642,"journal":{"name":"TELKOMNIKA Indonesian Journal of Electrical Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"TELKOMNIKA Indonesian Journal of Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/IJEECS.V15.I3.PP597-604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recently, shape-based matching and retrieval of 3D polygonal models has become one of the most fundamental problems in computer vision. Dealing with families of objects instead of a single one may impose further challenges on regular geometric algorithms. In this paper we focus on the classification of 3D objects based on their geodesic distance & path calculated on a mesh using an iterative algorithm for solving the Eikonal equation. For the classification process, we use both Multiclass Support Vector Machine (M-SVM) classifier,K-Nearest Neighbors (KNN), Decision Tree (DT) and Artificial Neural Networks (ANN) to better evaluate our descriptors. We illustrate the potential of extracted characteristics by two 3D benchmarks. The recognition rates achieved in all experiments show that a small number of curve between 9 and 12 can correctly categorize a family of 3D objects.
基于Eikonal方程的测地线距离三维目标检索
近年来,基于形状的三维多边形模型匹配与检索已成为计算机视觉领域的一个最基本的问题。处理对象族而不是单个对象可能会给常规几何算法带来进一步的挑战。在本文中,我们重点研究了基于网格上计算的测地线距离和路径的三维物体分类,使用迭代算法求解Eikonal方程。对于分类过程,我们使用多类支持向量机(M-SVM)分类器、k -近邻(KNN)、决策树(DT)和人工神经网络(ANN)来更好地评估我们的描述符。我们通过两个3D基准来说明提取特征的潜力。所有实验的识别率表明,在9 ~ 12之间的少量曲线可以正确地对一类三维物体进行分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信