Sciweavers

1039 search results - page 169 / 208
» Kernels and Regularization on Graphs
Sort
View
PAMI
2010
241views more  PAMI 2010»
14 years 6 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
TSP
2010
14 years 6 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
PAMI
2011
14 years 2 months ago
Richardson-Lucy Deblurring for Scenes under a Projective Motion Path
— This paper addresses how to model and correct image blur that arises when a camera undergoes ego motion while observing a distant scene. In particular, we discuss how the blurr...
Yu-Wing Tai, Ping Tan, Michael S. Brown
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
15 years 5 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 3 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek