"vscode:/vscode.git/clone" did not exist on "2032ad935d9d78c52c910ae599511715aef133bf"
fhog_object_detector_ex.cpp 15 KB
Newer Older
1
2
3
// The contents of this file are in the public domain. See LICENSE_FOR_EXAMPLE_PROGRAMS.txt
/*

4
5
6
7
8
9
10
11
12
13
    This example program shows how you can use dlib to make an object detector
    for things like faces, pedestrians, and any semi-rigid object.  In
    particular, we go though the steps to train the kind of sliding window
    object detector first published by Dalal and Triggs in 2005 in the paper
    Histograms of Oriented Gradients for Human Detection.  

    Note that this program executes fastest when compiled with at least SSE2
    instructions enabled.  So if you are using a PC with an Intel or AMD chip
    then you should enable at least SSE2 instructions.  If you are using cmake
    to compile this program you can enable them by using one of the following
14
15
16
17
18
19
20
21
22
    commands when you create the build project:
        cmake path_to_dclib/examples -DUSE_SSE2_INSTRUCTIONS=ON
        cmake path_to_dclib/examples -DUSE_SSE4_INSTRUCTIONS=ON
        cmake path_to_dclib/examples -DUSE_AVX_INSTRUCTIONS=ON
    This will set the appropriate compiler options for GCC, clang, Visual
    Studio, or the Intel compiler.  If you are using another compiler then you
    need to consult your compiler's manual to determine how to enable these
    instructions.  Note that AVX is the fastest but requires a CPU from at least
    2011.  SSE4 is the next fastest and is supported by most current machines.  
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

*/


#include <dlib/svm_threaded.h>
#include <dlib/gui_widgets.h>
#include <dlib/image_processing.h>
#include <dlib/data_io.h>

#include <iostream>
#include <fstream>


using namespace std;
using namespace dlib;

// ----------------------------------------------------------------------------------------

