Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 647-650 |
Number of pages | 4 |
Journal | Pattern Recognition Letters |
Volume | 14 |
Issue number | 8 |
DOIs | |
State | Published - Aug 1993 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence