Sciweavers

1095 search results - page 146 / 219
» Preprocessing of Intractable Problems
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 10 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
PAMI
2007
249views more  PAMI 2007»
13 years 10 months ago
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
— The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem...
Dacheng Tao, Xuelong Li, Xindong Wu, Stephen J. Ma...
CVPR
2012
IEEE
12 years 25 days ago
Discriminately decreasing discriminability with learned image filters
In machine learning and computer vision, input signals are often filtered to increase data discriminability. For example, preprocessing face images with Gabor band-pass filters ...
Jacob Whitehill, Javier R. Movellan
ECCV
2006
Springer
15 years 9 days ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
RECOMB
2001
Springer
14 years 10 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa