Sciweavers

1529 search results - page 31 / 306
» A slant removal algorithm
Sort
View
ICIP
2010
IEEE
14 years 7 months ago
Improving subpixel stereo matching with segment evolution
Segmentation-based approach has shown significant success in stereo matching. By assuming pixels within one image segment belong to the same 3D surface, robust depth estimation ca...
Yao-Jen Chang, Hung-Hsun Liu, Tsuhan Chen

Dataset
2955views
15 years 1 months ago
FRIDA (Foggy Road Image DAtabase): evaluation database for visibility restoration algorithms
FRIDA and FRIDA2 are databases of numerical synthetic images easily usable to evaluate in a systematic way the performance of visibility and contrast restoration algorithms. In any...
PDCAT
2004
Springer
15 years 3 months ago
Stochastic DFS for Multiprocessor Scheduling of Cyclic Taskgraphs
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
Frode Eika Sandnes, Oliver Sinnen
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 4 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
EOR
2008
136views more  EOR 2008»
14 years 10 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...