English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23059139      Online Users : 410
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/29539


    Title: OPTIMIZATION MODELS FOR SHAPE-MATCHING OF NONCONVEX POLYGONS
    Authors: CHEN,JM;VENTURA,JA
    Contributors: 工業管理研究所
    Keywords: RECOGNITION;OBJECTS
    Date: 1995
    Issue Date: 2010-06-29 20:27:31 (UTC+8)
    Publisher: 中央大學
    Abstract: The shape matching problem is concerned with fitting an input shape, represented by a set of discrete boundary data, to a defect-free reference shape. Two aspects of the problem must be considered: (1) shape modeling, and (2) matching algorithm. In this paper, two shape modeling schemes are proposed to represent the reference shape by a set of primitives, in which the object geometric configuration is encoded. The primitives uniquely define the pose and dimension of a given polygonal object. Based on these models, optimization matching procedures that use the least-squares criterion to find the best fitting between the set of scene data and the reference shape are developed. The complexity analysis and computational results show our shape matching approaches to be extremely fast.
    Relation: PATTERN RECOGNITION
    Appears in Collections:[工業管理研究所 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML457View/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  - 隱私權政策聲明