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

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Pathological brain detection based on online sequential extreme learning machine

Pathological brain detection based on online sequential extr...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Siyuan Lu Hainan Wang Xueyan Wu Shuihua Wang School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China State Key Lab of CAD & CG Zhejiang University Hangzhou Zhejiang China Key laboratory of symbolic computation and knowledge engineering of ministry of education Jilin University Changchun Jilin China Key Laboratory of Statistical information technology and data mining State Statistics Bureau Chengdu Sichuan China Department of Electrical Engineering CUNY New York NY USA

ISBN: (纸本)9781509034857

Magnetic resonance imaging (MRI) is a kind of imaging modality, which offers clearer images of soft tissues than computed tomography (CT). It is especially suitable for brain disease detection. It is beneficial to detect diseases automatically and accurately. We proposed a pathological brain detection method based on brain MR images and online sequential extreme learning machine. First, seven wavelet entropies (WE) were extracted from each brain MR image to form the feature vector. Then, an online sequential extreme learning machine (OS-ELM) was trained to differentiate pathological brains from the healthy controls. The experiment results over 132 brain MRIs showed that the proposed approach achieved a sensitivity of 93.51%, a specificity of 92.22%, and an overall accuracy of 93.33%, which suggested that our method is effective.

关键词： Entropy Discrete wavelet transforms Feature extraction Pathology Training Magnetic resonance imaging Diseases

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection

arXiv

引用

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

DRL-M4MR: An Intelligent Multicast Routing Approach Based on DQN Deep Reinforcement Learning in SDN

arXiv

引用

arXiv 2022年

作者： Zhao, Chenwei Ye, Miao Xue, Xingsi Lv, Jianhui Jiang, Qiuxiang Wang, Yong School of Information and Communication Guilin University of Electronic Technology Guilin541004 China Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing Guilin University of Electronic Technology Guilin541004 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fujian Fuzhou350118 China Peng Cheng Lab. Guangdong Shenzhen518038 China School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China

Traditional multicast routing methods have some problems in constructing a multicast tree, such as limited access to network state information, poor adaptability to dynamic and complex changes in the network, and inflexible data forwarding. To address these defects, the optimal multicast routing problem in software-defined networking (SDN) is tailored as a multi-objective optimization problem, and an intelligent multicast routing algorithm DRL-M4MR based on the deep Q network (DQN) deep reinforcement learning (DRL) method is designed to construct a multicast tree in SDN. First, the multicast tree state matrix, link bandwidth matrix, link delay matrix, and link packet loss rate matrix are designed as the state space of the DRL agent by combining the global view and control of the SDN. Second, the action space of the agent is all the links in the network, and the action selection strategy is designed to add the links to the current multicast tree under four cases. Third, single-step and final reward function forms are designed to guide the intelligence to make decisions to construct the optimal multicast tree. The experimental results show that, compared with existing algorithms, the multicast tree construct by DRL-M4MR can obtain better bandwidth, delay, and packet loss rate performance after training, and it can make more intelligent multicast routing decisions in a dynamic network environment. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Rethinking Lightweight Convolutional Neural Networks for Efficient and High-quality Pavement Crack Detection

arXiv

引用

arXiv 2021年

作者： Li, Kai Yang, Jie Ma, Siwei Wang, Bo Wang, Shanshe Tian, Yingjie Qi, Zhiquan School of Computer Science Institute of Digital Media Peking University Beijing100871 China School of Mathematics Sciences University of Chinese Academy of Sciences Beijing100049 China Advanced Institute of Information Technology Peking University Hangzhou310005 China School of Information Technology and Management University of International Business and Economics Beijing100029 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation University of Chinese Academy of Sciences No. 3 South Yitiao Zhongguancun Haidian District Beijing100190 China

Pixel-level road crack detection has always been a challenging task in intelligent transportation systems. Due to the external environments, such as weather, light, and other factors, pavement cracks often present low contrast, poor continuity, and different sizes in length and width. However, most of the existing studies pay less attention to crack data under different situations. Meanwhile, recent algorithms based on deep convolutional neural networks (DCNNs) have promoted the development of cutting-edge models for crack detection. Nevertheless, they usually focus on complex models for good performance, but ignore detection efficiency in practical applications. In this article, to address the first issue, we collected two new databases (i.e. Rain365 and Sun520) captured in rainy and sunny days respectively, which enrich the data of the open source community. For the second issue, we reconsider how to improve detection efficiency with excellent performance, and then propose our lightweight encoder-decoder architecture termed CarNet. Specifically, we introduce a novel olive-shaped structure for the encoder network, a light-weight multi-scale block and a new up-sampling method in the decoder network. Numerous experiments show that our model can better balance detection performance and efficiency compared with previous models. Especially, on the Sun520 dataset, our CarNet significantly advances the state-of-the-art performance with ODS F-score from 0.488 to 0.514. Meanwhile, it does so with an improved detection speed (104 frame per second) which is orders of magnitude faster than some recent DCNNs-based algorithms specially designed for crack detection. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Multi-kernel Graph Learning for Autism Prediction and Biomarker Discovery

arXiv

引用

arXiv 2023年

