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

Interblock-interference-free precoding using square-root decomposition for faster-than-Nyquist signaling

Digital Communications and Networks 2025年

作者： Yan Wang Qiang Li Liping Li Yingsong Li Xingwang Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230601 China School of Physics and Electronic Information Engineering Henan Polytechnic University Jiaozuo China

Precodings using square-root decomposition, including Cholesky and G-To-Minus-Half (GTMH) precodings, are promising for eliminating the Faster-Than-Nyquist (FTN)-induced Intersymbol-Interference (ISI). However, the existing precodings using square-root decomposition either ignore Interblock-Interference (IBI) or increase the signal power, deteriorating the Bit Error Rate (BER) performance for high-order modulations and severe ISI. To overcome these drawbacks, we adopt two approaches for constructing the circular ISI matrix. The first approach inserts a Cyclic Prefix/Suffix (CPS) after each precoded symbol block, while the second approach replaces the linear convolution of the FTN shaping and the matched filter by the circular convolution, resulting in the Circular FTN (CFTN). Using these two approaches, we propose three IBI-free precodings, i.e., CPS-Cholesky, CFTN-Cholesky and CFTN-GTMH precodings. Furthermore, employing QR decomposition shows that the GTMH and Cholesky precodings can be converted interchangeably. Thus, we demonstrate that the GTMH precoding is essentially equivalent to the Cholesky precoding. Simulation results indicate that the BER performance of three IBI-free precodings approaches Nyquist performance for moderate ISI. However, as ISI intensifies, the CPS-Cholesky scheme increases the transmit power, causing BER performance degradation. In contrast, the CFTN-Cholesky and CFTN-GTMH precodings maintain optimal BER performance even for severe ISI. Considering 128-amplitude phase shift keying with a code rate of 1/2, the BER loss of CFTN-Cholesky and CFTN-GTMH precodings for the ideal BER of 10-5 is approximately 0.002 dB and 0.005 dB when packing factor is 0.7 and roll-off factor is 0.3. To the best knowledge of the authors, this is the optimal performance achievable through precoding.

关键词： Faster-than-Nyquist Intersymbol-interference Interblock-interference Bit error rate Precoding

来源：评论

学校读者我要写书评

暂无评论

DRAG: Dynamic Region-Aware GCN for Privacy-Leaking Image Detection

arXiv

引用

arXiv 2022年

作者： Yang, Guang Cao, Juan Sheng, Qiang Qi, Peng Li, Xirong Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The daily practice of sharing images on social media raises a severe issue about privacy leakage. To address the issue, privacy-leaking image detection is studied recently, with the goal to automatically identify images that may leak privacy. Recent advance on this task benefits from focusing on crucial objects via pretrained object detectors and modeling their correlation. However, these methods have two limitations: 1) they neglect other important elements like scenes, textures, and objects beyond the capacity of pretrained object detectors;2) the correlation among objects is fixed, but a fixed correlation is not appropriate for all the images. To overcome the limitations, we propose the Dynamic Region-Aware Graph Convolutional Network (DRAG) that dynamically finds out crucial regions including objects and other important elements, and models their correlation adaptively for each input image. To find out crucial regions, we cluster spatially-correlated feature channels into several region-aware feature maps. Further, we dynamically model the correlation with the self-attention mechanism and explore the interaction among the regions with a graph convolutional network. The DRAG achieved an accuracy of 87% on the largest dataset for privacy-leaking image detection, which is 10 percentage points higher than the state of the art. The further case study demonstrates that it found out crucial regions containing not only objects but other important elements like textures. The code and more details are in https://***/guang-yanng/DRAG. © 2022, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Stable Attribute Group Editing for Reliable Few-shot Image Generation

arXiv

引用

arXiv 2023年

作者： Ding, Guanqi Han, Xinzhe Wang, Shuhui Wu, Shuzhe Jin, Xin Tu, Dandan Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518066 China Huawei Cloud EI Innovation Lab China

Few-shot image generation aims to generate data of an unseen category based on only a few samples. Apart from basic content generation, a bunch of downstream applications hopefully benefit from this task, such as low-data detection and few-shot classification. To achieve this goal, the generated images should guarantee category retention for classification beyond the visual quality and diversity. In our preliminary work, we present an "editing-based" framework Attribute Group Editing (AGE) for reliable few-shot image generation, which largely improves the performance compared with existing methods that require re-training a GAN with limited data. Nevertheless, AGE's performance on downstream classification is not as satisfactory as expected. This paper investigates the class inconsistency problem and proposes Stable Attribute Group Editing (SAGE) for more stable class-relevant image generation. Different from AGE which directly edits from a one-shot image, SAGE takes use of all given few-shot images and estimates a class center embedding based on the category-relevant attribute dictionary. Meanwhile, according to the projection weights on the category-relevant attribute dictionary, we can select category-irrelevant attributes from the similar seen categories. Consequently, SAGE injects the whole distribution of the novel class into StyleGAN's latent space, thus largely remains the category retention and stability of the generated images. Going one step further, we find that class inconsistency is a common problem in GAN-generated images for downstream classification. Even though the generated images look photo-realistic and requires no category-relevant editing, they are usually of limited help for downstream classification. We systematically discuss this issue from both the generative model and classification model perspectives, and propose to boost the downstream classification performance of SAGE by enhancing the pixel and frequency components. Extensive experime

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Note on the Conditional Fault-Tolerant Strong Menger Edge Connectivity of Regular Graphs∗

SSRN

引用

SSRN 2023年

作者： Li, Pingshan Xu, Min Cheng, Eddie Key Laboratory of Intelligent Computing & Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Laboratory of Mathematics and Complex Systems Ministry of Education Beijing100875 China Department of Mathematics and Statistics Oakland University RochesterMI48309 United States

A graph G is said to be strongly Menger edge-connected (SM-λ for short) if for every two of its vertices u and v, there are min{dG(u),dG(v)}) edge-disjoint paths between them, where dG(u) is the degree of u in G. The maximum conditional edge-fault-tolerant number of order r with respect to the SM-λ property of G, denoted by smrλ(G), is the maximum integer m such that G − F remains SM-λ for every edge set F with |F| ≤ m and δ(G − F) ≥ r. So far, most of the exact values of smrλ(G) are for the case when r ≤ 2 for special class of graphs. In this paper, we give a sufficient condition to give a bound of smrλ(G) for general r on regular graphs. As an application,we determine the exact value of) for 1 ≤ r ≤ n − 2 where AQn is the n-dimensional augmented cube. © 2023, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Node transfer with graph contrastive learning for class-imbalanced node classification

引用

Neural Networks 2025年 190卷 107674页

作者： Li, Yangding Zhao, Xiangchao Zeng, Yangyang Feng, Hao Chai, Jiawei Xie, Hao Fu, Shaobin Zhang, Shichao College of Information Science and Engineering Hunan Normal University Changsha China Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Guangxi Key Lab of Multi-Source Information Mining and Security Guangxi Normal University Guilin China

In graph representation learning, the class imbalance problem is a significant challenge that has received much attention from academics. Although current approaches have shown promising results, they have not adequately addressed the problems of node quantity imbalance and feature space imbalance in datasets. This research presents a node transfer with graph contrastive learning framework (NT-GCL) that aims to improve the representation capabilities of graph neural networks for minority classes nodes by balancing node quantity and feature space distributions. First, the proposed node transfer algorithm redistributes misclassified nodes from majority classes to achieve a balanced distribution of node quantity and feature space. This approach effectively prevents the feature space of minority classes from being compressed by majority classes during information propagation, further mitigating potential imbalance issues. Subsequently, the self-supervised contrastive learning strategy is employed to train the model without relying on labels, reducing the bias introduced by labeled data. Experiments conducted with various encoders on six public datasets demonstrate that NT-GCL exhibits strong competitiveness in class-imbalanced node classification. © 2025 Elsevier Ltd

