In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
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...
Yun Fu, Xi Zhou, Ming Liu, Mark Hasegawa-Johnson, ...
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...