Sciweavers

3823 search results - page 461 / 765
» Experiments with Random Projection
Sort
View
137
Voted
IJCV
2011
152views more  IJCV 2011»
14 years 10 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
127
Voted
JDCTA
2010
92views more  JDCTA 2010»
14 years 10 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 10 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
CVPR
2008
IEEE
16 years 5 months ago
On the use of independent tasks for face recognition
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary...
Àgata Lapedriza, David Masip, Jordi Vitri&a...
141
Voted
MICCAI
2007
Springer
16 years 4 months ago
Effectiveness of the Finite Impulse Response Model in Content-Based fMRI Image Retrieval
The thresholded t-map produced by the General Linear Model (GLM) gives an effective summary of activation patterns in functional brain images and is widely used for feature selecti...
Bing Bai, Paul B. Kantor, Ali Shokoufandeh