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

Surface-Continuous Scene Representation for Light Field Depth Estimation via Planarity Prior

IEEE Transactions on Circuits and Systems for Video Technology 2025年第5期35卷 5051-5066页

作者： Chen, Rongshan Sheng, Hao Yang, Da Cui, Zhenglong Cong, Ruixuan Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Key Laboratory of Data Science and Intelligent Computing Hangzhou International Innovation Institute Zhejiang Hangzhou311115 China Macao Polytechnic University Faculty of Applied Sciences China

Light field (LF) imaging captures both spatial and angular information of the real world, enabling precise depth estimation. However, images are merely discrete expressions of scenes. Limited by imaging technology, LF camera cannot capture the infinite rays emitted by scenes, leading to the discrete information storage (e.g. pixel). Consequently, previous deep learning methods have encountered challenges in accurately extracting depth information from LF images. In this paper, we investigate a surface-continuous scene representation using planarity prior and design PlaneNet, a Plane-based Network that successfully generates highly detailed depth maps for real scenes. Specifically, inspired by the plane assumption that real-world scenes generally yield piecewise smooth surfaces, we refine it to the pixel level for continuous surface approximation, which can overcome the limitations of discrete representation. Rather than explicitly parameterizing planes as multiple coefficients, we propose a novel plane regular sampling operator (PRSO), enabling the network to fit smooth depth surfaces easily. To explore the role of our theory at the feature level, we also introduce PRSO into the intermediate layers of PlaneNet. Experiments show that our method achieves state-of-the-art performance on both synthetic and real-world LF scenes, ranking 1st (MSE) on the HCI 4D Light Field benchmark. Furthermore, we explore the utilization of our representation in multiple LF depth estimation networks, and experiments demonstrate improved performance when surface-continuous representation is applied. © 1991-2012 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Resilient multi-objective mission planning for UAV formation:A unified framework integrating task pre-and re-assignment

引用

Defence Technology(防务技术) 2025年第3期45卷 203-226页

作者： Xinwei Wang Xiaohua Gao Lei Wang Xichao Su Junhong Jin Xuanbo Liu Zhilong Deng Department of Engineering Mechanics State Key Laboratory of Structural AnalysisOptimization and CAE Software for Industrial EquipmentDalian University of TechnologyDalianLiaoning 116024China School of Mathematics and Big Data Anhui University of Science and TechnologyHuainanAnhui 232001China School of Mathematical Science Dalian University of TechnologyDalianLiaoning 116024China Department of Airborne Vehicle Engineering Naval Aeronautical and Astronautical UniversityYantai 264001China

Combat effectiveness of unmanned aerial vehicle(UAV)formations can be severely affected by the mission execution *** the practical execution phase,there are inevitable risks where UAVs being destroyed or targets failed to be *** improve the mission reliability,a resilient mission planning framework integrates task pre-and re-assignment modules is developed in this *** the task pre-assignment phase,to guarantee the mission reliability,probability constraints regarding the minimum mission success rate are imposed to establish a multi-objective optimization *** an improved genetic algorithm with the multi-population mechanism and specifically designed evolutionary operators is used for efficient *** in the task-reassignment phase,possible trigger events are first analyzed.A real-time contract net protocol-based algorithm is then proposed to address the corresponding emergency *** the dual objective used in the former phase is adapted into a single objective to keep a consistent combat *** cases of different scales demonstrate that the two modules cooperate well with each *** the one hand,the pre-assignment module can generate high-reliability mission schedules as an elaborate mathematical model is *** the other hand,the re-assignment module can efficiently respond to various emergencies and adjust the original schedule within a *** corresponding animation is accessible at ***/video/BV12t421w7EE for better illustration.

关键词： Cooperative mission planning UAV formation Mission reliability Evolutionary algorithm Contract net protocol

来源：评论

学校读者我要写书评

暂无评论

Dynamic-prototype Contrastive Fine-tuning for Continual Few-shot Relation Extraction with Unseen Relation Detection 31

Dynamic-prototype Contrastive Fine-tuning for Continual Few-...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhao, Simiao Tan, Zhen Pang, Ning Xiao, Weidong Zhao, Xiang National Key Laboratory of Information Systems Engineering National University of Defense Technology China Laboratory for Big Data and Decision National University of Defense Technology China

ISBN: (纸本)9798891761964

Continual Few-shot Relation Extraction (CFRE) aims to continually learn new relations from limited labeled data while preserving knowledge about previously learned relations. Facing the inherent issue of catastrophic forgetting, previous approaches predominantly rely on memory replay strategies. However, they often overlook task interference in continual learning and the varying memory requirements for different relations. To address these shortcomings, we propose a novel framework, DPC-FT, which features: 1) a lightweight relation encoder for each task to mitigate negative knowledge transfer across tasks;2) a dynamic prototype module to allocate less memory for easier relations and more memory for harder relations. Additionally, we introduce the None-Of-The-Above (NOTA) detection in CFRE and propose a threshold criterion to identify relations that have never been learned. Extensive experiments demonstrate the effectiveness and efficiency of our method in CFRE, making our approach more practical and comprehensive for real-world scenarios. © 2025 Association for Computational Linguistics.

关键词： knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Semantic and Sentiment Dual-Enhanced Generative Model for Script Event Prediction 31

Semantic and Sentiment Dual-Enhanced Generative Model for Sc...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wu, Feiyang Huang, Peixin Hu, Yanli Tan, Zhen Zhao, Xiang Laboratory for Big Data and Decision National University of Defense Technology China National Key Laboratory of Information Systems Engineering National University of Defense Technology China

ISBN: (纸本)9798891761964

Script Event Prediction (SEP) aims to forecast the next event in a sequence from a list of candidates. Traditional methods often use pre-trained language models to model event associations but struggle with semantic ambiguity and embedding bias. Semantic ambiguity arises from the multiple meanings of identical words and insufficient consideration of event arguments, while embedding bias results from assigning similar word embeddings to event pairs with similar lexical features, despite their different meanings. To address above issues, we propose a the Semantic and Sentiment Dual-enhanced Generative Model (SSD-GM). SSD-GM leverages two types of script event information to enhance the generative model. Specifically, it employs a GNN-based semantic structure aggregator to integrate the event-centric structure information, thereby mitigating the impact of semantic ambiguity. Furthermore, we find that local sentiment variability effectively reduces biases in event embeddings, while maintaining global sentiment consistency enhances predictive accuracy. As a result, SSD-GM adeptly captures both global and local sentiment of events through its sentiment information awareness mechanism. Extensive experiments on the Multi-Choice Narrative Cloze (MCNC) task demonstrate that our approach achieves better results than other state-of-the-art baselines. © 2025 Association for Computational Linguistics.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Interpretable Machine Learning Method for Compressive Strength Prediction and Analysis of Pure Fly Ash-based Geopolymer Concrete

引用

Journal of Wuhan university of Technology(Materials Science) 2025年第1期40卷 65-78页

作者： SHI Yuqiong LI Jingyi ZHANG Yang LI Li Key Laboratory of Agricultural Soil and Water Engineering in Arid and Semiarid Areas of Ministry of Education Northwest A&F Uni-versityYangling 712100China College of Water Resources and Architectural Engineering Northwest A&F UniversityYangling 712100China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing 401420China Chongqing College of Mobile Communication Chongqing 401520China Department of Civil and Environmental Engineering The Hong Kong Polytechnic UniversityHung HomKowloonHong KongChina National Rail Transit Electrification and Automation Engineering Technology Research Center(Hong Kong Branch) The Hong Kong Polytechnic UniversityKowloonHung HomHong KongChina

In order to study the characteristics of pure fly ash-based geopolymer concrete(PFGC)conveniently,we used a machine learning method that can quantify the perception of characteristics to predict its compressive *** this study,505 groups of data were collected,and a new database of compressive strength of PFGC was *** order to establish an accurate prediction model of compressive strength,five different types of machine learning networks were used for comparative *** five machine learning models all showed good compressive strength prediction performance on *** them,R2,MSE,RMSE and MAE of decision tree model(DT)are 0.99,1.58,1.25,and 0.25,*** R2,MSE,RMSE and MAE of random forest model(RF)are 0.97,5.17,2.27 and 1.38,*** two models have high prediction accuracy and outstanding generalization *** order to enhance the interpretability of model decision-making,we used importance ranking to obtain the perception of machine learning model to 13 *** 13 variables include chemical composition of fly ash(SiO_(2)/Al_(2)O_(3),Si/Al),the ratio of alkaline liquid to the binder,curing temperature,curing durations inside oven,fly ash dosage,fine aggregate dosage,coarse aggregate dosage,extra water dosage and sodium hydroxide *** temperature,specimen ages and curing durations inside oven have the greatest influence on the prediction results,indicating that curing conditions have more prominent influence on the compressive strength of PFGC than ordinary Portland cement *** importance of curing conditions of PFGC even exceeds that of the concrete mix proportion,due to the low reactivity of pure fly ash.

