10 search results - page 1 / 2 » Point-in-polygon tests by convex decomposition |
CG
2007
Springer
13 years 5 months ago
2007
Springer
MVA
2000
13 years 6 months ago
2000
Previous works on range image segmentation concentrate on surface patches that can be well represented by certain mathematical functions. In this paper we consider the more qualit...
SCIA
2009
Springer
13 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ANOR
2006
13 years 5 months ago
2006
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker’s FMLLR rotation matrix is decomposed...