In this paper we propose an edge-direct visual odometry algorithm that efficiently utilizes edge pixels to find the relative pose that minimizes the photometric error between images. Prior work on exploiting edge pixels instead treats edges as features and employ various techniques to match edge lines or pixels, which adds unnecessary complexity. Direct methods typically operate on all pixel intensities, which proves to be highly redundant. In contrast our method builds on direct visual odometry methods naturally with minimal added computation. It is not only more efficient than direct dense methods since we iterate with a fraction of the pixels, but also more accurate. We achieve high accuracy and efficiency by extracting edges from only one image, and utilize robust Gauss-Newton to minimize the photometric error of these edge pixels. This simultaneously finds the edge pixels in the reference image, as well as the relative camera pose that minimizes the photometric error. We test various edge detectors, including learned edges, and determine that the optimal edge detector for this method is the Canny edge detection algorithm using automatic thresholding. We highlight key differences between our edge direct method and direct dense methods, in particular how higher levels of image pyramids can lead to significant aliasing effects and result in incorrect solution convergence. We show experimentally that reducing the photometric error of edge pixels also reduces the photometric error of all pixels, and we show through an ablation study the increase in accuracy obtained by optimizing edge pixels only. We evaluate our method on the RGB-D TUM benchmark on which we achieve state-of-the-art performance.
Any system that extracts edges must choose between several edge extraction algorithms. The most prominent are Canny edges @cite_6 , followed by edges extracted from Laplacian of Gaussian (LoG) filters which are efficiently implemented using Difference of Gaussians (DoG). Another type of edge that is not as popular but is very simple are Sobel edges. More recently, there has been research involving the learning of edge features. In @cite_20 the authors utilize structured forests, and in @cite_15 the authors utilize deep learning. Instead of selecting one, we test various edge extraction algorithms with our system select the optimal edge extraction algorithm. Note that @cite_15 requires the use of a GPU and is far from real-time, so we do not consider this method.
@cite_15 @cite_20 @cite_6
2129587342 2145023731
The human vision is usually considered a multiscale, hierarchical knowledge extraction system. Inspired by this fact, multiscale techniques for computer vision perform a sequential analysis, driven by different interpretations of the concept of scale. In the case of edge detection, the scale usually relates to the size of the region where the intensity changes are measured or to the size of the regularization filter applied before edge extraction. Multiscale edge detection methods constitute an effort to combine the spatial accuracy of fine-scale methods with the ability to deal with spurious responses inherent to coarse-scale methods. In this work we introduce a multiscale method for edge detection based on increasing Gaussian smoothing, the Sobel operators and coarse-to-fine edge tracking. We include visual examples and quantitative evaluations illustrating the benefits of our proposal. We propose to employ bilateral filters to solve the problem of edge detection. The proposed methodology presents an efficient and noise robust method for detecting edges. Classical bilateral filters smooth images without distorting edges. In this paper, we modify the bilateral filter to perform edge detection, which is the opposite of bilateral smoothing. The Gaussian domain kernel of the bilateral filter is replaced with an edge detection mask, and Gaussian range kernel is replaced with an inverted Gaussian kernel. The modified range kernel serves to emphasize dissimilar regions. The resulting approach effectively adapts the detection mask according as the pixel intensity differences. The results of the proposed algorithm are compared with those of standard edge detection masks. Comparisons of the bilateral edge detector with Canny edge detection algorithm, both after non-maximal suppression, are also provided. The results of our technique are observed to be better and noise-robust than those offered by methods employing masks alone, and are also comparable to the results from Canny edge detector, outperforming it in certain cases. Deep learning is a promising approach for extracting accurate information from raw sensor data from IoT devices deployed in complex environments. Because of its multilayer structure, deep learning is also appropriate for the edge computing environment. Therefore, in this article, we first introduce deep learning for IoTs into the edge computing environment. Since existing edge nodes have limited processing capability, we also design a novel offloading strategy to optimize the performance of IoT deep learning applications with edge computing. In the performance evaluation, we test the performance of executing multiple deep learning tasks in an edge computing environment with our strategy. The evaluation results show that our method outperforms other optimization solutions on deep learning for IoT. 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.