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

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yuecong Min Yanxiao Zhang Xiujuan Chai Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China Agricultural Information Institute Chinese Academy of Agricultural Sciences Beijing China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Point clouds contain rich spatial information, which provides complementary cues for gesture recognition. In this paper, we formulate gesture recognition as an irregular sequence recognition problem and aim to capture long-term spatial correlations across point cloud sequences. A novel and effective PointLSTM is proposed to propagate information from past to future while preserving the spatial structure. The proposed PointLSTM combines state information from neighboring points in the past with current features to update the current states by a weight-shared LSTM layer. This method can be integrated into many other sequence learning approaches. In the task of gesture recognition, the proposed PointLSTM achieves state-of-the-art results on two challenging datasets (NVGesture and SHREC'17) and outperforms previous skeleton-based methods. To show its advantages in generalization, we evaluate our method on MSR Action3D dataset, and it produces competitive results with previous skeleton-based methods.

关键词： Three-dimensional displays Gesture recognition Feature extraction Task analysis Data mining Logic gates Computer vision

来源：评论

学校读者我要写书评

暂无评论

Lifting the Answer: Reranking Candidates on Data Augmented Text-to-SQL

Lifting the Answer: Reranking Candidates on Data Augmented T...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Guang-Yu Cheng Shuo Yu Wen-Bin Jiang Shuai Ma Xiang Ao Qing He Henan Institutes of Advanced Technology Zhengzhou University Zhengzhou P.R. China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China Baidu inc Beijing China

The text-to-SQL task is a realistic and challenging job, which aims to translate natural language questions into corresponding SQL queries. When attempting to generate SQL queries in the text-to-SQL task, prevailing semantic parsing models employ beam search to generate several candidates. Based on our pilot study, we observe that the gold-standard SQL answer may exist in the n-best candidate list produced by the decoder, rather than the first. Hence, we aim to lift the correct answer given several candidates generated by semantic parsing models for text-to-SQL. To this end, we propose a reranking module that reorders the n-best list of candidate SQL queries by pair-wise hinge loss. Meanwhile, a data augmentation module is leveraged to enrich the inadequate training instances for providing candidates with better qualities. These two modules can be easily grafted onto text-to-SQL backbone networks, and extensive experiments on the cross-domain text-to-SQL benchmark Spider demonstrate that our method achieves 73.8% in accuracy on the Spider dataset, surpassing the base model by up to 3.5%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SSE-SAM: Balancing Head and Tail Classes Gradually through Stage-Wise SAM

arXiv

引用

arXiv 2024年

作者： Lyu, Xingyu Xu, Qianqian Yang, Zhiyong Lyu, Shaojie Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS China School of Computer Science and Tech University of Chinese Academy of Sciences China Tencent Corporate China BDKM University of Chinese Academy of Sciences China

Real-world datasets often exhibit a long-tailed distribution, where vast majority of classes known as tail classes have only few samples. Traditional methods tend to overfit on these tail classes. Recently, a new approach called Imbalanced SAM (ImbSAM) is proposed to leverage the generalization benefits of Sharpness-Aware Minimization (SAM) for long-tailed distributions. The main strategy is to merely enhance the smoothness of the loss function for tail classes. However, we argue that improving generalization in long-tail scenarios requires a careful balance between head and tail classes. We show that neither SAM nor ImbSAM alone can fully achieve this balance. For SAM, we prove that although it enhances the model’s generalization ability by escaping saddle point in the overall loss landscape, it does not effectively address this for tail-class losses. Conversely, while ImbSAM is more effective at avoiding saddle points in tail classes, the head classes are trained insufficiently, resulting in significant performance drops. Based on these insights, we propose Stage-wise Saddle Escaping SAM (SSE-SAM), which uses complementary strengths of ImbSAM and SAM in a phased approach. Initially, SSE-SAM follows the majority sample to avoid saddle points of the head-class loss. During the later phase, it focuses on tail-classes to help them escape saddle points. Our experiments confirm that SSE-SAM has better ability in escaping saddles both on head and tail classes, and shows performance improvements. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Delving into the Frequency: Temporally Consistent Human Motion Transfer in the Fourier Space

arXiv

引用

arXiv 2022年

作者： Yang, Guang Liu, Wu Liu, Xinchen Gu, Xiaoyan Cao, Juan Li, Jintao Institute of Computing Technology Chinese Academy of Sciences China Jd Explore Academy Institute of Information Engineering Chinese Academy of Sciences China The Key Lab of Intelligent Information Processing of Chinese Academy of Sciences The University of Chinese Academy of Sciences China

Human motion transfer refers to synthesizing photo-realistic and temporally coherent videos that enable one person to imitate the motion of others. However, current synthetic videos suffer from the temporal inconsistency in sequential frames that significantly degrades the video quality, yet is far from solved by existing methods in the pixel domain. Recently, some works on DeepFake detection try to distinguish the natural and synthetic images in the frequency domain because of the frequency insufficiency of image synthesizing methods. Nonetheless, there is no work to study the temporal inconsistency of synthetic videos from the aspects of the frequency-domain gap between natural and synthetic videos. Therefore, in this paper, we propose to delve into the frequency space for temporally consistent human motion transfer. First of all, we make the first comprehensive analysis of natural and synthetic videos in the frequency domain to reveal the frequency gap in both the spatial dimension of individual frames and the temporal dimension of the video. To close the frequency gap between the natural and synthetic videos, we propose a novel Frequency-based human MOtion TRansfer framework, named FreMOTR, which can effectively mitigate the spatial artifacts and the temporal inconsistency of the synthesized videos. FreMOTR explores two novel frequency-based regularization modules: 1) the Frequency-domain Appearance Regularization (FAR) to improve the appearance of the person in individual frames and 2) Temporal Frequency Regularization (TFR) to guarantee the temporal consistency between adjacent frames. Finally, comprehensive experiments demonstrate that the FreMOTR not only yields superior performance in temporal consistency metrics but also improves the frame-level visual quality of synthetic videos. In particular, the temporal consistency metrics are improved by nearly 30% than the state-of-the-art model. © 2022, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Milling algorithm for multi-level fuzzy association rules based on SOFM network

