Answers are grounded in this paper and cite their sources.
Pedestrian detection for autonomous driving is a challenging task that requires careful trade-off between accuracy, storage, computation and energy requirements. In our work, we extend the recent SqueezeNet architecture to pedestrian detection. We show how this network can be modified to obtain detection performance on the Caltech USA pedestrian dataset that is comparable in overall log-average miss rate to other competing models while easily running at 30FPS on an automotive processor with a model size of 3.24MB and within a power envelope of 2W. The extension relies on the observation that precise knowledge of bounding box corners is not necessary to know the location of pedestrians and their approximate size. Rather, a coarse grid based localization is proposed here and acts as a kind of heatmap of pedestrian locations, relying on only one forward pass through the network. The number of new free parameters introduced is small relative to the original SqueezeNet model.
No takes yet. Share an insight, caveat, or question.
Verbickas et al. (2017) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: