Density-Aware Graph for Deep Semi-Supervised Visual Recognition
- URL: http://arxiv.org/abs/2003.13194v1
- Date: Mon, 30 Mar 2020 02:52:40 GMT
- Title: Density-Aware Graph for Deep Semi-Supervised Visual Recognition
- Authors: Suichan Li, Bin Liu, Dongdong Chen, Qi Chu, Lu Yuan, Nenghai Yu
- Abstract summary: Semi-supervised learning (SSL) has been extensively studied to improve the generalization ability of deep neural networks for visual recognition.
This paper proposes to solve the SSL problem by building a novel density-aware graph, based on which the neighborhood information can be easily leveraged.
- Score: 102.9484812869054
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Semi-supervised learning (SSL) has been extensively studied to improve the
generalization ability of deep neural networks for visual recognition. To
involve the unlabelled data, most existing SSL methods are based on common
density-based cluster assumption: samples lying in the same high-density region
are likely to belong to the same class, including the methods performing
consistency regularization or generating pseudo-labels for the unlabelled
images. Despite their impressive performance, we argue three limitations exist:
1) Though the density information is demonstrated to be an important clue, they
all use it in an implicit way and have not exploited it in depth. 2) For
feature learning, they often learn the feature embedding based on the single
data sample and ignore the neighborhood information. 3) For label-propagation
based pseudo-label generation, it is often done offline and difficult to be
end-to-end trained with feature learning. Motivated by these limitations, this
paper proposes to solve the SSL problem by building a novel density-aware
graph, based on which the neighborhood information can be easily leveraged and
the feature learning and label propagation can also be trained in an end-to-end
way. Specifically, we first propose a new Density-aware Neighborhood
Aggregation(DNA) module to learn more discriminative features by incorporating
the neighborhood information in a density-aware manner. Then a novel
Density-ascending Path based Label Propagation(DPLP) module is proposed to
generate the pseudo-labels for unlabeled samples more efficiently according to
the feature distribution characterized by density. Finally, the DNA module and
DPLP module evolve and improve each other end-to-end.
Related papers
- Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition [50.61991746981703]
Current state-of-the-art LTSSL approaches rely on high-quality pseudo-labels for large-scale unlabeled data.
This paper introduces a novel probabilistic framework that unifies various recent proposals in long-tail learning.
We introduce a continuous contrastive learning method, CCL, extending our framework to unlabeled data using reliable and smoothed pseudo-labels.
arXiv Detail & Related papers (2024-10-08T15:06:10Z) - GuidedNet: Semi-Supervised Multi-Organ Segmentation via Labeled Data Guide Unlabeled Data [4.775846640214768]
Semi-supervised multi-organ medical image segmentation aids physicians in improving disease diagnosis and treatment planning.
A key concept is that voxel features from labeled and unlabeled data close each other in the feature space more likely to belong to the same class.
We introduce a Knowledge Transfer Cross Pseudo-label Supervision (KT-CPS) strategy, which leverages the prior knowledge obtained from the labeled data to guide the training of the unlabeled data.
arXiv Detail & Related papers (2024-08-09T07:46:01Z) - Towards the Uncharted: Density-Descending Feature Perturbation for Semi-supervised Semantic Segmentation [51.66997548477913]
We propose a novel feature-level consistency learning framework named Density-Descending Feature Perturbation (DDFP)
Inspired by the low-density separation assumption in semi-supervised learning, our key insight is that feature density can shed a light on the most promising direction for the segmentation classifier to explore.
The proposed DDFP outperforms other designs on feature-level perturbations and shows state of the art performances on both Pascal VOC and Cityscapes dataset.
arXiv Detail & Related papers (2024-03-11T06:59:05Z) - Towards Generic Semi-Supervised Framework for Volumetric Medical Image
Segmentation [19.09640071505051]
We develop a generic SSL framework to handle settings such as UDA and SemiDG.
We evaluate our proposed framework on four benchmark datasets for SSL, Class-imbalanced SSL, UDA and SemiDG.
The results showcase notable improvements compared to state-of-the-art methods across all four settings.
arXiv Detail & Related papers (2023-10-17T14:58:18Z) - ProtoCon: Pseudo-label Refinement via Online Clustering and Prototypical
Consistency for Efficient Semi-supervised Learning [60.57998388590556]
ProtoCon is a novel method for confidence-based pseudo-labeling.
Online nature of ProtoCon allows it to utilise the label history of the entire dataset in one training cycle.
It delivers significant gains and faster convergence over state-of-the-art datasets.
arXiv Detail & Related papers (2023-03-22T23:51:54Z) - Deep Low-Density Separation for Semi-Supervised Classification [0.0]
We introduce a novel hybrid method that applies low-density separation to the embedded features.
Our approach effectively classifies thousands of unlabeled users from a relatively small number of hand-classified examples.
arXiv Detail & Related papers (2022-05-22T11:00:55Z) - Open-Set Semi-Supervised Learning for 3D Point Cloud Understanding [62.17020485045456]
It is commonly assumed in semi-supervised learning (SSL) that the unlabeled data are drawn from the same distribution as that of the labeled ones.
We propose to selectively utilize unlabeled data through sample weighting, so that only conducive unlabeled data would be prioritized.
arXiv Detail & Related papers (2022-05-02T16:09:17Z) - Information Bottleneck Constrained Latent Bidirectional Embedding for
Zero-Shot Learning [59.58381904522967]
We propose a novel embedding based generative model with a tight visual-semantic coupling constraint.
We learn a unified latent space that calibrates the embedded parametric distributions of both visual and semantic spaces.
Our method can be easily extended to transductive ZSL setting by generating labels for unseen images.
arXiv Detail & Related papers (2020-09-16T03:54:12Z)
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.