Sciweavers

27 search results - page 1 / 6
» Revisiting the Brightness Constraint: Probabilistic Formulat...
Sort
View
ECCV
2006
Springer
14 years 7 months ago
Revisiting the Brightness Constraint: Probabilistic Formulation and Algorithms
Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabil...
Venu Madhav Govindu
ICPR
2000
IEEE
13 years 8 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
ICML
2007
IEEE
14 years 5 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 23 days ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
ICML
2005
IEEE
14 years 5 months ago
Preference learning with Gaussian processes
In this paper, we propose a probabilistic kernel approach to preference learning based on Gaussian processes. A new likelihood function is proposed to capture the preference relat...
Wei Chu, Zoubin Ghahramani