Sciweavers

6365 search results - page 419 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CAIP
2003
Springer
244views Image Analysis» more  CAIP 2003»
16 years 3 days ago
Real-Time Optic Flow Computation with Variational Methods
Abstract. Variational methods for optic flow computation have the reputation of producing good results at the expense of being too slow for real-time applications. We show that re...
Andrés Bruhn, Joachim Weickert, Christian F...
ISPAN
1999
IEEE
15 years 11 months ago
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
VCIP
2000
196views Communications» more  VCIP 2000»
15 years 8 months ago
MIME: a gesture-driven computer interface
MIME (Mime Is Manual Expression) is a computationally efficient computer vision system for recognizing hand gestures. The system is intended to replace the mouse interface on a st...
Daniel Heckenberg, Brian Lovell
JIRS
2007
108views more  JIRS 2007»
15 years 6 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami