Sciweavers

115 search results - page 6 / 23
» Segmentation On Surfaces With The Closest Point Method
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...
MVA
1996
100views Computer Vision» more  MVA 1996»
13 years 9 months ago
Range Data Segmentation with Principal Vectors and Surface Types
A new method for segmenting range data including curved surfaceisproposed.Themethod isbasedonrobust principal vectors calculation using ISL-primary-axis method. First a normal vec...
Takashi Yoshimi, Yoshihiro Kawai, Fumiaki Tomita
3DIM
2005
IEEE
13 years 9 months ago
Spatio-Temporal Fusion of Multiple View Video Rate 3D Surfaces
We consider the problem of geometric integration and representation of multiple views of non-rigidly deforming 3D surface geometry captured at video rate. Instead of treating each...
Gordon Collins, Adrian Hilton
MVA
1990
145views Computer Vision» more  MVA 1990»
13 years 8 months ago
Finding Line Segments by Surface Fitting to the Hough Transform
We describe a method based on the Hough transform to compute a set of parameters that completely describe line segments. By complete, we mean the description includes the endpoint...
Wayne Niblack, Tai Truong
VVS
1998
IEEE
141views Visualization» more  VVS 1998»
13 years 12 months ago
3D Scan Conversion of CSG Models into Distance Volumes
A distance volume is a volume dataset where the value stored at each voxel is the shortest distance to the surface of the object being represented by the volume. Distance volumes ...
David E. Breen, Sean Mauch, Ross T. Whitaker