We examine methods for clustering in high dimensions. In the first part of the paper, we perform an experimental comparison between three batch clustering algorithms: the Expectat...
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
–In contrast with the conventional trinocular planar image stereo in which the third camera is usually used to reduce the ambiguity on matching, every spherical camera of trinocu...
— We present algorithms to detect and precisely localize curbs and stairways for autonomous navigation. These algorithms combine brightness information (in the form of edgels) wi...
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...