Sciweavers

2988 search results - page 109 / 598
» Experiments with a New Boosting Algorithm
Sort
View
ICIP
2009
IEEE
16 years 5 months ago
A Graph-cut Based Algorithm For Approximate Mrf Optimization
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques...
ASPDAC
1995
ACM
77views Hardware» more  ASPDAC 1995»
15 years 8 months ago
A scheduling algorithm for synthesis of bus-partitioned architectures
- Due to efficient interconnect structure and internal parallelism bus-partitioned architectures are very beneficial for sub-micron chip design. This paper presents a new approach ...
Vasily G. Moshnyaga, Fumiaki Ohbayashi, Keikichi T...
ICCV
2003
IEEE
16 years 6 months ago
Ranking Prior Likelihood Distributions for Bayesian Shape Localization Framework
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...
Shuicheng Yan, Mingjing Li, HongJiang Zhang, QianS...
DIS
2009
Springer
15 years 11 months ago
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
Yasser El-Manzalawy, Vasant Honavar
ICCV
2009
IEEE
1425views Computer Vision» more  ICCV 2009»
16 years 7 months ago
Fast Ray Features for Learning Irregular Shapes
We introduce a new class of image features, the Ray feature set, that consider image characteristics at distant contour points, capturing information which is difficult to repre...
Kevin Smith, Alan Carleton, Vincent Lepetit