Sciweavers

2157 search results - page 313 / 432
» Binary ant algorithm
Sort
View
CVPR
2009
IEEE
17 years 2 days ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
ECCV
2002
Springer
16 years 6 months ago
Factorial Markov Random Fields
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
Junhwan Kim, Ramin Zabih
ICML
2009
IEEE
16 years 5 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ICML
2007
IEEE
16 years 5 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2006
IEEE
16 years 5 months ago
The relationship between Precision-Recall and ROC curves
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...
Jesse Davis, Mark Goadrich