Sciweavers

1348 search results - page 55 / 270
» Matching planar maps
Sort
View
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 10 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
PAMI
2008
152views more  PAMI 2008»
13 years 10 months ago
Class-Based Feature Matching Across Unrestricted Transformations
We develop a novel method for class-based feature matching across large changes in viewing conditions. The method (called MBE) is based on the property that when objects share a si...
Evgeniy Bart, Shimon Ullman
MICCAI
2008
Springer
14 years 11 months ago
Optimized Conformal Parameterization of Cortical Surfaces Using Shape Based Matching of Landmark Curves
Abstract. In this work, we find meaningful parameterizations of cortical surfaces utilizing prior anatomical information in the form of anatomical landmarks (sulci curves) on the s...
Lok Ming Lui, Sheshadri Thiruvenkadam, Yalin Wan...
ICCV
2001
IEEE
14 years 12 months ago
Viewpoint Invariant Texture Matching and Wide Baseline Stereo
We describe and demonstrate a texture region descriptor which is invariant to affine geometric and photometric transformations, and insensitive to the shape of the texture region....
Frederik Schaffalitzky, Andrew Zisserman
STACS
2010
Springer
14 years 5 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar