Sciweavers

2219 search results - page 205 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 3 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
107
Voted
IPPS
2007
IEEE
15 years 9 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
WG
2004
Springer
15 years 8 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
TOG
2002
234views more  TOG 2002»
15 years 2 months ago
Gradient domain high dynamic range compression
We present a new method for rendering high dynamic range images on conventional displays. Our method is conceptually simple, computationally efficient, robust, and easy to use. We...
Raanan Fattal, Dani Lischinski, Michael Werman
ICCV
2009
IEEE
15 years 27 days ago
High-resolution shape reconstruction from multiple range images based on simultaneous estimation of surface and motion
Recognition of dynamic scenes based on shape information could be useful for various applications. In this study, we aimed at improving the resolution of three-dimensional (3D) da...
Yoshihiro Watanabe, Takashi Komuro, Masatoshi Ishi...