60 search results - page 7 / 12 » On the Computation of the GCD of 2-D Polynomials |
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
CVPR
1998
IEEE
14 years 8 months ago
1998
IEEE
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
ECCV
2010
Springer
14 years 29 days ago
2010
Springer
This paper is addressing the problem of realigning broken
objects without correspondences. We consider linear transformations between
the object fragments and present the method ...
CGF
2010
13 years 7 months ago
2010
We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open ...