Oriented Edge Forests for Boundary Detection

Abstract
We present a simple, efficient model for learning bound-
ary detection based on a random forest classifier. Our ap-
proach combines (1) efficient clustering of training exam-
ples based on a simple partitioning of the space of local
edge orientations and (2) scale-dependent calibration of in-
dividual tree output probabilities prior to multiscale combi-
nation. The resulting model outperforms published results
on the challenging BSDS500 boundary detection bench-
mark. Further, on large datasets our model requires sub-
stantially less memory for training and speeds up training
time by a factor of 10 over the structured forest model.
Cite
@inproceedings{oriented-edge-forests-for-boundary-detection-2015,
author = {Sam Hallman and Charless C. Fowlkes},
title = {Oriented Edge Forests for Boundary Detection},
booktitle = {CVPR},
year = {2015},
doi = {10.1109/cvpr.2015.7298782},
url = {https://doi.org/10.1109/cvpr.2015.7298782},
}