Sciweavers

72 search results - page 8 / 15
» Colour Naming considering the Colour Variability Problem
Sort
View
DAGM
2006
Springer
13 years 11 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
PAMI
2010
168views more  PAMI 2010»
13 years 6 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
PC
2010
177views Management» more  PC 2010»
13 years 6 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
SIGPRO
2010
99views more  SIGPRO 2010»
13 years 6 months ago
Oversampled phase tracking in digital communications with large excess bandwidth
This paper deals with the on-line carrier phase estimation in a digital receiver. We consider a Brownian phase evolution in a Data Aided scenario. The proposed study uses an overs...
Jordi Vilà-Valls, Jean-Marc Brossier, Laure...
CSL
2004
Springer
14 years 1 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark