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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yichong Li Xiaojian Liu Fan Cheng Xiaoyong Pan Yang Yang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions.

关键词： Proteins Protein engineering Accuracy RNA Machine learning Predictive models Data models Gene expression Bioinformatics Diseases

来源：评论

学校读者我要写书评

暂无评论

An Active Landing Recovery Method for Quadrotor UAV: Localization, Tracking and Buffering Landing

引用

IFAC-PapersOnLine 2023年第2期56卷 3366-3372页

作者： Yongkang Xu Zhihua Chen Shoukun Wang Junzheng Wang National Key Lab of Autonomous Intelligent Unmanned Systems Beijing Institute of Technology Beijing CO 100081 P.R.China Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition and MOE Key Lab of Nondestructive Testing Technology School of Information Engineering Nanchang Hangkong University Nanchang CO 330063 P.R. China

This paper proposes a principle of fully autonomous ground mobile landing recovery of Unmanned Aerial Vehicles (UAV) for the problems of relatively fixed landing point, passive recovery, poor flexibility, and environmental adaptability, which mainly includes localization, landing point tracking, and buffering landing for quadrotor UAV. Firstly, aiming at the problem that it is difficult to accurately obtain the position of a UAV in dynamic mobile landing recovery, a target location method based on Asynchronous Multisensor Information Fusion(AMIF) and servo turntable focus tracking is proposed. Secondly, to achieve fast and high-precision tracking of UAVs, a tracking control strategy of an independently driven landing recovery system and a Stewart six-degree of freedom platform is proposed. Then, to solve the problems of large impact force and center of gravity instability in the landing process of UAV, a stationarity control algorithm based on model prediction and a compliance control algorithm based on adaptive variable impedance are designed to achieve active compliance control while adjusting the position and attitude of the receiving surface in real-time. Finally, a quadrotor unmanned landing and recovery experimental platform is built to verify the feasibility of the ground mobile landing and recovery strategy proposed in this paper and the effectiveness of the control algorithm.

关键词： Quadrotor UAV Mobile Autonomous recovery Target localization Falling point tracking Buffering landing

来源：评论

学校读者我要写书评

暂无评论

An Improved Adaptive Exponential Smoothing Model for Short-term Travel Time Forecasting of Urban Arterial Street

引用

Acta Automatica Sinica 2008年第11期34卷 1404-1409页

作者： Zhi-Peng LI Hong YU Yun-Cai LIU Fu-Qiang LIU Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 P. R. China Intelligent Transportation System Department Shanghai Electrical Apparatus Research Institute Shanghai 200063 P. R. China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai 200240 P. R. China

Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas, related works, advantages and disadvantages of each model. An improved adaptive exponential smoothing (IAES) model is also proposed to overcome the drawbacks of the previous adaptive exponential smoothing model. Then, comparing experiments are carried out under normal traffic condition and abnormal traffic condition to evaluate the performance of four main branches of forecasting models on direct travel time data obtained by license plate matching (LPM). The results of experiments show each model seems to have its own strength and weakness. The forecasting performance of IASE is superior to other models in shorter forecasting horizon (one and two step forecasting) and the IASE is capable of dealing with all kind of traffic conditions.

关键词： Travel time short-term forecasting license plate matching (LPM) exponential smoothing

来源：评论

学校读者我要写书评

暂无评论

NeuCube(ST) for spatio-temporal data predictive modelling with a case study on ecological data

NeuCube(ST) for spatio-temporal data predictive modelling wi...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Enmei Tu Nikola Kasabov Muhaini Othman Yuxiao Li Susan Worner Jie Yang Zhenghong Jia The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China The Knowledge Engineering and Discovery Research Institute Auckland University of Technology Auckland New Zealand Universiti Tun Hussein Onn Malaysia Lincoln University Lincoln NZ School of Information Science and Engineering Xinjiang University Urumqi China

Early event prediction challenges most of existing modeling methods especially when dealing with complex spatio-temporal data. In this paper we propose a new method for predictive data modelling based on a new development of the recently proposed NeuCube spiking neural network architecture, called here NeuCube (ST) . The NeuCube uses a Spiking Neural Network reservoir (SNNr) and dynamic evolving Spiking Neuron Network (deSNN) classifier. NeuCube (ST) is an integrated environment including data conversion into spike trains, input variable mapping, unsupervised learning in the SNNr, supervised classification learning, activity visualization and network structure analysis. A case study on a real world ecological data set is presented to demonstrate the validity of the proposed method.

