1375 search results - page 149 / 275 » Matching Points with Things |
133
Voted
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can...
151
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
114
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
157
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
131
click to vote
WADS
1995
Springer
15 years 7 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...