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

EC²Detect: Real-Time Online Video Object Detection in Edge-Cloud Collaborative IoT

IEEE Internet of Things Journal 2022年第20期9卷 20382-20392页

作者： Siyan Guo Cong Zhao Guiqin Wang Jiaqing Yang Shusen Yang National Engineering Laboratory for Big Data Analytics and the School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China Department of Computing Imperial College London London U.K. National Engineering Laboratory for Big Data Analytics and the School of Computer Science and Technology Xi’an Jiaotong University Xi’an China School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China National Engineering Laboratory for Big Data Analytics and Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China Industrial Artificial Intelligence Center Pazhou Laboratory Guangzhou China

Video object detection is a fundamental technology of intelligent video analytics for Internet of Things (IoT) applications. However, even with extraordinary detection accuracy, predominating solutions based on deep convolutional neural networks (DCNNs) cannot achieve real-time online object detection on video streams with a low end-to-end (E2E) response latency and therefore cannot be applied to proliferating latency-sensitive IoT applications like autonomous driving requiring large-scale intelligent video analytics. To address this issue, we present EC2Detect, an edge-cloud collaborative real-time online video object detection method. Specifically, we propose a tracking-assisted object detection architecture based on edge-cloud collaboration with keyframe selection, where the accurate but heavy object detection is conducted by the Cloud on sparse keyframes adaptively selected according to their semantic variation, and the lightweight object tracking is used to localize and identify objects in other frames at edge devices. Extensive experiments of our real-world prototype demonstrate that, EC2Detect significantly outperforms state-of-the-art methods in terms of processing speed (up to $4.77\times $ faster), E2E latency (up to $8.12 \times $ lower), and edge-cloud bandwidth occupation ( $17 \times $ lower) with an acceptable mAP, which can effectively support large-scale intelligent video analytics in practice. Source code of EC2Detect is available at https://***/ECCDetect/ECCDetect .

关键词： Object detection Image edge detection Streaming media Internet of Things Collaboration Visual analytics Feature extraction

来源：评论

学校读者我要写书评

暂无评论

StyleGene: Crossover and Mutation of Region-level Facial Genes for Kinship Face Synthesis

StyleGene: Crossover and Mutation of Region-level Facial Gen...

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： Hao Li xianxu Hou Zepeng Huang Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University

High-fidelity kinship face synthesis has many potential applications, such as kinship verification, missing child identification, and social media analysis. However, it is challenging to synthesize high-quality descendant faces with genetic relations due to the lack of large-scale, high-quality annotated kinship data. This paper proposes RFG (Region-level Facial Gene) extraction framework to address this issue. We propose to use IGE (Image-based Gene Encoder), LGE (Latent-based Gene Encoder) and Gene Decoder to learn the RFGs of a given face image, and the relationships between RFGs and the latent space of Style-GAN2. As cycle-like losses are designed to measure the $\mathcal{L}_data$ distances between the output of Gene Decoder and image encoder, and that between the output of LGE and IGE, only face images are required to train our framework, i.e. no paired kinship face data is required. Based upon the proposed RFGs, a crossover and mutation module is further designed to inherit the facial parts of parents. A Gene Pool has also been used to introduce the variations into the mutation of RFGs. The diversity of the faces of descendants can thus be significantly increased. Qualitative, quantitative, and subjective experiments on FIW, TSKinFace, and FF-databases clearly show that the quality and diversity of kinship faces generated by our approach are much better than the existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mind Reasoning Manners: Enhancing Type Perception for Generalized Zero-shot Logical Reasoning over Text

arXiv

引用

arxiv 2023年

作者： Xu, Fangzhi Liu, Jun Lin, Qika Zhao, Tianzhe Zhang, Jian Zhang, Lingling School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D National Engineering lab for Big Data Analytics Xi’an China

Logical reasoning task involves diverse types of complex reasoning over text, based on the form of multiple-choice question answering. Given the context, question and a set of options as the input, previous methods achieve superior performances on the full-data setting. However, the current benchmark dataset has the ideal assumption that the reasoning type distribution on the train split is close to the test split, which is inconsistent with many real application scenarios. To address it, there remain two problems to be studied: (1) How is the zero-shot capability of the models (train on seen types and test on unseen types)? (2) How to enhance the perception of reasoning types for the models? For problem 1, we propose a new benchmark for generalized zero-shot logical reasoning, named ZsLR. It includes six splits based on the three type sampling strategies. For problem 2, a type-aware model TaCo is proposed. It utilizes both the heuristic input reconstruction and the contrastive learning to improve the type perception in the global representation. Extensive experiments on both the zero-shot and full-data settings prove the superiority of TaCo over the state-of-the-art methods. Also, we experiment and verify the generalization capability of TaCo on other logical reasoning dataset. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

