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

IEEE International Conference on Systems, Man and Cybernetics

作者： Ping Guo Jing Wang X. Z. Gao Jarno M. A. Tanskanen Laboratory of Image Processing and Pattern Recognition Beijing Normal University Beijing China School of Foundational Education Peking University Health Science Center China Department of Automation and Systems Technology Aalto University School of Electrical Engineering Finland Department of Biomedical Engineering Tampere University of Technology Finland

In Epilepsy EEG signal classification, the main time-frequency features can be extracted by using sparse representation with marching pursuit (MP) algorithm. However, the computational burden is so heavy that it is almost impossible to apply MP to real time signal processing. To reduce complexity of sparse representation, we propose to adopt harmony search method in searching the best atoms. Because harmony search method can find the best atoms in continuous time-frequency dictionary, the performance of epilepsy EEG signal classification is enhanced. The validity of this method is proved by experimental results.

关键词： Feature extraction Electroencephalography Dictionaries Classification algorithms Training Matching pursuit algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

Pulsar candidate selection using ensemble networks for FAST drift-scan survey

arXiv

引用

arXiv 2019年

作者： Wang, Hongfeng Zhu, Weiwei Guo, Ping Li, Di Feng, Sibo Yin, Qian Miao, Chenchen Tao, Zhenzhao Pan, Zhichen Wang, Pei Zheng, Xin Deng, Xiaodan Liu, Zhijie Xie, Xiaoyao Yu, Xuhong You, Shanping Zhang, Hui Image Processing and Pattern Recognition Laboratory College of Information Science and Technology Beijing Normal University Beijing100875 China CAS Key Laboratory of FAST Chinese Academy of Science Beijing100101 China School of Information Management Dezhou University Dezhou253023 China Image Processing and Pattern Recognition Laboratory School of Systems Science Beijing Normal University Beijing100875 China University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Information and Computing Science Guizhou Province Guizhou Normal University Guiyang550001 China School of Physics and Electronic Science Guizhou Normal University Guiyang550001 China

The Commensal Radio Astronomy Five-hundred-meter Aperture Spherical radio Telescope (FAST) Survey (CRAFTS) utilizes the novel drift-scan commensal survey mode of FAST and can generate billions of pulsar candidate signals. The human experts are not likely to thoroughly examine these signals, and various machine sorting methods are used to aid the classification of the FAST candidates. In this study, we propose a new ensemble classification system for pulsar candidates. This system denotes the further development of the pulsar image-based classification system (PICS), which was used in the Arecibo Telescope pulsar survey, and has been retrained and customized for the FAST drift-scan survey. In this study, we designed a residual network model comprising 15 layers to replace the convolutional neural networks (CNNs) in PICS. The results of this study demonstrate that the new model can sort >96% of real pulsars to belong the top 1% of all candidates and classify > 1.6 million candidates per day using a dual-GPU and 24-core computer. This increased speed and efficiency can help to facilitate real-time or quasi-real-time processing of the pulsar-search data stream obtained from CRAFTS. In addition, we have published the labeled FAST data used in this study online, which can aid in the development of new deep learning techniques for performing pulsar searches. Copyright © 2019, The Authors. All rights reserved.

关键词： Pulsars

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Computation of the folkman number Fv(3,5;6)

引用

Journal of Combinatorial Mathematics and Combinatorial Computing 2012年 81卷 11-17页

作者： Shao, Zehui Liang, Meilian Pan, Linqiang Xu, Xiaodong School of Information Science and Technology Chengdu University Chengdu 610106 China Key Laboratory of Pattern Recognition and Intelligent Information Processing China School of Mathematics and Information Science Guangxi University Nanning 530004 China Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China Guangxi Academy of Sciences Nanning Guangxi 530007 China

We prove that Fv(3,5;6) = 16, which solves the smallest open case of vertex Folkman numbers of the form Fv(3,k;k + 1). The proof uses computer algorithms.

关键词： Mathematical techniques

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

