Recognizing Planar Curve Based on NRLCTI and Match Sub-curve

Gui-mei Zhang, M. Gao
{"title":"Recognizing Planar Curve Based on NRLCTI and Match Sub-curve","authors":"Gui-mei Zhang, M. Gao","doi":"10.1109/CADCG.2007.4407862","DOIUrl":null,"url":null,"abstract":"A new method is proposed to match planar curves under affine transformation in this paper. First, the definition of NRLCTI (normalized run length code of conner and tangent and inflexion points) of a two-dimensional curve is given. In terms of NRLCTI, we can match feature points both on object and models preliminarily. Then a method for estimating optimal affine transformation is given based on Frobenius norm. And then a new algorithm is designed to match sub-curves, which can cope with the problem that the curve represented by the feature points is not always unique. Last a novel approach is set up to recognize curves from a line drawing or image. By partitioning the curve into many sub-curve based on landmarks, then matching and recognizing them, the low accuracy for curve approximated by polygon or conies curve can be overcome. Computer simulations demonstrate the effectiveness of the algorithm preliminarily.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"285 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CADCG.2007.4407862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A new method is proposed to match planar curves under affine transformation in this paper. First, the definition of NRLCTI (normalized run length code of conner and tangent and inflexion points) of a two-dimensional curve is given. In terms of NRLCTI, we can match feature points both on object and models preliminarily. Then a method for estimating optimal affine transformation is given based on Frobenius norm. And then a new algorithm is designed to match sub-curves, which can cope with the problem that the curve represented by the feature points is not always unique. Last a novel approach is set up to recognize curves from a line drawing or image. By partitioning the curve into many sub-curve based on landmarks, then matching and recognizing them, the low accuracy for curve approximated by polygon or conies curve can be overcome. Computer simulations demonstrate the effectiveness of the algorithm preliminarily.
基于NRLCTI和匹配子曲线的平面曲线识别
提出了一种仿射变换下平面曲线匹配的新方法。首先,给出了二维曲线的角、切、拐点归一化行程长度编码NRLCTI的定义;在NRLCTI中,我们可以初步匹配对象和模型上的特征点。然后给出了一种基于Frobenius范数的最优仿射变换估计方法。然后设计了一种新的子曲线匹配算法,该算法可以解决特征点表示的曲线不总是唯一的问题。最后,提出了一种从直线图或图像中识别曲线的新方法。通过基于地标将曲线划分为多个子曲线,然后进行匹配和识别,克服了多边形或圆锥曲线近似曲线精度低的问题。计算机仿真初步验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信