检索结果-内蒙古大学图书馆

Direct quantification for coronary artery stenosis using multiview learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Dong Yang, Guang Zhao, Shu Zhang, Yanping Zhang, Heye Li, Shuo Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China Cardiovascular Research Centre Royal Brompton Hospital LondonSW3 6NP United Kingdom National Heart & Lung Institute Imperial College London LondonSW7 2AZ United Kingdom School of Biomedical Engineering Sun Yat-Sen University Shenzhen China Western University LondonON Canada

The quantification of the coronary artery stenosis is of significant clinical importance in coronary artery diseases diagnosis and intervention treatment. It aims to quantify the morphological indices of the coronary artery lesions such as minimum lumen diameter, reference vessel diameter, lesion length and these indices are the reference of the interventional stent placement. In this study, we propose a direct multiview quantitative coronary angiography (DMQCA) model as an automatic clinical tool to quantify the coronary artery stenosis from X-ray coronary angiography images. The proposed DMQCA model consists of a multiview module with two attention mechanisms, a key-frame module and a regression module, to achieve direct accurate multiple-index estimation. The multi-view module comprehensively learns the spatio-temporal features of coronary arteries through a three-dimensional convolution. The attention mechanisms of each view focus on the subtle feature of the lesion region and capture the important context information. The keyframe module learns the subtle features of the stenosis through successive dilated residual blocks. The regression module finally generates the indice estimation from multiple features. We evaluate the proposed model over 2100 X-ray coronary angiography images collected from 105 subjects from two viewpoints. Compared to other direct quantification methods, our DMQCA model achieves more accurate quantification, enabling to provide a patient-specic assessment of coronary artery stenosis. Copyright © 2019, The Authors. All rights reserved.

关键词： Heart

Butson Hadamard matrices, bent sequences, and spherical codes

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shi, Minjia Lu, Danni Armario, Andrés Egan, Ronan Ozbudak, Ferruh Solé, Patrick The Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Integrated Service Networks Xidian University Xi’an710071 China Departamento de Matemática Aplicada I Universidad de Sevilla Avda. Reina Mercedes s/n Seville41012 Spain School of Mathematical Sciences Dublin City University Ireland Faculty of Engineering and Natural Sciences Sabancı University Istanbul34956 Turkey I2M Aix Marseille Univ CNRS Centrale Marseille Marseilles France

We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order n defined over the complex qth roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of order q. In particular we construct self-dual bent sequences for various q ≤ 60 and lengths n ≤ 21. Computational construction methods comprise the resolution of polynomial systems by Groebner bases and eigenspace computations. Infinite families can be constructed from regular Hadamard matrices, Bush-type Hadamard matrices, and generalized Boolean bent functions. As an application, we estimate the covering radius of the code attached to that matrix over Zq. We derive a lower bound on that quantity for the Chinese Euclidean metric when bent sequences exist. We give the Euclidean distance spectrum, and bound above the covering radius of an attached spherical code, depending on its strength as a spherical design. © 2023, CC BY.

关键词： Spheres

Gradually Vanishing Gap in Prototypical Network for Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shanshan Zhou, Hao Yang, Xun He, Zhenwei Wang, Mengzhu Zhang, Xingyi Wang, Meng The Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information Technology Anhui University Hefei230601 China The Department of Electronic Engineering and Information Science School of Information Science and Technology University of Science and Technology of China Hefei230026 China The College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China The School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China The School of Artificial Intelligence Hebei University of Technology Tianjin China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The School of Computer Science and Technology Anhui University Hefei230601 China

Unsupervised domain adaptation (UDA) is a critical problem for transfer learning, which aims to transfer the semantic information from lab.led source domain to unlab.led target domain. Recent advancements in UDA models have demonstrated significant generalization capabilities on the target domain. However, the generalization boundary of UDA models remains unclear. When the domain discrepancy is too large, the model can not preserve the distribution structure, leading to distribution collapse during the alignment. To address this challenge, we propose an efficient UDA framework named Gradually Vanishing Gap in Prototypical Network (GVG-PN), which achieves transfer learning from both global and local perspectives. From the global alignment standpoint, our model generates a domain-biased intermediate domain that helps preserve the distribution structures. By entangling cross-domain features, our model progressively reduces the risk of distribution collapse. However, only relying on global alignment is insufficient to preserve the distribution structure. To further enhance the inner relationships of features, we introduce the local perspective. We utilize the graph convolutional network (GCN) as an intuitive method to explore the internal relationships between features, ensuring the preservation of manifold structures and generating domain-biased prototypes. Additionally, we consider the discriminability of the inner relationships between features. We propose a pro-contrastive loss to enhance the discriminability at the prototype level by separating hard negative pairs. By incorporating both GCN and the pro-contrastive loss, our model fully explores fine-grained semantic relationships. Experiments on several UDA benchmarks validated that the proposed GVG-PN can clearly outperform the SOTA models. Copyright © 2024, The Authors. All rights reserved.

