The semantic segmentation produced by most state-of-the-art methods does not show satisfactory adherence to object boundaries. Methods such as fully-connected conditional random fields (CRFs) can significantly refine segmentation predictions. However, they rely on supervised parameter optimization that depends upon specific datasets and predictor modules. We propose an unsupervised method for semantic segmentation refinement that takes as input the confidence scores generated by a segmentation network and re-labels pixels with low confidence levels. More specifically, a region growing mechanism aggregates these pixels to neighboring areas with high confidence scores and similar appearance. To minimize the impact of high-confidence prediction errors, our algorithm performs multiple growing steps by Monte Carlo sampling initial seeds in high-confidence regions. Our method provides both running time and segmentation improvements comparable to state-of-the-art refinement approaches for semantic segmentation, as demonstrated by evaluations on multiple publicly available benchmark datasets.
@cite_6: In this work we address the task of semantic image segmentation with Deep Learning and make three main contributions that are experimentally shown to have substantial practical merit. First , we highlight convolution with upsampled filters, or ‘atrous convolution’, as a powerful tool in dense prediction tasks. Atrous convolution allows us to explicitly control the resolution at which feature responses are computed within Deep Convolutional Neural Networks. It also allows us to effectively enlarge the field of view of filters to incorporate larger context without increasing the number of parameters or the amount of computation. Second , we propose atrous spatial pyramid pooling (ASPP) to robustly segment objects at multiple scales. ASPP probes an incoming convolutional feature layer with filters at multiple sampling rates and effective fields-of-views, thus capturing objects as well as image context at multiple scales. Third , we improve the localization of object boundaries by combining methods from DCNNs and probabilistic graphical models. The commonly deployed combination of max-pooling and downsampling in DCNNs achieves invariance but has a toll on localization accuracy. We overcome this by combining the responses at the final DCNN layer with a fully connected Conditional Random Field (CRF), which is shown both qualitatively and quantitatively to improve localization performance. Our proposed “DeepLab” system sets the new state-of-art at the PASCAL VOC-2012 semantic image segmentation task, reaching 79.7 percent mIOU in the test set, and advances the results on three other datasets: PASCAL-Context, PASCAL-Person-Part, and Cityscapes. All of our code is made publicly available online.
@cite_3: Most state-of-the-art techniques for multi-class image segmentation and labeling use conditional random fields defined over pixels or image regions. While region-level models often feature dense pairwise connectivity, pixel-level models are considerably larger and have only permitted sparse graph structures. In this paper, we consider fully connected CRF models defined on the complete set of pixels in an image. The resulting graphs have billions of edges, making traditional inference algorithms impractical. Our main contribution is a highly efficient approximate inference algorithm for fully connected CRF models in which the pairwise edge potentials are defined by a linear combination of Gaussian kernels. Our experiments demonstrate that dense connectivity at the pixel level substantially improves segmentation and labeling accuracy.
In addition to the generation of region proposals or pre-segmentation elements, local-appearance information has been also employed in post-processing steps to improve segmentations obtained with deep CNN models. One such post-processing approach is to model the problem as a CRF defined over neighboring pixels or small patches, which however might lead to excessive smoothing of boundaries due to the lack of long-range connections @cite_3 . Kr "a henb "uhl et al in @cite_3 introduces an efficient algorithm for fully connected CRFs containing pairwise potentials that associate all pairs of pixels in a image. This algorithm is successfully exploited by the Deeplab model @cite_6 to produce fine-grained segmentations. However, this refinement model contains parameters that have to be optimized in a supervised manner when applied to different datasets.