Sciweavers

1024 search results - page 2 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
CGF
2008
262views more  CGF 2008»
13 years 5 months ago
Global Correspondence Optimization for Non-Rigid Registration of Depth Scans
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
Hao Li, Robert W. Sumner, Mark Pauly
SIGSOFT
2007
ACM
14 years 6 months ago
Determining detailed structural correspondence for generalization tasks
Generalization tasks are important for continual improvement to the design of an evolving code base, eliminating redundancy where it has accumulated. An important step in generali...
Jörg Denzinger, Joseph J. C. Chang, Robert J....
ICCV
1998
IEEE
13 years 9 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox
PR
2006
89views more  PR 2006»
13 years 5 months ago
Gaussian fields for semi-supervised regression and correspondence learning
Gaussian fields (GF) have recently received considerable attention for dimension reduction and semi-supervised classification. In this paper we show how the GF framework can be us...
Jakob J. Verbeek, Nikos A. Vlassis
CG
2002
Springer
13 years 5 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao