Sciweavers

1024 search results - page 35 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
ICCVW
1999
Springer
15 years 2 months ago
Direct Recovery of Planar-Parallax from Multiple Frames
In this paper we present an algorithm that estimates dense planar-parallax motion from multiple uncalibrated views of a 3D scene. This generalizes the \plane + parallax" recov...
Michal Irani, P. Anandan, Meir Cohen
TIT
2002
86views more  TIT 2002»
14 years 9 months ago
Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates
Abstract--The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms fo...
Tamás Linder
WG
1999
Springer
15 years 2 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
ICML
2007
IEEE
15 years 10 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
AI
2008
Springer
14 years 10 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh