515 search results - page 9 / 103 » Classroom Examples of Robustness Problems in Geometric Compu... |
CVPR
2012
IEEE
13 years 5 days ago
2012
IEEE
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
SIAMIS
2010
14 years 4 months ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
ICPR
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...