Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
This paper addresses the problem of lip segmentation in color space, which is a crucial issue to the success of a lip-reading system. We present a new segmentation approach to lip ...
Radiometric variations between input images can seriously
degrade the performance of stereo matching algorithms.
In this situation, mutual information is a very popular
and powe...
Yong Seok Heo (Seoul National University), Kyoung ...
—A novel binarization method for courtesy amount recognition of color Chinese checks is proposed in this paper. It includes two steps: background removal and seal removal. In the...
In this contribution we present an algorithm for tracking non-rigid, moving objects in a sequence of colored images, which were recorded by a non-stationary camera. The applicatio...