Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
In this paper, we propose two effective methods to perform automatic template selection where the goal is to select prototype signature templates for a user from a given set of on...
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
One of the major limitations of HMM-based models is the inability to cope with topology: When applied to a visible observation (VO) sequence, HMM-based techniques have difficulty ...
In this paper, we propose a novel approach which integrates adaptive appearance model and hierarchical estimation mechanism composed of global estimation and local estimation. Hie...
Seok Min Yun, Jin Hee Na, Woo-Sung Kang, Jin Young...