Sciweavers

2219 search results - page 179 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
IEEEPACT
2002
IEEE
15 years 7 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ICPR
2008
IEEE
16 years 4 months ago
A covariance-based method for dynamic background subtraction
Background subtraction in dynamic scenes is an important and challenging task. In this paper, we present a novel and effective method for dynamic background subtraction based on c...
Hongxun Yao, Shaohui Liu, Shengping Zhang, Wen Gao...
ICPR
2008
IEEE
16 years 4 months ago
Graph-based classification for multiple observations of transformed patterns
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
Effrosini Kokiopoulou, Pascal Frossard, Stefanos P...
CVPR
2010
IEEE
15 years 11 months ago
Discrete minimum ratio curves and surfaces
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
Fred Nicolls, Phil Torr