关键词： Alignment

Forecasting wheat aphid with remote sensing based on relevance vector machine

学校读者我要写书评

暂无评论

Nongye Gongcheng Xuebao/Transactions of the Chinese Society of Agricultural Engineering 2015年第6期31卷 201-207页

作者： Tang, Cuicui Huang, Wenjiang Luo, Juhua Liang, Dong Zhao, Jinling Huang, Linsheng Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230039 China School of Electronic and Information Engineering Anhui University Hefei230039 China Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing100094 China Nanjing Institute of Geography and Limnology Chinese Academy of Sciences Nanjing210008 China

The prevalence of aphid in winter wheat field has a significant impact on the production of winter wheat. An effective and timely forewarning of the scope and severity of the disease at a regional scale will not only reduce yield losses but also alert the stakeholders to take effective preventive measures. Forecasting aphid occurrence with Remote Sensing has great advantages over traditional methods and meteorological data, such as lower cost, simpler operation, more real-time and higher resolution. Chinese HJ-1A/1B data which have a high revisit frequency ( ©, 2015, Chinese Society of Agricultural Engineering. All right reserved.

关键词： Satellite imagery

Co-training based prediction of multi-lab.l protein–protein interactions

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2024年 177卷 108623-108623页

作者： Tang, Tao Zhang, Xiaocai Li, Weizhuo Wang, Qing Liu, Yuansheng Cao, Xiaofeng School of Modern Posts Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China 1 Fusionopolis Way Singapore138632 Singapore School of Management Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China College of Computer Science and Electronic Engineering Hunan University 2 Lushan Rd Hunan Changsha410086 China Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University 111 Jiulong Road Anhui Hefei230601 China School of Artificial Intelligence Jilin University 2699 Qianjin St Changchun Jilin130012 China

Prediction of protein–protein interaction (PPI) types enhances the comprehension of the underlying structural characteristics and functions of proteins, which gives rise to a multi-lab.l classification problem. The nominal features describe the physicochemical characteristics of proteins directly, establishing a more robust correlation with the interaction types between proteins than ordered features. Motivated by this, we propose a multi-lab.l PPI prediction model referred to as CoMPPI (Co-training based Multi-lab.l prediction of Protein–Protein Interaction). This approach aims to maximize the utility of both ordered and nominal features extracted from protein sequences. Specifically, CoMPPI incorporates graph convolutional network (GCN) and 1D convolution operation to process the complementary subsets of features individually, leveraging both local and contextualized information in a more efficient way. In addition, two multi-type PPI datasets were constructed to eliminate the duplication in previous datasets. We compare the performance of CoMPPI with three state-of-the-art methods on three datasets partitioned using distinct schemes (Breadth-first search, Depth-first search, and Random), CoMPPI consistently outperforms the other methods across all cases, demonstrating improvements ranging from 3.81% to 32.40% in Micro-F1. The subsequent ablation experiment confirms the efficacy of employing the co-training framework for multi-lab.l PPI prediction, indicating promising avenues for future advancements in this domain. © 2024 Elsevier Ltd

关键词： Proteins

VANER: Leveraging Large Language Model for Versatile and Adaptive Biomedical Named Entity Recognition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bian, Junyi Zhai, Weiqi Huang, Xiaodi Zheng, Jiaxuan Zhu, Shanfeng School of Computer Science Fudan University Shanghai200433 China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China Ministry of Education Shanghai200433 China MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China Zhangjiang Fudan International Innovation Center Shanghai200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai200433 China School of Computing and Mathematics Charles Sturt University AlburyNSW2640 Australia

Prevalent solution for BioNER involves using representation learning techniques coupled with sequence lab.ling. However, such methods are inherently task-specific, demonstrate poor generalizability, and often require dedicated model for each dataset. To leverage the versatile capabilities of recently remarkable large language models (LLMs), several endeavors have explored generative approaches to entity extraction. Yet, these approaches often fall short of the effectiveness of previouly sequence lab.ling approaches. In this paper, we utilize the open-sourced LLM LLaMA2 as the backbone model, and design specific instructions to distinguish between different types of entities and datasets. By combining the LLM’s understanding of instructions with sequence lab.ling techniques, we use mix of datasets to train a model capable of extracting various types of entities. Given that the backbone LLMs lacks specialized medical knowledge, we also integrate external entity knowledge bases and employ instruction tuning to compel the model to densely recognize carefully curated entities. Our model VANER, trained with a small partition of parameters, significantly outperforms previous LLMs-based models and, for the first time, as a model based on LLM, surpasses the majority of conventional state-of-the-art BioNER systems, achieving the highest F1 scores across three datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational linguistics

Remote sensing identification of shrub encroachment in grassland in Inner Mongolia

学校读者我要写书评

暂无评论

Nongye Gongcheng Xuebao/Transactions of the Chinese Society of Agricultural Engineering 2014年第11期30卷 152-158页

作者： Dong, Zhou Zhao, Xia Liang, Dong Huang, Wenjiang Peng, Dailiang Huang, Linsheng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China School of Electronic and Information Engineering Anhui University Hefei 230039 China Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing 100094 China State Key Laboratory of Vegetation and Environmental Change Institute of Botany Chinese Academy of Sciences Beijing 100093 China

Shrub encroachment has been a wide phenomenon across the arid and semi-arid grasslands in Inner Mongolia, China. Although numerous studies have investigated the effect of this phenomenon on community composition, ecosystem structure, and nutrient cycling, reports on the distribution patterns of shrub encroachment are limited. A recent development in satellite remote sensing enables accurate assessment of shrub distribution and its dynamics at large scales. In this paper, the combined ground survey in Xianghuangqi, four satellite images (with spatial resolution of 5.8 m) of ZY-3, covering nearly the whole area and taken between July and August in 2013, were used to identify the shrub distribution in this region. It should be noted that the shrub here indicated the shrub-grass mosaic due to the mixed pixel effect, and the identification was weak when the coverage of shrub was on low levels. The NDVI threshold method was first used to extract the vegetation coverage area, and then three traditional pixel-oriented methods (Support vector machine, Maximum likelihood and Mahalanobis distance), compared with the object-oriented method, were used for the classification of images. Object-oriented method is different from the traditional one, in that the classification is not based on the spectral characteristics of individual pixel, but relies on the image object with spatial texture and shape and size characteristics. Ground survey data were used to compare the accuracy level of these methods. It indicated that the shrub recognition accuracy by using support vector machine algorithm is the highest among the three pixel-oriented methods, with higher producer accuracy and user accuracy than the other two algorithms. Furthermore, the overall classification accuracy of this algorithm is 81.15% higher than that of the maximum likelihood (73.33%) and the Mahalanobis distance (61.77%). However, the overall recognition accuracy by using the object-oriented approach (combined scale

关键词： Maximum likelihood

New algorithm of target classification in polarimetric SAR

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2008年第2期000卷

作者： Wang Yang Lu Jiaguo Wu Xianliang Wang Yang (Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui Univ. Heifei 230039 P. R. China The 38th Research Inst. China Electronic Technology Corporation Hefei 230031 P. R. China) Lu Jiaguo (The 38th Research Inst. China Electronic Technology Corporation Hefei 230031 P. R. China) Wu Xianliang (Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui Univ. Heifei 230039 P. R. China)

The different approaches used for target decomposition (TD) theory in radar polarimetry are reviewed and three main types of theorems are introduced: those based on Mueller matrix, those using an eigenvector analysis of the coherency matrix, and those employing coherent decomposition of the scattering matrix. Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated success in many fields. A new algorithm of target classification, by combining target decomposition and the support vector machine, is *** conduct the experiment, the polarimetric synthetic aperture radar (SAR) data are used. Experimental results show that it is feasible and efficient to target classification by applying target decomposition to extract scattering mechanisms, and the effects of kernel function and its parameters on the classification efficiency are significant.

关键词： polarimetric synthetic aperture radar target decomposition support vector machine target classifi-cation kernel function.

Author Correction: Full reconstruction of simplicial complexes from binary contagion and Ising data

学校读者我要写书评

暂无评论

Nature communications 2022年第1期13卷 3692页

作者： Huan Wang Chuang Ma Han-Shuang Chen Ying-Cheng Lai Hai-Feng Zhang The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei 230601 China. School of Internet Anhui University Hefei 230601 China. School of Physics and Material Science Anhui University Hefei 230601 China. School of Electrical Computer and Energy Engineering Arizona State University Tempe AZ 85287 USA. The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei 230601 China. haifengzhang1978@***.