OPTIMIZATION MODELS FOR SHAPE-MATCHING OF NONCONVEX POLYGONS

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

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:	[Graduate Institute of Industrial Management] journal & Dissertation

Files in This Item:

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

社群 sharing