引用

Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science) 2007年第5期35卷 81-85页

作者： Li, Xue-Jun Li, Long-Shu Xu, Yi Key Laboratory of Intelligent Computing and Signal Processing Anhui Univ. Hefei 230039 China School of Computer Science and Engineering Anhui Univ. Hefei 230039 China

In order to represent a complex large concept hierarchy tree, this paper proposes a more general coding scheme which applies concept hierarchy into the mining of fuzzy association rules. As it is difficult to determine the membership function subjectively, a self-organizing feature map (SOFM) network is introduced to determine the membership function of sample data. Based on the improved coding scheme and the SOFM network, fuzzy set is then introduced to design a new algorithm of mining multi-level fuzzy association rules. Experimental results show that the proposed algorithm is of high efficiency and scalability and can effectively mine multi-level fuzzy association rules that are meaningful and easily understandable.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Implicit Temporal Modeling with Learnable Alignment for Video Recognition

arXiv

引用

arXiv 2023年

作者： Tu, Shuyuan Dai, Qi Wu, Zuxuan Cheng, Zhi-Qi Hu, Han Jiang, Yu-Gang Shanghai Key Lab of Intell. Info. Processing School of CS Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China Microsoft Research Asia China Carnegie Mellon University United States

Contrastive language-image pretraining (CLIP) has demonstrated remarkable success in various image tasks. However, how to extend CLIP with effective temporal modeling is still an open and crucial problem. Existing factorized or joint spatial-temporal modeling trades off between the efficiency and performance. While modeling temporal information within straight through tube is widely adopted in literature, we find that simple frame alignment already provides enough essence without temporal attention. To this end, in this paper, we proposed a novel Implicit Learnable Alignment (ILA) method, which minimizes the temporal modeling effort while achieving incredibly high performance. Specifically, for a frame pair, an interactive point is predicted in each frame, serving as a mutual information rich region. By enhancing the features around the interactive point, two frames are implicitly aligned. The aligned features are then pooled into a single token, which is leveraged in the subsequent spatial self-attention. Our method allows eliminating the costly or insufficient temporal self-attention in video. Extensive experiments on benchmarks demonstrate the superiority and generality of our module. Particularly, the proposed ILA achieves a top-1 accuracy of 88.7% on Kinetics-400 with much fewer FLOPs compared with Swin-L and ViViT-H. Code is released at https://***/Francis-Rings/ILA. Copyright © 2023, The Authors. All rights reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Hard-instance learning for quantum adiabatic prime factorization

