@article{8c833e409b4040f288647d6d58deb3ca,
title = "Optimal matching of closed contours with line segments and arcs",
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.",
keywords = "Decent algorithm, Minimax error, Optimization, Shape representation",
author = "Chen, {Jen Ming}",
note = "Funding Information: Recently, the shape matching problems have been formulated as optimization models and solved by sophisticated mathematical techniques, such as using the Lagrangian relaxation and the primal-dual schemes (Mundy et al., 1992; Noble et al., 1992; Ventura et al., 1995) and the gradient-based descent algorithms (Chen J This research was partially supported by the National Science Council (Taiwan) under Grant NSC84-2213-E-008-011. 2 E-mail: jmchen@im.mgt.ncu.edu.tw.",
year = "1997",
month = jun,
doi = "10.1016/S0167-8655(97)00040-8",
language = "???core.languages.en_GB???",
volume = "18",
pages = "567--574",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
number = "6",
}