Concept

Kepler problem

Related publications (47)

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure from motion problem for images mapped on the 2-sphere. A novel graph-based variational framework is proposed for depth estimat ...

Springer Verlag2011

Conditional hardness of precedence constrained scheduling on identical machines

Ola Nils Anders Svensson

Already in 1966, Graham showed that a simple procedure called list scheduling yields a 2-approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. Till this date it has remained th ...

ACM2010

Tracking and Structure from Motion

Pierre Vandergheynst, Luigi Bagnato, Emmanuel D'Angelo, Andreas Weishaupt

Dense three-dimensional reconstruction of a scene from images is a very challenging task. In the structure from motion approach one of the key points is to compute depth maps which contain the distance of objects in the scene to a moving camera. Usually, t ...

2010

Fast Structure from Motion for Planar Image Sequences

Pierre Vandergheynst, Luigi Bagnato, Andreas Weishaupt

Dense three-dimensional reconstruction of a scene from images is a challenging task. Usually, it is achieved by finding correspondences in successive images and computing the distance by means of epipolar geometry. In this paper, we propose a variational f ...

2010

Applications of Derandomization Theory in Coding

Mahdi Cheraghchi Bashi Astaneh

Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...

EPFL2010

Robust, High-Speed Interest Point Matching for Real-Time Applications

Michael Calonder

A typical Computer Vision system needs to process vast amounts of data as captured by one or more cameras, constantly testing the capabilities of today's hardware. Yet such systems face an ever-growing computational load caused by the more and more demandi ...

EPFL2010

Broken rotational symmetry in the pseudogap phase of a high-Tc superconductor

Johan Juul Chang

The nature of the pseudogap phase is a central problem in the effort to understand the high-transition-temperature (high-Tc) copper oxide superconductors. A fundamental question is what symmetries are broken when the pseudogap phase sets in, which occurs w ...

2010

Two-Soliton Solutions to the Three-Dimensional Gravitational Hartree Equation

Joachim Krieger

We construct nondispersive two-soliton solutions to the three-dimensional gravitational Hartree equation whose trajectories asymptotically reproduce the non-trapped dynamics of the gravitational two-body problem. (C) 2009 Wiley Periodicals, Inc. ...

Wiley-Blackwell2009

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...

Springer2009

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

2009

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.