OPTIMAL MATCHING OF GENERAL POLYGONS BASED ON THE MINIMUM ZONE ERROR

被引：7

作者：

VENTURA, JA

NAIN, LY

WAN, WH

机构：

[1] Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA 16802

来源：

PATTERN RECOGNITION LETTERS | 1995年 / 16卷 / 11期

关键词：

SHAPE MATCHING; POLYGON; MINIMUM ZONE ERROR; MINIMAX; PROFILE TOLERANCE; OPTIMIZATION MODEL;

D O I：

10.1016/0167-8655(95)00026-D

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents a parametric approach for the matching of polygonal profiles based on the tolerancing requirements defined by the ANSI standards. The polygonal matching problem is formulated as a minimax optimization model and a procedure for solving this optimization model is developed.

引用

页码：1125 / 1136

页数：12

共 26 条

[1]

[Anonymous], 1982, DIMENSIONING TOLERAN

[2] AN EFFICIENTLY COMPUTABLE METRIC FOR COMPARING POLYGONAL SHAPES [J].

ARKIN, EM ;

CHEW, LP ;

HUTTENLOCHER, DP ;

KEDEM, K ;

MITCHELL, JSB .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (03) :209-216

[3] SEGMENTATION OF TWO-DIMENSIONAL BOUNDARIES USING THE CHAIN CODE [J].

BARUCH, O ;

LOEW, MH .

PATTERN RECOGNITION, 1988, 21 (06) :581-589

[4]

BAZARAA M, 1990, LINEAR PROGRAMMING N

[5]

Bazaraa MS, 1994, NONLINEAR PROGRAMMIN

[6] ON THE APPROXIMATION OF CURVES BY LINE SEGMENTS USING DYNAMIC PROGRAMMING [J].

BELLMAN, R .

COMMUNICATIONS OF THE ACM, 1961, 4 (06) :284-284

[7] INSPECTION OF 2-D OBJECTS USING PATTERN-MATCHING METHOD [J].

HAN, MH ;

JANG, DS ;

FOSTER, J .

PATTERN RECOGNITION, 1989, 22 (05) :567-575

[8] MATCHING POLYGON FRAGMENTS [J].

KOCH, MW ;

KASHYAP, RL .

PATTERN RECOGNITION LETTERS, 1989, 10 (05) :297-308

[9]

LAI D, 1988, 16TH N AM MAN RES C, P376

[10] POLYGONAL SHAPE-RECOGNITION USING STRING-MATCHING TECHNIQUES [J].

MAES, M .

PATTERN RECOGNITION, 1991, 24 (05) :433-440

← 1 2 3 →