Sciweavers

9659 search results - page 6 / 1932
» Points on Computable Curves
Sort
View
EMMCVPR
2003
Springer
14 years 22 days ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
ICCTA
2007
IEEE
14 years 1 months ago
Stabilisation of Active Contours Using Tangential Evolution: An Application to Tracking
— Active contours are very widely used in computer vision problems. Their usage has a typical problem, that of bunching together of curve points. This becomes apparent especially...
Viswanathan Srikrishnan, Subhasis Chaudhuri, Suman...
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
CAD
2008
Springer
13 years 7 months ago
Constrained curve fitting on manifolds
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a poin...
Simon Flöry, Michael Hofer
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...