Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Key-Point-Guided Adaptive Convolution and Instance Normalization for Continuous Transitive Face Reenactment of Any Person

View through CrossRef
Face reenactment technology is widely applied in various applications. However, the reconstruction effects of existing methods are often not quite realistic enough. Thus, this paper proposes a progressive face reenactment method. First, to make full use of the key information, we propose adaptive convolution and instance normalization to encode the key information into all learnable parameters in the network, including the weights of the convolution kernels and the means and variances in the normalization layer. Second, we present continuous transitive facial expression generation according to all the weights of the network generated by the key points, resulting in the continuous change of the image generated by the network. Third, in contrast to classical convolution, we apply the combination of depth- and point-wise convolutions, which can greatly reduce the number of weights and improve the efficiency of training. Finally, we extend the proposed face reenactment method to the face editing application. Comprehensive experiments demonstrate the effectiveness of the proposed method, which can generate a clearer and more realistic face from any person and is more generic and applicable than other methods.
Title: Key-Point-Guided Adaptive Convolution and Instance Normalization for Continuous Transitive Face Reenactment of Any Person
Description:
Face reenactment technology is widely applied in various applications.
However, the reconstruction effects of existing methods are often not quite realistic enough.
Thus, this paper proposes a progressive face reenactment method.
First, to make full use of the key information, we propose adaptive convolution and instance normalization to encode the key information into all learnable parameters in the network, including the weights of the convolution kernels and the means and variances in the normalization layer.
Second, we present continuous transitive facial expression generation according to all the weights of the network generated by the key points, resulting in the continuous change of the image generated by the network.
Third, in contrast to classical convolution, we apply the combination of depth- and point-wise convolutions, which can greatly reduce the number of weights and improve the efficiency of training.
Finally, we extend the proposed face reenactment method to the face editing application.
Comprehensive experiments demonstrate the effectiveness of the proposed method, which can generate a clearer and more realistic face from any person and is more generic and applicable than other methods.

Related Results

Directed Transitive Signature on Directed Tree
Directed Transitive Signature on Directed Tree
In early 2000's, Rivest [1,2] and Micali [2] introduced the notion of transitive signature, which allows a third party with public key to generate a valid signature for a composed ...
Ergativity
Ergativity
Ergativity refers to a system of marking grammatical relations in which intransitive subjects pattern together with transitive objects (“absolutive”), and differently from transiti...
Antipassive derivation in Soninke (West Mande)
Antipassive derivation in Soninke (West Mande)
Abstract Soninke, a West Mande language spoken in Mali, Mauritania, Gambia, and Senegal, provides crucial support to the...
Show-me ambiguity: an ethnographic study of Missouri Civil War reenactment
Show-me ambiguity: an ethnographic study of Missouri Civil War reenactment
This thesis examines Civil War reenactment as it is practiced and performed by residents of Missouri. Using fieldwork (interviews and participant observation) conducted by the rese...
Multi-Scale Cost Attention and Adaptive Fusion Stereo Matching Network
Multi-Scale Cost Attention and Adaptive Fusion Stereo Matching Network
At present, compared to 3D convolution, 2D convolution is less computationally expensive and faster in stereo matching methods based on convolution. However, compared to the initia...
The quantum convolution product
The quantum convolution product
Abstract In classical statistical mechanics, physical states (probability measures) are embedded in the Banach algebra of complex Borel measures on phase space, wher...

Back to Top