CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.05 - May
Issue No.05 - May (2011 vol.33)
Pablo Arbeláez , University of California at Berkeley, Berkeley
Michael Maire , California Institute of Technology, Pasadena
Charless Fowlkes , University of California at Irvine, Irvine
Jitendra Malik , University of California at Berkeley, Berkeley
This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentation algorithm consists of generic machinery for transforming the output of any contour detector into a hierarchical region tree. In this manner, we reduce the problem of image segmentation to that of contour detection. Extensive experimental evaluation demonstrates that both our contour detection and segmentation methods significantly outperform competing algorithms. The automatically generated hierarchical segmentations can be interactively refined by user-specified annotations. Computation at multiple image resolutions provides a means of coupling our system to recognition applications.
Contour detection, image segmentation, computer vision.
Pablo Arbeláez, Michael Maire, Charless Fowlkes, Jitendra Malik, "Contour Detection and Hierarchical Image Segmentation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 5, pp. 898-916, May 2011, doi:10.1109/TPAMI.2010.161