most state-of-the-art methods in pedestrian detection are unable to achieve a good trade-off between accuracy and efficiency. for example, acf has a fast speed but a relatively low detection rate, while checkerboards have a high detection rate but a slow speed. inspired by some simple inherent attributes of pedestrians (i.e., appearance constancy and shape symmetry), we propose two new types of non-neighboring features: side-inner difference features (sidf) and symmetrical similarity features (ssfs). sidf can characterize the difference between the background and pedestrian and the difference between the pedestrian contour and its inner part. ssf can capture the symmetrical similarity of pedestrian shape. however, it is difficult for neighboring features to have such above characterization abilities. finally, we propose to combine both non-neighboring features and neighboring features for pedestrian detection. it is found that non-neighboring features can further decrease the log-average miss rate by 4.44%. the relationship between our proposed method and some state-of-the-art methods is also given. experimental results on inria, caltech, and kitti data sets demonstrate the effectiveness and efficiency of the proposed method. compared with the state-of-the-art methods without using cnn, our method achieves the best detection performance on caltech, outperforming the second best method (i.e., checkerboards) by 2.27%. using the new annotations of caltech, it can achieve 11.87% miss rate, which outperforms other methods.