3630 search results - page 137 / 726 » Fast Marching Methods |
134
click to vote
SGP
2007
15 years 8 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
169
click to vote
SSWMC
2004
15 years 7 months ago
2004
This work reduces the computational requirements of the additive noise steganalysis presented by Harmsen and Pearlman. The additive noise model assumes that the stegoimage is crea...
191
click to vote
NIPS
2003
15 years 7 months ago
2003
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
152
click to vote
TSP
2008
15 years 6 months ago
2008
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...