关键词： Class imbalance Graph contrastive learning Graph neural network Node classification Node transfer

来源：评论

学校读者我要写书评

暂无评论

Hand Hygiene Assessment via Joint Step Segmentation and key Action Scorer

arXiv

引用

arXiv 2022年

作者： Li, Chenglong Zhu, Qiwen Liu, Tubiao Tang, Jin Su, Yu Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Hefei Normal University Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230061 China

Hand hygiene is a standard six-step hand-washing action proposed by the World Health Organization (WHO). However, there is no good way to supervise medical staff to do hand hygiene, which brings the potential risk of disease spread. Existing action assessment works usually make an overall quality prediction on an entire video. However, the internal structures of hand hygiene action are important in hand hygiene assessment. Therefore, we propose a novel fine-grained learning framework to perform step segmentation and key action scorer in a joint manner for accurate hand hygiene assessment. Existing temporal segmentation methods usually employ multi-stage convolutional network to improve the segmentation robustness, but easily lead to over-segmentation due to the lack of the long-range dependence. To address this issue, we design a multi-stage convolution-transformer network for step segmentation. Based on the observation that each hand-washing step involves several key actions which determine the hand-washing quality, we design a set of key action scorers to evaluate the quality of key actions in each step. In addition, there lacks a unified dataset in hand hygiene assessment. Therefore, under the supervision of medical staff, we contribute a video dataset that contains 300 video sequences with fine-grained annotations. Extensive experiments on the dataset suggest that our method well assesses hand hygiene videos and achieves outstanding performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Joint relay selection and power allocation protocol for two-way relaying system

引用

International Journal of Wireless and Mobile computing 2019年第4期17卷 349-360页

作者： Zhi, Hui Zhu, Jun Hu, Yanjun Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui230601 China

The Joint Relay Selection and Power Allocation (JRSPA) for Amplify-and-Forward (AF) relaying (JRSPA-AF) combines Power Allocation (PA) and Relay Selection (RS) very well in Two- Way Relaying (TWR) system. In order to explore the system performance of JRSPA-AF protocol, the outage probability and Diversity-Multiplexing Trade-off (DMT) of JRSPA-AF protocol are analysed. One upper bound, two lower bounds and approximate expressions of outage probability along with the DMT are derived. Based on this, the idea of JRSPA is introduced into Decode-and- Forward (DF) relaying TWR system, and the JRSPA-DF protocol is proposed. Moreover, the exact expressions of outage probability and DMT for JRSPA-DF are derived. Simulations are developed to validate the analytical results, the results show that the approximation outage probability of JRSPA-AF can be used well to evaluate system outage probability over the entire transmission SNR region, and the analysis results of outage probability of JRSPA-DF are consistent with its simulation results. In addition, the simulation results indicate that JRSPA-DF can achieve lower outage probability than JRSPA-AF and other protocols. Copyright © 2019 Inderscience Enterprises Ltd.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

An Innovative Control Approach for Cyber-Physical Transportation Systems: The Case of Monte-Carlo Workflow Computations

An Innovative Control Approach for Cyber-Physical Transporta...

引用

Euromicro Conference on Parallel, Distributed and Network-Based processing

作者： Vladislav Kashansky Sara Agha Hossein Kashani Javier Garcia-Blas Fabrizio Marozzo Hai Zhuge Xiaoping Sun Research Laboratory Eteronix GmbH Vienna Austria Institute of Production and Logistics Management Business School Johannes Kepler Universität Linz Austria ARCOS Group Universidad Carlos III de Madrid Leganes Spain DIMES Department University of Calabria Rende Italy Key Laboratory of Intelligent Information Processing Institute of Computing Technology (ICTCAS) Beijing China

