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

ChainHOI: Joint-based Kinematic Chain Modeling for Human-Object Interaction Generation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zeng, Ling-An Huang, Guohong Wei, Yi-Lin Gu, Shengbo Tang, Yu-Ming Meng, Jingke Zheng, Wei-Shi Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

We propose ChainHOI, a novel approach for text-driven human-object interaction (HOI) generation that explicitly models interactions at both the joint and kinetic chain levels. Unlike existing methods that implicitly model interactions using full-body poses as tokens, we argue that explicitly modeling joint-level interactions is more natural and effective for generating realistic HOIs, as it directly captures the geometric and semantic relationships between joints, rather than modeling interactions in the latent pose space. To this end, ChainHOI introduces a novel joint graph to capture potential interactions with objects, and a Generative Spatiotemporal Graph Convolution Network to explicitly model interactions at the joint level. Furthermore, we propose a Kinematics-based Interaction Module that explicitly models interactions at the kinetic chain level, ensuring more realistic and biomechanically coherent motions. Evaluations on two public datasets demonstrate that ChainHOI significantly outperforms previous methods, generating more realistic, and semantically consistent HOIs. Code is available here. Copyright © 2025, The Authors. All rights reserved.

关键词： Kinematics

PPGF: Probability Pattern-Guided Time Series Forecasting

学校读者我要写书评

暂无评论

IEEE Transactions on Neural Networks and Learning Systems 2025年 PP卷 PP页

作者： Sun, Yanru Xie, Zongxia Xing, Haoyu Yu, Hualong Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin Key Laboratory of Machine Learning Tianjin300350 China

Time series forecasting (TSF) is an essential branch of machine learning with various applications. Most methods for TSF focus on constructing different networks to extract better information and improve performance. However, practical application data contain different internal mechanisms, resulting in a mixture of multiple patterns. That is, the model's ability to fit different patterns is different and generates different errors. In order to solve this problem, we propose an end-to-end framework, namely probability pattern-guided time series forecasting (PPGF). PPGF reformulates the TSF problem as a forecasting task guided by probabilistic pattern classification. First, we propose the grouping strategy to approach forecasting problems as classification and alleviate the impact of data imbalance on classification. Second, we predict the corresponding class interval to guarantee the consistency of classification and forecasting. In addition, true class probability (TCP) is introduced to pay more attention to the difficult samples to improve the classification accuracy. Detailedly, PPGF classifies the different patterns to determine which one the target value may belong to and estimates it accurately in the corresponding interval. To demonstrate the effectiveness of the proposed framework, we conduct extensive experiments on real-world datasets, and PPGF achieves significant performance improvements over several baseline methods. Furthermore, the effectiveness of TCP and the necessity of consistency between classification and forecasting are proved in the experiments. All data and codes are available online: https://***/syrGitHub/PPGF. © 2025 IEEE.

关键词： Prediction models

Byzantine-robust distributed support vector machine

学校读者我要写书评

暂无评论

Science China Mathematics 2025年第3期68卷 707-728页

