Sciweavers

354 search results - page 17 / 71
» Estimating random variables from random sparse observations
Sort
View
ECCV
1994
Springer
15 years 4 months ago
Markov Random Field Models in Computer Vision
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Stan Z. Li
ICCV
2007
IEEE
16 years 1 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
PR
2002
108views more  PR 2002»
14 years 11 months ago
Hyperparameter estimation for satellite image restoration using a MCMC maximum-likelihood method
The satellite image deconvolution problem is ill-posed and must be regularized. Herein, we use an edge-preserving regularization model using a ' function, involving two hyper...
André Jalobeanu, Laure Blanc-Féraud,...
TARK
2009
Springer
15 years 6 months ago
Foundations of non-commutative probability theory
Kolmogorov’s setting for probability theory is given an original generalization to account for probabilities arising from Quantum Mechanics. The sample space has a central role ...
Daniel Lehmann
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 6 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe