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

Application of graph-curvature features in computer-aided diagnosis for histopathological image identification of gastric cancer

引用

Intelligent Medicine 2024年第3期4卷 141-152页

作者： Ruilin He Chen Li Xinyi Yang Jinzhu Yang Tao Jiang Marcin Grzegorzek Hongzan Sun Microscopic Image and Medical Image Analysis Group College of Medicine and Biological Information EngineeringNortheastern UniversityShenyangLiaoning 110016China Key Laboratory of Intelligent Computing in Medical Image Ministry of EducationNortheastern UniversityShenyangLiaoning 110016China School of Intelligent Medicine Chengdu University of Traditional Chinese MedicineChengduSichuan 610075China International Joint Institute of Robotics and Intelligent Systems Chengdu University of Information TechnologyChengduSichuan 610225China Institute for Medical Informatics University of LuebeckLuebeckGermany Department of Knowledge Engineering University of Economics in KatowiceKatowicePoland Shengjing Hospital of China Medical University ShenyangLiaoning 110136China

Background Histopathology diagnosis is often regarded as the final diagnostic method for malignant tumors;however,it has some *** study explored a computer-aided diagnostic method that can be used to identify benign and malignant gastric cancer using histopathological *** The most suitable process was selected through multiple experiments by comparing multiple meth-ods and features for ***,the U-net was applied to segment the ***,the nucleus was extracted from the segmented image,and the minimum spanning tree(MST)diagram structure that can cap-ture the topological information was *** third step was to extract the graph-curvature features of the histopathological image according to the MST ***,by inputting the graph-curvature features into the classifier,the recognition results for benign or malignant cancer can be *** During the experiment,we used various methods for *** the image segmentation stage,U-net,watershed algorithm,and Otsu threshold segmentation methods were *** found that the U-net method,combined with multiple indicators,was the most suitable for segmentation of histopathological *** the feature extraction stage,in addition to extracting graph-edge and graph-curvature features,several basic im-age features were extracted,including the red,green and blue feature,gray-level co-occurrence matrix feature,histogram of oriented gradient feature,and local binary pattern *** the classifier design stage,we exper-imented with various methods,such as support vector machine(SVM),random forest,artificial neural network,K nearest neighbors,VGG-16,and *** comparison and analysis,it was found that classifica-tion results with an accuracy of 98.57%can be obtained by inputting the graph-curvature feature into the SVM classifier.

关键词： Gastric cancer Graph-curvature feature Image identification

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Self-Learning Evolutionary Neural Architecture Search

SSRN

引用

SSRN 2023年

作者： Qiu, Zhengzhong Bi, Wei Xu, Dong Guo, Hua Ge, Hongwei Liang, Yanchun Lee, Heow Pueh Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun130012 China YGSOFT INC Guangdong Zhuhai519085 China Department of Electrical Engineering and Computer Science Informatics Institute Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States College of Computer Science and Technology Dalian University of Technology Liaoning Dalian116081 China School of Computer Science Zhuhai College of Science and Technology Guangdong Zhuhai519041 China Department of Mechanical Engineering National University of Singapore 9 Engineering Drive 1 117575 Singapore

The evolutionary algorithm has become a major method for neural architecture search recently. However, the fixed probability distribution adopted by the traditional evolutionary algorithm makes the algorithm unable to control the increase or decrease of the individual architecture size and thus cannot guarantee the lightweight and inference efficiency of the candidate architecture. In addition, the existing approaches cannot learn the optimal sampling probability distribution relevant to the specific problem from the empirical information accumulated through the search process. What’s more, the algorithm needs to evaluate the performance of all the individual architectures, which requires huge computing resources and time overhead. To overcome these problems and challenges, an Efficient Self-learning Evolutionary Neural Architecture Search method, called ESE-NAS, is presented in this paper. Firstly, we propose a Model Size Control module, which generates the probability distribution for sampling the type of mutation operators according to the current model size, so as to control both the node number of network architecture and the sparsity of links, therefore ensuring that neural architectures can remain compact and efficient as they evolve. Thereafter, a Mutation Candidate Credit Assignment method is proposed, which enables the algorithm to dynamically adjust the probability distribution for available types of node operations and directed links according to the empirical information from individuals’ performance evaluation, which can guide the evolutionary direction of neural architecture and shorten the first hitting time of the optimal architecture. Finally, a neural architecture performance predictor is formulated, and the accuracy of each individual architecture is predicted by using the simplified input features, to further improve the efficiency of neural architecture search. Experiments show that the ESE-NAS method proposed in this paper can learn a highly i

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: Multiple similarly effective solutions exist for biomedical feature selection and classification problems

引用

Scientific reports 2018年第1期8卷 4218页

作者： Jiamei Liu Cheng Xu Weifeng Yang Yayun Shu Weiwei Zheng Fengfeng Zhou College of Software Jilin University Changchun Jilin 130012 China. College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. College of Software Jilin University Changchun Jilin 130012 China. FengfengZhou@***. College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. FengfengZhou@***.

A correction to this article has been published and is linked from the HTML and PDF versions of this paper. The error has been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Multiple similarly effective solutions exist for biomedical feature selection and classification problems

引用

Scientific reports 2018年第1期8卷 838页

