Sciweavers

712 search results - page 69 / 143
» A mixture model for random graphs
Sort
View
VLSM
2005
Springer
14 years 2 months ago
Trimap Segmentation for Fast and User-Friendly Alpha Matting
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
Olivier Juan, Renaud Keriven
CCS
2010
ACM
13 years 8 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
TSP
2011
197views more  TSP 2011»
13 years 4 months ago
Group Object Structure and State Estimation With Evolving Networks and Monte Carlo Methods
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
Amadou Gning, Lyudmila Mihaylova, Simon Maskell, S...
DAGM
2007
Springer
14 years 3 months ago
Semi-supervised Tumor Detection in Magnetic Resonance Spectroscopic Images Using Discriminative Random Fields
Magnetic resonance spectral images provide information on metabolic processes and can thus be used for in vivo tumor diagnosis. However, each single spectrum has to be checked manu...
L. Görlitz, Bjoern H. Menze, M.-A. Weber, B. ...
ECCV
2008
Springer
14 years 11 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