Sciweavers

301 search results - page 46 / 61
» Probabilistic rough set approximations
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
TSP
2010
13 years 2 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
CVPR
2007
IEEE
14 years 9 months ago
Regression tracking with data relevance determination
This paper 1 addresses the problem of efficient visual 2D template tracking in image sequences. We adopt a discriminative approach in which the observations at each frame yield di...
Ioannis Patras, Edwin R. Hancock
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 28 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
PAMI
2010
190views more  PAMI 2010»
13 years 6 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...