Optimal matching of closed contours with line segments and arcs

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Economics > journal & Dissertation > Item 987654321/29567

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29567

Title:	Optimal matching of closed contours with line segments and arcs
Authors:	Chen,JM
Contributors:	產業經濟研究所
Date:	1997
Issue Date:	2010-06-29 20:31:30 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	PATTERN RECOGNITION LETTERS
Appears in Collections:	[Graduate Institute of Industrial Economics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	469	View/Open

社群 sharing