Publication

Graph-based regularization of inverse problems in imaging

Related publications (104)

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.

Space crossing numbers

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs. ...

2011

Joint registration and super-resolution with omnidirectional images

Pascal Frossard, Zafer Arican

This paper addresses the reconstruction of high resolution omnidirectional images from multiple low resolution images with inexact registration. When omnidirectional images from low resolution vision sensors can be uniquely mapped on the 2-sphere, such a r ...

Institute of Electrical and Electronics Engineers2011

Omnidirectional Object Duplicate Detection

Touradj Ebrahimi, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we extend a graph-based approach for omnidirectional object duplicate detection in still images. Objects are detected from several points of view with different distances. The goal of this work is to determine how many training images have t ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

On Sphere-Filling Ropes

Henryk Gerlach

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...

2011

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

Registration for Super-Resolution: Theory, Algorithms, and Applications in Image and Mobile Video Enhancement

Martin Vetterli, Luciano Sbaiz, Patrick Vandewalle

The relation between sensor resolution and the optics of a digital camera is determined by the Nyquist sampling theorem: the sampling frequency should be larger than twice the maximum frequency of the image content coming out of the optical system. If a lo ...

Taylor& Francis / CRC Press2010

Analysis of Multiview Omnidirectional Images in a Spherical Framework

Zafer Arican

With the increasing demand of information for more immersive applications such as Google Street view or 3D movies, the efficient analysis of visual data from cameras has gained more importance. This visual information permits to extract some crucial inform ...

EPFL2010

Plenoptic based super-resolution for omnidirectional image sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

This paper addresses the reconstruction of high resolution omnidirectional images from a low resolution video acquired by an omnidirectional camera moving in a static scene. In order to exploit the additional information provided by the side images in the ...

2010

Degenerate crossing numbers

János Pach

Let G be a graph with n vertices and ea parts per thousand yen4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p, then they properly cross one another at p. It is shown that the number of crossing points, ...

Springer-Verlag2009

Graph coloring with cardinality constraints on the neighborhoods

Dominique de Werra, Bernard Ries

Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph G a k-coloring, i.e., a partition V-1,...,V-k of the vertex set of G such that, for some specified neighborhood (N) over ...

2009