We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular ...
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
This paper presents a novel and efficient algorithm for the 3D range to 2D image registration problem in urban scene settings. Our input is a set of unregistered 3D range scans an...