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

Analysis of Least Squares Regularized Regression in Reproducing Kernel Kreın Spaces

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Fanghui Shi, Lei Huang, Xiaolin Yang, Jie Suykens, Johan A.K. Department of Electrical Engineering [ESAT-STADIUS KU Leuven LeuvenB-3001 Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai China

In this paper, we study the asymptotical properties of least squares regularized regression with indefinite kernels in reproducing kernel Kreın spaces (RKKS). The classical approximation analysis cannot be directly applied to study its asymptotical behavior under the framework of learning theory as this problem is in essence non-convex and outputs stationary points. By introducing a bounded hyper-sphere constraint to such non-convex regularized risk minimization problem, we theoretically demonstrate that this problem has a globally optimal solution with a closed form on the sphere, which makes our approximation analysis feasible in RKKS. Accordingly, we modify traditional error decomposition techniques, prove convergence results for the introduced hypothesis error based on matrix perturbation theory, and derive learning rates of such regularized regression problem in RKKS. Under some conditions, the derived learning rates in RKKS are the same as that in reproducing kernel Hilbert spaces (RKHS), which is actually the first work on approximation analysis of regularized learning algorithms in RKKS. Copyright © 2020, The Authors. All rights reserved.

关键词： Learning algorithms

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Brainnetome Center and National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine UCSD La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia ZHAW DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to the wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks, e.g., the attacker can add tiny adversarial perturbations to a test sample to fool the model, or poison the training data to insert a secret backdoor. Previous research has shown that adversarial attacks are also possible for EEG-based BCIs. However, only adversarial perturbations have been considered, and the approaches are theoretically sound but very difficult to implement in practice. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is more feasible in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs. © 2021, CC BY.

关键词： Electroencephalography

Efficient image Super-Resolution with Feature Interaction Weighted Hybrid Network

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Wenjie Li, Juncheng Gao, Guangwei Deng, Weihong Yang, Jian Qi, Guo-Jun Lin, Chia-Wen Pattern Recognition and Intelligent System Laboratory School of Artificial Intelligence Beijing University of Posts and Telecommunications Beijing100080 China Intelligent Visual Information Perception Laboratory Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing210046 China Key Laboratory of Artificial Intelligence Ministry of Education Shanghai200240 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China School of Communication and Information Engineering Shanghai University Shanghai200444 China School of Computer Science and Technology Nanjing University of Science and Technology Nanjing210094 China Research Center for Industries of the Future the School of Engineering Westlake University Hangzhou310024 China OPPO Research SeattleWA98101 United States Department of Electrical Engineering National Tsing Hua University Hsinchu30013 Taiwan

Lightweight image super-resolution aims to reconstruct high-resolution images from low-resolution images using low computational costs. However, existing methods result in the loss of middle-layer features due to activation functions. To minimize the impact of intermediate feature loss on reconstruction quality, we propose a Feature Interaction Weighted Hybrid Network (FIWHN), which comprises a series of Wide-residual Distillation Interaction Block (WDIB) as the backbone. Every third WDIB forms a Feature Shuffle Weighted Group (FSWG) by applying mutual information shuffle and fusion. Moreover, to mitigate the negative effects of intermediate feature loss, we introduce Wide Residual Weighting units within WDIB. These units effectively fuse features of varying levels of detail through a Wide-residual Distillation Connection (WRDC) and a Self-Calibrating Fusion (SCF). To compensate for global feature deficiencies, we incorporate a Transformer and explore a novel architecture to combine CNN and Transformer. We show that our FIWHN achieves a favorable balance between performance and efficiency through extensive experiments on low-level and high-level tasks. Codes will be available at https://***/IVIPLab/FIWHN. Copyright © 2022, The Authors. All rights reserved.

关键词： image reconstruction

An Ensemble Model for Error Modeling with Pseudoinverse Learning Algorithm

学校读者我要写书评

暂无评论

An Ensemble Model for Error Modeling with Pseudoinverse Lear...

IEEE International Conference on Systems, Man and Cybernetics

作者： Sibo Feng Xiaodan Deng Ping Guo Bo Zhao Qian Yin Hongfeng Wang Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China School of Information Management Dezhou University Shandong China

In Bayesian theory, the maximum posterior estimator uses prior information to estimate the noise in the machine learning model by adding the regularization term. The regularization terms L 1 and L 2 correspond to Laplacian prior and Guassian prior, respectively. In existing deep learning models, in order to use the gradient descent optimization algorithm and achieve good results, most models take L 2 regularization as the regularization term of the network model to fit the complex Guassian noise. However in practice, the Laplace noise and the Guassian noise are both considered as data noise. For multi-layer perceptrons, the difficulty caused by adding L 1 and L 2 into the optimization function of the network is solved by proposing an ensemble model for error modeling through adopting the divide and conquer strategy. First, several base learners are trained to fit different noise distributions of data, then the final results can be obtained by taking the results of each base leaner as new data to train a meta leaner, and get the final results. Among them, coordinate regression method is used to solve L 1 loss, while the pseudo-inverse learning algorithm is employed to solve L 2 loss. Both methods are nongradient optimization algorithms. The comparison results of the model on several data sets show that the proposed ensemble model achieves better performance.

关键词： Training Optimization Data models Neural networks Computational modeling Matrix decomposition Estimation

Sparse generalized canonical correlation analysis: Distributed alternating iteration based approach

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Cai, Jia Lv, Kexin Huo, Junyi Huang, Xiaolin Yang, Jie School of Statistics and Mathematics Guangdong University of Finance & Economics Big Data and Educational Statistics Application Laboratory 21 Chisha Road Guangzhou Guangdong510320 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China School of Electronics and Computer Science University of Southampton University Road SouthamptonSO17 1BJ United Kingdom

Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA works only for two datasets, i.e., there are only two views or two distinct objects. To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Moreover, the introduced sparsity could be considered as Laplace prior on the canonical variates. Specifically, we convert the GCCA into a linear system of equations and impose 1 minimization penalty for sparsity pursuit. This results in a nonconvex problem on Stiefel manifold, which is difficult to solve. Motivated by Boyd’s consensus problem, an algorithm based on distributed alternating iteration approach is developed and theoretical consistency analysis is investigated elaborately under mild conditions. Experiments on several synthetic and real world datasets demonstrate the effectiveness of the proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Statistical mechanics

A Method for Authenticity Identification of Fritillaria Cirrhosa D. Don Based on Deep Learning 4

学校读者我要写书评

暂无评论

A Method for Authenticity Identification of Fritillaria Cirr...

4th IEEE International Conference on image, Vision and Computing, ICIVC 2019

作者： Hu, Ke Hu, Pan Cao, Dong Yan, Xin Yu, Xi Liu, Chang Chengdu University College of Information Science and Engineering Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University Chengdu China Research Institute of Big Data Chengdu University China Chengdu Institute of Chinese Herbal Medicine China

ISBN: (纸本)9781728123257

Since the authentic Fritillaria Cirrhosa D. Don resources are scarce due to its high price and valuable medical uses, it is difficult to meet the clinical needs. Therefore, the problem of adulteration in the market is more and more serious. At present, the identification of Fritillaria mainly relies on traditional trait identification, microscopic identification, physical and chemical identification and other methods, which is subjective and requires high practical experience for operators, and the pretreatment work is cumbersome. In this paper, the concept of deep learning is introduced into the identification of Fritillaria for the first time. First, we have created the first multi-angle Fritillaria standard datasets, including Fritillaria Cirrhosa D. Don and Fritillary bulb. We then have proposed a novel deep learning framework SE-DPU to classify Fritillaria datasets, from which we can get the highest classification accuracy. The framework is a hybrid of Squeeze-and-Excitation block (SE unit), U-Net and Dual Path Network (DPN). It reuses the features and explores the new features adaptively recalibrates channel-wise feature responses obtains abundance features while training. Experimental results with Fritillaria Cirrhosa D. Don data have indicated that the proposed method have provided competitive performance. © 2019 IEEE.

关键词： Deep learning

Learning data-adaptive non-parametric kernels

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

Multi-granulation variable precision rough set based on limited tolerance relation

学校读者我要写书评

暂无评论

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第3期83卷 63-74页

作者： Wan, Renxia Yao, Yonghong Kumar, Hussain School of Mathematics and Information Science North Minzu University Ningxia750021 China HongYang Institute for Big Data in Health Fuzhou Fujian350028 China School of Mathematical Sciences Tiangong University Tianjin300387 China The Key Laboratory of Intelligent Information and Data Processing of NingXia Province North Minzu University and Health Big Data Research Institute of North Minzu University Yinchuan750021 China Machine vision and pattern recognition lab University of Regina ReginaSKS4S0A2 Canada

In this paper, the combination of the variable precision rough set and the limited tolerance relation under multi-granularity is explored. As an extension of rough set model, Multi-granularity variable precision limited tolerance rough set model is con-structed. Properties of upper and lower approximation operator and detailed structure of object class through threshold are discussed. Theoretical proofs are given to show the rationality and superiority of the proposed model. © 2021, Politechnica University of Bucharest. All rights reserved.

关键词： Granulation

Tasks integrated networks: Joint detection and retrieval for image search

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhang, Lei He, Zhenwei Yang, Yi Wang, Liang Gao, Xinbo School of Microelectronics and Communication Engineering Chongqing University Chongqing400044 China Center for Artificial Intelligence University of Technology Sydney Australia National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing400065 China

The traditional object (person) retrieval (re-identification) task aims to learn a discriminative feature representation with intra-similarity and inter-dissimilarity, which supposes that the objects in an image are manually or automatically pre-cropped exactly. However, in many real-world searching scenarios (e.g., video surveillance), the objects (e.g., persons, vehicles, etc.) are seldom accurately detected or annotated. Therefore, object-level retrieval becomes intractable without bounding-box annotation, which leads to a new but challenging topic, i.e. image-level search with multi-task integration of joint detection and retrieval. In this paper, to address the image search issue, we first introduce an end-to-end Integrated Net (I-Net), which has three merits: 1) A Siamese architecture and an on-line pairing strategy for similar and dissimilar objects in the given images are designed. Benefited by the Siamese structure, I-Net learns the shared feature representation, because, on which, both object detection and classification tasks are handled. 2) A novel on-line pairing (OLP) loss is introduced with a dynamic feature dictionary, which alleviates the multi-task training stagnation problem, by automatically generating a number of negative pairs to restrict the positives. 3) A hard example priority (HEP) based softmax loss is proposed to improve the robustness of classification task by selecting hard categories. The shared feature representation of I-Net may restrict the task-specific flexibility and learning capability between detection and retrieval tasks. Therefore, with the philosophy of divide and conquer, we further propose an improved I-Net, called DC-I-Net, which makes two new contributions: 1) two modules are tailored to handle different tasks separately in the integrated framework, such that the task specification is guaranteed. 2) A class-center guided HEP loss (C2HEP) by exploiting the stored class centers is proposed, such that the intra-similarity a

关键词： Object recognition