The development of a system able to detect and track moving people is described. Given a sequence of timevarying images, the goal is to count the number of people crossing a count...
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
This paper introduces a number of refinements to the Parallel Coordinates visualisation metaphor for multidimensional data. Firstly, the traditional set of poly-lines are replaced...
Abstract. Distinguished regions can be detected with high repeatability in different images of the same scene. Two definitions of distinguished regions of an image in a mathemati...