BREAK: BRONCHI RECONSTRUCTION BY GEODESIC TRANSFORMATION AND SKELETON EMBEDDING

arXiv

引用

arXiv 2022年

作者： Yu, Weihao Zheng, Hao Zhang, Minghui Zhang, Hanxiao Sun, Jiayuan Yang, Jie Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China Department of Respiratory and Critical Care Medicine Department of Respiratory Endoscopy Shanghai Chest Hospital Shanghai Engineering Research Center of Respiratory Endoscopy China

Airway segmentation is critical for virtual bronchoscopy and computer-aided pulmonary disease analysis. In recent years, convolutional neural networks (CNNs) have been widely used to delineate the bronchial tree. However, the segmentation results of the CNN-based methods usually include many discontinuous branches, which need manual repair in clinical use. A major reason for the breakages is that the appearance of the airway wall can be affected by the lung disease as well as the adjacency of the vessels, while the network tends to overfit these special patterns in the training set. To learn robust features for these areas, we design a multi-stage framework that adopts the geodesic distance transform to capture the intensity changes between airway lumen and wall. Another reason for the breakages is the intra-class imbalance. Since the volume of the peripheral bronchi may be much smaller than the large branches in an input patch, the common segmentation loss is not sensitive to the breakages among the distal branches. Therefore, in this paper, a breakage-sensitive regularization term is designed and can be easily combined with other loss functions. Extensive experiments are conducted on publicly available datasets. Compared with state-of-the-art methods, our framework can detect more branches while maintaining competitive segmentation performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Computer aided analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal classification of epileptic EEG signals using neural networks and harmony search methods

Journal of Software

引用

Journal of Software 2014年第1期9卷 230-239页

作者： Gao, Xiao-Zhi Wang, Jing Tanskanen, Jarno M. A. Bie, Rongfang Wang, Xiaolei Guo, Ping Zenger, Kai College of Information Engineering Shanghai Maritime University China Department of Automation and Systems Technology Aalto University School of Electrical Engineering Finland Laboratory of Image Processing and Pattern Recognition Beijing Normal University China Department of Biomedical Engineering Tampere University of Technology Finland School of Foundational Education Peking University Health Science Center China

In this paper, the Harmony Search (HS)-aided BP neural networks are used for the classification of the epileptic electroencephalogram (EEG) signals. It is well known that the gradient descent-based learning method can result in local optima in the training of BP neural networks, which may significantly affect their approximation performances. Three HS methods, the original version and two new variations recently proposed by the authors of the present paper, are applied here to optimize the weights in the BP neural networks for the classification of the epileptic EEG signals. Simulations have demonstrated that the classification accuracy of the BP neural networks can be remarkably improved by the HS method-based training. © 2014 ACADEMY PUBLISHER.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Unsupervised segmentation using cluster ensembles

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8836卷 76-84页

作者： Zhang, Wei Yang, Jie Jia, Wenjing Kasabov, Nikola Jia, Zhenhong Zhou, Lei Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China School of Computing and Communications University of Technology Sydney United States Knowledge Engineering and Discovery Research Institute Auckland University of Technology Auckland New Zealand School of Information Science and Engineering Xinjiang University Urumqi China

We propose a novel framework for automatic image segmentation. In this approach, a mixture of several over-segmentation methods are used to produce superpixels and then aggregation is achieved using a cluster ensemble method. Generated by different existing segmentation algorithms, superpixels can describe the manifold patterns of a natural image such as color space, smoothness and texture. We use them as the initial superpixels. Grouping cues which affect the performance of segmentation can also be captured. After the oversegmentation, the simultaneous collection of superpixels is expected to achieve synergistic effects and ensure the accuracy of the segmentation. For this purpose, cluster ensemble methods are used to process the initial segmentation results and produce the final result. Our method achieves significantly better performance on the Berkeley Segmentation Database compared to state-of-theart techniques. © Springer International Publishing Switzerland.

关键词： Superpixels

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：