非表示:
キーワード:
-
要旨:
We present a new approximation scheme for support vector decision
functions in object detection. In the present approach we are
building on an existing algorithm where the set of support vectors
is replaced by a smaller so-called reduced set of synthetic
points. Instead of finding the reduced set via unconstrained
optimization, we impose a structural constraint on the synthetic
vectors such that the resulting approximation can be evaluated via
separable filters. Applications that require scanning an entire
image can benefit from this representation: when using separable
filters, the average computational complexity for evaluating a
reduced set vector on a test patch of size (h x w) drops from
O(hw) to O(h+w). We show experimental results on
handwritten digits and face detection.
