2980 search results - page 521 / 596 » Computational Geometry |
115
Voted
ICPR
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper describes a method to detect glasses’ frames for robust facial image processing. This method makes use of the 3D features obtained by a trinocular stereo vision syste...
116
click to vote
ICRA
2002
IEEE
15 years 8 months ago
2002
IEEE
When assembling MEMS devices or manipulating biological cells it is often beneficial to have information about the force that is being applied to these objects. This force informa...
126
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
145
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
159
click to vote
SCALESPACE
2009
Springer
15 years 8 months ago
2009
Springer
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...