首页 > 最新文献

2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)最新文献

英文 中文
Multi-contrast High Quality MR Image Super-Resolution with Dual Domain Knowledge Fusion 基于双领域知识融合的多对比度高质量MR图像超分辨率
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995219
Runhan Wang, Ruiwei Zhao, Weijia Fu, X. Zhang, Yuejie Zhang, Rui Feng
Multi-contrast high quality high-resolution (HR) Magnetic Resonance (MR) images enrich available information for diagnosis and analysis. Deep convolutional neural network methods have shown promising ability for MR image super-resolution (SR) given low-resolution (LR) MR images. Methods taking HR images as references (Ref) have made progress to enhance the effect of MR images SR. However, existing multi-contrast MR image SR approaches are based on contrasting-expanding backbones, which lose high frequency information of Ref image during downsampling. They also failed to transfer textures of Ref image into target domain. In this paper, we propose Edge Mask Transformer UNet (EMFU) for accelerating MR images SR. We propose Edge Mask Transformer (EMF) to generate global details and texture representation of target domain. Dual domain fusion module in UNet aggregates semantic information of the representation and LR image of target domain. Specifically, we extract and encode edge masks to guide the attention in EMF by re-distributing the embedding tensors, so that the network allocates more attention to image edge area. We also design a dual domain fusion module with self-attention and cross-attention to deeply fuse semantic information of multiple protocols for MRI. Extensive experiments show the effectiveness of our proposed EMFU, which surpasses state-of-the-art methods on benchmarks quantitatively and visually. Codes will be released to the community.
多对比度高质量高分辨率(HR)磁共振(MR)图像丰富了诊断和分析的可用信息。在低分辨率核磁共振图像中,深度卷积神经网络方法在超分辨率核磁共振图像中显示出良好的应用前景。以HR图像为参考(Ref)的方法在增强MR图像SR效果方面取得了进展,但现有的多对比度MR图像SR方法是基于对比度扩展的主干,在降采样过程中丢失了Ref图像的高频信息。他们也未能将refimage的纹理转移到目标域。在本文中,我们提出了边缘掩膜变压器UNet (EMFU)来加速MR图像的sr,我们提出了边缘掩膜变压器(EMF)来生成目标域的全局细节和纹理表示。UNet中的双域融合模块对目标域的表示和LR图像的语义信息进行聚合。具体而言,我们提取和编码边缘掩模,通过重新分配嵌入张量来引导EMF中的注意力,使网络将更多的注意力分配到图像边缘区域。设计了自注意和交叉注意双域融合模块,实现了MRI多协议语义信息的深度融合。大量的实验表明了我们提出的EMFU的有效性,它在定量和视觉上超过了最先进的基准方法。代码将发布给社区。
{"title":"Multi-contrast High Quality MR Image Super-Resolution with Dual Domain Knowledge Fusion","authors":"Runhan Wang, Ruiwei Zhao, Weijia Fu, X. Zhang, Yuejie Zhang, Rui Feng","doi":"10.1109/BIBM55620.2022.9995219","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995219","url":null,"abstract":"Multi-contrast high quality high-resolution (HR) Magnetic Resonance (MR) images enrich available information for diagnosis and analysis. Deep convolutional neural network methods have shown promising ability for MR image super-resolution (SR) given low-resolution (LR) MR images. Methods taking HR images as references (Ref) have made progress to enhance the effect of MR images SR. However, existing multi-contrast MR image SR approaches are based on contrasting-expanding backbones, which lose high frequency information of Ref image during downsampling. They also failed to transfer textures of Ref image into target domain. In this paper, we propose Edge Mask Transformer UNet (EMFU) for accelerating MR images SR. We propose Edge Mask Transformer (EMF) to generate global details and texture representation of target domain. Dual domain fusion module in UNet aggregates semantic information of the representation and LR image of target domain. Specifically, we extract and encode edge masks to guide the attention in EMF by re-distributing the embedding tensors, so that the network allocates more attention to image edge area. We also design a dual domain fusion module with self-attention and cross-attention to deeply fuse semantic information of multiple protocols for MRI. Extensive experiments show the effectiveness of our proposed EMFU, which surpasses state-of-the-art methods on benchmarks quantitatively and visually. Codes will be released to the community.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121319431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
LDAGSO: Predicting 1ncRNA-Disease Associations from Graph Sequences and Disease Ontology via Deep Learning techniques LDAGSO:通过深度学习技术从图序列和疾病本体预测1ncrna -疾病关联
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995383
Norah Saeed Awn, Yiming Li, Baoying Zhao, Min Zeng, Min Li
Recent studies have confirmed the significant effects of long non-coding RNAs (1ncRNAs) in understanding the mechanism of diseases. Because of the relatively small number of validated associations between 1ncRNAs and diseases, and previous computational methods have limited performance without capturing important features of sequences and ontology information, we developed LDAGSO, a novel deep learning framework to predict 1ncRNA and disease associations from 1ncRNA sequences and disease ontology. For 1ncRNA sequences, we converted them into graph structure based on k-mer technique and de Bruijn graph, and captured high-level features of the graph using graph convolutional networks. For diseases, we extracted ontology term paths from the disease ontology tree, and treated them as sentences to obtain their feature representation using Bidirectional Encoder Representations from Transformers (BERT) technique. Finally, these two kinds of features were fed into a fully connected layer to perform the task of association prediction between 1ncRNAs and diseases. According to the results, our approach provides state-of-the-art results when evaluated by leave-one-out cross-validation.
最近的研究证实了长链非编码rna (1ncRNAs)在理解疾病机制方面的重要作用。由于验证的1ncRNA与疾病之间关联的数量相对较少,并且先前的计算方法在没有捕获序列和本体信息的重要特征方面性能有限,因此我们开发了LDAGSO,一种新的深度学习框架,用于从1ncRNA序列和疾病本体预测1ncRNA和疾病关联。对于1ncRNA序列,我们基于k-mer技术和de Bruijn图将其转换为图结构,并使用图卷积网络捕获图的高级特征。对于疾病,我们从疾病本体树中提取本体术语路径,并将其作为句子处理,利用BERT (Bidirectional Encoder Representations from Transformers)技术获得其特征表示。最后,将这两种特征输入到一个完全连接的层中,以执行1ncrna与疾病之间的关联预测任务。根据结果,我们的方法提供了最先进的结果时,通过留一交叉验证评估。
{"title":"LDAGSO: Predicting 1ncRNA-Disease Associations from Graph Sequences and Disease Ontology via Deep Learning techniques","authors":"Norah Saeed Awn, Yiming Li, Baoying Zhao, Min Zeng, Min Li","doi":"10.1109/BIBM55620.2022.9995383","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995383","url":null,"abstract":"Recent studies have confirmed the significant effects of long non-coding RNAs (1ncRNAs) in understanding the mechanism of diseases. Because of the relatively small number of validated associations between 1ncRNAs and diseases, and previous computational methods have limited performance without capturing important features of sequences and ontology information, we developed LDAGSO, a novel deep learning framework to predict 1ncRNA and disease associations from 1ncRNA sequences and disease ontology. For 1ncRNA sequences, we converted them into graph structure based on k-mer technique and de Bruijn graph, and captured high-level features of the graph using graph convolutional networks. For diseases, we extracted ontology term paths from the disease ontology tree, and treated them as sentences to obtain their feature representation using Bidirectional Encoder Representations from Transformers (BERT) technique. Finally, these two kinds of features were fed into a fully connected layer to perform the task of association prediction between 1ncRNAs and diseases. According to the results, our approach provides state-of-the-art results when evaluated by leave-one-out cross-validation.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121419818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tracing Randomly Oriented Filaments in a Simulated Actin Network Tomogram 在模拟肌动蛋白网络断层图中追踪随机定向细丝
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9994861
Salim Sazzed, P. Scheible, Jing He, W. Wriggers
The disordered nature of the actin network in Dictyostelium discoideum filopodia makes identifying filaments within noisy cryo-electron tomograms extremely challenging. In this work, we present a computationally efficient dynamic programming-based framework for tracing arbitrarily oriented actin filaments. Starting from locally determined seed points, it accumulates densities along paths of a particular length within 45° of the three Cartesian coordinate axes. This novel approach covers all possible orientations, so there is no need to assume a dominant direction as in earlier work. For each seed point, the path with the highest density value is selected, and it acts as a candidate filament segment (CFS) that is likely to form a part of a filament when it has a high path density value. The subsequent stages involve identifying groups of CFSs with high path densities by binning and merging them. The merging step considers the relative orientations and distances of CFSs to connect them. In addition, the CFSs are extended to fill the noise-induced gaps to some extent. In the current prototype software, we focused on the proof of the concept, using a noisy simulated tomogram with a known ground truth that closely mimics the appearance of an experimental map. We achieved an almost perfect precision score of 0.999, but this success came at the expense of a lower recall score 0.462 due to false negatives. We discuss the dependencies as well as the limitations of the current filament merging that need to be overcome to achieve a higher recall score in the future.
distyostelium disideum filopodia中肌动蛋白网络的无序性质使得在噪声低温电子断层扫描中识别细丝极具挑战性。在这项工作中,我们提出了一个基于计算效率的动态规划框架,用于跟踪任意定向的肌动蛋白丝。从局部确定的种子点开始,它沿着特定长度的路径在三个笛卡尔坐标轴的45°范围内积累密度。这种新颖的方法涵盖了所有可能的方向,因此不需要像以前的工作那样假设一个主导方向。对于每个种子点,选择密度值最高的路径,作为候选灯丝段(CFS),当其路径密度值较高时,可能成为灯丝的一部分。随后的阶段包括通过分组和合并来识别具有高路径密度的CFSs组。合并步骤考虑cfs的相对方向和距离来连接它们。此外,还对CFSs进行了扩展,在一定程度上填补了噪声引起的间隙。在目前的原型软件中,我们专注于概念的证明,使用具有已知地面真理的噪声模拟层析成像,密切模仿实验地图的外观。我们获得了近乎完美的精度分数0.999,但这一成功是以较低的召回分数0.462为代价的,这是由于假阴性。我们讨论了依赖关系以及当前灯丝合并需要克服的限制,以在未来实现更高的召回分数。
{"title":"Tracing Randomly Oriented Filaments in a Simulated Actin Network Tomogram","authors":"Salim Sazzed, P. Scheible, Jing He, W. Wriggers","doi":"10.1109/BIBM55620.2022.9994861","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9994861","url":null,"abstract":"The disordered nature of the actin network in Dictyostelium discoideum filopodia makes identifying filaments within noisy cryo-electron tomograms extremely challenging. In this work, we present a computationally efficient dynamic programming-based framework for tracing arbitrarily oriented actin filaments. Starting from locally determined seed points, it accumulates densities along paths of a particular length within 45° of the three Cartesian coordinate axes. This novel approach covers all possible orientations, so there is no need to assume a dominant direction as in earlier work. For each seed point, the path with the highest density value is selected, and it acts as a candidate filament segment (CFS) that is likely to form a part of a filament when it has a high path density value. The subsequent stages involve identifying groups of CFSs with high path densities by binning and merging them. The merging step considers the relative orientations and distances of CFSs to connect them. In addition, the CFSs are extended to fill the noise-induced gaps to some extent. In the current prototype software, we focused on the proof of the concept, using a noisy simulated tomogram with a known ground truth that closely mimics the appearance of an experimental map. We achieved an almost perfect precision score of 0.999, but this success came at the expense of a lower recall score 0.462 due to false negatives. We discuss the dependencies as well as the limitations of the current filament merging that need to be overcome to achieve a higher recall score in the future.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122209366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Time-series lung cancer CT dataset 时间序列肺癌CT数据集
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995198
Liang Zhao, Yu-Hsiang Shao, Chaoran Jia, Jiajun Ma
In order to better explore the evolution process of lung nodules in lung cancer patients, we collect lung CT data at multiple time points of lung cancer patients, track and mark the CT positions of the same lung nodules in lung cancer patients at different time points, and make time-series CT data sets of lung cancer patients. After that, 3D-UNet model is used to detect lung nodules on our data set. Experiment proves the effectiveness and availability of the data set, and also proved that the image data at multiple time points could improve the accuracy of the model’s identification of lung nodules.
为了更好地探索肺癌患者肺结节的演变过程,我们采集了肺癌患者多个时间点的肺CT数据,对肺癌患者同一肺结节在不同时间点的CT位置进行跟踪标记,制作肺癌患者时间序列CT数据集。然后,使用3D-UNet模型对我们的数据集进行肺结节检测。实验证明了数据集的有效性和可用性,也证明了多个时间点的图像数据可以提高模型对肺结节识别的准确性。
{"title":"Time-series lung cancer CT dataset","authors":"Liang Zhao, Yu-Hsiang Shao, Chaoran Jia, Jiajun Ma","doi":"10.1109/BIBM55620.2022.9995198","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995198","url":null,"abstract":"In order to better explore the evolution process of lung nodules in lung cancer patients, we collect lung CT data at multiple time points of lung cancer patients, track and mark the CT positions of the same lung nodules in lung cancer patients at different time points, and make time-series CT data sets of lung cancer patients. After that, 3D-UNet model is used to detect lung nodules on our data set. Experiment proves the effectiveness and availability of the data set, and also proved that the image data at multiple time points could improve the accuracy of the model’s identification of lung nodules.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120949921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Utilizing Deep Learning to Opportunistically Screen for Osteoporosis from Dental Panoramic Radiographs 利用深度学习从牙科全景x线片上机会性地筛查骨质疏松症
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995187
Rajaram Anantharaman, Anwika Bhandary, Raveesh Nandakumar, R. R. Kumar, Pranav Vajapeyam
Osteoporosis, a chronic disease, can be managed through medication and lifestyle changes if detected early. Therefore, there is need for a cost effective method of screening for osteoporosis. In this paper, we propose a deep learning based implementation for developing an automated computer aided diagnostic (CAD) system that harnesses additional information contained in dental panoramic radiographs to detect a person’s risk for developing osteoporosis. Our proposed method follows a two-step approach. First, we apply deep convolutional neural networks (CNNs) to segment key areas of a panoramic radiograph including the mandible, mental foramen, and the mandibular cortical bone. Second, we follow it up with image processing techniques using OpenCV to calculate the ratio of pixels to help arrive at a key ratio called the Panoramic Mandibular Index (PMI). This ratio is instrumental in determining the risk of bone loss in individuals. When compared to the dental clinicians, our model achieved an F1 score of 0.943 on the test set, whereas the performance of dental clinicians was regarded as the standard with a perfect score. Our paper focuses on automating the measurement of PMI to create a CAD system suitable for routine screening of osteoporosis.
骨质疏松症是一种慢性疾病,如果及早发现,可以通过药物治疗和改变生活方式来控制。因此,需要一种具有成本效益的骨质疏松筛查方法。在本文中,我们提出了一种基于深度学习的实现,用于开发自动化计算机辅助诊断(CAD)系统,该系统利用牙科全景x光片中包含的附加信息来检测一个人患骨质疏松症的风险。我们提出的方法采用两步方法。首先,我们应用深度卷积神经网络(cnn)来分割全景x线片的关键区域,包括下颌骨、颏孔和下颌骨皮质骨。其次,我们使用OpenCV的图像处理技术来计算像素的比率,以帮助达到一个称为全景下颌指数(PMI)的关键比率。这一比例有助于确定个体骨质流失的风险。与牙科临床医生相比,我们的模型在测试集上的F1得分为0.943,而牙科临床医生的表现被视为满分的标准。本文的重点是自动化PMI测量,以创建一个适合骨质疏松症常规筛查的CAD系统。
{"title":"Utilizing Deep Learning to Opportunistically Screen for Osteoporosis from Dental Panoramic Radiographs","authors":"Rajaram Anantharaman, Anwika Bhandary, Raveesh Nandakumar, R. R. Kumar, Pranav Vajapeyam","doi":"10.1109/BIBM55620.2022.9995187","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995187","url":null,"abstract":"Osteoporosis, a chronic disease, can be managed through medication and lifestyle changes if detected early. Therefore, there is need for a cost effective method of screening for osteoporosis. In this paper, we propose a deep learning based implementation for developing an automated computer aided diagnostic (CAD) system that harnesses additional information contained in dental panoramic radiographs to detect a person’s risk for developing osteoporosis. Our proposed method follows a two-step approach. First, we apply deep convolutional neural networks (CNNs) to segment key areas of a panoramic radiograph including the mandible, mental foramen, and the mandibular cortical bone. Second, we follow it up with image processing techniques using OpenCV to calculate the ratio of pixels to help arrive at a key ratio called the Panoramic Mandibular Index (PMI). This ratio is instrumental in determining the risk of bone loss in individuals. When compared to the dental clinicians, our model achieved an F1 score of 0.943 on the test set, whereas the performance of dental clinicians was regarded as the standard with a perfect score. Our paper focuses on automating the measurement of PMI to create a CAD system suitable for routine screening of osteoporosis.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MSE-CapsPPISP: Spatial Hierarchical Protein-Protein Interaction Sites Prediction Using Squeeze-and-Excitation Capsule Networks MSE-CapsPPISP:空间分层蛋白-蛋白相互作用位点预测使用挤压和激励胶囊网络
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995658
Weipeng Lv, Changkun Jiang, Jianqiang Li
The discovery of protein-protein interaction sites (PPIs) is vital for exploring the principle of PPI and understanding the nature of life activities. Developing computational approaches to predict PPIs can effectively compensate for the shortcomings of biological experiments, which are mostly time-consuming and vulnerable to noise. In recent years, deep learning has been used to develop PPIs prediction models. Most of them consider the contextual information of the target amino acid residues and use a local protein sequence to represent the targets. However, the traditional deep-learning techniques, e.g., deep neural networks (DNNs) and convolutional neural networks (CNNs), disregard the important spatial hierarchies contained in the features of protein sequences, leading to their failure to effectively distinguish the interaction sites from different residue regions. In this work, we design MSE-CapsPPISP, a new deep-learning model to address the PPIs prediction with spatial hierarchies. The key idea of MSE-CapsPPISP is to take into account the hierarchical relationships between the features of protein sequences. We characterize the hierarchical relationships by designing a tailored Capsule Network (CapsNet) model, which is a novel type of neural network with vector neurons. Moreover, to make the network representation more robust, MSE-CapsPPISP uses multi-scale CNNs to extract multi-scale features of protein sequences and Squeeze-and-Excitation blocks to recalibrate the features. The validation results show that our MSE-CapsPPISP outperforms the baseline CNNs-based architecture DeepPPISP and other competing schemes in the PPIs prediction task.
蛋白质-蛋白质相互作用位点(PPIs)的发现对于探索蛋白质相互作用的原理和理解生命活动的本质至关重要。开发计算方法来预测ppi可以有效地弥补生物实验的缺点,这些实验大多耗时且容易受到噪声的影响。近年来,深度学习已被用于开发ppi预测模型。它们大多考虑目标氨基酸残基的上下文信息,并使用局部蛋白质序列来表示目标。然而,传统的深度学习技术,如深度神经网络(dnn)和卷积神经网络(cnn),忽视了蛋白质序列特征中包含的重要空间层次,导致它们无法有效区分不同残基区域的相互作用位点。在这项工作中,我们设计了一个新的深度学习模型MSE-CapsPPISP来解决ppi的空间层次预测问题。MSE-CapsPPISP的关键思想是考虑蛋白质序列特征之间的层次关系。我们通过设计一个定制的胶囊网络(CapsNet)模型来表征层次关系,这是一种具有向量神经元的新型神经网络。此外,为了使网络表征更加鲁棒,MSE-CapsPPISP使用多尺度cnn提取蛋白质序列的多尺度特征,并使用挤压和激励块对特征进行重新校准。验证结果表明,我们的MSE-CapsPPISP在ppi预测任务中优于基于cnn的基准架构deeppppisp和其他竞争方案。
{"title":"MSE-CapsPPISP: Spatial Hierarchical Protein-Protein Interaction Sites Prediction Using Squeeze-and-Excitation Capsule Networks","authors":"Weipeng Lv, Changkun Jiang, Jianqiang Li","doi":"10.1109/BIBM55620.2022.9995658","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995658","url":null,"abstract":"The discovery of protein-protein interaction sites (PPIs) is vital for exploring the principle of PPI and understanding the nature of life activities. Developing computational approaches to predict PPIs can effectively compensate for the shortcomings of biological experiments, which are mostly time-consuming and vulnerable to noise. In recent years, deep learning has been used to develop PPIs prediction models. Most of them consider the contextual information of the target amino acid residues and use a local protein sequence to represent the targets. However, the traditional deep-learning techniques, e.g., deep neural networks (DNNs) and convolutional neural networks (CNNs), disregard the important spatial hierarchies contained in the features of protein sequences, leading to their failure to effectively distinguish the interaction sites from different residue regions. In this work, we design MSE-CapsPPISP, a new deep-learning model to address the PPIs prediction with spatial hierarchies. The key idea of MSE-CapsPPISP is to take into account the hierarchical relationships between the features of protein sequences. We characterize the hierarchical relationships by designing a tailored Capsule Network (CapsNet) model, which is a novel type of neural network with vector neurons. Moreover, to make the network representation more robust, MSE-CapsPPISP uses multi-scale CNNs to extract multi-scale features of protein sequences and Squeeze-and-Excitation blocks to recalibrate the features. The validation results show that our MSE-CapsPPISP outperforms the baseline CNNs-based architecture DeepPPISP and other competing schemes in the PPIs prediction task.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unsupervised Domain Adaptation with Dual U-DenseTransformer Generation 双u -密度变压器生成的无监督域自适应
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995254
Dongfang Shen, Ming Wu, Song Zheng, Jianhui Chen, Yijiang Chen, Yinran Chen, Xióngbiao Luó
Unsupervised domain adaptation is to transfer knowledge from a well-annotated source domain and learn an accurate classifier for an unlabeled target domain, which is particularly useful in multimodal medical image processing. Currently available adaptation approaches strongly reduce the domain bias or inconsistency in the latent space, deteriorating inherent data structures. To appropriately leverage the reduction of the domain discrepancy and the maintenance of the intrinsic structure, this paper proposes a dual U-DenseTransformer generation domain adaptation framework to bridge the gap between source and target domains and achieve translation. Specifically, we create a DenseTransformer with multi-head attention embedded in U-shape network to establish a dual-generator strategy, which is further enhanced by a new hybrid loss function and an edge-aware mechanism that preserve inherent data structure consistent. We apply our proposed method to medical image segmentation, with the experimental results showing that it works more effective and stable than currently available approaches. Particularly, the dice similarity was improved from 79.3% to 82.8%, while the average symmetric surface distance was reduced from 2.5 to 1.9.
无监督域自适应是指从一个标注良好的源域转移知识,学习到一个准确的目标域的分类器,这在多模态医学图像处理中特别有用。目前可用的自适应方法大大减少了潜在空间中的域偏差或不一致,从而恶化了固有的数据结构。为了适当地利用域差异的减少和内在结构的保持,本文提出了一种双U-DenseTransformer生成域自适应框架,以弥合源域和目标域之间的差距,实现翻译。具体来说,我们创建了一个将多头注意力嵌入u形网络的DenseTransformer,以建立双发生器策略,并通过新的混合损失函数和边缘感知机制进一步增强了该策略,以保持固有数据结构的一致性。将该方法应用于医学图像分割中,实验结果表明,该方法比现有方法更有效、更稳定。特别是,骰子相似度从79.3%提高到82.8%,而平均对称表面距离从2.5减少到1.9。
{"title":"Unsupervised Domain Adaptation with Dual U-DenseTransformer Generation","authors":"Dongfang Shen, Ming Wu, Song Zheng, Jianhui Chen, Yijiang Chen, Yinran Chen, Xióngbiao Luó","doi":"10.1109/BIBM55620.2022.9995254","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995254","url":null,"abstract":"Unsupervised domain adaptation is to transfer knowledge from a well-annotated source domain and learn an accurate classifier for an unlabeled target domain, which is particularly useful in multimodal medical image processing. Currently available adaptation approaches strongly reduce the domain bias or inconsistency in the latent space, deteriorating inherent data structures. To appropriately leverage the reduction of the domain discrepancy and the maintenance of the intrinsic structure, this paper proposes a dual U-DenseTransformer generation domain adaptation framework to bridge the gap between source and target domains and achieve translation. Specifically, we create a DenseTransformer with multi-head attention embedded in U-shape network to establish a dual-generator strategy, which is further enhanced by a new hybrid loss function and an edge-aware mechanism that preserve inherent data structure consistent. We apply our proposed method to medical image segmentation, with the experimental results showing that it works more effective and stable than currently available approaches. Particularly, the dice similarity was improved from 79.3% to 82.8%, while the average symmetric surface distance was reduced from 2.5 to 1.9.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121195349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
EEG Based Depression Recognition by Employing Static and Dynamic Network Metrics 基于静态和动态网络度量的脑电抑郁症识别
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9994864
Shuting Sun, Chang Yan, Juntong Lyu, Yueran Xin, Jieyuan Zheng, Zhaolong Yu, B. Hu
Neural circuit dysfunction underlies the biological mechanisms of major depressive disorder (MDD). However, little is known about how the brain’s dynamic connectomes differentiate between depressed patients and normal controls. As a result, we collected resting-state Electroencephalography from 16 MDD patients and 16 controls using 128-electrode geodesic sensor net. Static and dynamic network metrics were later applied to explore the abnormal topological structure of MDD patients and identify them from normal controls using traditional machine learning algorithms with feature selection methods. Results showed that the MDD tend to have a more randomized formation both in static and dynamic network. We also found that the combined static-dynamic feature set usually outperformed others with a highest accuracy of 79.25% under delta band. Lower frequency band (delta, theta) showed relatively better outcomes compared to higher frequency band (alpha, beta). It also indicate the role of functional segregation features as a potential biomarker for depression. In conclusion, neuropathological mechanism of depression may be more objectively quantified and evaluated from the perspective of combining static and dynamic network.
神经回路功能障碍是重度抑郁症(MDD)的生物学机制基础。然而,对于大脑的动态连接体如何区分抑郁症患者和正常对照组,人们知之甚少。因此,我们使用128电极测地传感器网收集了16名重度抑郁症患者和16名对照者的静息状态脑电图。随后,静态和动态网络指标被用于探索MDD患者的异常拓扑结构,并使用传统的带有特征选择方法的机器学习算法将其从正常对照中识别出来。结果表明,无论在静态网络还是动态网络中,MDD的形成都趋于随机化。我们还发现,静态-动态组合特征集通常优于其他特征集,在delta波段下准确率最高,达到79.25%。较低的频带(delta, theta)与较高的频带(alpha, beta)相比,表现出相对更好的结果。这也表明功能分离特征作为抑郁症的潜在生物标志物的作用。综上所述,从静态网络与动态网络相结合的角度,可以更客观地量化和评价抑郁症的神经病理机制。
{"title":"EEG Based Depression Recognition by Employing Static and Dynamic Network Metrics","authors":"Shuting Sun, Chang Yan, Juntong Lyu, Yueran Xin, Jieyuan Zheng, Zhaolong Yu, B. Hu","doi":"10.1109/BIBM55620.2022.9994864","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9994864","url":null,"abstract":"Neural circuit dysfunction underlies the biological mechanisms of major depressive disorder (MDD). However, little is known about how the brain’s dynamic connectomes differentiate between depressed patients and normal controls. As a result, we collected resting-state Electroencephalography from 16 MDD patients and 16 controls using 128-electrode geodesic sensor net. Static and dynamic network metrics were later applied to explore the abnormal topological structure of MDD patients and identify them from normal controls using traditional machine learning algorithms with feature selection methods. Results showed that the MDD tend to have a more randomized formation both in static and dynamic network. We also found that the combined static-dynamic feature set usually outperformed others with a highest accuracy of 79.25% under delta band. Lower frequency band (delta, theta) showed relatively better outcomes compared to higher frequency band (alpha, beta). It also indicate the role of functional segregation features as a potential biomarker for depression. In conclusion, neuropathological mechanism of depression may be more objectively quantified and evaluated from the perspective of combining static and dynamic network.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121207013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Integrating Prior Knowledge with Graph Encoder for Gene Regulatory Inference from Single-cell RNA-Seq Data 基于先验知识与图编码器的单细胞RNA-Seq基因调控推理
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9995287
Jiawei Li, Fan Yang, Fang Wang, Yu Rong, P. Zhao, Shizhan Chen, Jianhua Yao, Jijun Tang, Fei Guo
Inferring gene regulatory networks based on single-cell transcriptomes is critical for systematically understanding cell-specific regulatory networks and discovering drug targets in tumor cells. Here we show that existing methods mainly perform co-expression analysis and apply the image-based model to deal with the non-euclidean scRNA-seq data, which may not reasonably handle the dropout problem and not fully take advantage of the validated gene regulatory topology. We propose a graph-based end-to-end deep learning model for GRN inference (GRNInfer) with the help of known regulatory relations through transductive learning. The robustness and superiority of the model are demonstrated by comparative experiments.
基于单细胞转录组推断基因调控网络对于系统地理解细胞特异性调控网络和发现肿瘤细胞中的药物靶点至关重要。现有方法主要进行共表达分析,并采用基于图像的模型处理非欧几里得scRNA-seq数据,可能无法合理处理dropout问题,也无法充分利用已验证的基因调控拓扑。我们提出了一种基于图的端到端深度学习模型,用于GRN推理(GRNInfer),该模型通过转导学习帮助已知的调节关系。通过对比实验验证了该模型的鲁棒性和优越性。
{"title":"Integrating Prior Knowledge with Graph Encoder for Gene Regulatory Inference from Single-cell RNA-Seq Data","authors":"Jiawei Li, Fan Yang, Fang Wang, Yu Rong, P. Zhao, Shizhan Chen, Jianhua Yao, Jijun Tang, Fei Guo","doi":"10.1109/BIBM55620.2022.9995287","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9995287","url":null,"abstract":"Inferring gene regulatory networks based on single-cell transcriptomes is critical for systematically understanding cell-specific regulatory networks and discovering drug targets in tumor cells. Here we show that existing methods mainly perform co-expression analysis and apply the image-based model to deal with the non-euclidean scRNA-seq data, which may not reasonably handle the dropout problem and not fully take advantage of the validated gene regulatory topology. We propose a graph-based end-to-end deep learning model for GRN inference (GRNInfer) with the help of known regulatory relations through transductive learning. The robustness and superiority of the model are demonstrated by comparative experiments.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116542202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An integrated Extreme learning machine based on kernel risk-sensitive loss of q-Gaussian and voting mechanism for sample classification 基于q-高斯核风险敏感损失和投票机制的样本分类集成极限学习机
Pub Date : 2022-12-06 DOI: 10.1109/BIBM55620.2022.9994976
Zhi-Yuan Li, Ying-Lian Gao, Zhen Niu, Shasha Yuan, C. Zheng, Jin-Xing Liu
Ensemble learning is to train and combine multiple learners to complete the corresponding learning tasks. It can improve the stability of the overall model, and a good ensemble method can further improve the accuracy of the model. At the same time, as one of the outstanding representatives of machine learning, Extreme Learning Machine has attracted the continuous attention of experts and scholars. to get a better representation of the feature space, we extend the Gaussian kernel in the kernel risk-sensitive loss and propose a Kernel Risk-Sensitive Loss of q-Gaussian kernel and Hyper-graph Regularized Extreme Learning Machine method. Since the contingency in the ELM training process cannot be completely avoided, the stability of most ELM methods is affected to some extent. What’s more, we introduce the voting mechanism and a new ELM classification model named Kernel Risk-Sensitive Loss of q-Gaussian kernel and Hyper-graph Regularized Integrated Extreme Learning Machine based on Voting Mechanism is proposed. It improves the stability of the model through the idea of ensemble learning. We apply the new model on six real data sets, and through observation and analysis of experimental results, we find that the new model has certain competitiveness, especially in classification accuracy and stability.
集成学习是训练和组合多个学习者来完成相应的学习任务。它可以提高整体模型的稳定性,良好的集成方法可以进一步提高模型的精度。同时,作为机器学习领域的杰出代表之一,Extreme learning machine也吸引了专家学者的不断关注。为了更好地表示特征空间,我们将高斯核扩展到核风险敏感损失中,提出了一种q-高斯核核风险敏感损失和超图正则化极限学习机方法。由于ELM训练过程中的偶然性无法完全避免,大多数ELM方法的稳定性都会受到一定程度的影响。在此基础上,引入了投票机制,提出了一种新的ELM分类模型——q-高斯核核风险敏感损失模型和基于投票机制的超图正则化集成极限学习机。通过集成学习的思想提高了模型的稳定性。我们将新模型应用于6个真实数据集上,通过实验结果的观察和分析,发现新模型具有一定的竞争力,特别是在分类精度和稳定性方面。
{"title":"An integrated Extreme learning machine based on kernel risk-sensitive loss of q-Gaussian and voting mechanism for sample classification","authors":"Zhi-Yuan Li, Ying-Lian Gao, Zhen Niu, Shasha Yuan, C. Zheng, Jin-Xing Liu","doi":"10.1109/BIBM55620.2022.9994976","DOIUrl":"https://doi.org/10.1109/BIBM55620.2022.9994976","url":null,"abstract":"Ensemble learning is to train and combine multiple learners to complete the corresponding learning tasks. It can improve the stability of the overall model, and a good ensemble method can further improve the accuracy of the model. At the same time, as one of the outstanding representatives of machine learning, Extreme Learning Machine has attracted the continuous attention of experts and scholars. to get a better representation of the feature space, we extend the Gaussian kernel in the kernel risk-sensitive loss and propose a Kernel Risk-Sensitive Loss of q-Gaussian kernel and Hyper-graph Regularized Extreme Learning Machine method. Since the contingency in the ELM training process cannot be completely avoided, the stability of most ELM methods is affected to some extent. What’s more, we introduce the voting mechanism and a new ELM classification model named Kernel Risk-Sensitive Loss of q-Gaussian kernel and Hyper-graph Regularized Integrated Extreme Learning Machine based on Voting Mechanism is proposed. It improves the stability of the model through the idea of ensemble learning. We apply the new model on six real data sets, and through observation and analysis of experimental results, we find that the new model has certain competitiveness, especially in classification accuracy and stability.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116742978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1