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

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yangtao Zheng Di Huang Songtao Liu Yunhong Wang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University School of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarse-to-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach.

关键词： Feature extraction Subspace constraints Object detection Detectors Task analysis Semantics Prototypes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reversible adversarial information hiding based on the interpretation of neural network

引用

Digital Signal Processing: A Review Journal 2025年 165卷

作者： Li, Ruiping Wang, Xi Cui, Qingchen Li, Ming Information Construction and Management Office Henan Normal University Xinxiang453007 China School of Artificial Intelligence and Software Engineering Nanyang Normal University Nanyang473061 China Henan Engineering Research Center of Intelligent Processing for Big Data of Digital Image Henan Nanyang473000 China College of Information Engineering Zhoukou Vocational College of Arts and Science Zhoukou466000 China College of Computer and Information Engineering Henan Normal University Xinxiang453007 China Key Laboratory of Artificial Intelligence and Personalized Learning in Education of Henan Province Xinxiang453007 China

The emerging technology of adversarial information hiding can generate adversarial example by embedding useful information instead of meaningless noise into the host image. The obtained image can deceive classification models and therefore equip the function of privacy protection. However, existing research mainly focuses on the effectiveness of attack rather than preserving the integrity of the protected image. It cannot meet the requirements in the fields such as medical imaging, financial transactions, and copyright protection where users' raw data should not be damaged. Therefore, we propose a novel reversible adversarial information hiding based on interpretability of neural networks. The Grad-CAM-generated heatmap is employed to identify a minimal set of high-impact pixels for embedding, ensuring that minor modifications can induce significant misclassification. Then, the user-defined secret bits are embedded into the identified pixels by using difference expansion. After extraction, the original image can be perfectly restored. The technologies of adversarial example and reversible information hiding are combined to accommodate wider applications. The proposed method is tested on CIFAR-10 with three different neural architectures (NiN, AlexNet, ResNet). Experimental results show that the proposed method can completely restore the cover image while ensuring the extraction of the embedded data and misleading the neural network. © 2025 Elsevier Inc.

关键词： Adversarial attacks Adversarial information hiding Neural network interpretability Reversibility

来源：评论

学校读者我要写书评

暂无评论

Cross-domain object detection through coarse-to-fine feature adaptation

arXiv

引用

arXiv 2020年

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

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarseto-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach. Copyright © 2020, The Authors. All rights reserved.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading and Content Caching with Traffic Flow Prediction for Internet of Vehicles in Edge Computing

Computation Offloading and Content Caching with Traffic Flow...

引用

IEEE International Conference on Web Services (ICWS)

作者： Zijie Fang Xiaolong Xu Fei Dai Lianyong Qi Xuyun Zhang Wanchun Dou School of Computer and Software Nanjing University of Information Science and Technology Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University Kunming China School of Information Science and Engineering Qufu Normal University China Macquarie University Australia State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

The development of the Internet of Vehicles (IoV) enables numerous emerging in-vehicle applications to accommodate users with various contents, thus enhancing their traveling experiences. In IoV, content decoding tasks are typically offloaded to edge servers for implementation, as edge computing is an admirable paradigm to provide low-latency services. However, as different vehicular users may request the same contents, processing these contents repeatedly leads to the waste of storage, computation and bandwidth resources. Therefore, fine-grained computation offloading and content caching are demanded in IoV. In this paper, a joint optimization method for computation offloading and content caching based on traffic flow prediction, named COC, is proposed. Firstly, traffic flow covered by each edge server is predicted by a modified deep spatiotemporal residual network (ST-ResNet). Secondly, the non-dominated sorting genetic algorithm III (NSGA-III) is leveraged to realize the many-objective optimization to shorten the execution time and reduce the energy consumption of computation and transmission in IoV. Finally, evaluated by real-world big data from Nanjing China, COC shows a great reduction in execution time and energy consumption of transmission and computation compared to other methods.

关键词： Energy consumption intelligent vehicles Web services Optimization methods Bandwidth Servers Edge computing

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task Offloading with Minority Game for Internet of Vehicles in Cloud-Edge Computing

Dynamic Task Offloading with Minority Game for Internet of V...

引用

IEEE International Conference on Web Services (ICWS)

作者： Bowen Shen Xiaolong Xu Fei Dai Lianyong Qi Xuyun Zhang Wanchun Dou School of Computer and Software Nanjing University of Information Science and Technology Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University Kunming China School of Information Science and Engineering Qufu Normal University China Macquaire University Australia State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

With the advent of the Internet of Vehicles (IoV), drivers are now provided with diverse time-sensitive vehicular services that usually require a large scale of computation. As civilian vehicles are generally insufficient in computational resources, their service requests are offloaded to cloud data centers and edge computing devices (ECDs) with ample computational resources to enhance the quality of service (QoS). However, ECDs are often overloaded with excessive service requests. In addition, as the network conditions and service compositions are complicated and dynamic, the centralized control of ECDs is hard to achieve. To tackle these challenges, a dynamic task offloading method with minority game (MG) in cloud-edge computing, named DOM, is proposed in this paper. Technically, MG is an effective tool with a distributed mechanism which can minimize the dependency on centralized control in resource allocation. In the MG, reinforcement learning (RL) is applied to optimize the distributed decision-making of participants. Finally, with a real-world dataset of IoV services, the effectiveness and adaptability of DOM are evaluated.

