Sciweavers

10 search results - page 2 / 2
» A practical algorithm for L triangulation with outliers
Sort
View
CVPR
2010
IEEE
13 years 4 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
CDC
2010
IEEE
215views Control Systems» more  CDC 2010»
13 years 1 months ago
Consensus with robustness to outliers via distributed optimization
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
Jixin Li, Ehsan Elhamifar, I.-Jeng Wang, Ren&eacut...
COMGEO
1999
ACM
13 years 5 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
CVPR
2010
IEEE
14 years 2 months ago
Outlier Removal Using Duality
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
Carl Olsson, Anders Eriksson, Richard Hartley
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 7 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang