60 search results - page 4 / 12 » On the Computation of the GCD of 2-D Polynomials |
ICIP
1998
IEEE
14 years 8 months ago
1998
IEEE
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...
ECCV
2006
Springer
13 years 11 months ago
2006
Springer
We propose a closed form solution for segmenting mixtures of 2-D translational and 2-D affine motion models directly from the image intensities. Our approach exploits the fact that...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper we introduce the DCT-mod2 facial feature extraction technique which utilizes polynomial coefficients derived from 2-D DCT coefficients of spatially neighbouring bloc...