引用

Physical Review A 2022年第6期105卷 062455-062455页

作者： Jian Lin Zhengfeng Zhang Junping Zhang Xiaopeng Li State Key Laboratory of Surface Physics Institute of Nanoelectronics and Quantum Computing and Department of Physics Fudan University Shanghai 200433 China Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University Shanghai 200433 China Shanghai Qi Zhi Institute Xuhui District Shanghai 200032 China Shanghai Research Center for Quantum Sciences Shanghai 201315 China

Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman cryptography. With programable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and unconfigured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabatic factorization, we apply a deep reinforcement learning (RL) method to configure the AQC algorithm. By setting the success probability of the worst-case problem instances as the reward to RL, we show the AQC performance on the hard instances is dramatically improved by RL configuration. The success probability also becomes more evenly distributed over different problem instances, meaning the configured AQC is more stable as compared to the unconfigured case. Through a technique of transfer learning, we find prominent evidence that the framework of AQC configuration is scalable—the configured AQC as trained on five qubits remains working efficiently on nine qubits with a minimal amount of additional training cost.

关键词： Machine learning Quantum algorithms Quantum computation Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Single-Side Domain Generalization for Face Anti-Spoofing

Single-Side Domain Generalization for Face Anti-Spoofing

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yunpei Jia Jie Zhang Shiguang Shan Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Existing domain generalization methods for face anti-spoofing endeavor to extract common differentiation features to improve the generalization. However, due to large distribution discrepancies among fake faces of different domains, it is difficult to seek a compact and generalized feature space for the fake faces. In this work, we propose an end-to-end single-side domain generalization framework (SSDG) to improve the generalization ability of face anti-spoofing. The main idea is to learn a generalized feature space, where the feature distribution of the real faces is compact while that of the fake ones is dispersed among domains but compact within each domain. Specifically, a feature generator is trained to make only the real faces from different domains undistinguishable, but not for the fake ones, thus forming a single-side adversarial learning. Moreover, an asymmetric triplet loss is designed to constrain the fake faces of different domains separated while the real ones aggregated. The above two points are integrated into a unified framework in an end-to-end training manner, resulting in a more generalized class boundary, especially good for samples from novel domains. Feature and weight normalization is incorporated to further improve the generalization ability. Extensive experiments show that our proposed approach is effective and outperforms the state-of-the-art methods on four public databases. The code is released online.

关键词： Face Feature extraction Generators Training Aggregates Databases Face recognition

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

Energy-Efficient Flow Scheduling and Routing with Hard Deadl...

引用

International Conference on Distributed computing Systems

作者： Lin Wang Fa Zhang Kai Zheng Athanasios V. Vasilakos Shaolei Ren Zhiyong Liu University of Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences IBM China Research Lab University of Western Macedonia Greece Florida International University USA Institute of Computing Technology Chinese Academy of Sciences

The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing "deadline-constrained flows" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy saving strategies for network devices, we aim to explore the most energy efficient way of scheduling and routing flows on the network, as well as determining the transmission speed for every flow. We consider two general versions of the problem. For the version of only flow scheduling where routes of flows are pre-given, we show that it can be solved polynomially and we develop an optimal combinatorial algorithm for it. For the version of joint flow scheduling and routing, we prove that it is strongly NP-hard and cannot have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on a relaxation and randomized rounding technique, we provide an efficient approximation algorithm which can guarantee a provable performance ratio with respect to a polynomial of the total number of flows.

关键词： Schedules Routing Power demand Switches Optimal scheduling Data models Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic keyword extraction of Chinese document algorithm based on complex network features

引用

Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence 2007年第6期20卷 827-831页

作者： Zhao, Peng Cai, Qing-Sheng Wang, Qing-Yi Geng, Huan-Tong Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China

Automatic keyword extraction is one of the most important techniques in natural language processing. In this paper, features of complex networks composed of Chinese are studied. A novel automatic keyword extraction algorithm for Chinese document is proposed which is based on the features of the complex networks according to the small world structure in language networks and the theoretical achievements in complex networks. It extracts keyword based on the feature values of the word nodes in a documental language network. Experimental results show the proposed algorithm obtains higher average precision compared with the keyword extraction algorithm based on TFIDF.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：