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

Automatic detection of pneumonia in chest X-ray images using cooperative convolutional neural networks 1

2nd Chinese Conference on Pattern Recognition and Computer Vision, PRCV 2019

作者： Wang, Kun Zhang, Xiaohong Huang, Sheng Chen, Feiyu School of Big Data and Software Engineering Chongqing University Chongqing401331 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing400044 China

ISBN: (数字)9783030317232

ISBN: (纸本)9783030317225

Chest X-ray images are currently the best available visual media for diagnosing pneumonia, which plays a crucial role in clinical care. Medical images diagnosing can be error-prone for inexperienced radiologists, while tedious and time-consuming for experienced radiologists. To address these issues, we study automatically detect pneumonia in Chest X-ray images. However, this task exists several challenges. First, abnormal regions of pneumonia are difficult to identify due to the noise interference from other tissue and lesions. Second, the features of lung regions are usually essential information for diagnosis. With the pneumonia disease happens in lung areas, only training CNNs using global image may be affected by the irrelevant noisy regions. Third, the appearance of pneumonia in X-ray images is often vague, can overlap with other diagnoses. To cope with these challenges, we first introduce a lung segmentation network, which segments the lung from the original images. Then, develop a feature extraction model, which incorporates global and local features for pneumonia classification. Finally, build a cooperative learning framework, which merges bounding boxes (localization of pneu-monia) from two cooperative models. We demonstrate the effectiveness of our proposed methods on the Kaggles RSNA Pneumonia Detection Challenge dataset and reaches excellent performance with the level of the top 1% in this competition. © Springer Nature Switzerland AG 2019.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Fed-GAN: Federated Generative Adversarial Network with Privacy-Preserving for Cross-Device Scenarios

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Han, Song Ding, Hongxin Zhao, Shuai Ren, Siqi Zeng, Shengke Xue, Mengqi Wang, Ruili Hangzhou City University School of Computer and Computing Science Hangzhou China Zhejiang Gongshang University School of Computer Science and Technology China Zhejiang Key Laboratory of Big Data and Future E-Commerce Technology Hangzhou China Xihua University School of Computer and Software Engineering Chengdu China Massey University School of Mathematical and Computational Science Auckland New Zealand

Huge amounts of data from various sources are substantial to dependable distributed machine learning, especially for trustworthy federated learning (FL). However, existing FL methods are difficult to collect enough data for training the global model more accurately, especially in cross-device scenarios. In this paper, we propose a new federated generative adversarial network empowered by differential privacy and knowledge transfer named Fed-GAN, which can be used to address the problem of data shortage and prevent generator leakage from resource-constrained devices, as well as generate high-quality synthetic data while ensuring strict DP guarantees. Different from other generative model methods, our Fed-GAN framework can achieve efficient and secure generative model training and limited permission for resource-constrained devices to prevent them from leaking or misusing the generator. In addition, we propose a pHash-KT method for our Fed-GAN framework, which selects potentially high-quality data through the knowledge of each client for improving the utility of synthetic data. Our FedGAN framework satisfies (Formula presented)-DP, and also has high resistance when number of adversaries is 10%-70% of the total number of clients. Extensive experiments demonstrate that our Fed-GAN framework not only generates high-quality synthetic data, but also provides strict DP guarantees, compared with other generative model methods. © 2004-2012 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Gait Recognition Method Based on the Combination of Human Body Posture and Human Body Contour

A Gait Recognition Method Based on the Combination of Human ...

引用

作者： Yue Ma Chenghao Wei Hao Long Key Laboratory of Impression Evidence Examination and Identification Technology(Criminal Investigation Police University of China) Ministry of Public Security Big Data Institute College of Computer Science and Software EngineeringShenzhen University

Aiming at the issues that affect the gait recognition, such as outfit changes and carryon-objects during gait recognition, this paper proposes a gait recognition method based on the improved GaitSet network, which relies on the fusion of human posture and human contour. This method introduces key points of human posture, and improves the precision of human contour extraction by introducing the key points of human posture. At the same time, the human posture map composed of the key points of human posture is used as the synchronous attribute of the contour map to extract gait features. Because key points focus on the inherent walking characteristics of human body, they are not affected by the external information such as clothing and carrying objects. Combined with the rich gait change attributes of human contour, it can effectively improve the accuracy and robustness of the gait recognition model. In scenes of human body wearing coats, our experimental results show that the accuracy of the proposed method in CASIA-B gait data set and self-built database can reach over 73.5% accuracy.

关键词： A Gait Recognition Method Based on the Combination of Human Body Posture and Human Body Contour

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of “Certificateless remote data integrity checking using lattices in cloud storage”

Cryptanalysis of “Certificateless remote data integrity che...

引用

International Conference on Information Science and Technology (ICIST)

作者： Caihui Lan Haifeng Li Caifen Wang School of Electronic and Information Engineering Lanzhou City University Lanzhou China School of Software Dalian University of Technology Dalian China College of Big Data and Internet Shenzhen Technology University Shenzhen China

ISBN: (数字)9781728155586

ISBN: (纸本)9781728155593

C. Sasikala et al.'s proposed a certificateless RDIC protocol to audit the outsourced data without the requirement of PKI infrastructure and against quantum computer attacks. They argue the RDIC is correct and possesses desired security properties. However, through cryptoanalysis technique we find that their scheme is neither correct nor secure against two common attacks, that is, signature forgery attack from the malicious cloud service provider (CSP) and public key replacement attack from the curious private key generator (PKG) and other malicious users. Furthermore, we remark that their RDIC is not a rigorous certificateless protocol.

关键词： Cloud computing Protocols Public key cryptography Lattices

来源：评论

学校读者我要写书评

暂无评论

C olumnSGD: A Column-oriented Framework for Distributed Stochastic Gradient Descent

C olumnSGD: A Column-oriented Framework for Distributed Stoc...

引用

International Conference on data engineering

作者： Zhipeng Zhang Wentao Wu Jiawei Jiang Lele Yu Bin Cui Ce Zhang School of EECS & Key Laboratory of High Confidence Software Technologies (MOE) Peking University Microsoft Research Redmond USA ETH Zurich Switzerland Tencent Inc Center for Data Science Peking University & National Engineering Laboratory for Big Data Analysis and Applications

ISBN: (数字)9781728129037

ISBN: (纸本)9781728129044

Distributed machine learning (ML) has triggered tremendous research interest in recent years. Stochastic gradient descent (SGD) is one of the most popular algorithms for training ML models, and has been implemented in almost all distributed ML systems, such as Spark MLlib, Petuum, MXNet, and TensorFlow. However, current implementations often incur huge communication and memory overheads when it comes to large models. One important reason for this inefficiency is the row-oriented scheme (RowSGD) that existing systems use to partition the training data, which forces them to adopt a centralized model management strategy that leads to vast amount of data exchange over the network. We propose a novel, column-oriented scheme (ColumnSGD) that partitions training data by columns rather than by rows. As a result, ML model can be partitioned by columns as well, leading to a distributed configuration where individual data and model partitions can be collocated on the same machine. Following this locality property, we develop a simple yet powerful computation framework that significantly reduces communication overheads and memory footprints compared to RowSGD, for large-scale ML models such as generalized linear models (GLMs) and factorization machines (FMs). We implement ColumnSGD on top of Apache Spark, and study its performance both analytically and experimentally. Experimental results on both public and real-world datasets show that ColumnSGD is up to 930× faster than MLlib, 63× faster than Petuum, and 14× faster than MXNet.

关键词： Conferences data engineering Radio frequency

来源：评论

学校读者我要写书评

暂无评论

software Defect Prediction via Deep Belief Network

引用

Chinese Journal of Electronics 2019年第5期28卷 925-932页

作者： WEI Hua SHAN Chun HU Changzhen ZHANG Yu YU Xiao School of Computer Science and Technology Beijing Institute of Technology China Information Technology Security Evaluation Center Beijing Key Laboratory of Software Security Engineering Technology Beijing Institute of Technology School of Electrical and Information Engineering and Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture State Key Laboratory in China for Geomechanics and Deep Underground Engineering (Beijing) China University of Mining and Technology School of Computer Science and Technology Shandong University of Technology

Defect distribution prediction is a meaningful topic because software defects are the fundamental cause of many attacks and data loss. Building accurate prediction models can help developers find bugs and prioritize their testing efforts. Previous researches focus on exploring different machine learning algorithms based on the features that encode the characteristics of *** problem of data redundancy exists in software defect data set, which has great influence on prediction *** propose a defect distribution prediction model(Deep belief network prediction model, DBNPM), a system for detecting whether a program module contains defects. The key insight of DBNPM is Deep belief network(DBN)technology, which is an effective deep learning technique in image processing and natural language processing,whose features are similar to defects in source *** results show that DBNPM can efficiently extract and process the data characteristics of source program and the performance is better than Support vector machine(SVM), Locally linear embedding SVM(LLE-SVM), and Neighborhood preserving embedding SVM(NPE-SVM).

关键词： Defect prediction software security Deep belief network(DBN)

来源：评论

学校读者我要写书评

暂无评论

Budgeted Persuasion on User Opinions via Varying Susceptibility

Budgeted Persuasion on User Opinions via Varying Susceptibil...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Wenyi Tang Xinrui Xu Guangchun Luo Zaobo He Kaiming Zhan School of Computer Science and Engineering University of Electronic Science and Technology of China School of Information and Software Engineering University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Miami University Sichuan Jiuyuan Yinhai Software Co. Ltd

ISBN: (数字)9781728198293

ISBN: (纸本)9781728198309

Nowadays, the social network becomes an indispensable part of people's daily life, meanwhile offers an unprecedentedly convenient access for purposive individuals to influence the opinions of network users. Current studies present a subtle persuasion approach that finds a number of key users meanwhile varies their susceptibility extent to impact the public opinion. Such persuasion is significantly critical for public security, as it could facilitate both the spreading and dispelling of malicious rumors. However, the major body of these studies enclose impractical assumptions, such that persuaders have an unlimited budget, or the costs of varying different users' susceptibilities are the same, thus rendering these works unsuitable for realistic scenarios. Therefore, this work originally proposes a more practical and generalized problem of persuasion, where varying the susceptibilities of different users holds different costs. The analysis of its non-convexity, non-submodularity and complexity shows that solving the proposed problem is nontrivial, thus inspiring us to provide an intuitive greedy algorithm. Furthermore, we design an accelerated algorithm based on the community property, which reduces the time consumption more than one order of magnitude. The acceleration is based on the intuition that the impact of a user within a proper community could be a good estimation of the impact in the whole network, while the computation of the former one is much more efficient. The relationship between two algorithms is fully analyzed, which shows the community-based algorithm can degenerate to the intuitive greedy algorithm under a specific setting. Finally, comprehensive evaluations on real-world datasets show the superiority of proposed algorithms on both effectiveness and efficiency.

关键词： Greedy algorithms Social networking (online) Heuristic algorithms Search problems Rendering (computer graphics) Acceleration Security

来源：评论

学校读者我要写书评

暂无评论

High-Resolution Natural Image Matting by Refining Low-resolution Alpha Mattes

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Xianmin Ye Yihui Liang Mian Tan Fujian Feng Lin Wang Han Huang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan China Guizhou Key Laboratory of Pattern Recognition and Intelligent System and the College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) MOE of China Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

