.png){kind=icon}
返回
Least-Squares Contour Alignment
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2008.2008588.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The contour alignment problem, considered in this letter, is to compute the minimal distance in a least-squares sense, between two explicitly represented contours, specified by corresponding points, after arbitrary rotation, scaling, and translation of one of the contours. This is a constrained nonlinear optimization problem with respect to the translation, rotation, and scaling parameters; however, it is transformed into an equivalent linear least-squares problem by a nonlinear change of variables. Therefore, a global solution of the contour alignment problem can be computed efficiently. It is shown that a normalized minimum value of the cost function is invariant to ordering and affine transformation of the contours and can be used as a measure for the distance between the contours. A solution is proposed to the problem of finding a point correspondence between the contours.
Keyword:
Contour alignment
image registration
invariance
least squares
rotation
scaling
translation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
没有更多内容
没有更多内容