Sciweavers

524 search results - page 67 / 105
» Temporal reachability graphs
Sort
View
CVPR
2008
IEEE
14 years 12 months ago
High resolution motion layer decomposition using dual-space graph cuts
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
Thomas Schoenemann, Daniel Cremers
ICESS
2007
Springer
14 years 4 months ago
Handling Control Data Flow Graphs for a Tightly Coupled Reconfigurable Accelerator
In an embedded system including a base processor integrated with a tightly coupled accelerator, extracting frequently executed portions of the code (hot portion) and executing thei...
Hamid Noori, Farhad Mehdipour, Morteza Saheb Zaman...
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 3 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ICRA
2000
IEEE
129views Robotics» more  ICRA 2000»
14 years 2 months ago
Data Association for Mobile Robot Navigation: A Graph Theoretic Approach
Data association is the process of relating features observed in the environment to features viewed previously or to features in a map. Correct feature association is essential fo...
Tim Bailey, Eduardo Mario Nebot, Julio Rosenblatt,...
MTA
2010
175views more  MTA 2010»
13 years 8 months ago
Automatic summarization of rushes video using bipartite graphs
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
Liang Bai, Yan-Li Hu, Songyang Lao, Alan F. Smeato...