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

International Conference on Information Engineering and Computer Science (ICIECS)

作者： Jianglin Ma Zhouwei Zhang Chengyi Wang Zhong Chen Remote Sensing Image Processing Laboratory Institute of Remote Sensing Applications Chinese Academy and Sciences Beijing China Institute for Pattern Recognition & Artificial Intelligence Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781424449934

A classifier-based method to select and fuse grey level co-occurrence matrix (GLCM), Gaussian Markov random field (GMRF) and discrete wavelet transform (DWT) features to improve texture discrimination is presented. Feature selection via wrapper approaches is applied to find the optimal combination of texture features. The fused features have obtained higher discrimination accuracy compared with individual features. The curse of dimensionality is shown to affect discrimination accuracy, and feature selection and reduction helps obtain higher accuracy. Overall our proposed classifier-based method obtains the highest discrimination accuracy compared to other feature reduction methods such as principal component analysis (PCA) and linear discriminant analysis (LDA). Meanwhile GLCM features are found to produce higher discrimination accuracy than GMRF and DWT, and LDA is demonstrated to obtain higher discrimination accuracy than PCA.

关键词： Discrete wavelet transforms Linear discriminant analysis Signal processing algorithms Feature extraction Remote sensing Markov random fields Principal component analysis Classification algorithms Fuses Wavelet analysis

来源：评论

学校读者我要写书评

暂无评论

Consensus Control for Second-Order Multi-Agent with Time-Delay on Antagonistic Networks

Consensus Control for Second-Order Multi-Agent with Time-Del...

引用

第35届中国控制会议

作者： Penglin LI Yue LIU Yadong ZHAO Jie YANG Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University State Key Laboratory of Industrial Control Technology Institute of Industrial Process ControlCollege of Control Science and EngineeringZhejiang University Key Laboratory of System Control and Information Processing Ministry of Education

ISBN: (纸本)9781509009107

In this paper,we discuss consensus problems for antagonistic networks with double integrator *** cases are analyzed:(1) undirected graphs with fixed topology on antagonistic networks;(2) undirected graphs with fixed topology and time-delay on antagonistic *** both cases,distributed consensus protocols are proposed,with sufficient and necessary conditions *** is proved that the largest tolerable time-delay is only related to the largest eigenvalue of the graph ***,simulations are provided to demonstrate the obtained theoretical results.

关键词： Consensus Fixed Topology Multi-agent Antagonistic Networks Time-delay

来源：评论

学校读者我要写书评

暂无评论

Isoform Function Prediction Based on Heterogeneous Graph Attention Networks

Isoform Function Prediction Based on Heterogeneous Graph Att...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Guo, Kuo Li, Yifan Chen, Hao Shen, Hong-Bin Yang, Yang Shanghai Jiao Tong University Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Department of Computer Science and Engineering Shanghai200240 China Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Institute of Image Processing and Pattern Recognition Shanghai200240 China Carnegie Mellon University School of Computer Science Computational Biology Department PittsburghPA15213 United States

ISBN: (纸本)9798350337488

Isoforms refer to different mRNA molecules transcribed from the same gene, which can be translated into proteins with varying structures and functions. Predicting the functions of isoforms is an essential topic in bioinformatics as it can provide valuable insights into the intricate mechanisms of gene regulation and biological processes. Conventionally, gene function labels are standardized in Gene Ontology (GO) terms. However, traditional methods for predicting isoform function are largely limited by the absence of isoform-specific labels, sparse annotations, and the vast number of GO terms. To address these issues, we propose HANIso, a deep learning-based method for isoform function prediction. HANIso leverages a pretrained protein language model to extract features from protein sequences. It also integrates heterogeneous information, such as isoform sequence features, GO annotations, and isoform interaction data, using a Heterogeneous Graph Attention Network (HAN). This allows the model to learn the importance of different sources of information and their semantic relationships through the attention mechanism. Our method can predict function labels at both the gene level and isoform level. We conduct experiments on two species datasets, and the results demonstrate that our method outperforms existing methods on both AUROC and AUPRC. HANIso has the potential to overcome the limitations of traditional methods and provide a more accurate and comprehensive understanding of isoform function. © 2023 IEEE.

关键词： alternative splicing gene ontology heterogeneous graph attention network isoform function prediction protein language model

来源：评论

学校读者我要写书评

