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

arXiv 2022年

作者： Ma, Chuan Li, Jun Wei, Kang Liu, Bo Ding, Ming Yuan, Long Han, Zhu Poor, H. Vincent Zhejiang Laboratory Hangzhou311121 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China The School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210096 China The Department of Computing Hong Kong Polytechnic University 999077 Hong Kong The University of Technology SydneyNSW2007 Australia Data61 CSIRO NSW2015 Australia The School of Computer Science Nanjing University of Science and Technology Nanjing210096 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul Korea Republic of The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

Motivated by the advancing computational capacity of distributed end-user equipment (UE), as well as the increasing concerns about sharing private data, there has been considerable recent interest in machine learning (ML) and artificial intelligence (AI) that can be processed on distributed UEs. Specifically, in this paradigm, parts of a ML process are outsourced to multiple distributed UEs. Then the processed information is aggregated on a certain level at a central server, which turns a centralized ML process into a distributed one, and brings about significant benefits. However, this new distributed ML paradigm raises new risks of privacy and security issues. In this paper, we provide a survey on the emerging security and privacy risks of distributed ML from a unique perspective of information exchange levels, which are defined according to the key steps of a ML process, i.e.: i) the level of pre-processed data, ii) the level of learning models, iii) the level of extracted knowledge and, iv) the level of intermediate results. We explore and analyze the potential of threats for each information exchange level based on an overview of the current state-of-the-art attack mechanisms, and then discuss the possible defense methods against such threats. Finally, we complete the survey by providing an outlook on the challenges and possible directions for future research in this critical area. Copyright © 2022, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Fusing Global Structural and Local Deep Features for Thick Cloud Removal in Multitemporal Remote Sensing Images

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Yeqi Xu Yong Chen Maolin Chen Wei He Min Huang Jinshan Zeng School of Computer and Information Engineering Jiangxi Normal University Nanchang China School of Computer and Information Engineering and Jiangxi Provincial Key Laboratory for High Performance Computing Jiangxi Normal University Nanchang China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan China School of Geography and Environment Jiangxi Normal University Nanchang China School of Management Xi’an Jiaotong University Xi’an China

Optical remote sensing images are inevitably affected by thick cloud cover, leading to information missing, which seriously hinders subsequent Earth observation tasks. Existing cloud removal methods typically focus on extracting either global or local features, but lack effective fusion of these two aspects, resulting in deficiencies in recovering global structure and fine details. However, fusing multiple features is challenging for single-driven methods due to the diversity of images and clouds. To this end, this article proposes a novel joint-driven cloud removal framework that can simultaneously exploit the global structural and local deep features of both the image and cloud components. Specifically, in our joint-driven scheme, we devise a flexible model-driven low-rank group sparse decomposition method, in which the global temporal-spectral correlations and shared sparse features of multitemporal remote sensing images and clouds from different scenes are effectively captured. To fully account for the differences in the local features of images and clouds from different scenes, we devise effective data-driven dual self-supervised networks to adaptively learn their local deep features. Additionally, we design an efficient half-quadratic splitting algorithm to iteratively optimize the joint-driven model, fostering mutual enhancement between the two and achieving further performance improvements. Experimental results show that the proposed method outperforms existing thick cloud removal approaches in both simulated and real-world datasets, under varying factors such as spectral bands, cloud coverage, time nodes, and spatial resolutions.

关键词： Clouds Remote sensing Deep learning Adaptation models Feature extraction Optimization methods Training Tensors Image reconstruction Earth

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation and Workload Scheduling for Large-Scale Distributed Deep Learning: A Survey

arXiv

引用

arXiv 2024年

作者： Liang, Feng Zhang, Zhen Lu, Haifeng Li, Chengming Leung, Victor C.M. Guo, Yanyi Hu, Xiping Artificial Intelligence Research Institute Shenzhen MSU-BIT University 518107 China Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Shenzhen MSU-BIT University 518107 China Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University 730000 China Department of Electrical and Computer Engineering The University of British Columbia V6T 1Z4 Canada Frontier Cross Disciplinary Research Institute Shenzhen MSU-BIT University China School of Mechanical and Electrical Engineering Beijing Institute of Technology China School of Medical Technology Beijing Institute of Technology 10081 China

With rapidly increasing distributed deep learning workloads in large-scale data centers, efficient distributed deep learning framework strategies for resource allocation and workload scheduling have become the key to high-performance deep learning. The large-scale environment with large volumes of datasets, models, and computational and communication resources raises various unique challenges for resource allocation and workload scheduling in distributed deep learning, such as scheduling complexity, resource and workload heterogeneity, and fault tolerance. To uncover these challenges and corresponding solutions, this survey reviews the literature, mainly from 2019 to 2024, on efficient resource allocation and workload scheduling strategies for large-scale distributed DL. We explore these strategies by focusing on various resource types, scheduling granularity levels, and performance goals during distributed training and inference processes. We highlight critical challenges for each topic and discuss key insights of existing technologies. To illustrate practical large-scale resource allocation and workload scheduling in real distributed deep learning scenarios, we use a case study of training large language models. This survey aims to encourage computer science, artificial intelligence, and communications researchers to understand recent advances and explore future research directions for efficient framework strategies for large-scale distributed deep learning. © 2024, CC BY.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Automatic Classification of Strain in the Singing Voice Using Machine Learning

引用

Journal of Voice 2025年

作者： Liu, Yuanyuan Reddy, Mittapalle Kiran Yagnavajjula, Madhu Keerthana Räsänen, Okko Alku, Paavo Ikävalko, Tero Hakanpää, Tua Öyry, Aleksi Laukkanen, Anne-Maria Speech and Voice Research Laboratory Tampere University Tampere 33100 Finland Department of Computer Science and Engineering Indian Institute of Information Technology Raichur Karanataka Raichur 584135 India Advanced Technology Development Centre Indian Institute of Technology Kharagpur West Bengal Kharagpur 721302 India Unit of Computing Sciences Tampere University Tampere 33720 Finland Department of Information and Communications Engineering Aalto University Espoo 02150 Finland Faculty of Education University of Turku Turku 20014 Finland Aalto Acoustics Lab Aalto University Espoo 02150 Finland

Objectives: Classifying strain in the singing voice can help protect professional singers from vocal overuse and support singing training. This study investigates whether machine learning can automatically classify singing voices into two levels of perceived strain. The singing samples represent two genres: classical and contemporary commercial music (CCM). Methods: A total of 324 singing voice samples from 15 professional normophonic singers (nine female, six male) were analyzed. Nine singers were classical, and six were CCM singers. The samples consisted of syllable strings produced at three to six pitches and three loudness levels. Based on expert auditory-perceptual ratings, the samples were categorized into two strain levels: normal-mild and moderate-severe. Three acoustic feature sets (mel-frequency cepstral coefficients (MFCCs), the extended Geneva Minimalistic Acoustic Parameter Set (eGeMAPS), and wavelet scattering features) were compared using two classifier models [support vector machine (SVM) and multilayer perceptron (MLP)]. Feature selection was performed using recursive feature elimination, and the Mann-Whitney U test was used to assess the discriminative power of the selected features. Results: The highest classification accuracy of 86.1% was achieved using a subset of wavelet scattering features with the MLP classifier. A comparison between individual features showed that the first MFCC coefficient, representing spectral tilt, exhibited the greatest between-class separation. Conclusion: This study demonstrates that machine learning models utilizing selected acoustic features can classify perceptual strain of singing voices automatically with high accuracy. These preliminary findings highlight the potential for larger studies involving more diverse singer groups across different genres. © 2025 The Authors

关键词： Auditive-perceptual evaluation—Support vector machine—Multiple layer perceptron—Fisher vector—Wavelet scattering coefficients—Mel-frequency cepstral coefficients

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure Learning Benchmark

arXiv

引用

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Line Drawing Guided Progressive Inpainting of Mural Damage

arXiv

引用

arXiv 2022年

作者： Li, Luxi Zou, Qin Zhang, Fan Yu, Hongkai Chen, Long Song, Chengfang Huang, Xianfeng Wang, Xiaoguang Li, Qingquan Department of Computer Science Technology United International College of Beijing Normal University HongKong Baptist University Zhuhai China Machine Vision and Robotics Laboratory School of Computer Science Wuhan University Wuhan China State Key Laboratory of Surveying Mapping and Remote Sensing Information Engineering Wuhan University Wuhan China Department of Electrical Engineering and Computer Science Cleveland State University OH United States Institute of Automation Chinese Academy of Sciences Beijing China Cultural Heritage Intelligent Computing Laboratory Wuhan University Wuhan China Guangming Laboratory Shenzhen University Shenzhen China

Mural image inpainting is far less explored compared to its natural image counterpart and remains largely unsolved. Most existing image-inpainting methods tend to take the target image as the only input and directly repair the damage to generate a visually plausible result. These methods obtain high performance in restoration or completion of some pre-defined objects, e.g., human face, fabric texture, and printed texts, etc., however, are not suitable for repairing murals with varying subjects and large damaged areas. Moreover, due to discrete colors in paints, mural inpainting may suffer from apparent color bias. To this end, in this paper, we propose a line drawing guided progressive mural inpainting method. It divides the inpainting process into two steps: structure reconstruction and color correction, implemented by a structure reconstruction network (SRN) and a color correction network (CCN), respectively. In structure reconstruction, SRN utilizes the line drawing as an assistant to achieve large-scale content authenticity and structural stability. In color correction, CCN operates a local color adjustment for missing pixels which reduces the negative effects of color bias and edge jumping. The proposed approach is evaluated against the current state-of-the-art image inpainting methods. Qualitative and quantitative results demonstrate the superiority of the proposed method in mural image inpainting. The codes and data are available at https://***/qinnzou/mural-image-inpainting . © 2022, CC BY-NC-ND.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Sketch2Relief: Generating Bas-relief from Sketches with Deep Generative Networks

Sketch2Relief: Generating Bas-relief from Sketches with Deep...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Shizhe Zhou Zeyu Liu Key Laboratory of High Performance Computing and Stochastic Information Processing Ministry of Education of China College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (数字)9781728192284

ISBN: (纸本)9781728185361

We present a novel sketch-based system for generating digital bas-relief sculptures. All existing computational methods for generating digital bas-reliefs first require the input of a three-dimensional (3D) scene, thus preventing artists from freely creating or exploring designs when 3D data are not available. Motivated by this limitation, we propose a generative adversarial network (GAN)-based sketch modeling system for generating digital bas-reliefs from freehand user sketches (see Figure 1, 5). The basic tool underpinning the interface is a conditional GAN (cGAN) that digitally learns a functional map from a contour image to a 3D model for any given viewpoint of the corresponding bas-relief model. When using our system for designing bas-reliefs, the user only needs to draw 2D sketch lines without having to designate any additional hints on the lines. The interface returns bas-relief results in interactive time (500 ms per bas-relief on average). We tested the quality and robustness of our approach with extensive and comprehensive experiments. By carefully analyzing the results, we verified that our system can faithfully reconstruct bas-reliefs from a test dataset and can generate completely new reliefs from raw amateur sketches.

关键词： Solid modeling Three-dimensional displays Two dimensional displays Neural networks Tools Generative adversarial networks Robustness

来源：评论

学校读者我要写书评

暂无评论

Pre-Equalization Aided Grant-Free Massive Access in Massive MIMO System

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Yueqing Mei, Yikun Gao, Zhen Wan, Ziwei Ning, Boyu Mi, De Muhaidat, Sami School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology MIIT Key Laboratory of Complex-Field Intelligent Sensing Beijing100081 China Yangtze Delta Region Academy Jiaxing314019 China Beijing Institute of Technology Advanced Technology Research Institute Jinan250307 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China Birmingham City University School of Computing and Digital Technology BirminghamB55JU United Kingdom Khalifa University KU 6 G Research Center Department of Computer and Information Engineering Abu Dhabi United Arab Emirates

The spatial diversity and multiplexing advantages of massive multi-input-multi-output (mMIMO) can significantly improve the capacity of massive non-orthogonal multiple access (NOMA) in machine type communications. However, state-of-the-art grant-free massive NOMA schemes for mMIMO systems require accurate estimation of random access channels to perform activity detection and the following coherent data demodulation, which suffers from excessive pilot overhead and access latency. To address this, we propose a pre-equalization aided grant-free massive access scheme for mMIMO systems, where an iterative detection scheme is conceived. Specifically, the base station (BS) firstly activates one of its antennas (i.e., beacon antenna) to broadcast a beacon signal, which facilitates the user equipment (UEs) to perform downlink channel estimation and pre-equalize the uplink random access signal with respect to the channels associated with the beacon antenna. During the uplink transmission stage, the BS detects UEs' activity and data by using the proposed iterative detection algorithm, which consists of three modules: coarse data detection (DD), data-aided channel estimation (CE), and fine DD. In the proposed algorithm, the joint activity and DD is firstly performed based on the signals received by the beacon antenna. Subsequently, the DD is further refined by iteratively performing data-aided CE module and fine DD module using signals received by all BS antennas. Our simulation results demonstrate that the proposed scheme outperforms state-of-the-art mMIMO-based grant-free massive NOMA schemes with the same access latency. © 1967-2012 IEEE.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Transformer-Based Hierarchical Dynamic Decoders for Salient Object Detection

SSRN

引用

SSRN 2023年

作者： Zheng, Qingping Zheng, Ling Deng, Jiankang Li, Ying Shang, Changjing Shen, Qiang School of Computer Science National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech & Image Information Processing Northewestern Polytechnical University Shaanxi Xi’an710129 China Fuzhou Institute of Data Technology Fujian350200 China Department of Computing Imperial College London LondonSW7 2AZ United Kingdom

highlightsTransformer-Based Hierarchical Dynamic Decoders for Salient Object DetectionQingping Zheng, Ling Zheng, Jiankang Deng, Ying Li, Changjing Shang, Qiang Shen• T-HDDNet employs dynamic upsampling and fusion for data-driven salient object detection.• T-HDDNet uses a spatially sensitive loss to learn salient object structures, yielding a high-resolution map.• Our method exceeds benchmarks at 22.19G MACs and 27M Params, reducing costs compared to the top model. © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-based Energy-Aware Offloading in Edge-Cloud Vehicular Networks 18

Machine Learning-based Energy-Aware Offloading in Edge-Cloud...

引用

18th International Conference on Mobile Systems and Pervasive computing, MobiSPC 2021, The 16th International Conference on Future Networks and Communications, FNC 2021 and the 11th International Conference on Sustainable Energy information Technology, SEIT 2021

作者： Ismail, Leila Materwala, Huned Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi15551 United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi15551 United Arab Emirates

A vehicular network underpinned by the 3-tier vehicle-edge-cloud infrastructure enables an efficient and safer travel experience. The compute-intensive vehicular applications are often offloaded to the edge and/or cloud servers to enhance the applications' Quality of Services (QoS). The underlying edge-cloud servers consume a high among of energy. Consequently, it becomes crucial to optimizing energy consumption in the offloading process. Current energy-efficient offloading strategies in 2-tier vehicle-edge infrastructure, do not account for cloud computing energy consumption. In this paper, we address this void by proposing a machine learning-based energy-aware offloading algorithm, which optimizes the energy of the edge-cloud computing platform. The offloading strategy is enabled by the Support Vector Machine (SVM) regression model machine learning algorithm used for the edge-cloud power prediction. The experimental results show that the proposed algorithm is a promising approach in energy savings. © 2021 Elsevier B.V.. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：