Pooling
From Ufldl
(→Pooling: Overview) |
(→Pooling: Overview) |
||
| Line 1: | Line 1: | ||
== Pooling: Overview == | == Pooling: Overview == | ||
| - | After obtaining features using convolution, | + | After obtaining features using convolution, we would next like to use them for classification. In theory, one could use all the extracted features with a classifier such as a softmax classifier, but this can be computationally challenging. Consider for instance images of size 96x96 pixels, and suppose we have learned 400 features over 8x8 inputs. Each convolution results in an output of size <math>(96-8+1)*(96-8+1)=7921</math>, and since we have 400 features, this results in a vector of <math>89^2 * 400 = 3,168,400</math> features per example. Learning a classifier with inputs having 3+ million features can be unwieldy, and can also be prone to over-fitting. |
| - | + | To address this, first recall that we decided to obtain convolved features because images have the "stationarity" property, which implies that features that are useful in one region are also likely to be useful for other regions. Thus, to describe a large image, one natural approach is to aggregate statistics of these features at various locations. For example, one could compute the mean (or max) value of a particular feature over a region of the image. These summary statistics are much lower in dimension (compared to using all of the extracted features) and can also improve results (less over-fitting). We aggregation operation is called this operation '''pooling''', or sometimes '''mean pooling''' or '''max pooling''' (depending on the pooling operation applied). | |
| - | + | ||
| - | + | ||
The following image shows how pooling is done over 4 non-overlapping regions of the image. | The following image shows how pooling is done over 4 non-overlapping regions of the image. | ||
