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

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

Privacy-Preserving Push-Pull Method for Decentralized Optimization via State Decomposition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cheng, Huqiang Liao, Xiaofeng Li, Huaqing Zhao, You Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China

Distributed optimization is manifesting great potential in multiple fields, e.g., machine learning, control, and resource allocation. Existing decentralized optimization algorithms require sharing explicit state information among the agents, which raises the risk of private information leakage. To ensure privacy security, combining information security mechanisms, such as differential privacy and homomorphic encryption, with traditional decentralized optimization algorithms is a commonly used means. However, this would either sacrifice optimization accuracy or incur heavy computational burden. To overcome these shortcomings, we develop a novel privacy-preserving decentralized optimization algorithm, called PPSD, that combines gradient tracking with a state decomposition mechanism. Specifically, each agent decomposes its state associated with the gradient into two substates. One substate is used for interaction with neighboring agents, and the other substate containing private information acts only on the first substate and thus is entirely agnostic to other agents. For the strongly convex and smooth objective functions, PPSD attains a R-linear convergence rate. Moreover, the algorithm can preserve the agents’ private information from being leaked to honest-but-curious neighbors. Simulations further confirm the results. © 2023, CC BY.

关键词： Optimization

Multitask kernel-learning parameter prediction method for solving time-dependent linear systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jiang, Kai Zhang, Juan Zhou, Qi Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

Matrix splitting iteration methods play a vital role in solving large sparse linear systems. Their performance heavily depends on the splitting parameters, however, the approach of selecting optimal splitting parameters has not been well developed. In this paper, we present a multitask kernel-learning parameter prediction method to automatically obtain relatively optimal splitting parameters, which contains simultaneous multiple parameters prediction and a data-driven kernel learning. For solving time-dependent linear systems, including linear differential systems and linear matrix systems, we give a new matrix splitting Kronecker product method, as well as its convergence analysis and preconditioning strategy. Numerical results illustrate our methods can save an enormous amount of time in selecting the relatively optimal splitting parameters compared with the exists methods. Moreover, our iteration method as a preconditioner can effectively accelerate GMRES. As the dimension of systems increases, all the advantages of our approaches becomes significantly. Especially, for solving the differential Sylvester matrix equation, the speedup ratio can reach tens to hundreds of times when the scale of the system is larger than one hundred thousand. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear systems

A MULTI-CATEGORY INVERSE DESIGN NEURAL NETWORK AND ITS APPLICATION TO DIBLOCK COPOLYMERS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wei, Dan Zhou, Tiejun Huang, Yunqing Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this work, we design a multi-category inverse design neural network to map ordered periodic structure to physical parameters. The neural network model consists of two parts, a classifier and Structure-Parameter-Mapping (SPM) subnets. The classifier is used to identify structure, and the SPM subnets are used to predict physical parameters for desired structures. We also present an extensible reciprocal-space data augmentation method to guarantee the rotation and translation invariant of periodic structures. We apply the proposed network model and data augmentation method to two-dimensional diblock copolymers based on the Landau-Brazovskii model. Results show that the multi-category inverse design neural network is high accuracy in predicting physical parameters for desired structures. Moreover, the idea of multi-categorization can also be extended to other inverse design *** Codes 68T07, 35R30, 35Q68, 74E15, 03C64 Copyright © 2022, The Authors. All rights reserved.

关键词： Block copolymers

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024, CC BY.

关键词： Color image processing

No-Reference Image Quality Assessment Based on Active Reasoning Module

学校读者我要写书评

暂无评论

No-Reference Image Quality Assessment Based on Active Reason...

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Junwei Qi Yuhao Deng Qingchun Wang Zhen Yang Yingsong Li College of Information and Communication Engineering Harbin Engineering University Harbin China College of Computer Science and Technology Harbin Engineering University Harbin China Shanghai Yanding Information Technology Co. Ltd. Shanghai China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

We present a no-reference image-quality - assessment algorithm based on active reasoning module. This algorithm has three modules: the feature extraction module, the active reasoning module, and the quality assessment module. The active reasoning module incorporates the generator component of the generative adversarial network and enhances its structure with the Res2Net architecture. By integrating this module into the backbone feature extraction network, we improve the receptive field of each convolutional layer, enabling the network to capture information at different scales of the image. To preserve the texture information of the image, we input the gradient map of the distorted image, the distorted image itself, and the image features generated by the generator into the quality assessment module, which has a multi-feature regression networks. This module establishes a mapping model from image-feature to image-quality scores. We conducted experimental analysis of this algorithm on three widely used public datasets, confirming the excellent performance and superiorities of the presented algorithm. The results validate the effectiveness of the designed algorithm and its ability to assess image quality accurately.

关键词：

Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Shiping Wu, Zhihao Chen, Yuhong Chen, Yong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China School of Computer Science Beijing University of Posts and Telecommunications China

Graph convolutional networks (GCNs) have been attracting widespread attentions due to their encouraging performance and powerful generalizations. However, few work provide a general view to interpret various GCNs and guide GCNs’ designs. In this paper, by revisiting the original GCN, we induce an interpretable regularizer-centerd optimization framework, in which by building appropriate regularizers we can interpret most GCNs, such as APPNP, JKNet, DAGNN, and GNN-LF/HF. Further, under the proposed framework, we devise a dual-regularizer graph convolutional network (dubbed tsGCN) to capture topological and semantic structures from graph data. Since the derived learning rule for tsGCN contains an inverse of a large matrix and thus is time-consuming, we leverage the Woodbury matrix identity and low-rank approximation tricks to successfully decrease the high computational complexity of computing infinite-order graph convolutions. Extensive experiments on eight public datasets demonstrate that tsGCN achieves superior performance against quite a few state-of-the-art competitors w.r.t. classification *** Codes 68T07 Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

A C0-continuous nonconforming virtual element method for linear strain gradient elasticity

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huang, Jianguo Yu, Yue School of Mathematical Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

A robust C0-continuous nonconforming virtual element method (VEM) is developed for a boundary value problem arising from strain gradient elasticity in two dimensions, with the family of polygonal meshes satisfying a very general geometric assumption given in Brezzi et al. (2009) and Chen and Huang (2018). The stability condition of the VEMs is derived by establishing Korn-type inequalities and inverse inequalities. Some crucial commutative relations for locking-free analysis as in elastic problems are derived. The sharp and uniform error estimates with respect to both the microscopic parameter and the Lamé coefficient are achieved in the lowest-order case, which is also verified by numerical *** Codes 65N12, 65N15, 65N22, 65N30 © 2024, CC BY-NC-ND.

关键词： Boundary value problems

A Theoretically Guaranteed Quaternion Weighted Schatten p-norm Minimization Method for Color Image Restoration

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Qing-Hua He, Liang-Tian Wang, Yi-Lun Deng, Liang-Jian Liu, Jun Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Machinify Inc Palo AltoCA94301 United States School of Mathematical Sciences University of Electronic Science and Technology of China Chengdu611731 China Key Laboratory for Applied Statistics of MOE School of Mathematics and Statistics Northeast Normal University Changchun130024 China

Inspired by the fact that the matrix formulated by nonlocal similar patches in a natural image is of low rank, the rank approximation issue have been extensively investigated over the past decades, among which weighted nuclear norm minimization (WNNM) and weighted Schatten p-norm minimization (WSNM) are two prevailing methods have shown great superiority in various image restoration (IR) problems. Due to the physical characteristic of color images, color image restoration (CIR) is often a much more difficult task than its grayscale image counterpart. However, when applied to CIR, the traditional WNNM/WSNM method only processes three color channels individually and fails to consider their cross-channel correlations. Very recently, a quaternion-based WNNM approach (QWNNM) has been developed to mitigate this issue, which is capable of representing the color image as a whole in the quaternion domain and preserving the inherent correlation among the three color channels. Despite its empirical success, unfortunately, the convergence behavior of QWNNM has not been strictly studied yet. In this paper, on the one side, we extend the WSNM into quaternion domain and correspondingly propose a novel quaternion-based WSNM model (QWSNM) for tackling the CIR problems. Extensive experiments on two representative CIR tasks, including color image denoising and deblurring, demonstrate that the proposed QWSNM method performs favorably against many state-of-the-art alternatives, in both quantitative and qualitative evaluations. On the other side, more importantly, we preliminarily provide a theoretical convergence analysis, that is, by modifying the quaternion alternating direction method of multipliers (QADMM) through a simple continuation strategy, we theoretically prove that both the solution sequences generated by the QWNNM and QWSNM have fixed-point convergence guarantees. The source code of our algorithm can be downloaded at the website: https://***/qiuxuanzhizi/QWSNM. Copyr

关键词： Color