The design of complexity-aware cascaded detectors, combining features of very different complexities, is considered. A new cascade design procedure is introduced, by formulating cascade learning as the Lagrangian optimization of a risk that accounts for both accuracy and complexity. A boosting algorithm, denoted as complexity aware cascade training (CompACT), is then derived to solve this optimization. CompACT cascades are shown to seek an optimal trade-off between accuracy and complexity by pushing features of higher complexity to the later cascade stages, where only a few difficult candidate patches remain to be classified. This enables the use of features of vastly different complexities in a single detector. In result, the feature pool can be expanded to features previously impractical for cascade design, such as the responses of a deep convolutional neural network (CNN). This is demonstrated through the design of a pedestrian detector with a pool of features whose complexities span orders of magnitude. The resulting cascade generalizes the combination of a CNN with an object proposal mechanism: rather than a pre-processing stage, CompACT cascades seamlessly integrate CNNs in their stages. This enables state of the art performance on the Caltech and KITTI datasets, at fairly fast speeds.
Several works proposed alternative feature channels, obtained by convolving different filters with the original HOG+LUV channels @cite_18 @cite_9 @cite_33 @cite_10 . The SquaresChnFtrs of @cite_47 reduce the large number of features of @cite_25 @cite_39 to 16 box-like filters of various sizes. @cite_10 extended the locally decorrelated features of @cite_32 to ACF, learning four 5 @math 5 PCA-like filters from each of the ACF channels. Instead of empirical filter design, @cite_18 exploited prior knowledge about pedestrian shape to design informed filters. They later found, however, that such filters are actually not needed @cite_9 . Instead, the number of filters appears to be the most important variable: features as simple as checkerboard-like patterns, or purely random filters, can achieve very good performance, as long as there are enough of them. Although reached state-of-the-art performance has been achieved @cite_43 @cite_21 , they are relatively slow, due to the convolution computations with several hundred filters.
@cite_18 @cite_33 @cite_9 @cite_21 @cite_32 @cite_39 @cite_43 @cite_47 @cite_10 @cite_25
2096029268 2074777933 2950561226 2964198573
We propose a flexible, efficient design technique for the prototype filter of an oversampled near perfect reconstruction (NPR) generalized discrete Fourier transform (GDFT) filterbank. Such filterbanks have several desirable properties for subband processing systems that are sensitive to aliasing, such as subband adaptive filters. The design criteria for the prototype filter are explicit bounds (derived herein) on the aliased components in the subbands and the output, the distortion induced by the filterbank, and the imaged subband errors in the output. It is shown that the design of an optimal prototype filter can be transformed into a convex optimization problem, which can be efficiently solved. The proposed design technique provides an efficient and effective tool for exploring many of the inherent tradeoffs in the design of the prototype filter, including the tradeoff between aliasing in the subbands and the distortion induced by the filterbank. We calculate several examples of these tradeoffs and demonstrate that the proposed method can generate filters with significantly better performance than filters obtained using current design methods. This paper starts from the observation that multiple top performing pedestrian detectors can be modelled by using an intermediate layer filtering low-level features in combination with a boosted decision forest. Based on this observation we propose a unifying framework and experimentally explore different filter families. We report extensive results enabling a systematic analysis. Using filtered channel features we obtain top performance on the challenging Caltech and KITTI datasets, while using only HOG+LUV as low-level features. When adding optical flow features we further improve detection quality and report the best known results on the Caltech dataset, reaching 93 recall at 1 FPPI. This paper starts from the observation that multiple top performing pedestrian detectors can be modelled by using an intermediate layer filtering low-level features in combination with a boosted decision forest. Based on this observation we propose a unifying framework and experimentally explore different filter families. We report extensive results enabling a systematic analysis. Using filtered channel features we obtain top performance on the challenging Caltech and KITTI datasets, while using only HOG+LUV as low-level features. When adding optical flow features we further improve detection quality and report the best known results on the Caltech dataset, reaching 93 recall at 1 FPPI. Discriminative correlation filters (DCF) with deep convolutional features have achieved favorable performance in recent tracking benchmarks. However, most of existing DCF trackers only consider appearance features of current frame, and hardly benefit from motion and inter-frame information. The lack of temporal information degrades the tracking performance during challenges such as partial occlusion and deformation. In this paper, we propose the FlowTrack, which focuses on making use of the rich flow information in consecutive frames to improve the feature representation and the tracking accuracy. The FlowTrack formulates individual components, including optical flow estimation, feature extraction, aggregation and correlation filters tracking as special layers in network. To the best of our knowledge, this is the first work to jointly train flow and tracking task in deep learning framework. Then the historical feature maps at predefined intervals are warped and aggregated with current ones by the guiding of flow. For adaptive aggregation, we propose a novel spatial-temporal attention mechanism. In experiments, the proposed method achieves leading performance on OTB2013, OTB2015, VOT2015 and VOT2016.