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

computing Open 2024年第2期computing-open卷

作者： Guanghong Deng Bing Yu Wenlong Jing Yong Li Xiaodan Zhao GuangDong Engineering Technology Research Center of UAV Remote Sensing Network Guangzhou iMapCloud Intelligent Technology Co. Ltd. Guangzhou 510095 P. R. China Guangdong Province Engineering Laboratory for Geographic Spatiotemporal Big Data Key Laboratory of Guangdong for Utilization of Remote Sensing and Geographical Information System Guangdong Open Laboratory of Geospatial Information Technology and Application Guangzhou Institute of Geography Guangdong Academy of Sciences Guangzhou 510070 P. R. China Foshan iMapCloud Intelligent Technology Co. Ltd. Foshan 528251 P. R. China

Medical image segmentation has always been a challenging task. This paper proposes a new LUneXt medical image segmentation model based on the characteristics analysis of medical image data sets and testing of different nonlinear activation units. Both normalized activations for the original negative input image activation have good optimization capabilities for the tokenization module parameters proposed in the original UneXt model. Using different activation coefficients for different foreground and background areas has achieved better results. The experimental results of this paper on the Breast Ultrasound Images (BUSI) data set reached an intersection over union (IoU) value of 62.64%, a Dice value of 76.12%, and a single inference speed of 807.57 ms. The experimental IoU value of the International Skin Imaging Collaboration (ISIC 2018) data set reached 82.95%, and the Dice value reached 90.50%. The single inference speed reached 842.58 ms. The LUneXt model is more robust than other models. While improving model performance, it does not introduce higher computational complexity and does not have a major impact on the processing speed of a single image.

关键词： Image segmentation medical images neural networks activation function

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Crowd Counting for Static Images: A Survey of Methodology

Crowd Counting for Static Images: A Survey of Methodology

引用

第三十九届中国控制会议

作者： Ying Luo Jinhu Lu Baochang Zhang School of Automation Science and Electrical Engineering Beihang University Shenyuan Honors College Beihang University School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environmentand Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang University

Crowd counting for static images is one of the typical application fields of image processing. it is essential to direct crowd analysis for public security purposes under the background of a rapidly growing social environment. Crowd counting for static images involves crucial challenges such as occlusions, scale variations, scene perspective distortions and diverse crowd distributions. It has now become an independent research hotspot. This paper investigates the literature of crowd counting tasks, summarizes the evolution of counting approaches, compares and analyzes traditional methods and current trends of CNN estimation-based counting, and then evaluates common datasets for crowd counting tasks. Conclusions concerning summarizations and prospects are made.

关键词： Crowd counting crowd analysis pattern recognition computer vision

来源：评论

学校读者我要写书评

暂无评论

PC-RGNN: Point cloud completion and graph neural network for 3D object detection

arXiv

引用

arXiv 2020年

作者： Zhang, Yanan Huang, Di Wang, Yunhong Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China

LiDAR-based 3D object detection is an important task for autonomous driving and current approaches suffer from sparse and partial point clouds of distant and occluded objects. In this paper, we propose a novel two-stage approach, namely PC-RGNN, dealing with such challenges by two specific solutions. On the one hand, we introduce a point cloud completion module to recover high-quality proposals of dense points and entire views with original structures preserved. On the other hand, a graph neural network module is designed, which comprehensively captures relations among points through a local-global attention mechanism as well as multi-scale graph based context aggregation, substantially strengthening encoded features. Extensive experiments on the KITTI benchmark show that the proposed approach outperforms the previous state-of-the-art baselines by remarkable margins, highlighting its effectiveness. Copyright © 2020, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cycle extendability of hamiltonian strongly chordal graphs

arXiv

引用

arXiv 2020年

作者： Rong, Guozhen Li, Wenjun Wang, Jianxin Yang, Yongjie School of Computer Science and Engineering Central South University Changsha China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China Faculty of Human and Business Sciences Saarland University Saarbrücken Germany

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 2-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer k such that all k-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry’s is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle extendable graphs two more graph classes, namely, Hamiltonian 4-FAN-free chordal graphs where every induced K5 − e has true twins, and Hamiltonian {4-FAN, A}-free chordal graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Throughput Maximization for UAV-Enabled data Collection

Throughput Maximization for UAV-Enabled Data Collection

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Junchao Gong Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China

ISBN: (数字)9781728199160

ISBN: (纸本)9781728192369

In this paper, we consider a scenario where an unmanned aerial vehicle (UAV) collects data from a set of nodes placed on a two-dimensional (2-D) plane. The UAV flies along a given line to collect data. To prevent transmission collisions, only one node is allowed to transmit data to the UAV at any time, and the number of nodes that can transmit data to the UAV cannot exceed a specified number to avoid frequent switches. The problem is to select a subset of nodes and schedule their transmission time to maximize the UAV's throughput. After formulating the problem, we find that it is difficult to solve due to mixture of real variables and integer variables. We then propose to decompose the problem into subproblems, and give a polynomial time algorithm to solve each subproblem to optimality. We then get an exact algorithm by solving all subproblems. Unfortunately, due to an exponential number of subproblems, the overall running time is exponential with respect to the input size. We then propose two polynomial-time suboptimal algorithms to solve the problem, both of which explore a polynomial number of subproblems. Simulations show that the suboptimal algorithms perform comparably with the exponential-time exact algorithm, while the running time is much smaller.

关键词： Schedules Heuristic algorithms Two dimensional displays data collection Throughput Unmanned aerial vehicles Sensors

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Kernel Inversed Pyramidal Resizing Network for Efficient Pavement Distress Recognition

arXiv

引用

arXiv 2022年

作者： Qin, Rong Huangfu, Luwen Hood, Devon Ma, James Huang, Sheng School of Big Data & Software Engineering Chongqing University Chongqing400044 China Fowler College of Business San Diego State University San DiegoCA92182 United States Center for Human Dynamics in the Mobile Age San Diego State University San DiegoCA92182 United States College of Science San Diego State University San DiegoCA92182 United States Department of Business Analysis University of Colorado Colorado SpringsCO80918 United States Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Chongqing400044 China

Pavement Distress Recognition (PDR) is an important step in pavement inspection and can be powered by image-based automation to expedite the process and reduce labor costs. Pavement images are often in high-resolution with a low ratio of distressed to non-distressed areas. Advanced approaches leverage these properties via dividing images into patches and explore discriminative features in the scale space. However, these approaches usually suffer from information loss during image resizing and low efficiency due to complex learning frameworks. In this paper, we propose a novel and efficient method for PDR. A light network named the Kernel Inversed Pyramidal Resizing Network (KIPRN) is introduced for image resizing, and can be flexibly plugged into the image classification network as a pre-network to exploit resolution and scale information. In KIPRN, pyramidal convolution and kernel inversed convolution are specifically designed to mine discriminative information across different feature granularities and scales. The mined information is passed along to the resized images to yield an informative image pyramid to assist the image classification network for PDR. We applied our method to three well-known Convolutional Neural Networks (CNNs), and conducted an evaluation on a large-scale pavement image dataset named CQU-BPDD. Extensive results demonstrate that KIPRN can generally improve the pavement distress recognition of these CNN models and show that the simple combination of KIPRN and EfficientNetB3 significantly outperforms the state-of-the-art patch-based method in both performance and efficiency. © 2022, CC BY-NC-SA.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：