This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
papers:simard-99 [2007/02/02 08:26] leonb abstract |
papers:simard-99 [2007/02/02 08:49] leonb |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ===== Boxlets: a Fast Convolution Algorithm for Neural Networks and Signal Processing ===== | ===== Boxlets: a Fast Convolution Algorithm for Neural Networks and Signal Processing ===== | ||
| - | // | + | // |
| Signal processing and pattern recognition algorithms make extensive use of convolution. In many cases, computational accuracy is | Signal processing and pattern recognition algorithms make extensive use of convolution. In many cases, computational accuracy is | ||
| not as important as computational speed. In feature extraction, | not as important as computational speed. In feature extraction, | ||
| Line 37: | Line 37: | ||
| } | } | ||
| + | |||
| + | ==== Notes ==== | ||
| + | |||
| + | Maybe the most famous use of boxlets is the computation of the features of the Viola-Jones object recognition system [1,2]. The //integral image// representation is a boxlet of order zero. This was also described in [3] (see the paper for details.) | ||
| + | |||
| + | |||
| + | * **[1]** | ||
| + | * **[2]** Paul Viola, Michael Jones: Robust Real-time Object Detection, // | ||
| + | * **[3]** Paul S. Heckberg: | ||
| + | conference on Computer graphics//, 20:315-321, Dallas, 1986 | ||