ON THE MOST ROBUST AFFINE BASIS

被引：4

作者：

GOTSMAN, C

机构：

[1] Department of Computer Science, Technion, Haifa

来源：

PATTERN RECOGNITION LETTERS | 1993年 / 14卷 / 08期

关键词：

D O I：

10.1016/0167-8655(93)90050-N

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Let K be a planar convex region. In many pattern recognition applications an affine basis is used to represent the points of K. We show that the vertices of a triangle inscribed in K with maximal area are a relatively robust affine basis. If K is a convex n-gon, this basis may be computed in O(n) time, hence it is the most practical basis of choice.

引用

页码：647 / 650

页数：4