作者： Xiaozhou Wang Weidong Liu Xiaojun Mao School of Statistics East China Normal UniversityShanghai 200062China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(Ministry of Education) East China Normal UniversityShanghai 200062China School of Mathematical Sciences Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Artificial Intelligence(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Scientific and Engineering Computing(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China

The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.

关键词： Byzantine robustness convergence distributed learning support vector machine

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

学校读者我要写书评

暂无评论

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

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

Multi-scale Re-weighted Attention Feature Fusion for Non-Intrusive Load Monitoring

学校读者我要写书评

暂无评论

Multi-scale Re-weighted Attention Feature Fusion for Non-Int...

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

作者： Yang, Lingxi Sun, Meijun Ran, Haowei Liu, Yipu Zhou, Yan Wang, Zheng College of Intelligence and Computing Tianjin University Tianjin China Tianjin Key Laboratory of Machine Learning Tianjin University Tianjin China School of Disaster and Emergency Medicine Tianjin University Tianjin China

ISBN: (纸本)9798350368741

Non-Intrusive Load Monitoring (NILM) addresses the challenge of disaggregating total energy consumption into individual appliance usage, which is essential for enhancing energy efficiency and managing smart grids. Existing methods often overlook the impact of window sizes on the separation of appliance-level power signals, leading to appliance power aliasing (APA), where a single total power curve corresponds to multiple operating conditions and appliance couplings. A larger window captures global features noise, but it also exacerbates APA, thereby enlarging the solution space. In contrast, a smaller window mitigates APA but it introduces noise and increases complexity. To address these limitations, we propose the MultiScale Re-weighted Attention Feature Fusion (MRAFF) model, which employs a multi-scale framework to manage temporal variations and incorporates a re-weighted attention module to enhance multi-scale interactions, thereby improving feature representation. Experimental results demonstrate that our MRAFF model significantly outperforms baseline models on the REDD and UK-DALE datasets, achieving improvements ranging from 2.27% to 10.5% in MAE and from 33.74% to 58.34% in SAE. © 2025 IEEE.

关键词： appliance power aliasing deep learning MRAFF modle muti-scale time series NILM

Task-Oriented 6-DoF Grasp Pose Detection in Clutters

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, An-Lan Chen, Nuo Lin, Kun-Yu Li, Yuan-Ming Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

In general, humans would grasp an object differently for different tasks, e.g., "grasping the handle of a knife to cut" vs. "grasping the blade to hand over". In the field of robotic grasp pose detection research, some existing works consider this task-oriented grasping and made some progress, but they are generally constrained by low-DoF gripper type or non-cluttered setting, which is not applicable for human assistance in real life. With an aim to get more general and practical grasp models, in this paper, we investigate the problem named Task-Oriented 6-DoF Grasp Pose Detection in Clutters (TO6DGC), which extends the task-oriented problem to a more general 6-DOF Grasp Pose Detection in Cluttered (multi-object) scenario. To this end, we construct a large-scale 6-DoF task-oriented grasping dataset, 6-DoF Task Grasp (6DTG), which features 4391 cluttered scenes with over 2 million 6-DoF grasp poses. Each grasp is annotated with a specific task, involving 6 tasks and 198 objects in total. Moreover, we propose One-Stage TaskGrasp (OSTG), a strong baseline to address the TO6DGC problem. Our OSTG adopts a task-oriented point selection strategy to detect where to grasp, and a task-oriented grasp generation module to decide how to grasp given a specific task. To evaluate the effectiveness of OSTG, extensive experiments are conducted on 6DTG. The results show that our method outperforms various baselines on multiple metrics. Real robot experiments also verify that our OSTG has a better perception of the task-oriented grasp points and 6-DoF grasp poses. © 2025, CC BY.

关键词： Clutter (information theory)

Co-training with Progressive Distribution Alignment and Uncertainty-Interactive Relabeling for Semi-Supervised Domain Adaptive Semantic Segmentation

学校读者我要写书评

暂无评论

Co-training with Progressive Distribution Alignment and Unce...

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ruiguo Yu Yida Wang Xuewei Li Xuzhou Fu Zijian Zhang Yuan Tian Jie Gao College of Intelligence and Computing Tianjin University China Tianjin Key Laboratory of Cognitive Computing and Application China Tianjin Key Laboratory of Advanced Networking China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Self-training is a strong baseline for semi-supervised domain adaptive semantic segmentation. However, it inevitably introduces biased links between features and concepts in the prediction of certain "hard pixels", which may mislead the generalization of models. We consider these hard pixels to come from two aspects: First, the labels are severely imbalanced and distributed across domains and classes, which may lead to features biased towards source domains and majority classes. Second, the naive threshold filtering pseudo-label methods limit the supervision of hard pixels. To address the above problems, we propose a novel co-training framework with progressive distribution alignment and uncertainty-interactive relabeling strategies. More concretely, a progressive distribution alignment strategy is proposed to match distribution across domains while providing additional supervision for tail class pixels. Additionally, an uncertainty-interactive relabeling strategy is proposed to retain more supervisory information for hard pixels and reduce the overall uncertainty of the pseudo-labels. Experiments on two widely-used benchmarks demonstrate the effectiveness of the proposed PDAUR, achieving state-of-the-art results.

关键词： Adaptation models Uncertainty Filtering Semantic segmentation Semantics Tail Signal processing Predictive models Benchmark testing Speech processing

PPGF: Probability Pattern-Guided Time Series Forecasting

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Yanru Xie, Zongxia Xing, Haoyu Yu, Hualong Hu, Qinghua College of Intelligence and Computing The Tianjin Key Laboratory of Machine Learning Tianjin University Tianjin300350 China

Time series forecasting (TSF) is an essential branch of machine learning with various applications. Most methods for TSF focus on constructing different networks to extract better information and improve performance. However, practical application data contain different internal mechanisms, resulting in a mixture of multiple patterns. That is, the model’s ability to fit different patterns is different and generates different errors. In order to solve this problem, we propose an end-to-end framework, namely probability pattern-guided time series forecasting (PPGF). PPGF reformulates the TSF problem as a forecasting task guided by probabilistic pattern classification. Firstly, we propose the grouping strategy to approach forecasting problems as classification and alleviate the impact of data imbalance on classification. Secondly, we predict in the corresponding class interval to guarantee the consistency of classification and forecasting. In addition, True Class Probability (TCP) is introduced to pay more attention to the difficult samples to improve the classification accuracy. Detailedly, PPGF classifies the different patterns to determine which one the target value may belong to and estimates it accurately in the corresponding interval. To demonstrate the effectiveness of the proposed framework, we conduct extensive experiments on real-world datasets, and PPGF achieves significant performance improvements over several baseline methods. Furthermore, the effectiveness of TCP and the necessity of consistency between classification and forecasting are proved in the experiments. All data and codes are available online: https://***/syrGitHub/PPGF. Copyright © 2025, The Authors. All rights reserved.

关键词：

Panorama Generation From NFoV Image Done Right

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zheng, Dian Zhang, Cheng Wu, Xiao-Ming Li, Cao Lv, Chengfei Hu, Jian-Fang Zheng, Wei-Shi Sun Yat-sen University China Monash University Australia Alibaba Group China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

Generating 360-degree panoramas from narrow field of view (NFoV) image is a promising computer vision task for Virtual Reality (VR) applications. Existing methods mostly assess the generated panoramas with InceptionNet or CLIP based metrics, which tend to perceive the image quality and is not suitable for evaluating the distortion. In this work, we first propose a distortion-specific CLIP, named Distort-CLIP to accurately evaluate the panorama distortion and discover the "visual cheating" phenomenon in previous works (i.e., tending to improve the visual results by sacrificing distortion accuracy). This phenomenon arises because prior methods employ a single network to learn the distinct panorama distortion and content completion at once, which leads the model to prioritize optimizing the latter. To address the phenomenon, we propose PanoDecouple, a decoupled diffusion model framework, which decouples the panorama generation into distortion guidance and content completion, aiming to generate panoramas with both accurate distortion and visual appeal. Specifically, we design a DistortNet for distortion guidance by imposing panorama-specific distortion prior and a modified condition registration mechanism;and a ContentNet for content completion by imposing perspective image information. Additionally, a distortion correction loss function with Distort-CLIP is introduced to constrain the distortion explicitly. The extensive experiments validate that PanoDecouple surpasses existing methods both in distortion and visual metrics. Copyright © 2025, The Authors. All rights reserved.

关键词： Virtual reality