暂无评论

Decentralized Kernel Ridge Regression Based on Data-Dependent Random Feature

arXiv

引用

arXiv 2024年

作者： Yang, Ruikai He, Fan He, Mingzhen Yang, Jie Huang, Xiaolin The Institute of Image Processing and Pattern Recognition The MOE Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai200240 China The STADIUS Center for Dynamical Systems Signal Processing and Data Analytics KU Leuven LeuvenB-3001 Belgium

Random feature (RF) has been widely used for node consistency in decentralized kernel ridge regression (KRR). Currently, the consistency is guaranteed by imposing constraints on coefficients of features, necessitating that the random features on different nodes are identical. However, in many applications, data on different nodes varies significantly on the number or distribution, which calls for adaptive and data-dependent methods that generate different RFs. To tackle the essential difficulty, we propose a new decentralized KRR algorithm that pursues consensus on decision functions, which allows great flexibility and well adapts data on nodes. The convergence is rigorously given and the effectiveness is numerically verified: by capturing the characteristics of the data on each node, while maintaining the same communication costs as other methods, we achieved an average regression accuracy improvement of 25.5% across six real-world data sets. Copyright © 2024, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

SliceProp: A Slice-Wise Bidirectional Propagation Model for Interactive 3D Medical image Segmentation 1

SliceProp: A Slice-Wise Bidirectional Propagation Model for ...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Xu, Xin Lu, Wenjing Lei, Jiahao Qiu, Peng Shen, Hong-Bin Yang, Yang Shanghai Jiao Tong University Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Department of Computer Science and Engineering Shanghai200240 China Shanghai Ninth People's Hospital Shanghai Jiao Tong University School of Medicine Department of Vascular Surgery China Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

ISBN: (纸本)9798350358780

Interactive medical image segmentation methods have become increasingly popular in recent years. These methods combine manual labeling and automatic segmentation, reducing the workload of annotation while maintaining high accuracy. However, most current interactive segmentation frameworks are limited to 2D image data, and are not suitable for 3D image data due to the large size and high complexity of 3D data, as well as the challenges posed by information asymmetry and sparse annotation. In this paper, we propose SliceProp, an interactive segmentation framework that implements slice-wise Label Bidirectional Propagation (LBP) for 3D medical image segmentation. SliceProp extends the interactive 2D image segmentation algorithm to 3D image segmentation, and can handle 3D data with large size and high complexity. Moreover, equipped with a Backtracking Feedback Check (BFC) module, SliceProp effectively addresses the issues of information asymmetry and spatial sparse annotation in 3D medical image segmentation. Additionally, we adopt an uncertainty-based criterion to pri-oritize the slices to be refined interactively, which enhances the efficiency of the interaction process by enabling the model to focus on the regions with the most unreliable predictions. SliceProp is evaluated on two datasets and achieves promising results compared to state-of-the-art methods. © 2023 IEEE.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Cross-Modal De-Deviation for Enhancing Few-Shot Classification

SSRN

引用

SSRN 2023年

作者： Pan, Mei-Hong Shen, Hong-Bin School of Electronic Information and Electrical Engineering Shanghai Jiaotong University China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

Few-shot learning poses a critical challenge due to the deviation problem caused by the scarcity of available samples. In this work, we aim to address deviations in both feature representations and prototypes. To achieve this, we propose a cross-modal de-deviation framework that leverages class semantic information to provide robust prior knowledge for the samples. This framework begins with a visual-to-semantic autoencoder trained on the labeled samples to predict semantic features for the unlabeled samples. Then, we devise a binary linear programming model to incorporate the initial prototypes with the cluster centers of the unlabeled samples. To avoid mismatch between the cluster centers and the initial prototypes, we conduct the label assignment process in the semantic space using the class ground truth semantic features as the reference points, with the cluster centers transformed into semantic representations. Moreover, we model a linear classifier with the concatenation of the refined prototypes and the class ground truth semantic features serving as the initial weights. Then we propose a novel optimization strategy based on the alternating least squares (ALS) model. From the ALS model, we can derive two closed-form solutions regarding to the features and weights, facilitating alternative optimization of them. Extensive experiments conducted on three standard benchmarks demonstrate the competitive advantages of our CMDD method over the state-of-the-art few-shot classification methods, confirming its effectiveness in reducing deviation. © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Prediction of σ54 promoters in prokaryotes based on SVM–Adaboost

