Semantic edge detection (SED), which aims at jointly extracting edges as well as their category information, has far-reaching applications in domains such as semantic segmentation, object proposal generation, and object recognition. SED naturally requires achieving two distinct supervision targets: locating fine detailed edges and identifying high-level semantics. We shed light on how such distracted supervision targets prevent state-of-the-art SED methods from effectively using deep supervision to improve results. In this paper, we propose a novel fully convolutional neural network architecture using diverse deep supervision (DDS) within a multi-task framework where lower layers aim at generating category-agnostic edges, while higher layers are responsible for the detection of category-aware semantic edges. To overcome the distracted supervision challenge, a novel information converter unit is introduced, whose effectiveness has been extensively evaluated in several popular benchmark datasets, including SBD, Cityscapes, and PASCAL VOC2012. Source code will be released upon paper acceptance.
Classical category-agnostic edge detection. Edge detection is conventionally solved by designing various filters ( Sobel @cite_23 and Canny @cite_8 ) or complex models @cite_49 @cite_50 to detect pixels with highest gradients in their local neighborhoods @cite_11 @cite_14 @cite_56 . To the best of our knowledge, Konishi al @cite_42 proposed the first data-driven edge detector in which, unlike previous model based approaches, edge detection was posed as statistical inferences. features consisting of brightness, color and texture are used in @cite_2 to obtain the posterior probability of each boundary point. is further extended to @cite_18 by computing local cues from multi-scale and globalizing them through spectral clustering. Sketch tokens are learned from hand-drawn sketches for contour detection @cite_25 , while random decision forests are employed in @cite_6 to learn the local structure of edge patches, delivering competitive results among non-deep-learning approaches.
@cite_18 @cite_14 @cite_8 @cite_42 @cite_2 @cite_6 @cite_56 @cite_50 @cite_49 @cite_23 @cite_25 @cite_11
2110158442 2145023731 2107333657 2119823327 1976047850 2142675916 2736193919 2116504721 2151049637 2111416952
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. This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge. We use the criteria in numerical optimization to derive detectors for several common image features, including step edges. On specializing the analysis to step edges, we find that there is a natural uncertainty principle between detection and localization performance, which are the two main goals. With this principle we derive a single operator shape which is optimal at any scale. The optimal detector has a simple approximate implementation in which edges are marked at maxima in gradient magnitude of a Gaussian-smoothed image. We extend this simple detector using operators of several widths to cope with different signal-to-noise ratios in the image. We present a general method, called feature synthesis, for the fine-to-coarse integration of information from operators at different scales. Finally we show that step edge detector performance improves considerably as the operator point spread function is extended along the edge. We formulate edge detection as statistical inference. This statistical edge detection is data driven, unlike standard methods for edge detection which are model based. For any set of edge detection filters (implementing local edge cues), we use presegmented images to learn the probability distributions of filter responses conditioned on whether they are evaluated on or off an edge. Edge detection is formulated as a discrimination task specified by a likelihood ratio test on the filter responses. This approach emphasizes the necessity of modeling the image background (the off-edges). We represent the conditional probability distributions nonparametrically and illustrate them on two different data sets of 100 (Sowerby) and 50 (South Florida) images. Multiple edges cues, including chrominance and multiple-scale, are combined by using their joint distributions. Hence, this cue combination is optimal in the statistical sense. We evaluate the effectiveness of different visual cues using the Chernoff information and Receiver Operator Characteristic (ROC) curves. This shows that our approach gives quantitatively better results than the Canny edge detector when the image background contains significant clutter. In addition, it enables us to determine the effectiveness of different edge cues and gives quantitative measures for the advantages of multilevel processing, for the use of chrominance, and for the relative effectiveness of different detectors. Furthermore, we show that we can learn these conditional distributions on one data set and adapt them to the other with only slight degradation of performance without knowing the ground truth on the second data set. This shows that our results are not purely domain specific. We apply the same approach to the spatial grouping of edge cues and obtain analogies to nonmaximal suppression and hysteresis. The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from these features in an optimal way, we train a classifier using human labeled images as ground truth. The output of this classifier provides the posterior probability of a boundary at each image location and orientation. We present precision-recall curves showing that the resulting detector significantly outperforms existing approaches. Our two main results are 1) that cue combination can be performed adequately with a simple linear model and 2) that a proper, explicit treatment of texture is required to detect boundaries in natural images. 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. We describe a method to automatically find gradient thresholds to separate edge from nonedge pixels. A statistical model that is the weighted sum of two gamma densities corresponding to edge and nonedge pixels is used to identify a threshold. Results closely match human perceptual thresholds even under low signal-to-noise ratio (SNR) levels. Traditional differential-based edge detection suffers from abrupt degradation in performance when images are corrupted by impulse noises. The morphological operators such as the median filters and weighted median filters possess the intrinsic ability to counteract impulse noise. In this paper, by combining the biwindow configuration with weighted median filters, anisotropic morphological directional derivatives (AMDDs) robust to impulse noise are proposed to measure the local grayscale variation around a pixel. For ideal step edges, the AMDD spatial response and directional representation are derived. The characteristics and edge resolution of two kinds of typical biwindows are analyzed thoroughly. In terms of the AMDD spatial response and directional representation of ideal step edges, the spatial matched filter is used to extract the edge strength map (ESM) from the AMDDs of an image. The spatial and directional matched filters are used to extract the edge direction map (EDM). Embedding the extracted ESM and EDM into the standard route of the differential-based edge detection, an anti-impulse-noise AMDD-based edge detector is constructed. It is compared with the existing state-of-the-art detectors on a recognized image dataset for edge detection evaluation. The results show that it attains competitive performance in noise-free and Gaussian noise cases and the best performance in impulse noise cases. Abstract : The report developes a parametric model for a computer-controlled moveable camera on a pan-tilt head. The model expresses the transform relating object space to image space as a function of the control variables of the camera. We constructed a calibration system for measuring the model parameters which has a demonstrated accuracy more than adequate for our present needs. We have also identified the major source of error in model measurement to be undesired image motion and have developed means of measuring and compensating for some of it and eliminating other parts of it. The system can measure systematic image distortions if they become the major accuracy limitation. It has been shown how to generalize the model to handle small systematic errors due to aspects of pan-tilt head geometry not presently accounted for. The report demonstrates the model's application in stereo vision and have shown how it can be applied as a predictive device in locating objects of interest and centering them in an image. (Author) We propose a novel approach to both learning and detecting local contour-based representations for mid-level features. Our features, called sketch tokens, are learned using supervised mid-level information in the form of hand drawn contours in images. Patches of human generated contours are clustered to form sketch token classes and a random forest classifier is used for efficient detection in novel images. We demonstrate our approach on both top-down and bottom-up tasks. We show state-of-the-art results on the top-down task of contour detection while being over 200x faster than competing methods. We also achieve large improvements in detection accuracy for the bottom-up tasks of pedestrian and object detection as measured on INRIA and PASCAL, respectively. These gains are due to the complementary information provided by sketch tokens to low-level features such as gradient histograms. A method is proposed whereby a color image is treated as a vector field and the edge information carried directly by the vectors is exploited. A class of color edge detectors is defined as the minimum over the magnitudes of linear combinations of the sorted vector samples. From this class, a specific edge detector is obtained and its performance characteristics studied. Results of a quantitative evaluation and comparison to other color edge detectors, using Pratt's (1991) figure of merit and an artificially generated test image, are presented. Edge detection results obtained for real color images demonstrate the efficiency of the detector. >