English

Oriented Edge Forests for Boundary Detection

Computer Vision and Pattern Recognition 2015-06-30 v2

Abstract

We present a simple, efficient model for learning boundary detection based on a random forest classifier. Our approach combines (1) efficient clustering of training examples based on simple partitioning of the space of local edge orientations and (2) scale-dependent calibration of individual tree output probabilities prior to multiscale combination. The resulting model outperforms published results on the challenging BSDS500 boundary detection benchmark. Further, on large datasets our model requires substantially less memory for training and speeds up training time by a factor of 10 over the structured forest model.

Keywords

Cite

@article{arxiv.1412.4181,
  title  = {Oriented Edge Forests for Boundary Detection},
  author = {Sam Hallman and Charless C. Fowlkes},
  journal= {arXiv preprint arXiv:1412.4181},
  year   = {2015}
}

Comments

updated to include contents of CVPR version + new figure showing example segmentation results

R2 v1 2026-06-22T07:29:55.917Z