9842 search results - page 1395 / 1969 » The Complexity of the Matching-Cut Problem |
180
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...
214
click to vote
ICCV
2007
IEEE
16 years 9 months ago
2007
IEEE
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
178
click to vote
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
192
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
Abstract. We present a closed-form solution to the problem of recovering the 3D shape of a non-rigid inelastic surface from 3D-to-2D correspondences. This lets us detect and recons...
235
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...