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

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

来源：评论

学校读者我要写书评

暂无评论

Towards Occlusion Robust Facial Landmark Detector

Towards Occlusion Robust Facial Landmark Detector

引用

International Conference on Automatic Face and Gesture Recognition

作者： Yuyang Sha Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

ISBN: (纸本)9781665431774

Facial landmark detection plays an essential role in many face analysis tasks, such as face recognition, facial action unit detection, etc. However, when occlusion occurs, the existing methods might not perform well. This paper studies a new framework for facial landmark detection referred to as the Occlusion Robust Facial Landmark Detector (OR-FLD), which attempts to solve the occlusion problem. Specifically, the proposed OR-FLD consists of three main modules: Feature Random Dropping Module (FRD), Feature Activation Diversity Module (FAD), and Landmark Refinement Attention Module (LRA). The FRD forces the model to focus on the geometric relationships between different facial components by randomly dropping some appearance information and then automatically recovering them. The FAD tries to enhance the model representation and make the extracted features discriminative and robust to occlusions. Besides, the recovered features contribute differently to the final results. Therefore, we propose a simple and effective attention mechanism to refine the landmark location and make the model more robust to occlusions. We extensively evaluate OR-FLD on four facial landmark detection benchmarks (300W, WFLW, COFW, and AFLW). The results show that our method outperforms the state-of-the-art by a significant margin, especially on the datasets with large occlusion.

关键词： Location awareness Sensitivity Face recognition Pose estimation Detectors Gesture recognition Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Stable Attribute Group Editing for Reliable Few-shot Image Generation

arXiv

引用

arXiv 2023年

作者： Ding, Guanqi Han, Xinzhe Wang, Shuhui Wu, Shuzhe Jin, Xin Tu, Dandan Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518066 China Huawei Cloud EI Innovation Lab China

Few-shot image generation aims to generate data of an unseen category based on only a few samples. Apart from basic content generation, a bunch of downstream applications hopefully benefit from this task, such as low-data detection and few-shot classification. To achieve this goal, the generated images should guarantee category retention for classification beyond the visual quality and diversity. In our preliminary work, we present an "editing-based" framework Attribute Group Editing (AGE) for reliable few-shot image generation, which largely improves the performance compared with existing methods that require re-training a GAN with limited data. Nevertheless, AGE's performance on downstream classification is not as satisfactory as expected. This paper investigates the class inconsistency problem and proposes Stable Attribute Group Editing (SAGE) for more stable class-relevant image generation. Different from AGE which directly edits from a one-shot image, SAGE takes use of all given few-shot images and estimates a class center embedding based on the category-relevant attribute dictionary. Meanwhile, according to the projection weights on the category-relevant attribute dictionary, we can select category-irrelevant attributes from the similar seen categories. Consequently, SAGE injects the whole distribution of the novel class into StyleGAN's latent space, thus largely remains the category retention and stability of the generated images. Going one step further, we find that class inconsistency is a common problem in GAN-generated images for downstream classification. Even though the generated images look photo-realistic and requires no category-relevant editing, they are usually of limited help for downstream classification. We systematically discuss this issue from both the generative model and classification model perspectives, and propose to boost the downstream classification performance of SAGE by enhancing the pixel and frequency components. Extensive experime

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

On truthful auction mechanism for cloud resources allocation and consumption shifting with different time slots

On truthful auction mechanism for cloud resources allocation...

引用

作者： Song, Heng Zhu, Junwu Jiang, Yi Institute of Information Engineering Yangzhou University Yangzhou China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China State Key Laboratory of Ocean Engineering Shanghai Jiao Tong University Shanghai China

The flexibility and high reliability of cloud computing have generated a tremendous amount of economic benefits. With the growing demand for cloud resources, the task about how to making users' demand adaptive to the supply of cloud resources during peak and nonpeak hours becomes extremely challenging. However, most of the existing mechanisms mainly focus on the allocation of cloud resources, and ignore the balance between supply and demand of cloud resources. To improve the situation, this paper presents a combinatorial auction model for the cloud resource allocation and consumption shifting problem, and then puts forward a truthful auction mechanism with two different price curve functions, that is, staircase and continuous price curve. The proposed mechanism can effectively allocate and shift cloud resources to alleviate the pressure of cloud infrastructure during peak hours. Both the theoretical analysis and simulation results show that the proposed mechanism guarantees desired properties including individual rationality, budget balance, truthfulness and computational efficiency. In addition, extensive simulation results also show that continuous price curve outperforms stair case price curve in terms of system efficiency and balance efficiency. © 2020 John Wiley & Sons, Ltd.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Fan-Net: Fourier-Based Adaptive Normalization for Cross-Domain Stroke Lesion Segmentation

