On the most robust affine basis

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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 languageEnglish (US)
Pages (from-to)647-650
Number of pages4
JournalPattern Recognition Letters
Issue number8
StatePublished - Aug 1993
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'On the most robust affine basis'. Together they form a unique fingerprint.

Cite this