This paper presents and compares 3 methods for the statistical localization of partially occulted landmarks. In many real applications, some information is visible in images and s...
Barbara Romaniuk, Michel Desvignes, Marinette Reve...
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
In this paper we present a novel method to estimate curvature of iso grey-level surfaces in grey-value images. Our method succeeds where isophote curvature fails. There is neither...
Bernd Rieger, Frederik J. Timmermans, Lucas J. van...
Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple...
Dick de Ridder, Elzbieta Pekalska, Robert P. W. Du...
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...