High-resolution natural image matting plays an important role in image editing, film-making and remote sensing due to its ability of accurately extract the foreground from a natural background. However, due to the complexity brought about by the proliferation of resolution, the existing image matting methods cannot obtain high-quality alpha mattes on high-resolution images in reasonable time. To overcome this challenge, we introduce a high-resolution image matting framework based on alpha matte refinement from low-resolution to high-resolution (HRIMF-AMR). The proposed framework transforms the complex high-resolution image matting problem into low-resolution image matting problem and high-resolution alpha matte refinement problem. While the first problem is solved by adopting an existing image matting method, the latter is addressed by applying the Detail Difference Feature Extractor (DDFE) designed as a part of our work. The DDFE extracts detail difference features from high-resolution images by measuring the image feature difference between high-resolution images and low-resolution images. The low-resolution alpha matte is refined according to the extracted detail difference feature, providing the high-resolution alpha matte. In addition, the Matte Detail Resolution Difference (MDRD) loss is introduced to train the DDFE, which imposes an additional constraint on the extraction of detail difference features with mattes. Experimental results show that integrating HRIMF-AMR significantly enhances the performance of existing matting methods on high-resolution images of Transparent-460 and Alphamatting. Project page: https://***/yexianmin/HRAMR-Matting.

关键词： Feature extraction Image resolution Image color analysis Optimization Remote sensing Clustering algorithms Accuracy Visualization Transforms Training

来源：评论

学校读者我要写书评

暂无评论

Multivariate time series classification with hierarchical variational graph pooling

arXiv

引用

arXiv 2020年

作者： Duan, Ziheng Xu, Haoyan Wang, Yueyang Huang, Yida Ren, Anni Xu, Zhongbin Sun, Yizhou Wang, Wei School of Big Data and Software Engineering Chongqing University Chongqing401331 China College of Energy Engineering Zhejiang University Zhejiang310027 China Department of Computer Science University of California Los AngelesCA90095 United States

With the advancement of sensing technology, multivariate time series classification (MTSC) has recently received considerable attention. Existing deep learning-based MTSC techniques, which mostly rely on convolutional or recurrent neural networks, are primarily concerned with the temporal dependency of single time series. As a result, they struggle to express pairwise dependencies among multivariate variables directly. Furthermore, current spatial-temporal modeling (e.g., graph classification) methodologies based on Graph Neural Networks (GNNs) are inherently flat and cannot aggregate hub data in a hierarchical manner. To address these limitations, we propose a novel graph pooling-based framework MTPool to obtain the expressive global representation of MTS. We first convert MTS slices to graphs by utilizing interactions of variables via graph structure learning module and attain the spatial-temporal graph node features via temporal convolutional module. To get global graph-level representation, we design an "encoder-decoder" based variational graph pooling module for creating adaptive centroids for cluster assignments. Then we combine GNNs and our proposed variational graph pooling layers for joint graph representation learning and graph coarsening, after which the graph is progressively coarsened to one node. At last, a differentiable classifier takes this coarsened representation to get the final predicted class. Experiments on ten benchmark datasets exhibit MTPool outperforms state-of-the-art strategies in the MTSC task. Copyright © 2020, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Android malware family classification and characterization using CFG and DFG 13

Android malware family classification and characterization u...

引用

13th International Symposium on Theoretical Aspects of software engineering, TASE 2019

作者： Xu, Zhiwu Ren, Kerong Song, Fu College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Information Science and Technology ShanghaiTech University Shanghai China

ISBN: (纸本)9781728133423

Android malware has become a serious threat for our daily life, and thus there is a pressing need to effectively mitigate or defend against them. Recently, many approaches and tools to analyze Android malware have been proposed to protect legitimate users from the threat. However, most approaches focus on malware detection, while only a few of them consider malware classification or malware characterization. In this paper, we propose an extension of CDGDroid to classifying and characterizing Android malware families automatically. We first perform static analysis used in CDGDroid to extract control-flow graphs and data-flow graphs on the instruction level. Then we encode the graphs into matrices, and use them to build the family classification models via deep learning. For family characterization, we extract the n-gram sequences from the graphs, which are filtered according to the weights of the classification model built for the target family. And then we construct a vector space model and select the top-k sequences as a characterization of the target family. We have conducted some experiments to evaluate our approach and have identified that the family classification model taking the horizontal combination of CFG and DFG as features offers the best performance in terms of accuracy among all the models. Compared with CDGDroid, Drebin and many antivirus tools gathered in VirusTotal, our family classification model gives a better performance. Finally, We have also conducted experiments on family characterization, and the experimental results have shown that our characterization can capture the malicious behaviors of the testing families. © 2019 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：