SFDA-rPPG: Source-Free Domain Adaptive Remote Physiological Measurement with Spatio-Temporal Consistency

arXiv

引用

arxiv 2024年

作者： xie, Yiping Yu, Zitong Wu, Bingjie xie, Weicheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Singapore

Remote Photoplethysmography (rPPG) is a non-contact method that uses facial video to predict changes in blood volume, enabling physiological metrics measurement. Traditional rPPG models often struggle with poor generalization capacity in unseen domains. Current solutions to this problem is to improve its generalization in the target domain through Domain Generalization (DG) or Domain Adaptation (DA). However, both traditional methods require access to both source domain data and target domain data, which cannot be implemented in scenarios with limited access to source data, and another issue is the privacy of accessing source domain data. In this paper, we propose the first Source-free Domain Adaptation benchmark for rPPG measurement (SFDA-rPPG), which overcomes these limitations by enabling effective domain adaptation without access to source domain data. Our framework incorporates a Three-Branch Spatio-Temporal Consistency Network (TSTC-Net) to enhance feature consistency across domains. Furthermore, we propose a new rPPG distribution alignment loss based on the Frequency-domain Wasserstein Distance (FWD), which leverages optimal transport to align power spectrum distributions across domains effectively and further enforces the alignment of the three branches. Extensive cross-domain experiments and ablation studies demonstrate the effectiveness of our proposed method in source-free domain adaptation settings. Our findings highlight the significant contribution of the proposed FWD loss for distributional alignment, providing a valuable reference for future research and applications. The source code is available at https://***/xieYiping66/SFDA-rPPG. Copyright © 2024, The Authors. All rights reserved.

关键词： Photoplethysmography

来源：评论

学校读者我要写书评

暂无评论

Federated Distributed Deep Reinforcement Learning for Recommendation-enabled Edge Caching

Federated Distributed Deep Reinforcement Learning for Recomm...

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Hao Wang Huan Zhou Mingze Lit Liang Zhao Victor C.M. Leung Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering College of Computer and Information Technology China Three Gorges University Yichang China School of Computer Science Northwestern Polytechnical University Xi'an China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350384475

ISBN: (纸本)9798350384482

This paper investigates a content recommendation-based edge caching method in multi-tier edge-cloud networks while considering content delivery and cache replacement decisions as well as bandwidth allocation strategies. First, we formu-late the optimization problem with the goal of minimizing long-term content delivery delay. Second, we model the optimization problem as a Partially Observable Markov Decision Process, and propose a Federated Distributed Deep Deterministic Policy Gradient-based method (FD3PG) to solve the corresponding problem. In conclusion, simulation results demonstrate that the proposed FD3PG achieves not only a much lower content delivery delay but also a higher cache hit rate compared with other baselines in various scenarios.

关键词： Simulation Markov decision processes Conferences Channel allocation Deep reinforcement learning Delays Optimization

来源：评论

学校读者我要写书评

暂无评论

TD3-Based Collaborative Computation Offloading and Charging Scheduling in Multi-UAV-Assisted MEC Networks

TD3-Based Collaborative Computation Offloading and Charging ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Liang Zhao Yujun Yao Huan Zhou Hao Wang Victor C. M. Leung Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering College of Computer and Information Technology China Three Gorges University Yichang China School of Computer Science Northwestern Polytechnical University Xi'an China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350303582

ISBN: (纸本)9798350303599

Computation offloading, resource allocation, and endurance issues in unmanned aerial vehicle (UAV)-aided mobile edge computing (MEC) networks have always been a research focus. UAV-aided MEC allows mobile users (MUs)' tasks to be offloaded to drones for processing in special scenarios, such as natural disasters or military attacks. However, as the number and size of offloaded tasks increase, a single UAV is difficult to meet all computational demands, result in the decline of QoS. To address this issue, this paper presents a collaborative computation offloading scheme where multiple UAVs can cooperate to handle massive tasks. Firstly, considering that battery-limited UAVs cannot complete all tasks and sustain flight without charging, we incorporate charging stations (CS) into multi-UAV-assisted MEC networks. Subsequently, we design a price-based incentive mechanism to maximize the total revenue obtained from UAVs' collaborative computation. Then, we formulate the joint optimization problem of computation offloading, resource allocation and charging scheduling as a Markov Decision Process (MDP), and propose a Twin Delayed Deep Deterministic policy gradient (TD3) algorithm to find optimal strategies. Finally, extensive simulations demonstrate that the proposed TD3 algorithm outperforms other benchmark methods, achieving the highest overall system utility under different scenarios.

关键词： Processor scheduling Computational modeling Inductive charging Collaboration Charging stations Scheduling Resource management

来源：评论

学校读者我要写书评

暂无评论

Towards Exploratory Query Optimization for Template-Based Sql

SSRN

引用

SSRN 2023年

作者： Feng, Jieming Li, Zhanhuai Chen, Qun School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Ministry of Industry and Information Technology China

SQL query optimization aims to choose an optimal Query Execution Plan (QEP) for a query. The existing optimizers usually choose the plan with the minimal execution cost. However, in some real scenarios (e.g., cloud OLAP), it is a business imperative to minimize the cost of an entire workload. Unfortunately, the greedy optimizers are prone to generating execution plans that are only suboptimal from the workload perspective. In this paper, we propose a novel QEP optimization approach for template-based SQL that aims to minimize the execution cost of an entire workload instead of individual queries. While choosing an execution plan for a query, the proposed approach considers a plan's impact on future query execution as well as its own execution cost. We first define an exploratory metric, Plan Exploration Value (PEV), to measure a plan's potential benefit to future query execution. Then, we model exploratory plan selection as an optimization problem with cost constraints, and present an efficient algorithm based on dynamic programming for its solution. Finally, we evaluate the performance of the proposed approach by a comparative study on benchmark workloads. Our extensive experiments have shown that it generates more efficient workload execution plans than the existing alternatives. © 2023, The Authors. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Enhancing cell subpopulation discovery in cancer by integrating single-cell transcriptome and expressed variants

引用

Fundamental Research 2025年

作者： Wang, Tao Mai, Duoduo Shu, Han Hu, Jialu Wang, Yongtian Peng, Jiajie Chen, Jing Shang, Xuequn School of Computer Science Northwestern Polytechnical University Xian 710072 China Key Laboratory of Big Data Storage and Management Ministry of Industry and Information Technology Northwestern Polytechnical University Xian 710072 China School of Computer Science and Engineering Xi'an University of Technology Xian 710048 China

The emergence of single-cell RNA sequencing (scRNA-seq) technology has revolutionized the study of cellular heterogeneity at the single-cell level. However, existing methods for identifying subpopulations of cells in scRNA-seq data mainly rely on gene expression features, neglecting the valuable genomic information present in the raw sequencing data. To address this limitation, we propose an end-to-end deep clustering model called scCluster, which integrates single-cell gene expression profiles and expressed variant features derived from the raw scRNA-seq data to stratify cell subpopulations in cancer tissues. scCluster employs a joint optimization strategy that combines a zero-inflated negative binomial model-based dual-modal autoencoder with deep embedding clustering in the pre-training phase. This allows both gene expression profiles and variant features to be encoded into the same latent embedding space. In the fine-tuning stage, scCluster further enhances the discriminability of the latent representations by integrating deep soft K-means clustering and cross-instance guided contrastive clustering techniques. Our extensive evaluations reveal that scCluster surpasses state-of-the-art methods in multiple real-world cancer scRNA-seq datasets. The results also indicate that incorporating the expressed variant features alongside gene expressions substantially enhances the stratification of cell subpopulations in cancer single-cell research. © 2025

关键词： Cancer Deep learning Expressed variants Multi-omics data integration Single-cell subpopulation

来源：评论

学校读者我要写书评

暂无评论

Siamese Network Visual Tracking Algorithm Based on GCT Attention and Dual-Template Update

Siamese Network Visual Tracking Algorithm Based on GCT Atten...

引用

Natural Language Processing (ICNLP), International Conference on

作者： Sugang Ma Siwei Sun Lei Pu xiaobao Yang School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an China School of Operational Support Rocket Force Engineering University Xi’an China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an China

To address the problem of insufficient representational capability and lack of online update of the Fully-convolutional Siamese Network (SiamFC) tracker in complex scenes, this paper proposes a siamese network visual tracking algorithm based on GCT attention and dual-template update mechanism. First, the feature extraction network is constructed by replacing AlexNet with the VGG16 network and SoftPool is used to replace the maximum pooling layer. Secondly, the attention module is added after the backbone network to enhance the network’s ability to extract object features. Finally, a dual-template update mechanism is designed for response map fusion. Average Peak-to-Correlation Energy (APCE) is used to determine whether to update the dynamic templates, effectively improving the tracking robustness. The proposed algorithm is trained on the Got-10k dataset and tested on the OTB2015 and VOT2018 datasets. The experimental results show that, compared with SiamFC, the success rate and accuracy reach 0.663 and 0.891 on the OTB2015, which improve respectively 7.6% and 11.9%; On the VOT2018 dataset, the tracking accuracy, robustness and EAO are improved respectively by 2.9%, 29% and 14%. The proposed algorithm achieves high tracking accuracy in complex scenes and the tracking speed reaches 52.6 Fps, which meets the real-time tracking requirements.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arxiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：