There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
A novel robust active appearance model (AAM) matching algorithm is presented. The method consists of two main stages. First, initial residuals are clustered by a non parametric mea...
Reinhard Beichel, Horst Bischof, Franz Leberl, Mil...
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...