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

International Conference on Computer Supported Cooperative Work in Design

作者： Qingzhi Zou Jing Zhao Ming Li Ling Chen Lin Yuan Ronghuan Zhang Yushuai Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The primary objective of medical image segmentation is the isolation of pathological tissues and distinct organs from medical images, thereby assisting in medical diagnosis. The methods employed for medical image segmentation encompass convolutional neural networks and transformer-based methods. Although the self-attention mechanism in Transformers improves its capability to capture long-range dependencies, it have limitations in learning local (contextual) relationships between pixels. Some previous research has tried to solve this problem by incorporating convolutional layers into the encoder or decoder of transformers, but sometimes feature inconsistencies arise. To better extract local features from images using convolutional neural networks and to fuse low-resolution and high-resolution features from higher-level and lower features, we propose the Convolutional Attention Augmentation TransUNet (CAA-TransUNet) model. In our model, firstly, we propose a convolutional attention augmentation module that enhances both local and global features by suppressing irrelevant background information. Secondly, we have integrated attention gates into the skip connections to aggregate feature information from various stages of the encoder during the upsampling process. Finally, we employ the technique of aggregating the loss of multi-stage features to expedite convergence speed and enhance performance. The experimental results on three public datasets demonstrate that our proposed model significantly outperforms the baseline methods.

关键词： Image segmentation Pathology Computational modeling Aggregates Logic gates Feature extraction Transformers

来源：评论

学校读者我要写书评

暂无评论

A High-Order Scheme for Fractional Ordinary Differential Equations with the Caputo-Fabrizio Derivative

引用

Communications on Applied Mathematics and Computation 2020年第2期2卷 179-199页

作者： Junying Cao Ziqiang Wang Chuanju Xu School of Data Science and Information Engineering Guizhou Minzu UniversityGuiyang 550025China School of Mathematical Sciences and Fujian Provincial Key Laboratory of Mathematical Modeling and High Performance Scientific Computing Xiamen UniversityXiamen 361005China

In this paper, we consider numerical solutions of fractional ordinary diferential equations with the Caputo-Fabrizio derivative, and construct and analyze a high-order time-stepping scheme for this equation. The proposed method makes use of quadratic interpolation function in sub-intervals, which allows to produce fourth-order convergence. A rigorous stability and convergence analysis of the proposed scheme is given. A series of numerical examples are presented to validate the theoretical claims. Traditionally a scheme having fourth-order convergence could only be obtained by using block-by-block technique. The advantage of our scheme is that the solution can be obtained step by step, which is cheaper than a block-by-block-based approach.

关键词： Caputo-Fabrizio derivative Fractional diferential equations High-order numerical scheme

来源：评论

学校读者我要写书评

暂无评论

Constraint Boundary Wandering Framework: Enhancing Constrained Optimization with Deep Neural Networks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Wu, Shuang Chen, Shixiang Shen, Li Zhang, Lefei Tao, Dacheng Wuhan University National Engineering Research Center for Multimedia Software School of Computer Science Wuhan430072 China University of Science and Technology of China Key Laboratory of the Ministry of Education for Mathematical Foundations and Applications of Digital Technology School of Mathematical Sciences China Shenzhen Campus of Sun Yat-sen University School of Cyber Science and Technology Shenzhen518107 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Constrained optimization problems are pervasive in various fields, and while conventional techniques offer solutions, they often struggle with scalability. Leveraging the power of deep neural networks (DNNs) in optimization, we present a novel learning-based approach, the Constraint Boundary Wandering Framework (CBWF), to address these challenges. Our contributions include introducing a boundary wandering strategy inspired by the active-set method, enhancing equality constraint feasibility, and treating the Lipschitz constant as a learnable parameter. Additionally, we evaluate the regularization term, illustrating that the nonsmooth L2 norm yields superior results. Extensive testing on synthetic datasets and the ACOPT dataset demonstrates CBWF's superiority, outperforming existing deep learning-based solvers in terms of both objective and constraint loss. © 1979-2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Low-Resolution Face Recognition via Bridge Distillation

arXiv

引用

arXiv 2024年

作者： Ge, Shiming Zhao, Shengwei Li, Chenyu Zhang, Yu Li, Jia The Institute of Information Engineering Chinese Academy of Sciences Beijing100095 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China SenseTime Group Limited 100084 China The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University China The Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China The Peng Cheng Laboratory Shenzhen518055 China

Face recognition in the wild is now advancing towards light-weight models, fast inference speed and resolution-adapted capability. In this paper, we propose a bridge distillation approach to turn a complex face model pretrained on private high-resolution faces into a light-weight one for low-resolution face recognition. In our approach, such a cross-dataset resolution-adapted knowledge transfer problem is solved via two-step distillation. In the first step, we conduct cross-dataset distillation to transfer the prior knowledge from private high-resolution faces to public high-resolution faces and generate compact and discriminative features. In the second step, the resolution-adapted distillation is conducted to further transfer the prior knowledge to synthetic low-resolution faces via multi-task learning. By learning low-resolution face representations and mimicking the adapted high-resolution knowledge, a light-weight student model can be constructed with high efficiency and promising accuracy in recognizing low-resolution faces. Experimental results show that the student model performs impressively in recognizing low-resolution faces with only 0.21M parameters and 0.057MB memory. Meanwhile, its speed reaches up to 14,705, 934 and 763 faces per second on GPU, CPU and mobile phone, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

FEST: Feature Enhancement Swin Transformer for Remote Sensing Image Semantic Segmentation

FEST: Feature Enhancement Swin Transformer for Remote Sensin...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Ronghuan Zhang Jing Zhao Ming Li Qingzhi Zou Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The global context is crucial for the precise segmentation of remote sensing images. However, the large volumes and high spatial resolutions of remote sensing images make efficient analysis of the entire scene challenging for most convolutional neural network (CNN)-based methods. To address this issue, we propose to design an innovative framework for semantic segmentation of remote sensing images called Feature Enhancement Swin Transformer (FEST). Firstly, we utilize the Swin Transformer as the encoder and incorporates a Global Information Enhancement Model (GIEM) within each Swin Transformer block to reduce information loss and enable encoding of more accurate spatial information. Secondly, we introduce an enhanced decoding structure called Enhanced Feature Fusion Module (EFFM) with added enhanced channel and spatial attention modules to retain localized information while obtaining extensive contextual information. Finally, for loss calculation, we utilize the dice and cross-entropy loss to jointly supervise the model, aiming to achieve a competitive performance. We comprehensively evaluated FEST on the ISPRS-Vaihingen and Potsdam datasets. The results indicate that our approach has achieved significant improvements in semantic segmentation tasks compared to existing methods.

关键词： Deep learning Federated learning Semantic segmentation Semantics Transformers Information retrieval Encoding

来源：评论

学校读者我要写书评

暂无评论

RECURSIVE DISENTANGLEMENT NETWORK 10

RECURSIVE DISENTANGLEMENT NETWORK

引用

10th International Conference on Learning Representations, ICLR 2022

作者： Chen, Yixuan Shi, Yubin Li, Dongsheng Wang, Yujiang Dong, Mingzhi Zhao, Yingying Dick, Robert Lv, Qin Yang, Fan Shang, Li China and Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Microsoft Research Asia Shanghai China Department of Computing Imperial College London London United Kingdom Department of Electrical Engineering and Computer Science University of Michigan Michigan United States Department of Computer Science University of Colorado Boulder Boulder United States School of Microelectronics Fudan University Shanghai China

Disentangled feature representation is essential for data-efficient learning. The feature space of deep models is inherently compositional. Existing β-VAE-based methods, which only apply disentanglement regularization to the resulting embedding space of deep models, cannot effectively regularize such compositional feature space, resulting in unsatisfactory disentangled results. In this paper, we formulate the compositional disentanglement learning problem from an information-theoretic perspective and propose a recursive disentanglement network (RecurD) that propagates regulatory inductive bias recursively across the compositional feature space during disentangled representation learning. Experimental studies demonstrate that RecurD outperforms β-VAE and several of its state-of-the-art variants on disentangled representation learning and enables more data-efficient downstream machine learning tasks. © 2022 ICLR 2022 - 10th International Conference on Learning Representationss. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Activity Detection for Cell-Free Massive MIMO: From Centralized to Distributed Algorithms

arXiv

引用

arXiv 2022年

作者： Li, Yang Lin, Qingfeng Liu, Ya-Feng Ai, Bo Wu, Yik-Chung Shenzhen Research Institute of Big Data Shenzhen518172 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China

Device activity detection in the emerging cell-free massive multiple-input multiple-output (MIMO) systems has been recognized as a crucial task in machine-type communications, in which multiple access points (APs) jointly identify the active devices from a large number of potential devices based on the received signals. Most of the existing works addressing this problem rely on the impractical assumption that different active devices transmit signals synchronously. However, in practice, synchronization cannot be guaranteed due to the low-cost oscillators, which brings additional discontinuous and nonconvex constraints to the detection problem. To address this challenge, this paper reveals an equivalent reformulation to the asynchronous activity detection problem, which facilitates the development of a centralized algorithm and a distributed algorithm that satisfy the highly nonconvex constraints in a gentle fashion as the iteration number increases, so that the sequence generated by the proposed algorithms can get around bad stationary points. To reduce the capacity requirements of the fronthauls, we further design a communication-efficient accelerated distributed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms outperform state-of-the-art approaches, and the proposed accelerated distributed algorithm achieves a close detection performance to that of the centralized algorithm but with a much smaller number of bits to be transmitted on the fronthaul links. Copyright © 2022, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

LGDB-Net: Dual-Branch Path for Building Extraction from Remote Sensing Image

LGDB-Net: Dual-Branch Path for Building Extraction from Remo...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

ISBN: (数字)9798331515966

ISBN: (纸本)9798331515973

Extracting buildings from remote sensing images using deep learning techniques is a widely applied and crucial task. Convolutional Neural Networks (CNNs) adopt hierarchical feature representation, showcasing powerful capabilities in extracting local information but facing challenges in capturing global features. Transformers can address this limitation, but they perform poorly in extracting local features and significantly increase memory requirements and computational complexity. To overcome these challenges, we propose a method for building extraction from remote sensing images called LGDB-Net (Local-Global Dual-Branch Network), employing a dual-branch approach. Firstly, inspired by Swin Transformer, we designed GB-Former(Global Branch-Former) as the backbone network to model global information. We use a linear multi-head self-attention mechanism to reduce time and memory complexity while maintaining a large global receptive field. Additionally, we replace the traditional multi-layer perceptron with a convolution-enhanced multi-layer perceptron to improve channel feature representation, reduce model parameters, and enhance segmentation performance. Secondly, we use multiple Depth-wise Conv3×3 + LN (Layer Normalization) + GeLU (Gaussian Error Linear Unit) modules as the auxiliary branch for local detailed feature extraction. Finally, we adopt a multi-scale feature fusion strategy to integrate feature information from both branches. We conduct a series of experiments on three datasets: WHU, Massachusetts, and Inria. The experimental results demonstrate that the proposed method not only effectively improves segmentation accuracy with lower building omission and commission rates but also significantly reduces model parameters and computational complexity.

关键词： Accuracy Computational modeling Memory management Neural networks Feature extraction Transformers Sensors data mining Computational complexity Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Audio-visual Target Speaker Extraction with Reverse Selective Auditory Attention

arXiv

引用

arXiv 2024年

作者： Tao, Ruijie Qian, Xinyuan Jiang, Yidi Li, Junjie Wang, Jiadong Li, Haizhou Department of Electrical and Computer Engineering National University of Singapore Singapore Department of Computer Science and Technology University of Science and Technology Beijing Beijing100083 China Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big data Shenzhen518172 China Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore University of Bremen 28359 Germany

Audio-visual target speaker extraction (AV-TSE) aims to extract the specific person’s speech from the audio mixture given auxiliary visual cues. Previous methods usually search for the target voice through speech-lip synchronization. However, this strategy mainly focuses on the existence of target speech, while ignoring the variations of the noise characteristics, i.e., interference speaker and the background noise. That may result in extracting noisy signals from the incorrect sound source in challenging acoustic situations. To this end, we propose a novel selective auditory attention mechanism, which can suppress interference speakers and non-speech signals to avoid incorrect speaker extraction. By estimating and utilizing the undesired noisy signal through this mechanism, we design an AV-TSE framework named Subtraction-and-ExtrAction network (SEANet) to suppress the noisy signals. We conduct abundant experiments by re-implementing three popular AV-TSE methods as the baselines and involving nine metrics for evaluation. The experimental results show that our proposed SEANet achieves state-of-the-art results and performs well for all five datasets. The code can be found in: https://***/TaoRuijie/*** © 2024, CC BY.

关键词： Background noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：