Sciweavers

214 search results - page 18 / 43
» Computing the Closest Point to a Circle
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 9 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
COMPUTING
2007
81views more  COMPUTING 2007»
13 years 7 months ago
Hybrid curve fitting
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
Martin Aigner, Bert Jüttler
SIGGRAPH
2010
ACM
14 years 1 days ago
Line space gathering for single scattering in large scenes
We present an efficient technique to render single scattering in large scenes with reflective and refractive objects and homogeneous participating media. Efficiency is obtained...
Xin Sun, Kun Zhou, Stephen Lin, Baining Guo
SCIA
2005
Springer
113views Image Analysis» more  SCIA 2005»
14 years 1 months ago
Segmentation of Medical Images Using Three-Dimensional Active Shape Models
In this paper a fully automated segmentation system for the femur in the knee in Magnetic Resonance Images and the brain in Single Photon Emission Computed Tomography images is pr...
Klas Josephson, Anders Ericsson, Johan Karlsson