Publication

Non-Rigid Graph Registration using Active Testing Search

Publications associées (43)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Multichannel Blind Deconvolution Using Low-rank and Sparse Decomposition

Pierre Vandergheynst, Mahdad Hosseini Kamal

Multiple images of the same scene improve the result of multichannel blind deconvolution problem. However, existing techniques require alignment of channels. We define a multichannel deconvolution scheme for highly correlated images to estimated the blur k ...

2013

Robust Non-Rigid Registration of 2D and 3D Graphs

Pascal Fua, Jan Kybic, Przemyslaw Rafal Glowacki

We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-l ...

2012

Learning of Structured Graph Dictionaries

Pascal Frossard, Xiaowen Dong, Xue Zhang

We propose a method for learning dictionaries towards sparse approximation of signals defined on vertices of arbitrary graphs. Dictionaries are expected to describe effectively the main spatial and spectral components of the signals of interest, so that th ...

2012

Tangled Thrackles

János Pach

A tangle is a graph drawn in the plane so that any pair of edges have precisely one point in common, and this point is either an endpoint or a point of tangency. If we allow a third option: the common point may be a proper crossing between the two edges, t ...

Springer Berlin Heidelberg2012

Blockers and transversals

Dominique de Werra, Bernard Ries, Rico Zenklusen

Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of edges B such that nu((V, E \ B)) = d. ...

2009

Wavelets on Graphs via Spectral Graph Theory

Pierre Vandergheynst, Rémi Gribonval

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite graph. We define a notion of scaling using the graph analogue of the Fourier domain, namely the space of eigenfunctions forming the sp ...

2008

Parity-regular Steinhaus graphs

Maxime Augier

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...

American Mathematical Society2008

Latin-Amercian Conference on Combinatorics, Graphs and Applications

Thomas Liebling

Proceedings of Latin-Amercian Conference on Combinatorics, Graphs and Applications, University of Chile - Santiago, Chile - August 16-20, 2004 ...

Elsevier2004

DPS - Dynamic Parallel Schedules

Roger Hersch, Sebastian Gerlach

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PC). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic ...

IEEE Press2003

Dense Matching of Multiple Wide-baseline Views

Christoph Strecha

This paper describes a PDE-based method for dense depth extraction from multiple wide-baseline images. Emphasis lies on the usage of only a small amount of images. The integration of these multiple wide-baseline views is guided by the relative confidence t ...

2003