作者： Liu, Jin Mao, Junbin Lin, Hanhe Kuang, Hulin Pan, Shirui Wu, Xusheng Xie, Shan Liu, Fei Pan, Yi Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Xinjiang Engineering Research Center of Big Data and Intelligent Software School of software Xinjiang University Wulumuqi830000 China Hunan Province Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Science and Engineering University of Dundee DundeeDD1 4HN United Kingdom School of Information and Communication Technology Griffith University Gold CoastQLD4215 Australia Shenzhen Health Development Research and Data Management Center Shenzhen518109 China

Graph learning-based multi-modal integration and classification is one of the most challenging tasks for disease prediction. To effectively offset the negative impact among modalities in the process of multi-modal integration and heterogeneous information extractions from graphs, we propose a novel method called Multi-modal Multi-Kernel Graph Learning (MMKGL). To solve the problem of negative impact among modalities, we propose a multi-modal graph embedding module to construct a multi-modal graph. Different from conventional methods that manually construct static graphs for all modalities, each modality generates a separate graph by adaptive learning, where a function graph and a supervision graph are introduced for optimization during the multi-graph fusion embedding process. We then propose a multi-kernel graph learning module to extract heterogeneous information from the multi-modal graph. The information in the multi-modal graph at different levels is aggregated by convolutional kernels with different receptive field sizes, followed by generating a cross-kernel discovery tensor for disease prediction. Our method is evaluated on the benchmark Autism Brain Imaging data Exchange (ABIDE) dataset and outperforms the state-of-the-art methods. In addition, discriminative brain regions associated with autism are identified by our model, providing guidance for the study of autism pathology. The source code will be available at https://***/yutian0315/MMKGL. © 2023, CC BY-NC-ND.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Global Collaboration to Enhance Information technology & Quantitative management: Preface for ITQM 2023

引用

Procedia computer science 2023年 221卷 xv-xvii页

作者： Shi, Yong Filip, Florin G. He, Jing Li, Jianping Kou, Gang Tien, James Berg, Daniel Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Romanian Academy Calea Victoriei 125 Sector 1 Bucharest010071 Romania College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States University of Oxford United Kingdom School of Business Chengdu University Sichuan 610106 China College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

Perceptive self-supervised learning network for noisy image watermark removal

arXiv

引用

arXiv 2024年

作者： Tian, Chunwei Zheng, Menghua Li, Bo Zhang, Yanning Zhang, Shichao Zhang, David School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi’an710129 China School of Electronics and Information Northwestern Polytechnical University Xi’an710129 China School of Computer Science Northwestern Polytechnical University National Engineering Laboratory for Integrated AeroSpace-Ground-Ocean Big Data Application Technology Xi’an710129 China Guangxi Key Lab of Multisource Information Mining & Security College of Computer Science & Engineering Guangxi Normal University Guilin541004 China Shenzhen518172 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518172 China

Popular methods usually use a degradation model in a supervised way to learn a watermark removal model. However, it is true that reference images are difficult to obtain in the real world, as well as collected images by cameras suffer from noise. To overcome these drawbacks, we propose a perceptive self-supervised learning network for noisy image watermark removal (PSLNet) in this paper. PSLNet depends on a parallel network to remove noise and watermarks. The upper network uses task decomposition ideas to remove noise and watermarks in sequence. The lower network utilizes the degradation model idea to simultaneously remove noise and watermarks. Specifically, mentioned paired watermark images are obtained in a self-supervised way, and paired noisy images (i.e., noisy and reference images) are obtained in a supervised way. To enhance the clarity of obtained images, interacting two sub-networks and fusing obtained clean images are used to improve the effects of image watermark removal in terms of structural information and pixel enhancement. Taking into texture information account, a mixed loss uses obtained images and features to achieve a robust model of noisy image watermark removal. Comprehensive experiments show that our proposed method is very effective in comparison with popular convolutional neural networks (CNNs) for noisy image watermark removal. Codes can be obtained at https://***/hellloxiaotian/PSLNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved Honey Badger Algorithm for Electric Vehicle Charge Orderly Planning

Journal of Network Intelligence

引用

Journal of Network Intelligence 2022年第2期7卷 332-346页

作者： Chen, Ran-Fan Luo, Hao Huang, Kuan-Chun Nguyen, Trong-The Pan, Jeng-Shyang College of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China School of Aeronautics and Astronautics Zhejiang University HangZhou310000 China Department of Industrial and Systems Engineering Chung Yuan University Taoyuan320-33 Taiwan Multimedia Communications Lab VNUHCM-University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

Multiple electric vehicles simultaneously connected to a distribution load network will significantly impact the stability of the power grid. This paper proposes an improved Honey-badger algorithm (IHBA) through elite reverse learning, spiral update, and wild dog survival strategies to optimize the orderly charging of electric vehicles (EV). Objective functions of EV charge orderly planning are taken by using load fluctuation satisfaction, user cost satisfaction, and user convenience satisfaction to achieve the high efficiency of orderly charging. The benchmark test function and the electric vehicle se-quential charging problem were employed to evaluate the proposed IHBA approach. The obtained results are compared with the other algorithms in the literature, which indicate that the IHBA algorithm does not only provides more accurate outcome but better con-vergence speed than the other competitors. © 2022;Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Food products

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：