Publication

FAST TV-L1 OPTICAL FLOW FOR INTERACTIVITY

Related publications (68)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

FAST TV-L1 OPTICAL FLOW FOR INTERACTIVITY

Graph Chatbot

Chat with Graph Search

Stochastic Frank-Wolfe for Composite Convex Minimization

On the convergence of stochastic primal-dual hybrid gradient

An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

Learning with Structured Sparsity: From Discrete to Convex and Back.

A Least-Squares/Relaxation Method for the Numerical Solution of the Three-Dimensional Elliptic Monge-Ampere Equation

Fast and robust estimation of NODDI parameters using non-Gaussian noise models and spatial regularization

Convex Optimization using Sparsified Stochastic Gradient Descent with Memory

Proximity Operators of Discrete Information Divergences

A real-time optimal inverse planning for Gamma Knife radiosurgery by convex optimization: description of the system and first dosimetry data

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H-infinity Performance