Sciweavers

2219 search results - page 208 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICPP
2005
IEEE
15 years 8 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
ICPR
2004
IEEE
16 years 4 months ago
Synchronization and Calibration of Camera Networks from Silhouettes
We propose an automatic approach to synchronize a network of uncalibrated and unsynchronized video cameras, and recover the complete calibration of all these cameras. In this pape...
Sudipta N. Sinha, Marc Pollefeys
CVPR
2010
IEEE
15 years 11 months ago
Noise-Optimal Capture for High Dynamic Range Photography
Taking multiple exposures is a well-established approach both for capturing high dynamic range (HDR) scenes and for noise reduction. But what is the optimal set of photos to captur...
Samuel W. Hasinoff, Frédo Durand, and William T. ...
TOOLS
2000
IEEE
15 years 7 months ago
Algorithmic Analysis of the Impacts of Changes to Object-Oriented Software
The research presented here addresses the problem of change impact analysis CIA for object-oriented software. A major problem for developers in an evolutionary environment is th...
Michelle Lee, A. Jefferson Offutt, Roger T. Alexan...
CVPR
2004
IEEE
16 years 5 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell