Sciweavers

4639 search results - page 3 / 928
» A General Method for Errors-in-Variables Problems in Compute...
Sort
View
ICCV
2007
IEEE
14 years 7 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
ECCV
2010
Springer
13 years 6 months ago
Fast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and re...
Jan Lellmann, Dirk Breitenreicher, Christoph Schn&...
ICPR
2010
IEEE
13 years 6 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 5 months ago
Space and camera path reconstruction for omni-directional vision
In this paper, we address the inverse problem of reconstructing a scene as well as the camera motion from the image sequence taken by an omni-directional camera. Our structure fro...
Oliver Knill, Jose Ramirez-Herran
ECCV
2010
Springer
13 years 3 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...