Fan-Net: Fourier-Based Adaptive Normalization for Cross-Doma...

引用

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

作者： Weiyi Yu Yiming Lei Hongming Shan Institute of Science and Technology for Brain-Inspired Intelligence Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China Shanghai Center for Brain Science and Brain-Inspired Technology Shanghai China

Since stroke is the main cause of various cerebrovascular diseases, deep learning-based stroke lesion segmentation on magnetic resonance (MR) images has attracted considerable attention. However, the existing methods often neglect the domain shift among MR images collected from different sites, which has limited performance improvement. To address this problem, we intend to change style information without affecting high-level semantics via adaptively changing the low-frequency amplitude components of the Fourier transform so as to enhance model robustness to varying domains. Thus, we propose a novel FAN-Net, a U-Net–based segmentation network incorporated with a Fourier-based adaptive normalization (FAN) and a domain classifier with a gradient reversal layer. The FAN module is tailored for learning adaptive affine parameters for the amplitude components of different domains, which can dynamically normalize the style information of source images. Then, the domain classifier provides domain-agnostic knowledge to endow FAN with strong domain generalizability. The experimental results on the ATLAS dataset, which consists of MR images from 9 sites, show the superior performance of the proposed FAN-Net compared with baseline methods.

关键词： Image segmentation Fans Semantics Neural networks Magnetic resonance Stroke (medical condition) Signal processing

来源：评论

学校读者我要写书评

暂无评论

Technical Function-effect Based Patent Multi-to-One Negation Game Model 25

Technical Function-effect Based Patent Multi-to-One Negation...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Du, Lu Liu, Weidong Xiao, Kaiyang Gao, Shixuan Han, Yong College of Computer Science Inner Mongolia University Hohhot China Institute of Scientific and Technical Information of China Beijing China Natl. and Loc. Jt. Eng. Res. Center of Intelligent Information Processing Technology for Mongolian Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China Inner Mongolia Intellectual Property Service Center Hohhot China

ISBN: (纸本)9781665405270

As the number of patent applications increases yearly, the negation relation between patents has become intertwined, which makes it difficult for constructing negation relation in patent examination manually. Therefore, how to automatically construct negation relation between patents has become the hot research. Constructing negation relation is the process of comparing technical features between patents, which depends on the technical features in the patent claims and the technical function-effect. Although there are many researches on patent one-to-one negation, few researches on patent multi-to-one negation. The research on negation relation of multi-to-one patents, has the following challenges: (1) the definition of patent features is ambiguous in comparison of negation relation;(2) the role of patent function-effect is often ignored in judgement of negation relation. To solve the above issues, we propose a technical function-effect based patent multi-to-one negation game model. In the model, we decompose patent technical features into technical utility and technical function-effect. Patent technical utility is mainly realized by using the valence theory in linguistics. After obtaining technical utility, we choose to have the same technical effect, express the technical features of different technical functions, and obtain the patent technical function-effect. Finally, we combine the technical utility and function-effect to construct a technical utility/function-effect game tree to judge the patent negation relation. According to the two-tailed test in the A/B-test, our model outperforms the baseline model in the evaluation measurement. This model can subsequently be used to calculate the portfolio value and the strategic value of the patents. © 2022 IEEE.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

Towards Accurate Unified Anomaly Segmentation

