Sciweavers

712 search results - page 2 / 143
» A mixture model for random graphs
Sort
View
ICIP
2009
IEEE
13 years 3 months ago
Random swap EM algorithm for finite mixture models in image segmentation
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
Qinpei Zhao, Ville Hautamäki, Ismo Kärkk...
CVPR
2005
IEEE
14 years 7 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
ECCV
2004
Springer
14 years 7 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
13 years 12 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera