Sciweavers

2188 search results - page 160 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
TOG
2012
206views Communications» more  TOG 2012»
13 years 6 months ago
Beady: interactive beadwork design and construction
We introduce the interactive system “Beady” to assist the design and construction of customized 3D beadwork. The user first creates a polygonal mesh model called the design m...
Yuki Igarashi, Takeo Igarashi, Jun Mitani
AAAI
2012
13 years 6 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
ECCV
2000
Springer
16 years 6 months ago
A Six Point Solution for Structure and Motion
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
ICIP
2004
IEEE
16 years 5 months ago
Rotation and cropping resilient data hiding with zernike moments
Most digital data hiding schemes are sensitive to simple geometric attacks namely rotation, cropping, and scaling. Of these, rotational attacks possess the capability to not only ...
Palak K. Amin, Koduvayur P. Subbalakshmi
116
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue