1397 search results - page 31 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
SIAMJO
2002
13 years 8 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
3DIM
1997
IEEE
14 years 21 days ago
1997
IEEE
In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple tex...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
CCCG
2009
13 years 9 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
BVAI
2005
Springer
14 years 1 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...