Sciweavers

2219 search results - page 269 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICPR
2000
IEEE
15 years 6 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
IPPS
2009
IEEE
15 years 10 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
CVPR
2008
IEEE
16 years 5 months ago
Globally optimal shape-based tracking in real-time
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
Thomas Schoenemann, Daniel Cremers
ECCV
2002
Springer
16 years 5 months ago
Factorial Markov Random Fields
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
Junhwan Kim, Ramin Zabih
CF
2005
ACM
15 years 5 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso