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

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

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria consensus sorting model with flexible linguistic preferences based on fuzzy information granulation from the perspective of preference disaggregation

引用

Engineering Applications of Artificial Intelligence 2025年 154卷

作者： Zhang, Shiji Zhang, Shitao Tian, Hao Deveci, Muhammet Liu, Xiaodi School of Microelectronics and Data Science Anhui University of Technology Ma'anshan243032 China Key Laboratory of Multidisciplinary Management and Control of Complex Systems of Anhui Higher Education Institutes Anhui University of Technology Ma'anshan243002 China Anhui Provincial Joint Key Laboratory of Disciplines for Industrial Big Data Analysis and Intelligent Decision Ma'anshan243032 China Department of Industrial Engineering Turkish Naval Academy National Defence University Tuzla Istanbul34942 Turkey The Bartlett School of Sustainable Construction University College London LondonWC1E 6BT United Kingdom Department of Information Technologies Western Caspian University Baku1001 Azerbaijan

Multi-criteria group sorting (MCGS) that considers linguistic preferences involves multiple individuals evaluating alternatives and assigning them to pre-determined ordered categories based on specific criteria. Nevertheless, due to the limited availability of class information and the constrained cognitive capacity of decision-makers (DMs), it becomes challenging for DMs to furnish explicit preference information to reach consensus. Besides, decision parameters such as consensus threshold and class thresholds are also too hard to be assumed in advance. Therefore, this paper studies the preference disaggregation problem in MCGS, in which DMs are allowed to provide their pairwise comparisons in flexible linguistic expressions (FLEs) as preference information. To more fully utilize the preferences, semantic granulation is introduced. First, an individual consistency recognition model is proposed to identify inconsistent preferences and provide modification directions to the corresponding individuals. Next, semantic granulation and maximum entropy are combined into a granulation-driven information transformation model to convert the preference information based on FLEs into triangular fuzzy numbers (TFNs). Subsequently, in the consensus-driven preference disaggregation model, decision parameters and sorting results can be obtained at the premise of consensus by adjusting weights. Ultimately, to substantiate the effectiveness of the proposal, two numerical applications concerning the sorting of government venture capitals and information system suppliers are presented, along with comparative analysis, sensitivity analysis, and simulation analysis. © 2025 The Authors

关键词： Information granules

来源：评论

学校读者我要写书评

暂无评论

AI-GENERATED CONTENT ENHANCED COMPUTER-AIDED DIAGNOSIS MODEL FOR THYROID NODULES: A CHATGPT-STYLE ASSISTANT

arXiv

引用

arXiv 2024年

作者： Yao, Jincao Wang, Yunpeng Lei, Zhikai Wang, Kai Li, Xiaoxian Zhou, Jianhua Hao, Xiang Shen, Jiafei Wang, Zhenping Ru, Rongrong Chen, Yaqing Zhou, Yahan Chen, Chen Zhang, Yanming Liang, Ping Xu, Dong Department of Radiology Zhejiang Cancer Hospital Hangzhou310022 China Chinese Academy of Sciences Hangzhou310000 China Key Laboratory of Head & Neck Cancer Translational Research of Zhejiang Province Hangzhou310022 China Zhejiang Provincial Research Center for Cancer Intelligent Diagnosis and Molecular Technology Hangzhou310000 China Wenling Medical Big Data and Artificial Intelligence Research Institute 24th Floor Machang Road Taizhou310061 China Taizhou317502 China College of Optical Science and Engineering Zhejiang University No.38 of Zheda Road Zhejiang Province Hangzhou China Zhejiang Provincial Hospital of Chinese Medicine 54 Youdian Road Hangzhou310003 China Department of Ultrasound The Affiliated Dongyang Hospital of Wenzhou Medical University Dongyang322100 China Department of Ultrasound Sun Yat-sen University Cancer Center State Key Laboratory of Oncology in South China Collaborative Innovation Center for Cancer Medicine Guangzhou510060 China Affiliated Xiaoshan Hospital Hangzhou Normal University No.728 North Yucai Road Hangzhou311202 China Zhejiang Provincial People's Hospital Affiliated People's Hospital Hangzhou Medical College Hangzhou314408 China Key Laboratory of Endocrine Gland Diseases of Zhejiang Province Hangzhou314408 China Department of Ultrasound Chinese PLA General Hospital Chinese PLA Medical School Beijing100853 China

An artificial intelligence-generated content-enhanced computer-aided diagnosis (AIGC-CAD) model, designated as ThyGPT, has been developed. This model, inspired by the architecture of ChatGPT, could assist radiologists in assessing the risk of thyroid nodules through semantic-level human-machine interaction. A dataset comprising 19,165 thyroid nodule ultrasound cases from Zhejiang Cancer Hospital was assembled to facilitate the training and validation of the model. After training, ThyGPT could automatically evaluate thyroid nodule and engage in effective communication with physicians through human-computer interaction. The performance of ThyGPT was rigorously quantified using established metrics such as the receiver operating characteristic (ROC) curve, area under the curve (AUC), sensitivity, and specificity. The empirical findings revealed that radiologists, when supplemented with ThyGPT, markedly surpassed the diagnostic acumen of their peers utilizing traditional methods as well as the performance of the model in isolation. These findings suggest that AIGC-CAD systems, exemplified by ThyGPT, hold the promise to fundamentally transform the diagnostic workflows of radiologists in forthcoming years. Copyright © 2024, The Authors. All rights reserved.

关键词： Computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

One for Multiple: Physics-informed Synthetic data Boosts Generalizable Deep Learning for Fast MRI Reconstruction

arXiv

引用

arXiv 2023年

作者： Wang, Zi Yu, Xiaotong Wang, Chengyan Chen, Weibo Wang, Jiazheng Chu, Ying-Hua Sun, Hongwei Li, Rushuai Li, Peiyong Yang, Fan Han, Haiwei Kang, Taishan Lin, Jianzhong Yang, Chen Chang, Shufu Shi, Zhang Hua, Sha Li, Yan Hu, Juan Zhu, Liuhong Zhou, Jianjun Lin, Meijing Guo, Jiefeng Cai, Congbo Chen, Zhong Guo, Di Yang, Guang Qu, Xiaobo Department of Electronic Science Intelligent Medical Imaging R&D Center Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Xiamen University China Human Phenome Institute Fudan University China Philips Healthcare China Siemens Healthineers Ltd. China United Imaging Research Institute of Intelligent Imaging China Department of Nuclear Medicine Nanjing First Hospital China Shandong Aoxin Medical Technology Company China Department of Radiology The First Affiliated Hospital of Xiamen University China Department of Radiology Zhongshan Hospital Affiliated to Xiamen University China China Department of Cardiology Shanghai Institute of Cardiovascular Diseases Zhongshan Hospital Fudan University China Department of Radiology Zhongshan Hospital Fudan University China Department of Cardiovascular Medicine Heart Failure Center Ruijin Hospital Lu Wan Branch Shanghai Jiaotong University School of Medicine China Department of Radiology Ruijin Hospital Shanghai Jiaotong University School of Medicine China Medical Imaging Department The First Affiliated Hospital of Kunming Medical University China Xiamen Key Laboratory of Clinical Transformation of Imaging Big Data and Artificial Intelligence China Department of Applied Marine Physics and Engineering Xiamen University China Department of Microelectronics and Integrated Circuit Xiamen University China School of Computer and Information Engineering Xiamen University of Technology China Department of Bioengineering Imperial College London United Kingdom

Magnetic resonance imaging (MRI) is a widely used radiological modality renowned for its radiation-free, comprehensive insights into the human body, facilitating medical diagnoses. However, the drawback of prolonged scan times hinders its accessibility. The k-space undersampling offers a solution, yet the resultant artifacts necessitate meticulous removal during image reconstruction. Although Deep Learning (DL) has proven effective for fast MRI image reconstruction, its broader applicability across various imaging scenarios has been constrained. Challenges include the high cost and privacy restrictions associated with acquiring large-scale, diverse training data, coupled with the inherent difficulty of addressing mismatches between training and target data in existing DL methodologies. Here, we present a novel Physics-Informed Synthetic data learning framework for Fast MRI, called PISF. PISF marks a breakthrough by enabling generalized DL for multi-scenario MRI reconstruction through a single trained model. Our approach separates the reconstruction of a 2D image into many 1D basic problems, commencing with 1D data synthesis to facilitate generalization. We demonstrate that training DL models on synthetic data, coupled with enhanced learning techniques, yields in vivo MRI reconstructions comparable to or surpassing those of models trained on matched realistic datasets, reducing the reliance on real-world MRI data by up to 96%. Additionally, PISF exhibits remarkable generalizability across multiple vendors and imaging centers. Its adaptability to diverse patient populations has been validated through evaluations by ten experienced medical professionals. PISF presents a feasible and cost-effective way to significantly boost the widespread adoption of DL in various fast MRI applications. Importantly, it alleviates the ethical and practical challenges associated with in vivo human data acquisitions, opening new horizons for advancing fast MRI technologies. Copyright © 20

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

CROA: A content-based recommendation optimization algorithm for personalized knowledge services 21

CROA: A content-based recommendation optimization algorithm ...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Non-structured Pruning for Deep-learning based Steganalytic Frameworks

Non-structured Pruning for Deep-learning based Steganalytic ...

引用

Annual Summit and Conference of the Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA ASC)

作者： Li, Qiushi Shao, Zilong Tan, Shunquan Zeng, Jishen Li, Bin Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Peoples R China Shenzhen Univ Coll Elect & Informat Engn Shenzhen Peoples R China Shenzhen Inst Artificial Intelligence & Robot Soc Shenzhen Key Lab Media Secur Guangdong Key Lab Intelligent Informat Proc Natl Engn Lab Big Data Syst Comp Technol Shenzhen 518060 Peoples R China

ISBN: (纸本)9781728132488

Image steganalysis aims to discriminate innocent cover images and those suspected stego images embedded with secret message. Recently, increasing advanced deep neural networks have been proposed and used in image steganalysis. Though those deep learning models can gain superior performance, they also result in redundancy of computational resource and memory storage. In this paper, we apply a non-structured pruning method to prune XuNet2 and SRNet - the two state-of-the-art deep-learning framework in the field of JPEG image steganalysis. We obtain the priorities of the connections among neurons according to a certain criterion, then keep those significant weights and prune those nonsignificant ones in the meantime. We have conducted extensive experiments on BOSSBase and BOWS image dataset. The experimental results demonstrate that our proposed non-structured pruning method can significantly reduce the cost of computation and storage required by the original deep-learning frameworks without affecting their detection accuracy.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

An optimal profit route planning scheme based on ACO-OPP 21

An optimal profit route planning scheme based on ACO-OPP

引用

作者： Qiu, Yuhua Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Taxi plays an important role of urban public transportation system. However, without appropriate route planning scheme, taxi drivers can only choose to wait or seek passengers in the absence of orders, leading to wasting a lot of time and fuel. In this paper, an optimal profit route planning scheme for taxi drivers with Ant Colony Optimization Algorithm based on Optimal Profit Points (ACO-OPP) is proposed. First, the taxi trajectory data are preprocessed and the pick-up and drop-off points are extracted to obtain high-quality data;second, the data spatiotemporal distribution is analyzed to plan a more appropriate and rational route;the clustering algorithm is used to obtain the optimal profit points to increase the occupancy rate of taxis;then, ACO-OPP is utilized to plan the profit routes for each taxi. A series of experiments are implemented based on the real taxi trajectory dataset to test and compare the performance of the simulated annealing algorithm, the genetic algorithm, the ant colony algorithm and ACO-OPP on the optimal route length and the profitability with the unit time profit function. The experimental results show that ACO-OPP has the shortest optimal route length and the best profit per unit time. © 2019 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Bilinear Semi-Tensor Product Attention (BSTPA) model for visual question answering

Bilinear Semi-Tensor Product Attention (BSTPA) model for vis...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zongwen Bai Ying Li Meili Zhou Di Li Dong Wang Dawid Połap Marcin Woźniak School of Computer Science Northwestern Polytechnical University Xi’an CHINA Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yan’an CHINA School of Physics and Electronic Information Yan’an University Yan’an CHINA Faculty of Applied Mathematics Silesian University of Technology Gliwice POLAND

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

We propose a semi-tensor product attention network model as a visual question answering tool for complex interaction over image features. Proposed model performs matrix multiplication of two arbitrary dimensions, which is used to overcome possible dimensional limitations and improve recognition flexibility. In used block-wise operation we preserve spatial and temporal information but reduce the number of parameters by using low-rank pooling scheme. Applied BERT pre-train model is tuned to recognize question features. The proposed model is evaluated on the VQA2.0 dataset. Research results show that our model has good accuracy and easy reconfiguration for future research.

关键词： Feature extraction Visualization Knowledge discovery Cognition Task analysis Computational modeling Bit error rate

来源：评论

学校读者我要写书评

暂无评论

A Diverse Biases Non-negative Latent Factorization of Tensors Model for Dynamic Network Link Prediction

A Diverse Biases Non-negative Latent Factorization of Tensor...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Xuke Wu Hang Gou Hao Wu Juan Wang Minzhi Chen Siyu Lai Computer School China West Normal University Nanchong China Computer School of China West Normal University Nanchong Sichuan China University of Chinese Academy of Sciences Beijing China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China North Sichuan Medical College Nanchong China Medical College Nanchong Sichuan China

ISBN: (数字)9781728168555

ISBN: (纸本)9781728168562

Dynamic networks vary over time, making it vital to capture networks temporal patterns for predicting missing links with high accuracy. A biased non-negative latent factorization of tensors (BNLFT) model is very effective in extracting such patterns from dynamic data. However, a BNLFT model only integrates single bias, which cannot adequately represents the volatility of the dynamic data. To address this issue, this paper presents a Diverse Biases Non-negative Latent Factorization of Tensors (DBNT) model for accurate prediction of missing links in dynamic networks. Meanwhile, for further prediction accuracy improvement, the preprocessing bias is integrated into the DBNT model. Empirical studies on two dynamic networks datasets from real applications show that compared with state of the art predictors, a DBNT model achieves higher prediction accuracy.

关键词： Tensors Conferences Predictive models data models Sensors data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：