Sciweavers

1245 search results - page 91 / 249
» Triangulation for Points on Lines
Sort
View
ISCAS
2008
IEEE
103views Hardware» more  ISCAS 2008»
16 years 25 days ago
Watermarking curves using 2D mesh spectral transform
— This paper presents a robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline ...
Ji Young Kim, Dong-Hyuck Im, Hae-Yeoun Lee, Heung-...
ICCV
2011
IEEE
14 years 6 months ago
Trajectory reconstruction from non-overlapping surveillance cameras with relative depth ordering constraints
We present a method for reconstructing a trajectory of an object moving in front of non-overlapping fully or partially calibrated cameras. The non-overlapping setup turns that pro...
Branislav Micusik
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
15 years 11 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg
COMPGEOM
2007
ACM
15 years 10 months ago
There are not too many magic configurations
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom...
FQ
2003
Springer
15 years 11 months ago
Symplectic Spreads and Permutation Polynomials
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
Simeon Ball, Michael Zieve