Sciweavers

6562 search results - page 257 / 1313
» Noetherianity and Combination Problems
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Exploiting qualitative domain knowledge for learning Bayesian network parameters with incomplete data
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
Qiang Ji, Wenhui Liao
ICPR
2004
IEEE
16 years 7 months ago
Real-time Estimation of Light Source Environment for Photorealistic Augmented Reality
This paper proposes a vision-based augmented reality system with correct representation of attached and cast shadows. To realize a seamless augmented reality system, we need to re...
Masayuki Kanbara, Naokazu Yokoya
ICPR
2004
IEEE
16 years 7 months ago
A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
Manolis I. A. Lourakis, Antonis A. Argyros, Kostas...
ICPR
2000
IEEE
16 years 7 months ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura
ICML
2007
IEEE
16 years 7 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...