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

10th Conference on Sound and Music Technology, CSMT 2023

作者： Zhou, Monan Wu, Shangda Ji, Shaohua Li, Zijin Li, Wei Central Conservatory of Music Beijing China School of Computer Science and Technology Fudan University Shanghai200438 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai200433 China

ISBN: (纸本)9789819779611

This paper aims to develop a holistic evaluation method for piano sound quality to assist in purchasing decisions. Unlike previous studies that focused on the effect of piano performance techniques on sound quality, this study evaluates the inherent sound quality of different pianos. To derive quality evaluation systems, the study uses subjective questionnaires based on a piano sound quality dataset. The method selects the optimal piano classification models by comparing the fine-tuning results of different pre-training models of Convolutional Neural Networks (CNN). To improve the interpretability of the models, the study applies Equivalent Rectangular Bandwidth (ERB) analysis. The results reveal that musically trained individuals are better able to distinguish between the sound quality differences of different pianos. The best fine-tuned CNN pre-trained backbone achieves a high accuracy of 98.3% as the piano classifier. However, the dataset is limited, and the audio is sliced to increase its quantity, resulting in a lack of diversity and balance, so we use focal loss to reduce the impact of data imbalance. To optimize the method, the dataset will be expanded, or few-shot learning techniques will be employed in future research. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Relaxing Distillation Constraints for Improved New Class Learning in Continual Semantic Segmentation

Relaxing Distillation Constraints for Improved New Class Lea...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Ti, Zheng Hao, Xuze Chen, Renhai College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China

ISBN: (纸本)9798350368741

Continual Semantic Segmentation (CSS) aims to continuously learn new classes while mitigating catastrophic forgetting. Existing CSS methods primarily address this challenge through knowledge distillation. While they focus on maintaining stability for old classes, this emphasis often restricts plasticity in learning new ones. In this work, we propose two plug-and-play methods to better balance stability and plasticity. First, for feature map distillation, we replace pixel-level constraints with statistical information extraction within a window, improving the learning of new classes while preserving structural integrity to overcome forgetting. Second, we use relative ranks of predictions to replace exact probabilistic values to loosen the constraints in the logit distribution of old classes. Extensive experiments demonstrate that our methods outperform state-of-the-art methods when integrating into several baselines across various CSS scenarios. © 2025 IEEE.

关键词： Continual Learning Knowledge Distillation Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Stochastic Trajectory Optimization for Robotic Skill Acquisition From a Suboptimal Demonstration

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 6127-6134页

作者： Ming, Chenlin Wang, Zitong Zhang, Boxuan Cao, Zhanxiang Duan, Xiaoming He, Jianping Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Department of Automation Shanghai China School of Computation Information and Technology Germany Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China Shanghai Jiao Tong University State Key Laboratory of Submarine Geoscience the Department of Automation Shanghai200240 China

Learning from Demonstration (LfD) has emerged as a crucial method for robots to acquire new skills. However, when given suboptimal task trajectory demonstrations with shape characteristics reflecting human preferences but subpar dynamic attributes such as slow motion, robots not only need to mimic the behaviors but also optimize the dynamic performance. In this work, we leverage optimization-based methods to search for a superior-performing trajectory whose shape is similar to that of the demonstrated trajectory. Specifically, we use Dynamic Time Warping (DTW) to quantify the difference between two trajectories and combine it with additional performance metrics, such as collision cost, to construct the cost function. Moreover, we develop a multi-policy version of the Stochastic Trajectory Optimization for Motion Planning (STOMP), called MSTOMP, which is more stable and robust to parameter changes. To deal with the jitter in the demonstrated trajectory, we further utilize the gain-controlling method in the frequency domain to denoise the demonstration and propose a computationally more efficient metric, called Mean Square Error in the Spectrum (MSES), that measures the trajectories' differences in the frequency domain. We also theoretically highlight the connections between the time domain and the frequency domain methods. Finally, we verify our method in both simulation experiments and real-world experiments, showcasing its improved optimization performance and stability compared to existing methods. © 2016 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

MoME: Mixture of Multi-Domain Experts for Multivariate Long-Term Series Forecasting

MoME: Mixture of Multi-Domain Experts for Multivariate Long-...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Li, Xinyu Yang, Zhiheng Xu, Hao Cai, Yunqi Lu, Hong Wang, Xin Zhao, Jin Qi, Fenglin Shen, Jiajie School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Informatization Office Fudan University Shanghai China

ISBN: (纸本)9798350368741

Time series forecasting is always important, with multivariate long-term series forecasting being its most challenging task. Here, the existing methods typically learn only in a single domain and focus on optimizing model structures, leading to incomplete information mining and imprecise predictions. To address this, we propose a generalized Mixture of Multi-Domain Experts (MoME) for multivariate long-term series forecasting. Unlike most existing methods, MoME focuses on multi-perspective information mining and fusing. To this end, MoME transforms time series into the frequency and spatial domains to learn their respective representations. MoME regards variates information as embedded features and applies fast Fourier transform to the time dimension. Then it learns embedded features in the frequency domain. In spatial domain learning, MoME applies self-attention mechanism on the variates dimension to efficiently capture dependencies among multiple variates. Finally, MoME fuses the outputs from all domains, reinterprets and integrates information across multiple domains, and predicts future time series. Extensive experiments prove that MoME outperforms state-of-the-art (SOTA) methods. Code is available at: https://***/lxy-PhD2022/MoME. © 2025 IEEE.

关键词： Generalized MoE Multi-Domain learning Multivariate long-term forecasting Time series forecasting

来源：评论

学校读者我要写书评

暂无评论

RoBGuard: Enhancing LLMs to Assess Risk of Bias in Clinical Trial Documents 31

RoBGuard: Enhancing LLMs to Assess Risk of Bias in Clinical ...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Ji, Changkai Zhao, Bowen Wang, Zhuoyao Wang, Yingwen Zhang, Yuejie Cheng, Ying Feng, Rui Zhang, Xiaobo School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai200433 China National Children's Medical Center Children's Hospital of Fudan University Shanghai China

ISBN: (纸本)9798891761964

Randomized Controlled Trials (RCTs) are rigorous clinical studies crucial for reliable decision-making, but their credibility can be compromised by bias. The Cochrane Risk of Bias tool (RoB 2) assesses this risk, yet manual assessments are time-consuming and labor-intensive. Previous approaches have employed Large Language Models (LLMs) to automate this process. However, they typically focus on manually crafted prompts and a restricted set of simple questions, limiting their accuracy and generalizability. Inspired by the human bias assessment process, we propose RoBGuard, a novel framework for enhancing LLMs to assess the risk of bias in RCTs. Specifically, RoBGuard integrates medical knowledge-enhanced question reformulation, multimodal document parsing, and multi-expert collaboration to ensure both completeness and accuracy. Additionally, to address the lack of suitable datasets, we introduce two new datasets: RoB-Item and RoB-Domain. Experimental results demonstrate RoBGuard's effectiveness on the RoB-Item dataset, outperforming existing methods. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

MA-MFIF: When misaligned multi-focus Image fusion meets deep homography estimation

引用

Multimedia Tools and Applications 2025年第12期84卷 10877-10898页

作者： Zhao, Baojun Luo, Fei Fuentes, Joel Ding, Weichao Gu, Chunhua School of Information Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Information Technologies Universidad del Bio-Bio Chillán3780000 Chile

Multi-focus image fusion is a technique that combines multiple out-of-focus images to enhance the overall image quality. It has gained significant attention in recent years, thanks to the advancements in deep learning. However, one of the persistent challenges in this field is the processing of misaligned data, which can negatively impact the fusion results. To overcome this problem, a novel fusion framework with pre-registration is proposed for the fusion of misaligned multi-focus images. For pre-registration, content-aware deep homography estimation is used, which performs transfer learning on a real multi-focus image dataset to adapt to registration under defocused conditions. For fusion, a fusion module with dual-branch feature interaction is utilized to avoid invalid feature fusion and trained on real light field dataset to achieve better fusion performance. Qualitative and quantitative experimental results show that the proposed method has a 2-3 percentage point improvement in multiple evaluation metrics compared to existing advanced registration and fusion methods, and a maximum improvement of 4.83 percentage points in fusion performance when tested independently on the Lytro dataset. Additionally, We find that the value of the Qcv metric is greatly influenced by the alignment status of the input images, leading to its inability to reflect the fusion quality of aligned images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Optimal Production Capacity Matching for Blockchain-Enabled Manufacturing Collaboration With the Iterative Double Auction Method

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 550-562页

作者： Ying Chen Feilong Lin Zhongyu Chen Changbing Tang Cailian Chen the Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal University the School of Computer Science and Technology Zhejiang Normal University IEEE the College of Physics and Electronic Information Engineering Zhejiang Normal University the Department of Automation Shanghai Jiao Tong University

The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other. In this article, a blockchain-enabled manufacturing collaboration framework is proposed, with a focus on the production capacity matching problem for blockchainbased peer-to-peer(P2P) collaboration. First, a digital model of production capacity description is built for trustworthy and transparent sharing over the blockchain. Second, an optimization problem is formulated for P2P production capacity matching with objectives to maximize both social welfare and individual benefits of all participants. Third, a feasible solution based on an iterative double auction mechanism is designed to determine the optimal price and quantity for production capacity matching with a lack of personal information. It facilitates automation of the matching process while protecting users' privacy via blockchainbased smart contracts. Finally, simulation results from the Hyperledger Fabric-based prototype show that the proposed approach increases social welfare by 1.4% compared to the Bayesian game-based approach, makes all participants profitable,and achieves 90% fairness of enterprises.

关键词： Blockchain iterative double auction manufacturing collaboration production capacity matching

来源：评论

学校读者我要写书评

暂无评论

Multiband Kick Drum Separation with Genre-Guided Optimization 10th

Multiband Kick Drum Separation with Genre-Guided Optimizati...

引用

10th Conference on Sound and Music Technology, CSMT 2023

作者： Li, Si Jiang, Yuanfeng Wang, Zhaowen Qian, Jiale Li, Wei School of Computer Science and Technology Fudan University Shanghai200438 China Department of Music AI and Information Technology Central Conservatory of Music Beijing100091 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai200433 China

ISBN: (纸本)9789819779611

Kick drum plays an important role in electronic music. When hearing an excellent kick drum sound from a reference music track, music production beginners always feel confused about how it will sound if we solo the kick track and why it sounds perfect in a specific song. Reproducing the kick of a music track is not easy even for professional producers and arrangers. To investigate the ability of artificial intelligence in separating kick-drum sounds, in this paper we propose an end-to-end system which is capable of separating multi-genre high-quality electronic kick drum clips from mixed song tracks. Unlike most of the previous music source separation tasks, we only focus on the electronic kick drum rather than the whole percussion track. First, we design a multiband data representation approach for non-pitched percussions such as kick drums, then adopt a multi-discriminator module trained on a multi-genre kick drum corpus to further optimize the separated kick sound. To the authors’ knowledge, this study marks the first attempt at kick drum separation with stylistic optimization. Objective and subjective evaluations demonstrate that joint multiband representation and genre-guided optimisation can form a high-performance framework, showing a promising solution to the kick drum separation task. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Bilateral Pricing for Dynamic Association in Federated Edge Learning

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4684-4697页

作者： Pan, Bangqi Lu, Jianfeng Cao, Shuqin Liu, Jing Tian, Wenlong Li, Minglu Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Dalian University of Technology Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence China University of South China School of Computer Science and Technology Hengyang421001 China Zhejiang Normal University School of Computer Science and Technology Jinhua321004 China

Devices and servers in Federated Edge Learning (FEL) are self-interested and resource-constrained, making it critical to design incentives to improve model performance. However, dynamic network conditions raise energy consumption, while data heterogeneity undermines device cooperation. Current research overlooks the interplay between system efficiency and device clustering, resulting in suboptimal updates. To address these challenges, we develop BENCH, a bilateral pricing mechanism consisting of three core rules aimed at incentivizing participation from both devices and servers. Specifically, we first design a reward allocation rule, based on the Rubinstein bargaining model, which dynamically allocates rewards. Theoretically, we derive a closed-form solution for this rule, demonstrating BENCH achieves Nash equilibrium. Secondly, we design a device partitioning rule that leverages modularity to group similar devices, facilitating personalized edge aggregation to accelerate local data adaptation. Thirdly, we design an edge matching rule that employs the Kuhn-Munkres algorithm to balance the load at edge servers, thus minimizing the congestion. Together, these three rules enable hierarchical optimization of pricing and associations, effectively mitigating the impact of dynamic costs and device heterogeneity. Extensive experiments demonstrate BENCH's effectiveness in increasing device participation by 28.81% and improving model performance by 2.66% compared to state-of-the-art baselines. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

A survey of distributed algorithms for aggregative games

引用

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 859-871页

作者： Li, Huaqing Li, Jun Ran, Liang Zheng, Lifeng Huang, Tingwen Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing The College of Electronic and Information Engineering Southwest University Chongqing400715 China College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518107 China

Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：