Oriented Edge Forests for Boundary Detection
arXiv:1412.4181
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.
updated to include contents of CVPR version + new figure showing example segmentation results
References in corpus (2)
Cited by in corpus (8)
- Holistically-Nested Edge Detection
- PixelNet: Representation of the pixels, by the pixels, and for the pixels
- Oriented Response Networks
- Improved Image Boundaries for Better Video Segmentation
- Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
- Weakly Supervised Object Boundaries
- cvpaper.challenge in 2015 - A review of CVPR2015 and DeepSurvey
- cvpaper.challenge in 2016: Futuristic Computer Vision through 1,600 Papers Survey