全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于连接点的二维多角弧匹配

DOI: 10.11834/jig.200304156

Keywords: 连接点,二维多角弧匹配,拓扑结构,模拟试验,特征集

Full-Text   Cite this paper   Add to My Lib

Abstract:

多角弧匹配问题的关键是,其既能反映多角弧的几何性质,又能反映多角弧拓扑结构的特征选取.在分析了多角弧几何形状的基础上,引入了连接点的概念,并用连接点集表示多角弧,这一表示在旋转和平移变换下是不变的。进一步取该连接点集作为匹配的特征集,给出了特征集之间匹配的算法.该算法是将连接点间的距离积分作为测量函数,使二维多角弧的匹配由连接点的匹配来决定.给出的模拟试验结果表明,该算法效果良好,并且对于数值污染具有健壮性。

References

[1]  [2]黄良明,彭立中,程明德.利用几何代数进行线段模型匹配和运动估计[J].中国图象图形学报,2001,6A(3):270~274.
[2]  [4]Theodosios, Pavlidis. The use of a Syntactic Shape Analyzer for Contour Matching[J]. IEEE Trans. PAMI, 1979,1 (3): 307~310.
[3]  [6]Zhengyou Zhan. Estimating motion and Structure from Correspondences of line Segments between two perspective Image[J],IEEE Trans. PAMI, 1995, 17(12) :1129~1139.
[4]  [8]Wang guo-jin, Wang guo-zhao. Computer. Aided Geometric Design [M]. Beijing: China Higher Education press, Berlin Heidelberg: Springer Verlag press, 2001.
[5]  [1]Douglas R, Prabir. Matching 2D Polygonal Arcs by using a subgroup of the unit Quaternions[J]. Computer Vision and Image Understanding,1998, 69(2) :246~249.
[6]  [3]Parsi B, Margalit A, Rosenfeld. Matching general polygonal arcs [J]. Computer Vision, Graphics and Image Processing,Image Understanding, 1991, 53(2): 227~234.
[7]  [5]Ross Beveridge J, Edward M Riseman. How easy is Matching 2D line models using local search? [J]. IEEE Trans. PAMI,1997, 19(6) :564~579.
[8]  [7]Xinquan Shen, Phil Palmer. Uncertainty propagation and the Matching of Junction as Feature Groupings [J]. IEEE Trans.PAMI, 2000,22(12) :1381~1395.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133