Sciweavers

515 search results - page 1 / 103
» Classroom Examples of Robustness Problems in Geometric Compu...
Sort
View
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
13 years 10 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
ICCV
2009
IEEE
14 years 9 months ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
13 years 11 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
WACV
2002
IEEE
13 years 9 months ago
Arm Gesture Detection in a Classroom Environment
Detecting human arm motion in a typical classroom environment is a challenging task due to the noisy and highly dynamic background, varying light conditions, as well as the small ...
Jie Yao, Jeremy R. Cooperstock
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
13 years 10 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka