Sciweavers

1018 search results - page 112 / 204
» Learning Probabilistic Models of Contours
Sort
View
ECCV
2008
Springer
15 years 12 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 2 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
ICPR
2008
IEEE
15 years 4 months ago
Top down image segmentation using congealing and graph-cut
This paper develops a weakly supervised algorithm that learns to segment rigid multi-colored objects from a set of training images and key points. The approach uses congealing to ...
Douglas Moore, John Stevens, Scott Lundberg, Bruce...
SEAL
2010
Springer
14 years 8 months ago
Bayesian Reliability Analysis under Incomplete Information Using Evolutionary Algorithms
During engineering design, it is often difficult to quantify product reliability because of insufficient data or information for modeling the uncertainties. In such cases, one need...
Rupesh Kumar Srivastava, Kalyanmoy Deb
SIAMIS
2010
156views more  SIAMIS 2010»
14 years 4 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...