This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is based on the Reactive Tabu Search strategy, and requires to define a suitable fitness function that measures the performance of the MRF stereo algorithm with a given parameters set. This approach have been made possible by the recent availability of ground-truth disparity maps. Experiments with synthetic and real images illustrate the approach
The Markov random field (MRF) model, whose model parameters specify the amount of smoothness in an i...
Abstract. Brute-force dense matching is usually not satisfactory because the same search range is us...
One of the central problems in stereo matching (and other image registration tasks) is the selection...
This paper presents an optimisation technique to select automatically a set of control parameters fo...
This paper presents an optimization technique to automatically select a set of control parameters fo...
For about the last ten years, stereo matching in computer vision has been treated as a combinatorial...
Abstract Until recently, the lack of ground truth data has hindered the application of discriminativ...
International audienceWhile machine learning has been instrumental to the ongoing progress in most a...
While machine learning has been instrumental to the on-going progress in most areas of computer visi...
In the research literature, maximum likelihood principles were applied to stereo matching by alterin...
Under the popular Bayesian approach, a stereo problem can be formulated by defining likelihood and p...
This paper deals with the stereo matching problem, while moving away from the traditional fronto-par...
International audienceWe propose a Markov Random Field (MRF) formulation for the intensity-based N-v...
Mutual information (MI) has shown promise as an effective stereo matching measure for images affecte...
We describe a simple and fast algorithm for optimizing Markov random fields over images. The algorit...
The Markov random field (MRF) model, whose model parameters specify the amount of smoothness in an i...
Abstract. Brute-force dense matching is usually not satisfactory because the same search range is us...
One of the central problems in stereo matching (and other image registration tasks) is the selection...
This paper presents an optimisation technique to select automatically a set of control parameters fo...
This paper presents an optimization technique to automatically select a set of control parameters fo...
For about the last ten years, stereo matching in computer vision has been treated as a combinatorial...
Abstract Until recently, the lack of ground truth data has hindered the application of discriminativ...
International audienceWhile machine learning has been instrumental to the ongoing progress in most a...
While machine learning has been instrumental to the on-going progress in most areas of computer visi...
In the research literature, maximum likelihood principles were applied to stereo matching by alterin...
Under the popular Bayesian approach, a stereo problem can be formulated by defining likelihood and p...
This paper deals with the stereo matching problem, while moving away from the traditional fronto-par...
International audienceWe propose a Markov Random Field (MRF) formulation for the intensity-based N-v...
Mutual information (MI) has shown promise as an effective stereo matching measure for images affecte...
We describe a simple and fast algorithm for optimizing Markov random fields over images. The algorit...
The Markov random field (MRF) model, whose model parameters specify the amount of smoothness in an i...
Abstract. Brute-force dense matching is usually not satisfactory because the same search range is us...
One of the central problems in stereo matching (and other image registration tasks) is the selection...