The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
Data association is the process of relating features observed in the environment to features viewed previously or to features in a map. Correct feature association is essential fo...
Tim Bailey, Eduardo Mario Nebot, Julio Rosenblatt,...
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...