Optimal matching of closed contours with line segments and arcs

NCU Institutional Repository > 管理學院 > 產業經濟研究所 > 期刊論文 > Item 987654321/29567

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29567

題名:	Optimal matching of closed contours with line segments and arcs
作者:	Chen,JM
貢獻者:	產業經濟研究所
日期:	1997
上傳時間:	2010-06-29 20:31:30 (UTC+8)
出版者:	中央大學
摘要:	In this paper, a planar contour consisting of line segments and circular arcs is described in analytic form, and the contour matching problem is formulated as an optimization problem based on the criterion of minimax (or so-called minimal zone) errors. An iterative descent algorithm is developed to solve the multimodal and non-differentiable optimization problem, the solution of which reports the out-of-profile error and determines the scale and pose of the shape. (C) 1997 Elsevier Science B.V.
關聯:	PATTERN RECOGNITION LETTERS
顯示於類別:	[產業經濟研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	469	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing