Sciweavers

55 search results - page 3 / 11
» Using Linearization for Global Consistency in SSR
Sort
View
SIGGRAPH
1994
ACM
15 years 1 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
15 years 3 months ago
A Lie Algebraic Approach for Consistent Pose Registration for General Euclidean Motion
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
Motilal Agrawal
CVPR
2008
IEEE
15 years 11 months ago
Motion estimation for multi-camera systems using global optimization
We present a motion estimation algorithm for multicamera systems consisting of more than one calibrated camera securely attached on a moving object. So, they move all together, bu...
Hongdong Li, Jae-Hak Kim, Richard I. Hartley
EACL
2009
ACL Anthology
14 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 9 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...