Shape retrieval using concavity trees

O. Badawy, M. Kamel
{"title":"Shape retrieval using concavity trees","authors":"O. Badawy, M. Kamel","doi":"10.1109/ICPR.2004.1334481","DOIUrl":null,"url":null,"abstract":"Concavity trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The first is an efficient (in terms of space and time) contour-based concavity tree extraction algorithm. The second component is a recursive concavity-tree matching algorithm that returns a distance between two trees. We demonstrate that concavity trees are able to boost the retrieval performance of two feature sets by at least 15% when tested on a database of 625 silhouette images.","PeriodicalId":335842,"journal":{"name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2004.1334481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Concavity trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The first is an efficient (in terms of space and time) contour-based concavity tree extraction algorithm. The second component is a recursive concavity-tree matching algorithm that returns a distance between two trees. We demonstrate that concavity trees are able to boost the retrieval performance of two feature sets by at least 15% when tested on a database of 625 silhouette images.
利用凹形树进行形状检索
凹树是众所周知的抽象结构。提出了一种基于凹树的基于形状的图像检索方法。该方法主要由两个部分组成。首先是一种有效的(在空间和时间方面)基于轮廓的凹树提取算法。第二个组件是一个递归的凹树匹配算法,它返回两棵树之间的距离。在625张轮廓图像的数据库中,我们证明了凹形树能够将两个特征集的检索性能提高至少15%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信