Prediction of σ54 promoters in prokaryotes based on SVM–Ad...

引用

Chinese Automation Congress (CAC)

作者： Yongxian Fan Qingqi Zhu Chengwei Lv Xianyong Pan School of Computer and Information Security Guilin University of Electronic Technology Guilin Guangxi Key Laboratory of System Control and Information Processing Ministry of Education of China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China

σ 54 promoters are responsible for transcriptional carbon and nitrogen in prokaryotes. However, it is costly and difficult by experimental identification of them, especially in the postgenomic era with avalanche of sequencing data. Thus, it is imperative to develop efficiently and rapidly computational algorithms to identify the σ 54 promoters. In this study, a novel predictor named SVM-Adaboost was developed to predict σ 54 promoters from sequences alone, it used the Adaboost algorithm as the core, and support vector machine (SVM) as weak base predictors. SVM-Adaboost integrated SVM predictors to construct a more powerful and robust ensemble predictor. In SVM-Adaboost, we used pseudo k-tuple nucleotide composition method to encode DNA sequences, and then a feature selection method was used to further select the discriminate features for subsequent classification. We strictly evaluate the SVM-Adaboost on a constructed gold-standard σ 54 promoter dataset using ten-fold cross validation 100 times, and achieved an average accuracy of 96.06%.

关键词： DNA Support vector machines Feature extraction Training Prediction algorithms Benchmark testing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm and implementation for residue to binary number conversion

An efficient algorithm and implementation for residue to bin...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Chengyi Xiong Zhirong Gao Jinwen Tian Key Laboratory of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition & Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science Wuhan University of Science & Engineering Wuhan China Key Laboratory of Education Commission for Image Processing Huazhong University of Science & Technology China

The residue number system (RNS) has computational advantages in addition and multiplication compared with weighted number systems, such as the binary number system (BNS), since operations on residue digits are performed independently and these processes can be performed in parallel. Thus they are widely used in digital signal processing etc. Since residue to binary conversion is critical and difficult for the practicality of RNS, in this paper, a novel residue to binary (R/B) conversion algorithm for the restricted moduli set (2/sup n/ -1, 2/sup n/, 2n+1), based on exploring the periodicity of modulo (2/sup n/ /spl plusmn/ 1) operations is presented. A new 2n-bit adder based R/B converter is also proposed. The performance comparison results demonstrate that the new converter is faster and requires less area compared with the others reported in the previous literature.

关键词： Signal processing algorithms image converters Educational institutions Computer science Concurrent computing Digital signal processing Arithmetic Laboratories image processing Intelligent control

来源：评论

学校读者我要写书评

暂无评论

FVC2002: Second fingerprint verification competition

FVC2002: Second fingerprint verification competition

引用

作者： Maio, D. Maltoni, D. Cappelli, R. Wayman, J.L. Jain, A.K. Biometric System Lab. DEIS University of Bologna via Sacchi 3 47023 Cessna Italy Biometric Test Center College of Engineering San Jose State University San Jose CA 95192 United States Pattern Recognition and Image Processing Laboratory Michigan State University East Lansing MI 48824 United States

Two years after the first edition, a new Fingerprint Verification Competition (FVC2002) was organized by the authors, with the aim of determining the state-of-the-art in this challenging pattern recognition application. The experience and the feedback received from FVC2000 allowed the authors to improve the organization of FVC2002 and to capture the attention of a significantly higher number of academic and commercial organizations (33 algorithms were submitted). This paper discusses the FVC2002 database, the test protocol and the main differences between FVC2000 and FVC2002. The algorithm performance evaluation will be presented at the 16th ICPR. © 2002 IEEE.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Robust recovery of eigenimages in the presence of outliers and occlusions

引用

Journal of Computing and Information Technology 1996年第1期4卷 25-38页

作者： Leonardis, Aleš Bischof, Horst Department for Pattern Recognition and Image Processing Technical University Vienna Treitlstraße 3/1832 ViennaA-1040 Austria Computer Vision Laboratory Faculty of Computer and Information Science University of Ljubljana Tržaška 25 Ljubljana1000 Slovenia

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coefficients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way how the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages. we extract them by a hvpothesize-and-test paradigm using subsets of image points. Competing hypotheses arc then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only lo reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：