English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23106152      Online Users : 134
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    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:[產業經濟研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML349View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明