Sciweavers

1089 search results - page 17 / 218
» Randomness and Reducibility
Sort
View
PR
2008
84views more  PR 2008»
13 years 7 months ago
Practical background estimation for mosaic blending with patch-based Markov random fields
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...
Dae Woong Kim, Ki-Sang Hong
ICIP
2008
IEEE
14 years 9 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
ICASSP
2009
IEEE
14 years 2 months ago
Compressive spectral estimation for nonstationary random processes
We propose a “compressive” estimator of the Wigner-Ville spectrum (WVS) for time-frequency sparse, underspread, nonstationary random processes. A novel WVS estimator involving...
Alexander Jung, Georg Tauböck, Franz Hlawatsc...
MOR
2008
81views more  MOR 2008»
13 years 7 months ago
Optimal Stopping of Linear Diffusions with Random Discounting
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
Savas Dayanik
ML
2000
ACM
13 years 7 months ago
Randomizing Outputs to Increase Prediction Accuracy
Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, grow predictors on these perturbed training sets and combine them. A que...
Leo Breiman