Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive Support-Weight Approach for Correspondence Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Fractional Stereo Matching Using Expectation-Maximization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo vision for obstacle detection: a graph-based approach
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Fast variable window for stereo correspondence using integral images
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Journal on Image and Video Processing - Special issue on advanced video-based surveillance
Hi-index | 0.00 |
Achieving an accurate disparity map in a reasonable processing time is a real challenge in the stereovision field. For this purpose, we propose in this paper an original approach which aims to accelerate matching time while keeping a very good matching accuracy. The proposed method allows us to shift from a dense to a sparse disparity map. Firstly, we have computed scores for all pairs of pixels using a new dissimilarity function recently developed. Then, by applying a confidence measure on each pair of pixels, we keep only couples of pixels having a high confidence measure which is computed relying on a set of new local parameters.