553 search results - page 32 / 111 » On Planar Path Transformation |
135
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
138
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we describe a cellular automaton (CA) used to perform the watershed transform in N-D images. Our method is based on image integration via the Ford-Bellman shortest p...
131
Voted
SOSP
2003
ACM
16 years 1 months ago
2003
ACM
We describe an evolutionary path that allows operating systems to be used in a more flexible and appropriate manner by higher-level services. An infokernel exposes key pieces of ...
149
click to vote
JGAA
2002
15 years 4 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
127
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We describe a realtime system for finding and tracking unstructured paths in off-road conditions. The system was designed as part of the recent Darpa Grand Challenge and was teste...