30 search results - page 1 / 6 » Lipreading by Locality Discriminant Graph |
ICIP
2007
IEEE
13 years 8 months ago
2007
IEEE
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...