关键词： Neurons Training Reservoirs Data models Predictive models Biological neural networks Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

The effect of data augmentation on classification of atrial fibrillation in short single-lead ecg signals using deep neural networks

arXiv

引用

arXiv 2020年

作者： Hatamian, Faezeh Nejati Ravikumar, Nishant Vesal, Sulaiman Kemeth, Felix P. Struck, Matthias Maier, Andreas Department of Image Processing and Medical Technology Fraunhofer Institute for Integrated Circuits IIS Erlangen Germany Pattern Recognition Lab Department of Computer Science Friedrich-Alexander University Erlangen-Nrnberg Erlangen Germany School of Computing LICAMM Leeds Institute of Cardiovascular and Metabolic Medicine School of Medicine University of Leeds United Kingdom

Cardiovascular diseases are the most common cause of mortality worldwide. Detection of atrial fibrillation (AF) in the asymptomatic stage can help prevent strokes. It also improves clinical decision making through the delivery of suitable treatment such as, anticoagulant therapy, in a timely manner. The clinical significance of such early detection of AF in electrocardiogram (ECG) signals has inspired numerous studies in recent years, of which many aim to solve this task by leveraging machine learning algorithms. ECG datasets containing AF samples, however, usually suffer from severe class imbalance, which if unaccounted for, affects the performance of classification algorithms. Data augmentation is a popular solution to tackle this problem. In this study, we investigate the impact of various data augmentation algorithms, e.g., oversampling, Gaussian Mixture Models (GMMs) and Generative Adversarial Networks (GANs), on solving the class imbalance problem. These algorithms are quantitatively and qualitatively evaluated, compared and discussed in detail. The results show that deep learning-based AF signal classification methods benefit more from data augmentation using GANs and GMMs, than oversampling. Furthermore, the GAN results in circa 3% better AF classification accuracy in average while performing comparably to the GMM in terms of f1-score. Copyright © 2020, The Authors. All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Noise Perturbation Based Graph Contrastive Learning via Flexible Filters for Node Classification

Noise Perturbation Based Graph Contrastive Learning via Flex...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhilong Xiong Jia Cai Ranhui Yan Xiaolin Huang xFusion Digital Technologies Company Limited Shenzhen China School of Digital Economics Guangdong University of Finance & Economics Guangzhou China School of Statistics and Mathematics Guangdong University of Finance & Economics Guangzhou China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Graph neural networks (GNNs), as a powerful deep learning framework for modeling graph-structured data, have attracted lots of attention recently. Most of existing GNNs need a lot of labeled data. However, constructing generalizable and robust representation from unlabeled graph data remains a challenge for GNNs. Existing graph contrastive learning (GCL) methods either try to uniformly drop edges, or intend to remove unimportant nodes and edges, which heavily relies on the specific structure of the data. Another thing is that vanilla graph convolutional network only utilize low-pass filter (adjacency matrix), which ignores the middle and high frequency information of the graph structural data. To tackle existing challenges in the GCL methods, instead, we propose a noise perturbation based general GCL framework via flexible filters. Specifically, we first add various types of noise to the nodes and edges. Subsequently, we design flexible filters, which are the combination of low, middle and high-pass filters. Our investigation systematically examines the impact of noise and filters, with an initial theoretical analysis linking these elements to the triplet loss function, shedding light on their roles. Extensive experiments in node classification showcase that our proposed approach surpasses existing state-of-the-art baselines. Surprisingly, we find that moderate levels of noise effectively alleviate the over-smoothing problem encountered in GNNs, while the use of flexible filters notably enhances model performance.

关键词： Filters Sensitivity analysis Perturbation methods image processing image edge detection Noise Low-pass filters

来源：评论

学校读者我要写书评

暂无评论

Towards a unified quadrature framework for large-scale kernel machines

arXiv

引用

arXiv 2020年

作者： Liu, Fanghui Huang, Xiaolin Chen, Yudong Suykens, Johan A.K. KU Leuven LeuvenB-3001 Belgium Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China School of Operations Research and Information Engineering Cornell University IthacaNY14850 United States