Towards Accurate Unified Anomaly Segmentation

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Wenxin Ma Qingsong Yao Xiang Zhang Zhelong Huang Zihang Jiang S. Kevin Zhou Division of Life Sciences and Medicine School of Biomedical Engineering University of Science and Technology of China (USTC) Hefei Anhui China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) USTC Suzhou Institute for Advance Research Suzhou Jiangsu China Stanford University Palo Alto California United State School of Medicine Shanghai University Shanghai China Key Laboratory of Precision and Intelligent Chemistry USTC Hefei Anhui China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Unsupervised anomaly detection (UAD) from images strives to model normal data distributions, creating discriminative representations to distinguish and precisely localize anomalies. Despite recent advancements in the efficient and unified one-for-all scheme, challenges persist in accurately segmenting anomalies for further monitoring. Moreover, this problem is obscured by the widely-used AUROC metric under imbalanced UAD settings. This motivates us to emphasize the significance of precise segmentation of anomaly pixels using pAP and DSC as metrics. To address the unsolved segmentation task, we introduce the Unified Anomaly Segmentation (UniAS). UniAS presents a multi-level hybrid pipeline that progressively enhances normal information from coarse to fine, incorporating a novel multi-granularity gated CNN (MGG-CNN) into Transformer layers to explicitly aggregate local details from different granularities. UniAS achieves state-of-the-art anomaly segmentation performance, attaining 65.12/59.33 and 40.06/32.50 in pAP/DSC on the MVTec-AD and VisA datasets, respectively, surpassing previous methods significantly. The codes are shared at https://***/Mwxinnn/UniAS.

关键词： Measurement Image segmentation Computer vision Codes Pipelines Logic gates Transformers Data models Monitoring Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: Boosting Can Achieve Modality Reconcilement

arXiv

引用

arXiv 2024年

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Prefix-Tuning for Generative Template-based Event Extraction

arXiv

引用

arXiv 2022年

作者： Liu, Xiao Huang, Heyan Shi, Ge Wang, Bo School of Computer Science and Technology Beijing Institute of Technology China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications China Key Laboratory of Intelligent Information Processing and Information Security Ministry of Industry and Information Technology China Southeast Academy of Information Technology Beijing Institute of Technology China Faculty of Information Technology Beijing University of Technology China

We consider event extraction in a generative manner with template-based conditional generation. Although there is a rising trend of casting the task of event extraction as a sequence generation problem with prompts, these generation-based methods have two significant challenges, including using suboptimal prompts and static event type information. In this paper, we propose a generative template-based event extraction method with dynamic prefix (GTEE-DYNPREF) by integrating context information with type-specific prefixes to learn a context-specific prefix for each context. Experimental results show that our model achieves competitive results with the state-of-the-art classification-based model ONEIE on ACE 2005 and achieves the best performances on ERE. Additionally, our model is proven to be portable to new types of events effectively. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Balanced Contrastive Learning for Long-Tailed Visual Recognition

arXiv

引用

arXiv 2022年

作者： Zhu, Jianggang Wang, Zheng Chen, Jingjing Chen, Yi-Ping Phoebe Jiang, Yu-Gang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Shanghai Collaborative Innovation Center on Intelligent Visual Computing China Department of Computer Science and Information Technology La Trobe University Australia

Real-world data typically follow a long-tailed distribution, where a few majority categories occupy most of the data while most minority categories contain a limited number of samples. Classification models minimizing cross-entropy struggle to represent and classify the tail classes. Although the problem of learning unbiased classifiers has been well studied, methods for representing imbalanced data are under-explored. In this paper, we focus on representation learning for imbalanced data. Recently, supervised contrastive learning has shown promising performance on balanced data recently. However, through our theoretical analysis, we find that for long-tailed data, it fails to form a regular simplex which is an ideal geometric configuration for representation learning. To correct the optimization behavior of SCL and further improve the performance of long-tailed visual recognition, we propose a novel loss for balanced contrastive learning (BCL). Compared with SCL, we have two improvements in BCL: class-averaging, which balances the gradient contribution of negative classes;class-complement, which allows all classes to appear in every mini-batch. The proposed balanced contrastive learning (BCL) method satisfies the condition of forming a regular simplex and assists the optimization of cross-entropy. Equipped with BCL, the proposed two-branch framework can obtain a stronger feature representation and achieve competitive performance on long-tailed benchmark datasets such as CIFAR-10-LT, CIFAR-100-LT, ImageNet-LT, and iNaturalist2018. Our code is available at this URL. Copyright © 2022, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：