Fast Edge Detection Using Structured Forests

By Piotr Doll'ar, C. Lawrence Zitnick. 2014

1,006 citations recorded by the source corpus.

Edge detection is a critical component of many vision systems, including object detectors and image segmentation algorithms. Patches of edges exhibit well-known forms of local structure, such as straight lines or T-junctions. In this paper we take advantage of the structure present in local image patches to learn both an accurate and computationally efficient edge detector. We formulate the problem of predicting local edge masks in a structured learning framework applied to random decision forests. Our novel approach to learning decision trees robustly maps the structured labels to a discrete space on which standard information gain measures may be evaluated. The result is an approach that obtains realtime performance that is orders of magnitude faster than many competing state-of-the-art approaches, while also achieving state-of-the-art edge detection results on the BSDS500 Segmentation dataset and NYU Depth dataset. Finally, we show the potential of our approach as a general purpose edge detector by showing our learned edge models generalize well across datasets.

Subfields: Computer Vision and Pattern Recognition, Media Technology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Xiaogang Wang
  3. Ming-Hsuan Yang
  4. Dacheng Tao
  5. Jitendra Malik
  6. Bernt Schiele
  7. Trevor Darrell
  8. Andrew Zisserman

In Media Technology

  1. Luc Van Gool
  2. Andrew Zisserman
  3. Andrea Vedaldi
  4. Chunhua Shen
  5. Jitendra Malik
  6. Chen Change Loy
  7. Xiang Bai
  8. Xiaoou Tang

Citations in the corpus