{"title":"基于特征点的形状匹配","authors":"Yuhua Li, Jianqiang Sheng","doi":"10.1109/ICDH.2012.61","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a shape contexts based method which incorporates appearance similarity term into the correspondence estimation to improve the performance of shape matching. The optimal correspondence result then can be acquired by balancing the cost of matching and appearance similarity. On the other hand, a feature-points based matching algorithm is also presented to reduce the search space and improve the efficiency on shape matching. The algorithm is tested on two famous databases, namely, the database of MPEG-7 CE-Shape-1 part B and the coil-100 database. We also evaluate this algorithm on some images with noisy background. The experimental results show that our approach is robust and efficient in images with noise.","PeriodicalId":308799,"journal":{"name":"2012 Fourth International Conference on Digital Home","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feature-Points Based Shape Matching\",\"authors\":\"Yuhua Li, Jianqiang Sheng\",\"doi\":\"10.1109/ICDH.2012.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a shape contexts based method which incorporates appearance similarity term into the correspondence estimation to improve the performance of shape matching. The optimal correspondence result then can be acquired by balancing the cost of matching and appearance similarity. On the other hand, a feature-points based matching algorithm is also presented to reduce the search space and improve the efficiency on shape matching. The algorithm is tested on two famous databases, namely, the database of MPEG-7 CE-Shape-1 part B and the coil-100 database. We also evaluate this algorithm on some images with noisy background. The experimental results show that our approach is robust and efficient in images with noise.\",\"PeriodicalId\":308799,\"journal\":{\"name\":\"2012 Fourth International Conference on Digital Home\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Digital Home\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDH.2012.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Digital Home","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDH.2012.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了一种基于形状上下文的方法,该方法将外观相似项引入到对应估计中,以提高形状匹配的性能。然后通过平衡匹配成本和外观相似度,获得最优对应结果。另一方面,提出了一种基于特征点的形状匹配算法,减少了形状匹配的搜索空间,提高了形状匹配的效率。该算法在MPEG-7 CE-Shape-1 part B数据库和coil-100数据库两个著名数据库上进行了测试。我们还对一些带有噪声背景的图像进行了评价。实验结果表明,该方法对带有噪声的图像具有较好的鲁棒性和有效性。
In this paper, we propose a shape contexts based method which incorporates appearance similarity term into the correspondence estimation to improve the performance of shape matching. The optimal correspondence result then can be acquired by balancing the cost of matching and appearance similarity. On the other hand, a feature-points based matching algorithm is also presented to reduce the search space and improve the efficiency on shape matching. The algorithm is tested on two famous databases, namely, the database of MPEG-7 CE-Shape-1 part B and the coil-100 database. We also evaluate this algorithm on some images with noisy background. The experimental results show that our approach is robust and efficient in images with noise.