Animated heads from ordinary images: a least-squares approach
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This paper analyzes the implementation of least-mean-squares (LMS)-based, adaptive diffusion algorithms over networks in the frequency-domain (FD). We focus on a scenario of noisy links and include a moving-average step for denoising after self-learning to ...
Visual crowding is the inability to perceive elements within clutter. Traditional crowding models, such as pooling, predict that performance deteriorates when flankers are added. However, this prediction has been disproved. For example, performance was fou ...
We propose new algorithms to overcome two of the most constraining limitations of surface reconstruction methods in use. In particular, we focus on the large amount of data characterizing standard acquisitions by scanner and the noise intrinsically introdu ...
We study the least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space as a special case. We rst investigate regularized algorithms adapted to a projection operator on a closed subspace ...
2020
,
Dynamic Networks have been introduced in the literature to solve multi-sensor fusion problems for navigation and mapping. They have been shown to outperform conventional methods in challenging scenarios, such as corridor mapping or self-calibration. In thi ...
2019
Quasi-Newton (qN) techniques approximate the Newton step by estimating the Hessian using the so-called secant equations. Some of these methods compute the Hessian using several secant equations but produce non-symmetric updates. Other quasi-Newton schemes, ...
We investigate regularized algorithms combining with projection for least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space. We prove convergence results with respect to variants of n ...
We propose two new alternating direction methods to solve “fully” nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and feasibility gap ...
Advances in high-speed imaging techniques have opened new possibilities for capturing ultrafast phenomena such as light propagation in air or through media. Capturing light in flight in three-dimensional xyt space has been reported based on various types o ...
We consider the optimization of a quadratic objective function whose gradients are only accessible through a stochastic oracle that returns the gradient at any given point plus a zero-mean finite variance random error. We present the first algorithm that a ...