Sciweavers

2031 search results - page 59 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
ALT
2004
Springer
15 years 6 months ago
Prediction with Expert Advice by Following the Perturbed Leader for General Weights
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
Marcus Hutter, Jan Poland
BICOB
2009
Springer
15 years 4 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
15 years 4 months ago
Deformations of general parametric shells: Computation and robot experiment
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
Yan-Bin Jia, Jiang Tian
ICCV
1999
IEEE
15 years 11 months ago
A Simple and Efficient Rectification Method for General Motion
In this paper a new rectification method is proposed. The method is both simple and efficient and can deal with all possible camera motions. A minimal image size without any pixel...
Marc Pollefeys, Reinhard Koch, Luc J. Van Gool