基于Freeman链码的曲线匹配算法

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems Pub Date : 2010-12-06 DOI:10.1109/ICICISYS.2010.5658385

Bo Yu, Lei Guo, Tian-yun Zhao, Xiaoliang Qian

{"title":"基于Freeman链码的曲线匹配算法","authors":"Bo Yu, Lei Guo, Tian-yun Zhao, Xiaoliang Qian","doi":"10.1109/ICICISYS.2010.5658385","DOIUrl":null,"url":null,"abstract":"Curve matching is an important method to object recognition; traditional methods are difficult to deal with the curves which contain rotation, scale operations. In this paper a curve matching algorithm based on Freeman Chain Code is proposed. This method is free from curve rotation, scale operations and translation, it even has less calculation, easy to implement, so the method proposed is a practical curve matching algorithm.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A curve matching algorithm based on Freeman Chain Code\",\"authors\":\"Bo Yu, Lei Guo, Tian-yun Zhao, Xiaoliang Qian\",\"doi\":\"10.1109/ICICISYS.2010.5658385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Curve matching is an important method to object recognition; traditional methods are difficult to deal with the curves which contain rotation, scale operations. In this paper a curve matching algorithm based on Freeman Chain Code is proposed. This method is free from curve rotation, scale operations and translation, it even has less calculation, easy to implement, so the method proposed is a practical curve matching algorithm.\",\"PeriodicalId\":339711,\"journal\":{\"name\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2010.5658385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2010.5658385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

曲线匹配是目标识别的重要方法;传统方法难以处理包含旋转、缩放操作的曲线。本文提出了一种基于Freeman链码的曲线匹配算法。该方法不需要进行曲线旋转、尺度运算和平移，计算量少，易于实现，是一种实用的曲线匹配算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A curve matching algorithm based on Freeman Chain Code

Curve matching is an important method to object recognition; traditional methods are difficult to deal with the curves which contain rotation, scale operations. In this paper a curve matching algorithm based on Freeman Chain Code is proposed. This method is free from curve rotation, scale operations and translation, it even has less calculation, easy to implement, so the method proposed is a practical curve matching algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems

自引率

0.00%

发文量