In this paper, we develop a quadrature framework for large-scale kernel machines via a numerical integration representation. Considering that the integration domain and measure of typical kernels, e.g., Gaussian kernels, arc-cosine kernels, are fully symmetric, we leverage deterministic fully symmetric interpolatory rules to efficiently compute quadrature nodes and associated weights for kernel approximation. The developed interpolatory rules are able to reduce the number of needed nodes while retaining a high approximation accuracy. Further, we randomize the above deterministic rules by the classical Monte-Carlo sampling and control variates techniques with two merits: 1) The proposed stochastic rules make the dimension of the feature mapping flexibly varying, such that we can control the discrepancy between the original and approximate kernels by tuning the dimnension. 2) Our stochastic rules have nice statistical properties of unbiasedness and variance reduction with fast convergence rate. In addition, we elucidate the relationship between our deterministic/stochastic interpolatory rules and current quadrature rules for kernel approximation, including the sparse grids quadrature and stochastic spherical-radial rules, thereby unifying these methods under our framework. Experimental results on several benchmark datasets show that our methods compare favorably with other representative kernel approximation based methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive nonparametric kernels

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Online learning of multi-feature weights for robust object tracking

Online learning of multi-feature weights for robust object t...

引用

IEEE International Conference on image processing

作者： Tao Zhou Harish Bhaskar Kai Xie Jie Yang Xiangjian He Pengfei Shi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China Dept. of Elec. & Comp. Engg. Khalifa Univ. of Science Technology and Research Abu Dhabi U.A.E Faculty of Engineering and Information Technology University of Technology Sydney Australia

Sparse Representation based Classification (SRC) and its potential in object tracking have been explored in recent years. However, the trade-off between the discriminative ability of the overly emphasized sparse representation and the lack of insight on correlation of visual information has raised questions over the general applicability of such methods in object tracking. In addition, the need for the optimization of a series of l 1 -regularized least square norm, increases the computational complexity thereby limiting their usage in real-time applications. In this paper, a novel approach to robust object tracking is proposed. First, the variations in the appearance of the tracked target is modelled using PCA basis vectors, and further, a l 2 -regularized least square method is used to solve the proposed representation model. In order to improve the robustness of feature representation in object tracking applications, weights are associated with multiple trackers; each formulated using a different feature, and adapted via an online learning scheme. Finally, a decision fusion criterion is imposed to generate an optimized output through the weighted combination of different tracking results. Experiments on challenging video sequences have demonstrated the superior accuracy and robustness of the proposed method in comparison to thirteen other state-of-the-art baselines.

关键词： Target tracking Robustness Object tracking Lighting Clutter Computed tomography Visualization

来源：评论

学校读者我要写书评

暂无评论

Handwritten Chinese character segmentation using a two-stage approach

Handwritten Chinese character segmentation using a two-stage...

引用

International Conference on Document Analysis and recognition

作者： Shuyan Zhao Zheru Chi Pengfei Shi Qing Wang Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai China Centre for Multimedia Signal Processing Department of Electronic and Information Engineering Hong Kong Polytechnic University Hong Kong China Department of Electronic and Information Engineering Hong Kong Polytechnic University Hong Kong China Department of Computer Science and Engineering Northwestern Polytechnical University Xi'an China

ISBN: (纸本)0769512631

Correct segmentation of handwritten Chinese characters is crucial to the successful recognition. However, because of the many difficulties involved, little work has been done in this area. In this paper, a two-stage approach is addressed to segment unconstrained handwritten Chinese character strings. A string is first coarsely segmented according to the background skeleton and vertical projection after a proper image preprocessing. At the fine segmentation stage that follows, the strokes that may contain segmentation points are first identified. The feature points are then extracted from candidate strokes and taken as segmentation point candidates through each of which a segmentation path may be formed. Geometric features are extracted and fuzzy decision rules learned from examples are used to evaluate the segmentation paths. By using this two-stage segmentation approach, we can achieve both good performance and efficiency in segmenting unconstrained handwritten Chinese characters.

关键词： image segmentation Character recognition pattern recognition Handwriting recognition Signal processing image processing Computer science Electronic mail image recognition Skeleton

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：