作者： Jiamei Liu Cheng Xu Weifeng Yang Yayun Shu Weiwei Zheng Fengfeng Zhou College of Software Jilin University Changchun Jilin 130012 China. College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. College of Software Jilin University Changchun Jilin 130012 China. fengfengzhou@***. College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. fengfengzhou@***.

A correction to this article has been published and is linked from the HTML version of this paper. The error has been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Localization algorithm based on optimal nodes for wireless sensor networks

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2011年第SUPPL. 1期41卷 208-214页

作者： Shen, Xuan-Jing Li, Cheng-Yue Wang, Shuo Qian, Qing-Ji College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Unit 89 The Chinese People's Liberation Army 95900 Troops Kaifeng 475003 China College of Physics Jilin University Changchun 130015 China

Because of restricted energy of the sensor nodes, the location error, costs of communication and computation should be considered in localization algorithms. The DV-Hop algorithm was detailedly analyzed and the main reasons for the error were pointed out, aiming at the different position anchor nodes' effect on location error, a novel localization algorithm called DV-Hop_Bon (DV-Hop based on optimal nodes) based on optimal nodes was put forward. Finally, it was simulated on Matlab, the results of the simulation show that the novel localization algorithm improves the localization precision with a short communication radius. Therefore it can be applied to wireless sensor networks widely.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Adaptive Structure-Constrained Robust Latent Low-Rank Coding for Image Recovery

Adaptive Structure-Constrained Robust Latent Low-Rank Coding...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Zhao Zhang Lei Wang Sheng Li Yang Wang Zheng Zhang Zhengjun Zha Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University of Georgia Athens GA Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2, 1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-shot learning based histopathological image classification of colorectal cancer

引用

Intelligent Medicine 2024年第4期4卷 256-267页

作者： Rui Li Xiaoyan Li Hongzan Sun Jinzhu Yang Md Rahaman Marcin Grzegozek Tao Jiang Xinyu Huang Chen Li Key Laboratory of Intelligent Computing in Medical Image Ministry of EducationNortheastern UniversityShenyangLiaoning 110167China Cancer Hospital China Medical UniversityShenyangLiaoning 110122China Shengjing Hospital China Medical UniversityShenyang.Liaoning 110000China Institute for Medical Informatics University of LuebeckGermany Department of Knowledge Engineering University of Economics in KatowicePoland School of Intelligent Medicine Chengdu University of Traditional Chinese MedicineChengduSichuan 610075China International Joint Institute of Robotics and Intelligent Systems Chengdu University of Information TechnologyChengduSichuan 610225China School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

Background Colorectal cancer is a prevalent and deadly disease worldwide,posing significant diagnostic *** histopathologic image classification is often inefficient and *** some histopathologists use computer-aided diagnosis to improve efficiency,these methods depend heavily on exten-sive data and specific annotations,limiting their *** address these challenges,this paper proposes a method based on few-shot *** This study introduced a few-shot learning approach that combines transfer learning and contrastive learning to classify colorectal cancer histopathology images into benign and malignant *** model comprises modules for feature extraction,dimensionality reduction,and classification,trained using a combi-nation of contrast loss and cross-entropy *** this paper,we detailed the setup of hyperparameters:n-way,κ-shot,β,and the creation of support,query,and test *** Our method achieved over 98% accuracy on a query dataset with 35 samples per category using only 10 training samples per *** documented the model’s loss,accuracy,and the confusion matrix of the ***,we employed the t-SNE algorithm to analyze and assess the model’s classification *** The proposed model may demonstrate significant advantages in accuracy and minimal data depen-dency,performing robustly across all tested n-way,κ-shot *** consistently achieved over 93% accuracy on comprehensive test datasets,including 1916 samples,confirming its high classification accuracy and strong generalization *** research could advance the use of few-shot learning in medical diagnostics and also lays the groundwork for extending it to deal with rare,difficult-to-diagnose cases.

关键词： Colorectal cancer Few-shot learning Transfer learning Contrastive learning Histopathological images Benign and malignant categories

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm-enabled Collaborative Secure Relay Communications with Time-domain Colluding Eavesdropper

arXiv

引用

arXiv 2023年

作者： Zhang, Chuang Sun, Geng Wu, Qingqing Li, Jiahui Liang, Shuang Niyato, Dusit Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China Pillar of Engineering Systems and Design Singapore University of Technology and Design 487372 Singapore The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) as aerial relays are practically appealing for assisting Internet of Things (IoT) network. In this work, we aim to utilize the UAV swarm to assist the secure communication between the micro base station (MBS) equipped with the planar array antenna (PAA) and the IoT terminal devices by collaborative beamforming (CB), so as to counteract the effects of collusive eavesdropping attacks in time-domain. Specifically, we formulate a UAV swarm-enabled secure relay multi-objective optimization problem (US2RMOP) for simultaneously maximizing the achievable sum rate of associated IoT terminal devices, minimizing the achievable sum rate of the eavesdropper and minimizing the energy consumption of UAV swarm, by jointly optimizing the excitation current weights of both MBS and UAV swarm, the selection of the UAV receiver, the position of UAVs and user association order of IoT terminal devices. Furthermore, the formulated US2RMOP is proved to be a non-convex, NP-hard and large-scale optimization problem. Therefore, we propose an improved multi-objective grasshopper algorithm (IMOGOA) with some specific designs to address the problem. Simulation results exhibit the effectiveness of the proposed UAV swarm-enabled collaborative secure relay strategy and demonstrate the superiority of IMOGOA. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：