515 search results - page 36 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
SIGGRAPH
2000
ACM
15 years 1 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
126
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
ISRR
2001
Springer
15 years 2 months ago
2001
Springer
We discuss the role of spatial representations and visual geometries in vision-based navigation. To a large extent, these choices determine the complexity and robustness of a given...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
The following data fusion problem is considered: Given a 3D geometric model of an object and two uncalibrated images of the same object, and assuming that the object surface is te...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, a novel method based on pose adaptive linear discriminant analysis (PALDA) is proposed to deal with pose variation problems in face recognition when each person has...