2695 search results - page 297 / 539 » Learning Graph Matching |
116
click to vote
IJCAI
2007
15 years 5 months ago
2007
We present MBoost, a novel extension to AdaBoost that extends boosting to use multiple weak learners explicitly, and provides robustness to learning models that overfit or are po...
145
Voted
ICB
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
121
Voted
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
181
Voted
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we propose a robust supervised label transfer method for the semantic segmentation of street scenes. Given an input image of street scene, we first find multiple ima...
129
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...