Learn More
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u, v) for(More)
We introduce a method for extracting information about human hands present in colour images largely based on work done by Daniel Heckenberg and Brian Lovell. It relies heavily on isolating the hand in the image using a statistical model of skin colour. Following this, it employs solely image-based techniques to determine the locations of the fingers, and(More)
  • 1