关键词： Cloud computing Games Quality of service Reinforcement learning Space exploration Task analysis Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Local and global structure-aware entropy regularized mean teacher model for 3d left atrium segmentation 23rd

Local and global structure-aware entropy regularized mean te...

引用

23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020

作者： Hang, Wenlong Feng, Wei Liang, Shuang Yu, Lequan Wang, Qiong Choi, Kup-Sze Qin, Jing School of Computer Science and Technology Nanjing Tech University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Smart Health Big Data Analysis and Location Services Engineering Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing China Department of Radiation Oncology Stanford University StanfordCA94305 United States CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology Shenzhen China School of Nursing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9783030597092

Emerging self-ensembling methods have achieved promising semi-supervised segmentation performances on medical images through forcing consistent predictions of unannotated data under different perturbations. However, the consistency only penalizes on independent pixel-level predictions, making structure-level information of predictions not exploited in the learning procedure. In view of this, we propose a novel structure-aware entropy regularized mean teacher model to address the above limitation. Specifically, we firstly introduce the entropy minimization principle to the student network, thereby adjusting itself to produce high-confident predictions of unannotated images. Based on this, we design a local structural consistency loss to encourage the consistency of inter-voxel similarities within the same local region of predictions from teacher and student networks. To further capture local structural dependencies, we enforce the global structural consistency by matching the weighted self-information maps between two networks. In this way, our model can minimize the prediction uncertainty of unannotated images, and more importantly that it can capture local and global structural information and their complementarity. We evaluate the proposed method on a publicly available 3D left atrium MR image dataset. Experimental results demonstrate that our method achieves outstanding segmentation performances than the state-of-the-art approaches in scenes with limited annotated images. © Springer Nature Switzerland AG 2020.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

NDRIDC: NMF-based deep representation algorithm for incomplete data clustering

引用

Knowledge-Based Systems 2025年 324卷

作者： Dexian Wang Zonglin Li Sha Yang Tianrui Ren Pengfei Zhang Ping Deng Tianrui Li Chengdu University of Traditional Chinese Medicine Chengdu 611137 China Chinese Academy of Medical Sciences & Peking Union Medical College Beijing 100730 China School of Computer and Software Engineering Xihua University Chengdu 610039 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu 611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu 611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu 611756 China

Incomplete data clustering is a hot research topic in the field of data mining. Many methods based on incomplete clustering have two issues: (1) their models do not have non-negative constraints; (2) their model building strategies do not consider combining traditional machine learning and deep learning. To address these issues, we proposed the NMF-based deep representation algorithm for incomplete data clustering (NDRIDC). First, the element-based objective function is constructed based on the known elements in the incomplete data matrix with matrix factorization principle. Then the NDRIDC deep network is constructed based on the element update gradient and nonlinear function with non-negative value domain. The learning of the NDRIDC network enables the optimization of the objective function and the filling of missing values. Further, based on the same learning framework, the NDRIDC network is employed to perform low-dimensional representation of the filled matrix. Finally, extensive experiments on regular and large-scale datasets show that our proposed algorithm has good performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spectral-spatial anomaly detection of hyperspectral data based on improved isolation forest

TechRxiv

引用

TechRxiv 2021年

作者： Song, Xiangyu Aryal, Sunil Ting, Kai Ming Liu, Zhen He, Bin Changchun130033 China The University of Chinese Academy of Sciences Beijing100049 China The School of Information Technology Deakin University 75 Pigdons Rd Waurn Ponds VIC3216 Australia National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Big Data Research Center and Web Sciences Center School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

Anomaly detection in hyperspectral image is affected by redundant bands and the limited utilization capacity of spectral-spatial information. In this article, we propose a novel Improved Isolation Forest (IIF) algorithm based on the assumption that anomaly pixels are more susceptible to isolation than the background pixels. The proposed IIF is a modified version of the Isolation Forest (iForest) algorithm, which addresses the poor performance of iForest in detecting local anomalies and anomaly detection in high-dimensional data. Further, we propose a spectral-spatial anomaly detector based on IIF (SSIIFD) to make full use of global and local information, as well as spectral and spatial information. To be specific, first, we apply the Gabor filter to extract spatial features, which are then employed as input to the Relative Mass Isolation Forest (ReMass-iForest) detector to obtain the spatial anomaly score. Next, original images are divided into several homogeneous regions via the Entropy Rate Segmentation (ERS) algorithm, and the preprocessed images are then employed as input to the proposed IIF detector to obtain the spectral anomaly score. Finally, we fuse the spatial and spectral anomaly scores by combining them linearly to predict anomaly pixels. The experimental results on four real hyperspectral data sets demonstrate that the proposed detector outperforms other state-of-the-art methods. © 2021, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：