关键词： machine learning pure fly ash geopolymer compressive strength feature perception

来源：评论

学校读者我要写书评

暂无评论

Enhancing fairness of trading environment:discovering overlapping spammer groups with dynamic co‑review graph optimization

引用

Cybersecurity 2025年第2期8卷 242-269页

作者： Chaoqun Wang Ning Li Shujuan Ji Xianwen Fang Zhen Wang Shandong Provincial Key Laboratory of Wisdom Mine Information Technology Shandong University of Science&TechnologyQingdao 266590ShandongChina Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety Anhui University of Science and TechnologyHuainanChina

Within the thriving e-commerce landscape,some unscrupulous merchants hire spammer groups to post misleading reviews or ratings,aiming to manipulate public perception and disrupt fair market *** phenomenon has prompted a heightened research focus on spammer groups *** the e-commerce domain,current spammer group detection algorithms can be classified into three categories,i.e.,Frequent Item Mining-based,graph-based,and burst-based ***,existing graph-based algorithms have limitations in that they did not adequately consider the redundant relationships within co-review graphs and neglected to detect overlapping members within spammer *** address these issues,we introduce an overlapping spammer group detection algorithm based on deep reinforcement learning named ***,the algorithm filters out highly suspicious products and gets the set of reviewers who have reviewed these ***,taking these reviewers as nodes and their co-reviewing relationships as edges,we construct a homogeneous co-reviewing ***,to efficiently identify and handle the redundant relationships that are accidentally formed between ordinary users and spammer group members,we propose the Auto-Sim algorithm,which is a specifically tailored algorithm for dynamic optimization of the co-reviewing graph,allowing for adjustments to the reviewers’relationship network within the ***,candidate spammer groups are discovered by using the Ego-Splitting overlapping clustering algorithm,allowing overlapping members to exist in these ***,these groups are refined and ranked to derive the final list of spammer *** results based on real-life datasets show that our proposed DRL-OSG algorithm performs better than the baseline algorithms in Precision.

关键词： Spammer groups Homogeneous network Redundant relationships Overlapping members Deep reinforcement learning Ego-splitting algorithm

来源：评论

学校读者我要写书评

暂无评论

DMC-Watermark: A backdoor richer watermark for dual identity verification by dynamic mask covering

引用

Applied Intelligence 2025年第8期55卷 1-15页

作者： Zhu, Yujia Wang, Ruoxi Xia, Daoxun School of Big Data and Computer Science Guizhou Normal University Guiyang China Guizhou Key Laboratory of Advanced Computing Guizhou Normal University Guiyang China Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang China

With the increasing use of neural networks, the importance of copyright protection for these models has gained significant attention. Backdoor watermarking is one of the key methods for protecting copyright. However, on the one hand, most existing backdoor watermarks are triggered by visual images, making them easily detectable, and therefore vulnerable to various attacks. On the other hand, it is difficult for these methods to carry information related to the creator’s identity which can easily lead to fraudulent claims of ownership. These factors contribute to the vulnerability and limitations of backdoor watermarking. In this paper, we propose DMC-Watermark, a backdoor richer watermarking method that uses dynamic mask-covered image structures as triggers. Leveraging the semantic preservation of image structure in transformation attacks, we select image structure as triggers. Furthermore, we convert the author-related information into an array of color information and apply it as a mask to the extracted image structures, allowing it to serve as a second layer of verification during the validation phase to resist fraudulent claims of ownership. The final trigger pattern, embedded with author-related image structures, is applied to the selected images in the trigger set, generating a final trigger set that is trained together with clean samples to produce a protected model. The experiments show that the proposed DMC-Watermark performs well in terms of fidelity, invisibility, undetectability, functionality, dual verification and robustness on three different datasets and four representative DNNs, and it has wide applicability and excellent results in high-resolution images. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Federated Stochastic Primal-Dual Learning for Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第11期12卷 17034-17050页

