Unmixing Convolutional Features for Crisp Edge Detection
- URL: http://arxiv.org/abs/2011.09808v2
- Date: Tue, 29 Jun 2021 13:01:08 GMT
- Title: Unmixing Convolutional Features for Crisp Edge Detection
- Authors: Linxi Huan, Nan Xue, Xianwei Zheng, Wei He, Jianya Gong, Gui-Song Xia
- Abstract summary: This paper presents a context-aware tracing strategy (CATS) for crisp edge detection with deep edge detectors.
Experiments demonstrate that the proposed CATS can be integrated into modern deep edge detectors to improve localization accuracy.
- Score: 28.232800355331726
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper presents a context-aware tracing strategy (CATS) for crisp edge
detection with deep edge detectors, based on an observation that the
localization ambiguity of deep edge detectors is mainly caused by the mixing
phenomenon of convolutional neural networks: feature mixing in edge
classification and side mixing during fusing side predictions. The CATS
consists of two modules: a novel tracing loss that performs feature unmixing by
tracing boundaries for better side edge learning, and a context-aware fusion
block that tackles the side mixing by aggregating the complementary merits of
learned side edges. Experiments demonstrate that the proposed CATS can be
integrated into modern deep edge detectors to improve localization accuracy.
With the vanilla VGG16 backbone, in terms of BSDS500 dataset, our CATS improves
the F-measure (ODS) of the RCF and BDCN deep edge detectors by 12% and 6%
respectively when evaluating without using the morphological non-maximal
suppression scheme for edge detection.
Related papers
- DiffusionEdge: Diffusion Probabilistic Model for Crisp Edge Detection [20.278655159290302]
We propose the first diffusion model for the task of general edge detection, which we call DiffusionEdge.
To avoid expensive computational resources while retaining the final performance, we apply DPM in the latent space and enable the classic cross-entropy loss.
With all the technical designs, DiffusionEdge can be stably trained with limited resources, predicting crisp and accurate edge maps with much fewer augmentation strategies.
arXiv Detail & Related papers (2024-01-04T02:20:54Z) - Small Object Detection via Coarse-to-fine Proposal Generation and
Imitation Learning [52.06176253457522]
We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning.
CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
arXiv Detail & Related papers (2023-08-18T13:13:09Z) - Delving into Crispness: Guided Label Refinement for Crisp Edge Detection [14.26122188105415]
Learning-based edge detection usually suffers from predicting thick edges.
We find that noisy human-labeled edges are the main cause of thick predictions.
We propose an effective Canny-guided refinement of human-labeled edges.
arXiv Detail & Related papers (2023-06-27T03:12:58Z) - Analysis of ROC for Edge Detectors [14.494626833445915]
This paper presents an evaluation of edge detectors using receiver operating characteristic (ROC) analysis on the BIPED dataset.
We observed that while ROC analysis is suitable for certain edge filters, it presents challenges when accurately measuring their performance using ROC metrics.
To address this issue, we introduce customization techniques to enhance the performance of these filters, enabling more accurate evaluation.
arXiv Detail & Related papers (2023-05-28T22:47:54Z) - Edge-weighted pFISTA-Net for MRI Reconstruction [0.0]
We present the edge-weighted pFISTA-Net that directly applies the detected edge map to the soft-thresholding part of pFISTA-Net.
The proposed yields reconstructions with lower error and better artifact suppression compared with the state-of-the-art deep learning-based methods.
arXiv Detail & Related papers (2023-02-15T04:46:17Z) - Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations.
This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
arXiv Detail & Related papers (2022-10-17T08:02:33Z) - The KFIoU Loss for Rotated Object Detection [115.334070064346]
In this paper, we argue that one effective alternative is to devise an approximate loss who can achieve trend-level alignment with SkewIoU loss.
Specifically, we model the objects as Gaussian distribution and adopt Kalman filter to inherently mimic the mechanism of SkewIoU.
The resulting new loss called KFIoU is easier to implement and works better compared with exact SkewIoU.
arXiv Detail & Related papers (2022-01-29T10:54:57Z) - Second-Order Component Analysis for Fault Detection [0.0]
High-order neural networks might bring the risk of overfitting and learning both the key information from original data and noises or anomalies.
This paper proposes a novel fault detection method called second-order component analysis (SCA)
arXiv Detail & Related papers (2021-03-12T14:25:37Z) - Dense Label Encoding for Boundary Discontinuity Free Rotation Detection [69.75559390700887]
This paper explores a relatively less-studied methodology based on classification.
We propose new techniques to push its frontier in two aspects.
Experiments and visual analysis on large-scale public datasets for aerial images show the effectiveness of our approach.
arXiv Detail & Related papers (2020-11-19T05:42:02Z) - Bayesian Optimization with Machine Learning Algorithms Towards Anomaly
Detection [66.05992706105224]
In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique.
The performance of the considered algorithms is evaluated using the ISCX 2012 dataset.
Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
arXiv Detail & Related papers (2020-08-05T19:29:35Z) - Saliency Enhancement using Gradient Domain Edges Merging [65.90255950853674]
We develop a method to merge the edges with the saliency maps to improve the performance of the saliency.
This leads to our proposed saliency enhancement using edges (SEE) with an average improvement of at least 3.4 times higher on the DUT-OMRON dataset.
The SEE algorithm is split into 2 parts, SEE-Pre for preprocessing and SEE-Post pour postprocessing.
arXiv Detail & Related papers (2020-02-11T14:04:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.