Contemporarily, in light of the intelligent transportation systems (ITS) sector, the tendency can be observed that the solution of the multi-objective cyber-physical optimization problems with imperfect information takes an increasingly weighted role. In the present scientific work, the authors want to take these developments into account by introducing an innovative cyber-physical architectural design and corresponding the two-stage heuristic computing approach. It is utilized in synergy with the MCSA 1 1 Multi-tier Cyber-physical System Architecture and DCEx architectural principles for the workflow scheduling of Monte-Carlo simulation, which is based on the intelligent and sustainable route-order dispatching process model. Factors such as emissions, transport costs, risks, and the individual weighting of orders are reflected in the model. In particular, the authors define a stochastic ILP-based 2 2 Integer Linear Programming monte-carlo workflow model. They further propose two-stage scheduling heuristic with 6-HEFT DAG relaxation as first stage and apply state-of-the-art techniques as a part of SCIP framework to solve 2nd 1–0 ILP-based stage; evaluate the performance of the scheduling approach. The authors obtain preliminary results of the second stage behavior using a realistic heterogeneous computing scenario and corresponding constraint structures within MACS simulator engine 3 3 Modular Architecture for Complex computing Systems Analysis. The results from the experiments illustrate moderate complexity of the approach. Scalability of the model looks promising for the applicability in various industry-related scenarios and corresponding computing environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploiting Completeness and Uncertainty of Pseudo Labels for Weakly Supervised Video Anomaly Detection

Exploiting Completeness and Uncertainty of Pseudo Labels for...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Chen Zhang Guorong Li Yuankai Qi Shuhui Wang Laiyun Qing Qingming Huang Ming-Hsuan Yang State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences Australian Institute for Machine Learning The University of Adelaide Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS University of California Merced

Weakly supervised video anomaly detection aims to identify abnormal events in videos using only video-level labels. Recently, two-stage self-training methods have achieved significant improvements by self-generating pseudo labels and self-refining anomaly scores with these labels. As the pseudo labels play a crucial role, we propose an enhancement framework by exploiting completeness and uncertainty properties for effective self-training. Specifically, we first design a multi-head classification module (each head serves as a classifier) with a diversity loss to maximize the distribution differences of predicted pseudo labels across heads. This encourages the generated pseudo labels to cover as many abnormal events as possible. We then devise an iterative uncertainty pseudo label refinement strategy, which improves not only the initial pseudo labels but also the updated ones obtained by the desired classifier in the second stage. Extensive experimental results demonstrate the proposed method performs favorably against state-of-the-art approaches on the UCF-Crime, TAD, and XD-Violence benchmark datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prompting Video-Language Foundation Models with Domain-specific Fine-grained Heuristics for Video Question Answering

arXiv

引用

arXiv 2024年

作者： Yu, Ting Fu, Kunhao Wang, Shuhui Huang, Qingming Yu, Jun School of Information Science and Technology Hangzhou Normal University Hangzhou311121 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China

Video Question Answering (VideoQA) represents a crucial intersection between video understanding and language processing, requiring both discriminative unimodal comprehension and sophisticated cross-modal interaction for accurate inference. Despite advancements in multi-modal pre-trained models and video-language foundation models, these systems often struggle with domain-specific VideoQA due to their generalized pre-training objectives. Addressing this gap necessitates bridging the divide between broad cross-modal knowledge and the specific inference demands of VideoQA tasks. To this end, we introduce HeurVidQA, a framework that leverages domain-specific entity-action heuristics to refine pre-trained video-language foundation models. Our approach treats these models as implicit knowledge engines, employing domain-specific entity-action prompters to direct the model’s focus toward precise cues that enhance reasoning. By delivering fine-grained heuristics, we improve the model’s ability to identify and interpret key entities and actions, thereby enhancing its reasoning capabilities. Extensive evaluations across multiple VideoQA datasets demonstrate that our method significantly outperforms existing models, underscoring the importance of integrating domain-specific knowledge into video-language models for more accurate and context-aware VideoQA. Copyright © 2024, The Authors. All rights reserved.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：