Sciweavers

1024 search results - page 134 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
CAGD
2010
125views more  CAGD 2010»
13 years 6 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
CVPR
2011
IEEE
13 years 4 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
FIMH
2011
Springer
13 years 7 days ago
Construction of Left Ventricle 3D Shape Atlas from Cardiac MRI
In this paper, we present an effective algorithm to construct a 3D shape atlas for the left ventricle of heart from cardiac Magnetic Resonance Image data. We derive a framework tha...
Shaoting Zhang, Mustafa Gökhan Uzunbas, Zhenn...
EMMCVPR
2009
Springer
14 years 3 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
14 years 9 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami