scholarly journals Iterative Text-Based Editing of Talking-Heads Using Neural Retargeting

2021 ◽  
Vol 40 (3) ◽  
pp. 1-14
Author(s):  
Xinwei Yao ◽  
Ohad Fried ◽  
Kayvon Fatahalian ◽  
Maneesh Agrawala
Keyword(s):  
Real World ◽  
Search Algorithm ◽  
Performance Style ◽  
Talking Head ◽  
Talking Heads ◽  
Overall Performance ◽  
And Performance ◽  
Iteration Loop ◽  
Loop 2 ◽  
Fine Tune

We present a text-based tool for editing talking-head video that enables an iterative editing workflow. On each iteration users can edit the wording of the speech, further refine mouth motions if necessary to reduce artifacts, and manipulate non-verbal aspects of the performance by inserting mouth gestures (e.g., a smile) or changing the overall performance style (e.g., energetic, mumble). Our tool requires only 2 to 3 minutes of the target actor video and it synthesizes the video for each iteration in about 40 seconds, allowing users to quickly explore many editing possibilities as they iterate. Our approach is based on two key ideas. (1) We develop a fast phoneme search algorithm that can quickly identify phoneme-level subsequences of the source repository video that best match a desired edit. This enables our fast iteration loop. (2) We leverage a large repository of video of a source actor and develop a new self-supervised neural retargeting technique for transferring the mouth motions of the source actor to the target actor. This allows us to work with relatively short target actor videos, making our approach applicable in many real-world editing scenarios. Finally, our, refinement and performance controls give users the ability to further fine-tune the synthesized results.

scholarly journals GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Local Search ◽  
Hybrid Algorithm ◽  
State Of The Art ◽  
Search Algorithm ◽  
Satisfiability Problem ◽  
Local Search Algorithm ◽  
Overall Performance ◽  
Genetic Local Search ◽  
Search Stage

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.

Tri-polarized MIMO systems in real-world channels: Channel investigation and performance analysis

2012 ◽  
Vol 5 (4) ◽  
pp. 308-316 ◽  
Author(s):  
François Quitin ◽  
Claude Oestges ◽  
Ali Panahandeh ◽  
François Horlin ◽  
Philippe De Doncker
Keyword(s):  
Performance Analysis ◽  
Real World ◽  
Mimo Systems ◽  
And Performance

Behavior and Performance of Refrigerant Mixture HFC125/HC290 in Heat Pumps

2013 ◽  
Author(s):  
Xiaowei Fan ◽  
Fang Wang ◽  
Huifan Zheng ◽  
Xianping Zhang ◽  
Di Xu
Keyword(s):  
Energy Consumption ◽  
Heat Pumps ◽  
Operating Conditions ◽  
Environment Friendly ◽  
Factors Affecting ◽  
Refrigerant Mixture ◽  
Important Direction ◽  
Overall Performance ◽  
And Performance ◽  
Binary Refrigerant

The refrigerant mixtures provide an important direction in selecting new environment-friendly alternative to match the desirable properties with the existing halogenated refrigerants or future use in the new devices, in which, HFCs refrigerants with zero ODP combined with HCs refrigerants with zero ODP and lower GWP are of important value in the fields of application. In the present work, research on HFC125/HC290 (25/75 by mass) binary refrigerant mixture used in heat pumps was carried out, and parameters, factors affecting the performance were investigated, and compared with that of HCFC22 under the same operating conditions. It has been found that the new mixture can improve the actual COP by 2 to 13% and hence it can reduce the energy consumption by 20 to 31.5%. The overall performance has proved that the new refrigerant mixture could be a promising substitute for HCFC22.

scholarly journals Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess

2017 ◽  
Vol 59 ◽  
pp. 463-494 ◽  
Author(s):  
Shaowei Cai ◽  
Jinkun Lin ◽  
Chuan Luo
Keyword(s):  
Local Search ◽  
Real World ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Vertex Cover ◽  
Search Algorithms ◽  
Theory And Practice ◽  
Sparse Graphs ◽  
Massive Graphs

The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard combinatorial optimization problem of great importance in theory and practice. Due to its NP-hardness, there has been much interest in developing heuristic algorithms for finding a small vertex cover in reasonable time. Previously, heuristic algorithms for MinVC have focused on solving graphs of relatively small size, and they are not suitable for solving massive graphs as they usually have high-complexity heuristics. This paper explores techniques for solving MinVC in very large scale real-world graphs, including a construction algorithm, a local search algorithm and a preprocessing algorithm. Both the construction and search algorithms are based on low-complexity heuristics, and we combine them to develop a heuristic algorithm for MinVC called FastVC. Experimental results on a broad range of real-world massive graphs show that, our algorithms are very fast and have better performance than previous heuristic algorithms for MinVC. We also develop a preprocessing algorithm to simplify graphs for MinVC algorithms. By applying the preprocessing algorithm to local search algorithms, we obtain two efficient MinVC solvers called NuMVC2+p and FastVC2+p, which show further improvement on the massive graphs.

scholarly journals Development and Performance of the Pepper Industry in Malaysia: A Critical Review

2021 ◽  
Vol 21 (3) ◽  
pp. 1402-1423
Author(s):  
Harry Entebang ◽  
Swee-Kiong Wong ◽  
Zehnder Jarroop Augustine Mercer
Keyword(s):  
Rural Community ◽  
Household Income ◽  
New Technology ◽  
Supply And Demand ◽  
National Income ◽  
Secondary Data ◽  
Commodity Export ◽  
Overall Performance ◽  
And Performance ◽  
Farm Inputs

The National Commodity Policy 2011-2020 was developed to increase the national income by harnessing the potential of commodity export revenues. Despite continuous efforts implemented by various related agencies, the overall performance of major commodities, particularly pepper, remains unsatisfactory. Regarded as a sought-after ‘king of spices’, pepper has become one of the most prized and important commodities traded globally. This paper highlights the development and performance of the pepper industry in Malaysia and discusses practical strategies and recommendations to transform the pepper industry. Besides conducting interviews with the industry experts to gain first-hand information, content and thematic analysis was employed based on secondary data research in this study. The findings of the study show that even though pepper is mostly used in food-related industries, its potential in pharmaceutical and cosmeceutical sectors remains underexplored. Globally, the overall supply and demand of pepper continue to increase, though the demand has recently exceeded supply. However, continuous new planting and farmexpansion initiatives by major producers caused the total global pepper supply to exceed consumption in 2018. In fact, pepper prices have declined more than 70% since 2015, which affected the overall household income of the rural community engaged in pepper farming. While experiencing low prices, smallholder pepper farmers and the industry continue to struggle with low domestic consumption, low production, higher cost of farm inputs, lack of extension services, low impact of research, development and innovation, ageing farming population, intense competition from other producing countries, low prices for quality pepper, limited subsidy to support continuous farming, pepper-related diseases, lack of new technology, and poor investment in downstream activities. Given this, the performance of the Malaysian pepper industry has fallen below expectations.

scholarly journals VLSI ARCHITECTURE OF PARALLEL MULTIPLIER– ACCUMULATOR BASED ON RADIX-2 MODIFIED BOOTH ALGORITHM

2012 ◽  
pp. 40-46
Author(s):  
Mr.M.V. Sathish ◽  
Mrs. Sailaja
Keyword(s):  
Signal Processing ◽  
High Speed ◽  
High Performance ◽  
Vlsi Architecture ◽  
Clock Frequency ◽  
Parallel Multiplier ◽  
Hybrid Type ◽  
Standard Design ◽  
Overall Performance ◽  
And Performance

A new architecture of multiplier-andaccumulator (MAC) for high-speed arithmetic. By combining multiplication with accumulation and devising a hybrid type of carry save adder (CSA), the performance was improved. Since the accumulator that has the largest delay in MAC was merged into CSA, the overall performance was elevated. The proposing method CSA tree uses 1’s-complement-based radix-2 modified Booth’s algorithm (MBA) and has the modified array for the sign extension in order to increase the bit density of the operands. The proposed MAC showed the superior properties to the standard design in many ways and performance twice as much as the previous research in the similar clock frequency. We expect that the proposed MAC can be adapted to various fields requiring high performance such as the signal processing areas.

scholarly journals State Variable Effects in Graphical Event Models

2020 ◽  
Author(s):  
Debarun Bhattacharjya ◽  
Dharmashankar Subramanian ◽  
Tian Gao
Keyword(s):  
Real World ◽  
Continuous Time ◽  
Point Processes ◽  
Temporal Dynamics ◽  
Search Algorithm ◽  
State Variables ◽  
Discrete State ◽  
State Variable ◽  
Event Models ◽  
Real World Datasets

Many real-world domains involve co-evolving relationships between events, such as meals and exercise, and time-varying random variables, such as a patient's blood glucose levels. In this paper, we propose a general framework for modeling joint temporal dynamics involving continuous time transitions of discrete state variables and irregular arrivals of events over the timeline. We show how conditional Markov processes (as represented by continuous time Bayesian networks) and multivariate point processes (as represented by graphical event models) are among various processes that are covered by the framework. We introduce and compare two simple and interpretable yet practical joint models within the framework with relevant baselines on simulated and real-world datasets, using a graph search algorithm for learning. The experiments highlight the importance of jointly modeling event arrivals and state variable transitions to better fit joint temporal datasets, and the framework opens up possibilities for models involving even more complex dynamics whenever suitable.

Sign in / Sign up

Export Citation Format

Share Document