ConCAD: Contrastive Learning-based Cross Attention for Sleep Apnea
Detection
- URL: http://arxiv.org/abs/2105.03037v1
- Date: Fri, 7 May 2021 02:38:56 GMT
- Title: ConCAD: Contrastive Learning-based Cross Attention for Sleep Apnea
Detection
- Authors: Guanjie Huang and Fenglong Ma
- Abstract summary: We propose a contrastive learning-based cross attention framework for sleep apnea detection (named ConCAD)
Our proposed framework can be easily integrated into standard deep learning models to utilize expert knowledge and contrastive learning to boost performance.
- Score: 16.938983046369263
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With recent advancements in deep learning methods, automatically learning
deep features from the original data is becoming an effective and widespread
approach. However, the hand-crafted expert knowledge-based features are still
insightful. These expert-curated features can increase the model's
generalization and remind the model of some data characteristics, such as the
time interval between two patterns. It is particularly advantageous in tasks
with the clinically-relevant data, where the data are usually limited and
complex. To keep both implicit deep features and expert-curated explicit
features together, an effective fusion strategy is becoming indispensable. In
this work, we focus on a specific clinical application, i.e., sleep apnea
detection. In this context, we propose a contrastive learning-based cross
attention framework for sleep apnea detection (named ConCAD). The cross
attention mechanism can fuse the deep and expert features by automatically
assigning attention weights based on their importance. Contrastive learning can
learn better representations by keeping the instances of each class closer and
pushing away instances from different classes in the embedding space
concurrently. Furthermore, a new hybrid loss is designed to simultaneously
conduct contrastive learning and classification by integrating a supervised
contrastive loss with a cross-entropy loss. Our proposed framework can be
easily integrated into standard deep learning models to utilize expert
knowledge and contrastive learning to boost performance. As demonstrated on two
public ECG dataset with sleep apnea annotation, ConCAD significantly improves
the detection performance and outperforms state-of-art benchmark methods.
Related papers
- Topological Persistence Guided Knowledge Distillation for Wearable Sensor Data [15.326571438985466]
topological features obtained by topological data analysis (TDA) have been suggested as a potential solution.
There are two significant obstacles to using topological features in deep learning.
We propose to use two teacher networks, one trained on the raw time-series data, and another trained on persistence images generated by TDA methods.
A robust student model is distilled, which uses only the time-series data as an input, while implicitly preserving topological features.
arXiv Detail & Related papers (2024-07-07T10:08:34Z) - A Discrepancy Aware Framework for Robust Anomaly Detection [51.710249807397695]
We present a Discrepancy Aware Framework (DAF), which demonstrates robust performance consistently with simple and cheap strategies.
Our method leverages an appearance-agnostic cue to guide the decoder in identifying defects, thereby alleviating its reliance on synthetic appearance.
Under the simple synthesis strategies, it outperforms existing methods by a large margin. Furthermore, it also achieves the state-of-the-art localization performance.
arXiv Detail & Related papers (2023-10-11T15:21:40Z) - Practical Edge Detection via Robust Collaborative Learning [11.176517889212015]
Edge detection is a core component in a wide range of visionoriented tasks.
To achieve the goal, two key issues should be concerned.
How to mitigate deep edge models from inefficient pre-trained backbones.
How to liberate the negative influence from noisy or even wrong labels in training data.
arXiv Detail & Related papers (2023-08-27T12:12:27Z) - Learning Prompt-Enhanced Context Features for Weakly-Supervised Video
Anomaly Detection [37.99031842449251]
Video anomaly detection under weak supervision presents significant challenges.
We present a weakly supervised anomaly detection framework that focuses on efficient context modeling and enhanced semantic discriminability.
Our approach significantly improves the detection accuracy of certain anomaly sub-classes, underscoring its practical value and efficacy.
arXiv Detail & Related papers (2023-06-26T06:45:16Z) - Temporal Feature Alignment in Contrastive Self-Supervised Learning for
Human Activity Recognition [2.2082422928825136]
Self-supervised learning is typically used to learn deep feature representations from unlabeled data.
We propose integrating a dynamic time warping algorithm in a latent space to force features to be aligned in a temporal dimension.
The proposed approach has a great potential in learning robust feature representations compared to the recent SSL baselines.
arXiv Detail & Related papers (2022-10-07T07:51:01Z) - Hyperspherical Consistency Regularization [45.00073340936437]
We explore the relationship between self-supervised learning and supervised learning, and study how self-supervised learning helps robust data-efficient deep learning.
We propose hyperspherical consistency regularization (HCR), a simple yet effective plug-and-play method, to regularize the classifier using feature-dependent information and thus avoid bias from labels.
arXiv Detail & Related papers (2022-06-02T02:41:13Z) - Spatio-temporal Gait Feature with Adaptive Distance Alignment [90.5842782685509]
We try to increase the difference of gait features of different subjects from two aspects: the optimization of network structure and the refinement of extracted gait features.
Our method is proposed, it consists of Spatio-temporal Feature Extraction (SFE) and Adaptive Distance Alignment (ADA)
ADA uses a large number of unlabeled gait data in real life as a benchmark to refine the extracted-temporal features to make them have low inter-class similarity and high intra-class similarity.
arXiv Detail & Related papers (2022-03-07T13:34:00Z) - Real-time landmark detection for precise endoscopic submucosal
dissection via shape-aware relation network [51.44506007844284]
We propose a shape-aware relation network for accurate and real-time landmark detection in endoscopic submucosal dissection surgery.
We first devise an algorithm to automatically generate relation keypoint heatmaps, which intuitively represent the prior knowledge of spatial relations among landmarks.
We then develop two complementary regularization schemes to progressively incorporate the prior knowledge into the training process.
arXiv Detail & Related papers (2021-11-08T07:57:30Z) - Low-Regret Active learning [64.36270166907788]
We develop an online learning algorithm for identifying unlabeled data points that are most informative for training.
At the core of our work is an efficient algorithm for sleeping experts that is tailored to achieve low regret on predictable (easy) instances.
arXiv Detail & Related papers (2021-04-06T22:53:45Z) - Uncovering the structure of clinical EEG signals with self-supervised
learning [64.4754948595556]
Supervised learning paradigms are often limited by the amount of labeled data that is available.
This phenomenon is particularly problematic in clinically-relevant data, such as electroencephalography (EEG)
By extracting information from unlabeled data, it might be possible to reach competitive performance with deep neural networks.
arXiv Detail & Related papers (2020-07-31T14:34:47Z) - Symbiotic Adversarial Learning for Attribute-based Person Search [86.7506832053208]
We present a symbiotic adversarial learning framework, called SAL.Two GANs sit at the base of the framework in a symbiotic learning scheme.
Specifically, two different types of generative adversarial networks learn collaboratively throughout the training process.
arXiv Detail & Related papers (2020-07-19T07:24:45Z)
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.