41
int main(int argc, char** argv)
42
43
44
45
{  

    try
    {
46
47
48
49
50
        // In this example we are going to train a face detector based on the
        // small faces dataset in the dclib/examples/faces directory.  So the
        // first thing we do is load that dataset.  This means you need to
        // supply the path to this faces folder as a command line argument so we
        // will know where it is.
51
52
53
54
55
56
57
58
59
60
        if (argc != 2)
        {
            cout << "Give the path to the dclib/examples/faces directory as the argument to this" << endl;
            cout << "program.  For example, if you are in the dclib/examples folder then execute " << endl;
            cout << "this program by running: " << endl;
            cout << "   ./fhog_object_detector_ex faces" << endl;
            cout << endl;
            return 0;
        }
        const std::string faces_directory = argv[1];
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
        // Inside the faces directory is a training dataset and a separate
        // testing dataset.  The training data consists of 4 images, each
        // annotated with rectangles that bound each human face.  The idea is 
        // to use this training data to learn to identify human faces in new
        // images.  
        // 
        // Once you have trained an object detector it is always important to
        // test it on data it wasn't trained on.  Therefore, we will also load
        // a separate testing set of 5 images.  Once we have a face detector
        // created from the training data we will see how well it works by
        // running it on the testing images. 
        // 
        // So here we create the variables that will hold our dataset.
        // images_train will hold the 4 training images and face_boxes_train
        // holds the locations of the faces in the training images.  So for
        // example, the image images_train[0] has the faces given by the
        // rectangles in face_boxes_train[0].
        dlib::array<array2d<unsigned char> > images_train, images_test;
        std::vector<std::vector<rectangle> > face_boxes_train, face_boxes_test;

        // Now we load the data.  These XML files list the images in each
        // dataset and also contain the positions of the face boxes.  Obviously
        // you can use any kind of input format you like so long as you store
        // the data into images_train and face_boxes_train.  But for convenience
        // dlib comes with tools for creating and loading XML image dataset
        // files.  Here you see how to load the data.  To create the XML files
        // you can use the imglab tool which can be found in the
        // dclib/tools/imglab folder.  It is a simple graphical tool for
        // labeling objects in images with boxes.  To see how to use it you can
        // read the dclib/tools/imglab/README.txt file.
        load_image_dataset(images_train, face_boxes_train, faces_directory+"/training.xml");
        load_image_dataset(images_test, face_boxes_test, faces_directory+"/testing.xml");

        // Now we do a little bit of pre-processing.  This is optional but for
        // this training data it improves the results.  The first thing we do is
        // increase the size of the images by a factor of two.  We do this
        // because it will allow us to detect smaller faces than otherwise would
        // be practical (since the faces are all now twice as big).  Note that,
        // in addition to resizing the images, these functions also make the
        // appropriate adjustments to the face boxes so that they still fall on
        // top of the faces after the images are resized.
        upsample_image_dataset<pyramid_down<2> >(images_train, face_boxes_train);
        upsample_image_dataset<pyramid_down<2> >(images_test,  face_boxes_test);
        // Since human faces are generally left-right symmetric we can increase
        // our training dataset by adding mirrored versions of each image back
        // into images_train.  So this next step doubles the size of our
        // training dataset.  Again, this is obviously optional but is useful in
        // many object detection tasks.
        add_image_left_right_flips(images_train, face_boxes_train);
        cout << "num training images: " << images_train.size() << endl;
111
112
        cout << "num testing images:  " << images_test.size() << endl;

113
114
115
116
117
118
119
120
121

        // Finally we get to the training code.  dlib contains a number of
        // object detectors.  This typedef tells it that you want to use the one
        // based on Felzenszwalb's version of the Histogram of Oriented
        // Gradients (commonly called HOG) detector.  The 6 means that you want
        // it to use an image pyramid that downsamples the image at a ratio of
        // 5/6.  Recall that HOG detectors work by creating an image pyramid and
        // then running the detector over each pyramid level in a sliding window
        // fashion.   
122
123
        typedef scan_fhog_pyramid<pyramid_down<6> > image_scanner_type; 
        image_scanner_type scanner;
124
        // The sliding window detector will be 80 pixels wide and 80 pixels tall.
125
        scanner.set_detection_window_size(80, 80); 
126
        structural_object_detection_trainer<image_scanner_type> trainer(scanner);
127
128
129
130
131
        // Set this to the number of processing cores on your machine.
        trainer.set_num_threads(4);  
        // The trainer is a kind of support vector machine and therefore has the usual SVM
        // C parameter.  In generally, a bigger C encourages it to fit the training data
        // better but might lead to overfitting.  
132
        trainer.set_c(1);
133
        // We can tell the trainer to print it's progress to the console if we want.  
134
        trainer.be_verbose();
135
136
137
138
139
        // The trainer will run until the "risk gap" is less than 0.01.  Smaller values
        // make the trainer solve the SVM optimization problem more accurately but will
        // take longer to train.  For most problems a value in the range of 0.1 to 0.01 is
        // plenty accurate.  Also, when in verbose mode the risk gap is printed each
        // iteration so you can see how close it is to finishing the training.  
140
141
142
        trainer.set_epsilon(0.01);


143
144
145
        // Now we run the trainer.  For this example, it should take on the order of 10
        // seconds to train.
        object_detector<image_scanner_type> detector = trainer.train(images_train, face_boxes_train);
146

147
148
149
        // Now that we have a face detector we can test it.  The first statement tests it
        // on the training data.  It will print the precision, recall, and then average precision.
        cout << "training results: " << test_object_detection_function(detector, images_train, face_boxes_train) << endl;
Davis King's avatar
Davis King committed
150
        // Happily, we see that the object detector works perfectly on the testing images.
151
        cout << "testing results:  " << test_object_detection_function(detector, images_test, face_boxes_test) << endl;
152
153


154
155
156
157
158
        // If you have read any papers that use HOG you have probably seen the nice looking
        // "sticks" visualization of a learned HOG detector.  This next line creates a
        // window that visualizes the HOG filter we just learned.  It should look somewhat
        // like a face.
        image_window hogwin(draw_fhog(detector), "Learned fHOG detector");
159

160
161
        // Now for the really fun part.  Lets display the testing images on the screen and
        // show the output of the face detector overlaid on each image.
162
        image_window win; 
163
164
        for (unsigned long i = 0; i < images_test.size(); ++i)
        {
165
            // Run the detector and get the detections.
166
            std::vector<rectangle> dets = detector(images_test[i]);
167
168
169
            win.clear_overlay();
            win.set_image(images_test[i]);
            win.add_overlay(dets, rgb_pixel(255,0,0));
170
            cout << "Hit enter to process the next image..." << endl;
171
172
173
174
            cin.get();
        }


175
176
        // Like everything in dlib, you can save your detector to disk using the
        // serialize() function.
177
178
        ofstream fout("face_detector.svm", ios::binary);
        serialize(detector, fout);
179
180
        fout.close();

181
        // Then you can recall it using the deserialize() function.
182
183
184
185
186
187
188
        ifstream fin("face_detector.svm", ios::binary);
        object_detector<image_scanner_type> detector2;
        deserialize(detector2, fin);




189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
        // Now lets talk about some optional features of this training tool as well as some
        // important points you should understand.
        //
        // The first thing that should be pointed out is that, since this is a sliding
        // window classifier, it can't output any arbitrary rectangle as a detection.  In
        // this example our sliding window is 80 by 80 pixels and is run over an image
        // pyramid.  This means that it detector can only output detections that are at
        // least 80 by 80 pixels in size.  It also means that the aspect ratio of the
        // outputs is also 1.  So if, for example, you had a box in your training data that
        // was 200 pixels by 10 pixels then it would simply be impossible for the detector
        // to learn to detect it.  Similarly, if you had a really small box it would be
        // unable to learn to detect it.  
        //
        // So the training code performs a check on the training data and will throw an
        // exception if it detects any boxes that are impossible to detect given your
        // setting of scanning window size and image pyramid resolution.  You can use 
        // a statement like:
        //   remove_unobtainable_rectangles(trainer, images_train, face_boxes_train)
        // to automatically discard these impossible boxes from your training dataset.
        // This will avoid getting the "impossible box" exception.  However, I would
        // recommend that you be careful that you are not throwing away truth boxes you
        // really care about.  The remove_unobtainable_rectangles() will return the set of
        // removed rectangles so you can visually inspect them and make sure you are OK
        // that they are being removed. 
        // 
        // Next, note that any location in the images not marked with a truth box is
        // implicitly treated as a negative example.  This means that when creating
        // training data it is critical that you label all the objects you want to detect.
        // So for example, if you are making a face detector then you must mark all the
        // faces in each image.  Sometimes there are objects in images you are unsure about
        // or simply don't care if the detector identifies or not.  For these objects you
        // can pass in a set of "ignore boxes" as a third argument to the trainer.train()
        // function.  The trainer will simply disregard any detections that happen to hit
        // these boxes.   
        //
        // Another useful thing you can do is pack multiple HOG detectors into one
        // object_detector.  The main benefit of this is increased speed since it avoids
        // recomputing the HOG features for each run of the detector.  This is how the face
        // detector that comes with dlib works (see get_frontal_face_detector()).  It
        // contains 5 different detectors.  One for front looking faces with no rotation,
        // another for faces rotated to the left about 30 degrees, one for a right rotation
        // of 30 degrees.  Then two more detectors, one for faces looking to the left and
        // another to the right.  However, note that to use this all the detectors must
        // have been trained with the same settings for the sliding window size and also
        // the scanner padding option (see the scan_fhog_pyramid documentation).  
        //
        // Finally, you can add a nuclear norm regularizer to the SVM trainer.  Doing has
        // two benefits.  It can cause the learned HOG detector to be composed of separable
        // filters and therefore makes it faster when detecting objects.  It can also help
        // with generalization since it tends to make the learned HOG filters smoother.  To
        // enable this option you call the following function before you create the trainer
        // object:
        //    scanner.set_nuclear_norm_regularization_strength(1.0);
        // The argument determines how important it is to have a small nuclear norm.  A
        // bigger regularization strength means it is more important.  The smaller the
        // nuclear norm the smoother and faster the learned HOG filters will be, but if the
        // regularization strength value is too large then the SVM will not fit the data
        // well.  This is analogous to giving a C value that is too small.
        //
        // You can see how many separable filters are inside your detector like so:
        cout << "num filters: "<< num_separable_filters(detector) << endl;
        // You can also control how many filters there are by explicitly thresholding the
        // singular values of the filters like this:
252
        detector = threshold_filter_singular_values(detector,0.1);
253
254
255
256
        // That removes filter components with singular values less than 0.1.  The bigger
        // this number the fewer separable filters you will have and the faster the
        // detector will run.  However, a large enough threshold will hurt detection
        // accuracy.  
257
258
259
260
261
262
263
264
265
266
267

    }
    catch (exception& e)
    {
        cout << "\nexception thrown!" << endl;
        cout << e.what() << endl;
    }
}

// ----------------------------------------------------------------------------------------