The latest generation of Convolutional Neural Networks (CNN) have achieved impressive results in challenging benchmarks on image recognition and object detection, significantly raising the interest of the community in these methods. Nevertheless, it is still unclear how different CNN methods compare with each other and with previous state-of-the-art shallow representations such as the Bag-of-Visual-Words and the Improved Fisher Vector. This paper conducts a rigorous evaluation of these new techniques, exploring different deep architectures and comparing them on a common ground, identifying and disclosing important implementation details. We identify several useful properties of CNN-based representations, including the fact that the dimensionality of the CNN output layer can be reduced significantly without having an adverse effect on performance. We also identify aspects of deep and shallow methods that can be successfully shared. In particular, we show that the data augmentation techniques commonly applied to CNN-based methods can also be applied to shallow methods, and result in an analogous performance boost. Source code and models to reproduce the experiments in the paper is made publicly available.READ FULL TEXT VIEW PDF
Deep learning, in particular Convolutional Neural Network (CNN), has ach...
With the growth of digitized comics, image understanding techniques are
Deep convolutional Neural Networks (CNN) are the state-of-the-art perfor...
Although many studies suggest high performance hand detection methods, t...
Transfer learning is commonly used to address the problem of the prohibi...
Despite the importance of image representations such as histograms of
The side-channel community recently investigated a new approach, based o...
Perhaps the single most important design choice in current state-of-the-art image classification and object recognition systems is the choice of visual features, or image representation. In fact, most of the quantitative improvements to image understanding obtained in the past dozen years can be ascribed to the introduction of improved representations, from the Bag-of-Visual-Words (BoVW) [1, 2] to the (Improved) Fisher Vector (IFV) . A common characteristic of these methods is that they are largely handcrafted. They are also relatively simple, comprising dense sampling of local image patches, describing them by means of visual descriptors such as SIFT, encoding them into a high-dimensional representation, and then pooling over the image. Recently, these handcrafted approaches have been substantially outperformed by the introduction of the latest generation of Convolutional Neural Networks (CNNs) 
to the computer vision field. These networks have a substantially more sophisticated structure than standard representations, comprising several layers of non-linear feature extractors, and are therefore said to bedeep (in contrast, classical representation will be referred to as shallow
). Furthermore, while their structure is handcrafted, they contain a very large number of parameters learnt from data. When applied to standard image classification and object detection benchmark datasets such as ImageNet ILSVRC
and PASCAL VOC such networks have demonstrated excellent performance [7, 8, 9, 10, 11], significantly better than standard image encodings .
Despite these impressive results, it remains unclear how different deep architectures compare to each other and to shallow computer vision methods such as IFV. Most papers did not test these representations extensively on a common ground, so a systematic evaluation of the effect of different design and implementation choices remains largely missing. As noted in our previous work , which compared the performance of various shallow visual encodings, the performance of computer vision systems depends significantly on implementation details. For example, state-of-the-art methods such as  not only involve the use of a CNN, but also include other improvements such as the use of very large scale datasets, GPU computation, and data augmentation (also known as data jittering or virtual sampling). These improvements could also transfer to shallow representations such as the IFV, potentially explaining a part of the performance gap .
In this study we analyse and empirically clarify these issues, conducting a large set of rigorous experiments (Sect. 4), in many ways picking up the story where it last ended in  with the comparison of shallow encoders. We focus on methods to construct image representations, i.e. encoding functions mapping an image to a vector
suitable for analysis with a linear classifier, such as an SVM. We considerthree scenarios (Sect. 2, Sect. 3): shallow image representations, deep representations pre-trained on outside data, and deep representation pre-trained and then fine-tuned on the target dataset. As part of our tests, we explore generally-applicable best practices that are nevertheless more often found in combination with CNNs  or, alternatively, with shallow encoders , porting them with mutual benefit. These are (Sect. 2): the use of colour information, feature normalisation, and, most importantly, the use of substantial data augmentation. We also determine scenario-specific best-practices, improving the ones in [12, 15]
and others, including dimensionality reduction for deep features. Finally, we achieveperformance competitive with the state of the art [16, 17] on PASCAL VOC classification using less additional training data and significantly simpler techniques. As in , the source code and models to reproduce all experiments in this paper is available on the project website111http://www.robots.ox.ac.uk/~vgg/research/deep_eval/.
This section introduces the three types of image representation considered in this paper, describing them within the context of three different scenarios. Having outlined details specific to each, general methodologies which apply to all three scenarios are reviewed, such as data augmentation and feature normalisation, together with the linear classifier (trained with a standard hinge loss). We also specify here the benchmark datasets used in the evaluation.
Our reference shallow image representation is the IFV . Our choice is motivated by the fact that IFV usually outperforms related encoding methods such as BoVW, LLC , and VLAD . Given an image , the IFV is obtained by extracting a dense collection of patches and corresponding local descriptors (e.g. SIFT) from the image at multiple scales. Each descriptor
is then soft-quantized using a Gaussian Mixture Model withcomponents. First and second order differences between each descriptor and its Gaussian cluster mean are accumulated in corresponding blocks , in the vector , appropriately weighed by the Gaussian soft-assignments and covariance, leading to a -dimensional image representation The improved version of the Fisher vector involves post-processing by computing the signed square-root of its scalar components and normalising the result to a unit norm. The details of this construction can be found in ; here we follow the notation of .
of the penultimate layer of a deep CNN, learnt on a large dataset such as ImageNet, can be used as a powerful image descriptor applicable to other datasets. Numerous CNN architectures that improve the previous state of the art obtained using shallow representations have been proposed, but choosing the best one remains an open question. Many are inspired by : DeCAF [7, 11]
, Caffe, Oquab et al. 
. Others use larger networks with a smaller stride of the first convolutional layer: Zeiler and Fergus and OverFeat [10, 9]. Other differences include the CNN pre-training protocols. Here we adopt a single learning framework and experiment with architectures of different complexity exploring their performance-speed trade-off.
In Scenario 2 features are trained on one (large) dataset and applied to another (usually smaller). However, it was demonstrated  that fine-tuning a pre-trained CNN on the target data can significantly improve the performance. We consider this scenario separately from that of Scenario 2, as the image features become dataset-specific after the fine-tuning.
We now turn to what is in common across the scenarios.
Data augmentation is a method applicable to shallow and deep representations, but that has been so far mostly applied to the latter [13, 19]. By augmentation we mean perturbing an image by transformations that leave the underlying class unchanged (e.g
. cropping and flipping) in order to generate additional examples of the class. Augmentation can be applied at training time, at test time, or both. The augmented samples can either be taken as-is or combined to form a single feature, e.g. using sum/max-pooling or stacking.
All the representations in the three scenarios are used to construct linear predictors
for each class to be recognized. These predictors are learnt using Support Vector Machines (SVM) by fittingto the available training data by minimizing an objective function balancing a quadratic regularizer and the hinge-loss. The parameter in the SVM, trading-off regularizer and loss, is determined using an held-off validation subset of the data. Here we use the same learning framework with all representations. It is common experience that linear classifiers are particularly sensitive to the normalisation of the data and that, in particular, SVMs tend to benefit from normalisation 
(an interpretation is that after normalisation the inner product corresponds to the cosine similarly).
As reference benchmark we use the PASCAL VOC  data as already done in . The VOC-2007 edition contains about 10,000 images split into train, validation, and test sets, and labelled with twenty object classes. A one-vs-rest SVM classifier for each class is learnt and evaluated independently and the performance is measured as mean Average Precision (mAP) across all classes. The VOC-2012 edition contains roughly twice as many images and does not include test labels; instead, evaluation uses the official PASCAL Evaluation Server. To train deep representations we use the ILSVRC-2012 challenge dataset. This contains 1,000 object categories from ImageNet  with roughly 1.2M training images, 50,000 validation images, and 100,000 test images. Performance is evaluated using the top-5 classification error. Finally, we also evaluate over the Caltech-101 and Caltech-256 image classification benchmarks [21, 22]. For Caltech-101, we followed the protocol of , and considered three random splits into training and testing data, each of which comprises 30 training and up to 30 testing images per class. For Caltech-256, two random splits were generated, each of which contains 60 training images per class, and the rest are used for testing. On both Caltech datasets, performance is measured using mean class accuracy.
This section gives the implementation details of the methods introduced in Sect. 2.
Our IFV representation uses a slightly improved setting compared to the best result of .
Computation starts by upscaling the image by a factor of 2 
, followed by SIFT features extraction with a stride of 3 pixels at 7 different scales withscale increments. These features are square-rooted as suggested by , and decorrelated and reduced in dimension from to using PCA. A GMM with components is learnt from features sampled from the training images. Hence the Fisher Vector has dimension . Before use in classification, the vector is signed-square-rooted and -normalised (square rooting correspond to the Hellinger’s kernel map ). As in , square-rooting is applied twice, once to the raw encodings, and once again after sum pooling and normalisation. In order to capture weak geometrical information, the IFV representation is used in a spatial pyramid . As in , the image is divided into , , and spatial subdivisions and corresponding IFVs are computed and stacked with an overall dimension of elements.
In addition to this standard formulation, we experiment with a few modifications. The first one is the use of intra-normalisation of the descriptor blocks, an idea recently proposed for the VLAD descriptor . In this case, the normalisation is applied to the individual sub-blocks of the vector , which helps to alleviate the local feature burstiness . In the case of the improved intra-normalised features, it was found that applying the square-rooting only once to the final encoding produced the best results.
The second modification is the use of spatially-extended local descriptors  instead of a spatial pyramid. Here descriptors are appended with their image location before quantization with the GMM. Formally, is extended, after PCA projection, with its normalised spatial coordinates: , where are the dimensions of the image. Since the GMM quantizes both appearance and location, this allows for spatial information to be captured directly by the soft-quantization process. This method is significantly more memory-efficient than using a spatial pyramid. Specifically, the PCA-reduced SIFT features are spatially augmented by appending yielding dimensional descriptors pooled in a dimensional IFV.
The third modification is the use of colour features in addition to SIFT descriptors. While colour information is used in CNNs  and by the original FV paper , it was not explored in our previous comparison . We do so here by adopting the same Local Colour Statistics (LCS) features as used by . LCS is computed by dividing an input patch into a
spatial grid (akin to SIFT), and computing the mean and variance of each of theLab colour channels for each cell of the grid. The LCS dimensionality is thus . This is then encoded in a similar manner to SIFT.
st. 4, pad 0
|st. 1, pad 2||st. 1, pad 1||st. 1, pad 1||st. 1, pad 1||drop-||drop-||soft-|
|LRN, x2 pool||LRN, x2 pool||-||-||x2 pool||out||out||max|
|st. 2, pad 0||st. 2, pad 1||st. 1, pad 1||st. 1, pad 1||st. 1, pad 1||drop-||drop-||soft-|
|LRN, x2 pool||LRN, x2 pool||-||-||x2 pool||out||out||max|
|st. 2, pad 0||st. 1, pad 1||st. 1, pad 1||st. 1, pad 1||st. 1, pad 1||drop-||drop-||soft-|
|LRN, x3 pool||x2 pool||-||-||x3 pool||out||out||max|
The CNN-based features are based on three CNN architectures representative of the state of the art (shown in Table I
) each exploring a different accuracy/speed trade-off. To ensure a fair comparison between them, these networks are trained using the same training protocol and the same implementation, which we developed based on the open-source Caffe framework. -normalising the CNN features before use in the SVM was found to be important for performance.
Our Fast (CNN-F) architecture is similar to the one used by Krizhevsky et al. . It comprises 8 learnable layers, 5 of which are convolutional, and the last 3 are fully-connected. The input image size is . Fast processing is ensured by the 4 pixel stride in the first convolutional layer. The main differences between our architecture and that of  are the reduced number of convolutional layers and the dense connectivity between convolutional layers ( used sparse connections to enable training on two GPUs).
Our Medium (CNN-M) architecture is similar to the one used by Zeiler and Fergus . It is characterised by the decreased stride and smaller receptive field of the first convolutional layer, which was shown to be beneficial on the ILSVRC dataset. At the same time, conv2 uses larger stride (2 instead of 1) to keep the computation time reasonable. The main difference between our net and that of  is we use less filters in the conv4 layer (512 vs. 1024).
Our Slow (CNN-S) architecture is related to the ‘accurate’ network from the OverFeat package . It also uses filters with stride in conv1. Unlike CNN-M and , the stride in conv2 is smaller (1 pixel), but the max-pooling window in conv1 and conv5 is larger () to compensate for the increased spatial resolution. Compared to , we use 5 convolutional layers as in the previous architectures ( used 6), and less filters in conv5 (512 instead of 1024); we also incorporate an LRN layer after conv1 ( did not use contrast normalisation).
In general, our CNN training procedure follows that of , learning on ILSVRC-2012 using gradient descent with momentum. The hyper-parameters are the same as used by : momentum ; weight decay ; initial learning rate , which is decreased by a factor of
, when the validation error stop decreasing. The layers are initialised from a Gaussian distribution with a zero mean and variance equal to. We also employ similar data augmentation in the form of random crops, horizontal flips, and RGB colour jittering. Test time crop sampling is discussed in Sect. 3.3; at training time, crops are sampled randomly, rather than deterministically. Thus, the only notable difference to  is that the crops are taken from the whole training image , rather than its centre. Training was performed on a single NVIDIA GTX Titan GPU and the training time varied from 5 days for CNN-F to 3 weeks for CNN-S.
In our experiments, we fine-tuned CNN-S using VOC-2007, VOC-2012, or Caltech-101 as the target data. Fine-tuning was carried out using the same framework (and the same data augmentation), as we used for CNN training on ILSVRC. The last fully-connected layer (conv8) has output dimensionality equal to the number of classes, which differs between datasets, so we initialised it from a Gaussian distribution (as used for CNN training above). Now we turn to dataset-specific fine-tuning details.
VOC-2007 and VOC-2012. Considering that PASCAL VOC is a multi-label dataset (i.e
. a single image might have multiple labels), we replaced the softmax regression loss with a more appropriate loss function, for which we considered two options: one-vs-rest classification hinge loss (the same loss as used in the SVM experiments) and ranking hinge loss. Both losses define constraints on the scores of positive () and negative () images for each class: for the classification loss, for the ranking loss ( is the -th row of the last fully-connected layer, which can be seen as a linear classifier on deep features ; is a slack variable). Our fine-tuned networks are denoted as “CNN S TUNE-CLS” (for the classification loss) and “CNN S TUNE-RNK” (for the ranking loss). In the case of both VOC datasets, the training and validation subsets were combined to form a single training set. Given the smaller size of the training data when compared to ILSVRC-2012, we controlled for over-fitting by using lower initial learning rates for the fine-tuned hidden layers. The learning rate schedule for the last layer / hidden layers was: .
Caltech-101 dataset contains a single class label per image, so fine-tuning was performed using the softmax regression loss. Other settings (including the learning rate schedule) were the same as used for the VOC fine-tuning experiments.
Our baseline networks (Table I) have the same dimensionality of the last hidden layer (full7): 4096. This design choice is in accordance with the state-of-the-art architectures [13, 19, 10], and leads to a 4096-D dimensional image representation, which is already rather compact compared to IFV. We further trained three modifications of the CNN-M network, with lower dimensional full7 layers of: 2048, 1024, and 128 dimensions respectively. The networks were learnt on ILSVRC-2012. To speed-up training, all layers aside from full7/full8 were set to those of the CNN-M net and a lower initial learning rate of was used. The initial learning rate of full7/full8 was set to .
We explore three data augmentation strategies. The first strategy is to use no augmentation. In contrast to IFV, however, CNNs require images to be transformed to a fixed size () even when no augmentation is used. Hence the image is downsized so that the smallest dimension is equal to pixels and a crop is extracted from the centre.222Extracting a centre crop from a image  resulted in worse performance. The second strategy is to use flip augmentation, mirroring images about the -axis producing two samples from each image. The third strategy, termed C+F augmentation, combines cropping and flipping. For CNN-based representations, the image is downsized so that the smallest dimension is equal to pixels. Then crops are extracted from the four corners and the centre of the image. Note that the crops are sampled from the whole image, rather than its centre, as done by . These crops are then flipped about the -axis, producing perturbed samples per input image. In the case of the IFV encoding, the same crops are extracted, but at the original image resolution.
|(I) FK BL||spm||–||327K||61.69||79.0||67.4||51.9||70.9||30.8||72.2|
|(b) FK IN||spm||–||327K||64.18||82.1||69.7||59.7||75.2||35.7||71.3|
|(d) FK IN||(x,y)||–||42K||64.36||83.1||70.4||62.4||75.2||37.1||69.1|
|(e) FK IN||(x,y)||(F)||f||-||42K||64.35||83.1||70.5||62.3||75.4||37.1||69.1|
|(f) FK IN||(x,y)||(C)||f||s||42K||67.17||85.5||71.6||64.6||77.2||39.0||70.8|
|(g) FK IN||(x,y)||(C)||s||s||42K||66.68||84.9||70.1||64.7||76.3||39.2||69.8|
|(h) FK IN 512||(x,y)||–||84K||65.36||84.1||70.4||65.0||76.7||37.2||71.3|
|(i) FK IN 512||(x,y)||(C)||f||s||84K||68.02||85.9||71.8||67.1||77.1||38.8||72.3|
|(j) FK IN COL 512||–||–||82K||52.18||69.5||52.1||47.5||64.0||24.6||49.8|
|(k) FK IN 512 COL+||(x,y)||–||166K||66.37||82.9||70.1||67.0||77.0||36.1||70.0|
|(l) FK IN 512 COL+||(x,y)||(C)||f||s||166K||67.93||85.1||70.5||67.5||77.4||35.7||71.2|
|(m) CNN F||–||(C)||f||s||4K||77.38||88.7||83.9||87.0||84.7||46.9||77.5|
|(n) CNN S||–||(C)||f||s||4K||79.74||90.7||85.7||88.9||86.6||50.5||80.1|
|(o) CNN M||–||–||4K||76.97||89.5||84.3||88.8||83.2||48.4||77.0|
|(p) CNN M||–||(C)||f||s||4K||79.89||91.7||85.4||89.5||86.6||51.6||79.3|
|(q) CNN M||–||(C)||f||m||4K||79.50||90.9||84.6||89.4||85.8||50.3||78.4|
|(r) CNN M||–||(C)||s||s||4K||79.44||91.4||85.2||89.1||86.1||52.1||78.0|
|(s) CNN M||–||(C)||t||t||41K||78.77||90.7||85.0||89.2||85.8||51.0||77.8|
|(t) CNN M||–||(C)||f||-||4K||77.78||90.5||84.3||88.8||84.5||47.9||78.0|
|(u) CNN M||–||(F)||f||-||4K||76.99||90.1||84.2||89.0||83.5||48.1||77.2|
|(v) CNN M GS||–||–||4K||73.59||87.4||80.8||82.4||82.1||44.5||73.5|
|(w) CNN M GS||–||(C)||f||s||4K||77.00||89.4||83.8||85.1||84.4||49.4||77.6|
|(x) CNN M 2048||–||(C)||f||s||2K||80.10||91.3||85.8||89.9||86.7||52.4||79.7|
|(y) CNN M 1024||–||(C)||f||s||1K||79.91||91.4||86.9||89.3||85.8||53.3||79.8|
|(z) CNN M 128||–||(C)||f||s||128||78.60||91.3||83.9||89.2||86.9||52.1||81.0|
|() FK+CNN F||(x,y)||(C)||f||s||88K||77.95||89.6||83.1||87.1||84.5||48.0||79.4|
|() FK+CNN M 2048||(x,y)||(C)||f||s||86K||80.14||90.9||85.9||88.8||85.5||52.3||81.4|
|() CNN S TUNE-RNK||–||(C)||f||s||4K||82.42||95.3||90.4||92.5||89.6||54.4||81.9|
This section describes the experimental results, comparing different features and data augmentation schemes. The results are given in Table II for VOC-2007 and analysed next, starting from generally applicable methods such as augmentation and then discussing the specifics of each scenario. We then move onto other datasets and the state of the art in Sect. 4.7.
We experiment with no data augmentation (denoted Image Aug=– in Tab. II), flip augmentation (Image Aug=F), and C+F augmentation (Image Aug=C). Augmented images are used as stand-alone samples (f), or by fusing the corresponding descriptors using sum (s) or max (m) pooling or stacking (t). So for example Image Aug=(C) f s in row II of Tab. II means that C+F augmentation is used to generate additional samples in training (f), and is combined with sum-pooling in testing (s).
Augmentation consistently improves performance by for both IFV (e.g. II vs. II) and CNN (e.g. II vs. II). Using additional samples for training and sum-pooling for testing works best (II) followed by sum-pooling II, max pooling II, and stacking II. In terms of the choice of transformations, flipping improves only marginally (II vs. II), but using the more expensive C+F sampling improves, as seen, by about (II vs. II). We experimented with sampling more transformations, taking a higher density of crops from the centre of the image, but observed no benefit.
Colour information can be added and subtracted in CNN and IFV. In IFV replacing SIFT with the colour descriptors of  (denoted COL in Method) yields significantly worse performance (II vs. II). However, when SIFT and colour descriptors are combined by stacking the corresponding IFVs (COL+) there is a small but significant improvement of around in the non-augmented case (e.g. II vs. II) but little impact in the augmented case (e.g. II vs. II). For CNNs, retraining the network after converting all the input images to grayscale (denoted GS in Methods) has a more significant impact, resulting in a performance drop of (II vs. II, II vs. II).
The baseline IFV encoding using a spatial pyramid II performs slightly better than the results [I] taken from Chatfield et al. , primarily due to a larger number of spatial scales being used during SIFT feature extraction, and the resultant SIFT features being square-rooted. Intra-normalisation, denoted as IN in the Method column of the table, improves the performance by (e.g. II vs. II). More interestingly, switching from spatial pooling (denoted spm in the SPool column) to feature spatial augmentation (SPool=(x,y)) has either little effect on the performance or results in a marginal increase (II vs. II, II vs. II), whilst resulting in a representation which is over 10 smaller. We also experimented with augmenting with scale in addition to position as in  but observed no improvement. Finally, we investigate pushing the parameters of the representation setting (rows II-II). Increasing the number of GMM centres in the model from to results in a further performance increase (e.g. II vs. II), but at the expense of higher-dimensional codes (125K dimensional).
CNN-based methods consistently outperform the shallow encodings, even after the improvements discussed above, by a large mAP margin (II vs. II). Our small architecture CNN-F, which is similar to DeCAF , performs significantly better than the latter ([II] vs. II), validating our implementation. Both medium CNN-M II and slow CNN-S II outperform the fast CNN-F II by a significant margin. Since the accuracy of CNN-S and CNN-M is nearly the same, we focus on the latter as it is simpler and marginally () faster. Remarkably, these good networks work very well even with no augmentation II. Another advantage of CNNs compared to IFV is the small dimensionality of the output features, although IFV can be compressed to an extent. We explored retraining the CNNs such that the final layer was of a lower dimensionality, and reducing from 4096 to 2048 actually resulted in a marginal performance boost (II vs. II). What is surprising is that we can reduce the output dimensionality further to 1024D II and even 128D II with only a drop of for codes that are smaller ( smaller than our best performing IFV II). Note, -normalising the features accounted for up to of their performance over VOC 2007; it should be applied before input to the SVM and after pooling the augmented descriptors (where applicable).
We fine-tuned our CNN-S architecture on VOC-2007 using the ranking hinge loss, and achieved a significant improvement: (II vs. II). This demonstrates that in spite of the small amount of VOC training data (5,011 images), fine-tuning is able to adjust the learnt deep representation to better suit the dataset in question.
For the CNN-M 2048 representation II, stacking deep and shallow representations to form a higher-dimensional descriptor makes little difference (II vs. II). For the weaker CNN-F it results in a small boost of (II vs. II).
|(a) FK IN 512||-||68.0||–||–||–|
|(b) CNN F||16.7||77.4||79.9||–||–|
|(c) CNN M||13.7||79.9||82.5||87.15 0.80||77.03 0.46|
|(d) CNN M 2048||13.5||80.1||82.4||86.64 0.53||76.88 0.35|
|(e) CNN S||13.1||79.7||82.9||87.76 0.66||77.61 0.12|
|(f) CNN S TUNE-CLS||13.1||-||83.0||88.35 0.56||77.33 0.56|
|(g) CNN S TUNE-RNK||13.1||82.4||83.2||–||–|
|(h) Zeiler & Fergus ||16.1||-||79.0||86.5 0.5||74.2 0.3|
|(i) Razavian et al. [9, 10]||14.7||77.2||–||–||–|
|(j) Oquab et al. ||18||77.7||78.7 (82.8*)||–||–|
|(k) Oquab et al. ||-||-||86.3*||–||–|
|(l) Wei et al. ||-||81.5 (85.2*)||81.7 (90.3*)||–||–|
|(m) He et al. ||13.6||80.1||-||91.4 0.7||–|
In Table III we report our results on ILSVRC-2012, VOC-2007, VOC-2012, Caltech-101, and Caltech-256 datasets, and compare them to the state of the art. First, we note that the ILSVRC error rates of our CNN-F, CNN-M, and CNN-S networks are better than those reported by , , and  for the related configurations. This validates our implementation, and the difference is likely to be due to the sampling of image crops from the uncropped image plane (instead of the centre). When using our CNN features on other datasets, the relative performance generally follows the same pattern as on ILSVRC, where the nets are trained – the CNN-F architecture exhibits the worst performance, with CNN-M and CNN-S performing considerably better.
Further fine-tuning of CNN-S on the VOC datasets turns out to be beneficial; on VOC-2012, using the ranking loss is marginally better than the classification loss (III vs. III), which can be explained by the ranking-based VOC evaluation criterion. Fine-tuning on Caltech-101 also yields a small improvement, but no gain is observed over Caltech-256.
Our CNN-S net is competitive with recent CNN-based approaches [19, 9, 8, 16, 17, 29] and on a number of datasets (VOC-2007, VOC-2012, Caltech-101, Caltech-256) and sets the state of the art on VOC-2007 and VOC-2012 across methods pre-trained solely on ILSVRC-2012 dataset. While the CNN-based methods of [16, 17] achieve better performance on VOC (86.3% and 90.3% respectively), they were trained using extended ILSVRC datasets, enriched with additional categories semantically close to the ones in VOC. Additionally,  used a significantly more complex classification pipeline, driven by bounding box proposals , pre-trained on ILSVRC-2013 detection dataset. Their best reported result on VOC-2012 (90.3%) was achieved by the late fusion with a complex hand-crafted method of ; without fusion, they get 84.2%. On Caltech-101,  achieves the state of the art using spatial pyramid pooling of conv5 layer features, while we used full7 layer features consistently across all datasets (for full7 features, they report ).
In addition to achieving performance comparable to the state of the art with a very simple approach (but powerful CNN-based features), with the modifications outlined in the paper (primarily the use of data augmentation similar to the CNN-based methods) we are able to improve the performance of shallow IFV to 68.02% (Table II, II).
A comparative plot of the evolution in the performance of the methods evaluated in this paper, along with a selection from our earlier review of shallow methods  is presented in Fig. 1. Classification accuracy over PASCAL VOC was 54.48% mAP for the BoVW model in 2008, 61.7% for the IFV in 2010 , and 73.41% for DeCAF  and similar [8, 9] CNN-based methods introduced in late 2013. Our best performing CNN-based method (CNN-S with fine-tuning) achieves 82.42%, comparable to the most recent state-of-the-art.
One of our best-performing CNN representations CNN-M-2048 II is more compact than the best performing IFV II (84K vs. 2K) and CNN-M features are also faster to compute ( vs. per image with augmentation enabled, over a single CPU core). Non-augmented CNN-M features II take around per image, compared to for CNN-S features and for CNN-F features.
In this paper we presented a rigorous empirical evaluation of CNN-based methods for image classification, along with a comparison with more traditional shallow feature encoding methods. We have demonstrated that the performance of shallow representations can be significantly improved by adopting data augmentation, typically used in deep learning. In spite of this improvement, deep architectures still outperform the shallow methods by a large margin. We have shown that the performance of deep representations on the ILSVRC dataset is a good indicator of their performance on other datasets, and that fine-tuning can further improve on already very strong results achieved using the combination of deep representations and a linear SVM. Source code and CNN models to reproduce the experiments presented in the paper are available on the project website in the hope that it would provide common ground for future comparisons, and good baselines for image representation research.
This work was supported by the EPSRC and ERC grant VisRec no. 228180. We gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.
Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. Jackel, “Backpropagation applied to handwritten zip code recognition,”Neural Computation, vol. 1, no. 4, pp. 541–551, 1989.