作者： Li, Yiwei Wang, Shuai Chang, Tsung-Hui Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning (FL) has the potential to empower Internet-of-Vehicles (IoV) networks by enabling smart vehicles (SVs) to participate in the learning process under the orchestration of a vehicular service provider while keeping data locally. In this paper, we propose a novel federated stochastic primal-dual algorithm with differential privacy (FedSPD-DP) to ensure robust privacy protection for FL based IoV (FL-IoV) systems. The FedSPD-DP algorithm leverages multiple steps of local stochastic gradient descent (SGD) and partial client participation (PCP) to improve communication efficiency while incorporating differential privacy (DP) to ensure privacy protection. Our theoretical analysis explores the impact of these strategies on learning performance. Specifically, we demonstrate that the data sampling strategy and PCP enhance data privacy, while a larger number of local SGD steps may increase privacy leakage, revealing a non-trivial tradeoff between communication efficiency and privacy protection. Extensive experiments on real-world data validate the effectiveness of the proposed algorithm, showing superior performance compared to state-of-the-art FL algorithms, and confirming the analytical results and properties. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic graph-based graph attention network for anomaly detection in industrial multivariate time series data

引用

Applied Intelligence 2025年第6期55卷 1-18页

作者： Gao, Cong Ma, Hongye Pei, Qingqi Chen, Yanping School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China School of Telecommunications Engineering Xidian University Xi’an710071 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China

For industrial big data, anomaly detection for multivariate time series data is of critical strategic significance. However, the complexity of industrial equipment and production processes, combined with the high dimensionality of production data, makes it challenging for traditional anomaly detection methods to effectively capture the complex interdependencies and dynamic evolutionary relationships among multiple variables. Additionally, issues such as unstable data distributions, variability, and data drift exacerbate the challenges faced by anomaly detection methods in industrial data analysis and decision-making. This study presents a dynamic graph-based graph attention network for anomaly detection in a multivariate time series data (D-GATAD) model, introducing an innovative approach to dynamic graph construction. The proposed method seamlessly integrates node content features with graph topological structure information, enabling adaptive construction of dynamic graphs based on the current sensor network structure. This design allows for precise modeling of the complex temporal dependencies between variables. Furthermore, the method incorporates an optimized prediction-based model design that organically combines embedding vectors with node data, thereby significantly enhancing the interpretability of the analytical results. Experimental evaluations demonstrate that the proposed method outperforms existing state-of-the-art models across multiple public benchmark datasets. Notably, on the highly complex WADI dataset, it achieves a 5.12% improvement in the AUC score, underscoring its robustness and effectiveness in industrial anomaly detection. This research offers an innovative and widely applicable solution for industrial data analysis and anomaly detection, with significant implications for practical deployment. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Iterative Bounded Distance Decoding With Random Flipping for Product-Like Codes

引用

IEEE Transactions on Communications 2025年第5期73卷 2864-2875页

作者： Li, Guorong Wang, Shiguo Zhao, Shancheng Jinan University National and Local Joint Research Center of Network Security Detection and Protection Technology College of Information Science and Technology Guangzhou510632 China Guangdong Key Laboratory of Data Security and Privacy Preserving Guangzhou Key Laboratory of Data Security and Privacy Preserving Guangzhou510632 China Changsha University of Science and Technology Computer and Communication Engineering Institute Changsha410114 China

Product-like codes are widely used in high-speed communication systems since they can be decoded with low-complexity hard decision decoders (HDDs). To meet the growing demand of data rates, enhanced HDDs are required. In this paper, we propose a novel soft-aided HDD (SA-HDD), termed iterative bounded distance decoding with random flipping (iBDD-RF), for product-like codes. In iBDD-RF, the soft reliability of a bit is a weighted sum of the output of bounded distance decoder (BDD) and the channel log-likelihood ratio (LLR). When the amplitude of the soft reliability of a bit is less than a given threshold, it is flipped with a given probability. This random flipping may make the decoder escape from the local optimum. To optimize the threshold and the flipping probability, we derive the density evolution (DE) equations of iBDD-RF for product codes (PCs) and staircase codes (SCs). Our extensive numerical results show that iBDD-RF outperforms iBDD with scaled reliability (iBDD-SR) over the binary-input additive white Gaussian noise (Bi-AWGN) channel. Particularly, for a PC with (255,239,2) Bose-Chaudhuri-Hocquenghem (BCH) code and an SC with (254,230,3) BCH code, iBDD-RF performs about 0.25 dB and 0.28 dB better than iBDD-SR, respectively. © 1972-2012 IEEE.

关键词： Optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：