Combining Mahalanobis and Jaccard to Improve Shape Similarity Measurement in Sketch Recognition

S. S. Salleh, Noor Aznimah Abdul Aziz, D. Mohamad, Megawati Omar
{"title":"Combining Mahalanobis and Jaccard to Improve Shape Similarity Measurement in Sketch Recognition","authors":"S. S. Salleh, Noor Aznimah Abdul Aziz, D. Mohamad, Megawati Omar","doi":"10.1109/UKSIM.2011.67","DOIUrl":null,"url":null,"abstract":"Mahalanobis, Jaccard and others are similarity measurements which are commonly used in sketch recognition. Attempts to improve similarity measurement can be made by manipulating formulae and reducing the testing data set used but less effort are attempted to propose algorithm. Hence, the purpose of this study is to propose a new algorithm for a better method in shape recognition. To do so, Mahalanobis and Jaccard distance measures were combined to improve the similarity measure. The pre-processing involved feature analysis, shape normalization and shape perfection and data conversion into a binary. In the new algorithm, each edge of the geometric shape was separated and measured using Jaccard distance. Shapes that passed the threshold value were measured by Mahalanobis distance. The results showed that the similarity percentage had increased from 61% to 84%, thus accrued an improved average of 21.6% difference. Having this difference, the three outcomes of this study were a combined algorithm, a new technique of separating the strokes in Jaccard, and lastly, the use of extreme vertices in Mahalanobis similarity measurement to reduce computation time.","PeriodicalId":161995,"journal":{"name":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKSIM.2011.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Mahalanobis, Jaccard and others are similarity measurements which are commonly used in sketch recognition. Attempts to improve similarity measurement can be made by manipulating formulae and reducing the testing data set used but less effort are attempted to propose algorithm. Hence, the purpose of this study is to propose a new algorithm for a better method in shape recognition. To do so, Mahalanobis and Jaccard distance measures were combined to improve the similarity measure. The pre-processing involved feature analysis, shape normalization and shape perfection and data conversion into a binary. In the new algorithm, each edge of the geometric shape was separated and measured using Jaccard distance. Shapes that passed the threshold value were measured by Mahalanobis distance. The results showed that the similarity percentage had increased from 61% to 84%, thus accrued an improved average of 21.6% difference. Having this difference, the three outcomes of this study were a combined algorithm, a new technique of separating the strokes in Jaccard, and lastly, the use of extreme vertices in Mahalanobis similarity measurement to reduce computation time.
结合Mahalanobis和Jaccard改进素描识别中的形状相似度量
Mahalanobis, Jaccard和其他相似度测量通常用于草图识别。可以通过修改公式和减少使用的测试数据集来尝试改进相似性度量,但很少尝试提出算法。因此,本研究的目的是提出一种新的算法,以达到更好的形状识别方法。为此,将Mahalanobis和Jaccard距离测度相结合来改进相似性测度。预处理包括特征分析、形状归一化和形状完善以及数据转换为二进制。在新算法中,利用Jaccard距离对几何形状的每条边进行分离和测量。通过马氏距离测量通过阈值的形状。结果表明,相似性百分比从61%增加到84%,从而累积了21.6%的平均差异。有了这种差异,本研究的三个结果是一个组合算法,一种新的Jaccard笔画分离技术,最后,在Mahalanobis相似性测量中使用极端顶点来减少计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信