Sciweavers

1956 search results - page 274 / 392
» Learning the Relative Importance of Features in Image Data
Sort
View
IJCV
2006
299views more  IJCV 2006»
15 years 4 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
EMMCVPR
2001
Springer
15 years 9 months ago
A Hierarchical Markov Random Field Model for Figure-Ground Segregation
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
Stella X. Yu, Tai Sing Lee, Takeo Kanade
ML
2006
ACM
15 years 4 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
ICCV
2007
IEEE
16 years 6 months ago
Semi-supervised Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing ...
Deng Cai, Xiaofei He, Jiawei Han
IPMI
2003
Springer
16 years 5 months ago
Spatiotemporal Localization of Significant Activation in MEG Using Permutation Tests
Abstract. We describe the use of non-parametric permutation tests to detect activation in cortically-constrained maps of current density computed from MEG data. The methods are app...
Dimitrios Pantazis, Thomas E. Nichols, Sylvain Bai...