Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
We present methods for training high quality object detectors
very quickly. The core contribution is a pair of fast
training algorithms for piece-wise linear classifiers, which
...
Human beings have the ability to learn to recognize a new visual category based on only one or few training examples. Part of this ability might come from the use of knowledge fro...
This work considers the efficient coding of hyperspectral images. The shape-adaptive DCT is extended to the three-dimensional case. Both the 3D-SA-DCT and the conventional 3D-DCT ...
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...