2127 search results - page 93 / 426 » Computing large matchings fast |
136
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
136
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...
135
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tr...
143
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
126
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper proposes a method to match diffusion tensor magnetic resonance images (DT-MRI) through the large deformation diffeomorphic metric mapping of vector fields, focusing on ...