Sciweavers

6575 search results - page 714 / 1315
» Specializing visualization algorithms
Sort
View
230
Voted
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ICCV
2007
IEEE
16 years 9 months ago
DynamicBoost: Boosting Time Series Generated by Dynamical Systems
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
René Vidal, Paolo Favaro
ECCV
2008
Springer
16 years 9 months ago
Interactive Tracking of 2D Generic Objects with Spacetime Optimization
Abstract. We present a continuous optimization framework for interactive tracking of 2D generic objects in a single video stream. The user begins with specifying the locations of a...
Xiaolin K. Wei, Jinxiang Chai
ECCV
2002
Springer
16 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICIP
2007
IEEE
16 years 8 months ago
Automatic Quality Analysis for Film and Video Restoration
A considerable amount of work in larger film and video restoration projects is dedicated to manually exploring the audiovisual content in order to estimate the costs for restorati...
Georg Thallinger, Hermann Fürntratt, Peter Sc...