Sciweavers

CVPR
2006
IEEE

Reconstruction with Interval Constraints Propagation

15 years 1 months ago
Reconstruction with Interval Constraints Propagation
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account the propagation of data errors and roundoff. Image points are represented as small rectangles: As a result, the output of the n-views triangulation is not a single point in space, but a polyhedron that contains all the possible solutions. Interval Analysis is used to bound this polyhedron with a box. Geometrical constraints such as orthogonality, parallelism, and coplanarity are subsequently enforced in order to reduce the size of those boxes, using Constraint Logic Programming. Experiments with real calibrated images illustrate the approach.
Michela Farenzena, Andrea Fusiello, Agostino Dovie
Added 12 Oct 2009
Updated 28 Oct 2009
Type Conference
Year 2006
Where CVPR
Authors Michela Farenzena, Andrea Fusiello, Agostino Dovier
Comments (0)