Sciweavers

1092 search results - page 121 / 219
» Convex Methods for Transduction
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Global Optimization through Searching Rotation Space and Optimal Estimation of the Essential Matrix
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
Richard I. Hartley, Fredrik Kahl
ICCV
2003
IEEE
15 years 11 months ago
Surface Reflectance Modeling of Real Objects with Interreflections
In mixed reality, especially in augmented virtuality which virtualizes real objects, it is important to estimate object surface reflectance properties to render the objects under ...
Takashi Machida, Naokazu Yokoya, Haruo Takemura
KDD
2004
ACM
123views Data Mining» more  KDD 2004»
15 years 10 months ago
A DEA approach for model combination
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify t...
Zhiqiang Zheng, Balaji Padmanabhan, Haoqiang Zheng
ICASSP
2009
IEEE
15 years 4 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
15 years 4 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....