Sciweavers

90 search results - page 2 / 18
» Efficient Parallel Algorithms for Template Matching
Sort
View
ICIAP
2007
ACM
14 years 5 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
ICPR
2008
IEEE
13 years 11 months ago
Score based biometric template selection
A biometric identification procedure usually contains two stages: registration and authentication. Most biometric systems capture multiple samples of the same biometric trait (e.g...
Yong Li, Jianping Yin, En Zhu, Chunfeng Hu, Hui Ch...
ICPP
1987
IEEE
13 years 8 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
CONCURRENCY
2004
151views more  CONCURRENCY 2004»
13 years 5 months ago
User transparency: a fully sequential programming model for efficient data parallel image processing
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
Frank J. Seinstra, Dennis Koelma
CVPR
2003
IEEE
14 years 7 months ago
Representation and Detection of Deformable Shapes
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
Pedro F. Felzenszwalb