Sciweavers

1337 search results - page 8 / 268
» Fast computation of distance estimators
Sort
View
ACIVS
2009
Springer
13 years 5 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
ICIP
2007
IEEE
14 years 9 months ago
Distancecut: Interactive Segmentation and Matting of Images and Videos
An interactive algorithm for soft segmentation and matting of natural images and videos is presented in this paper. The technique follows and extends [10], where the user first ro...
Xue Bai, Guillermo Sapiro
CORR
2004
Springer
168views Education» more  CORR 2004»
13 years 7 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
ICIP
2006
IEEE
14 years 9 months ago
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
Luca Bertelli, Baris Sumengen, B. S. Manjunath