Visible and infrared sensors fusion by matching feature points of foreground blobs

Authors:
Pier-Luc St-Onge;Guillaume-Alexandre Bilodeau
Affiliations:
LITIV, Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada;LITIV, Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada
Venue:
ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II
Year:
2007

Citing 6
Cited 0

Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
A Cooperative Algorithm for Stereo Matching and Occlusion Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
A practical adaptive approach for dynamic background subtraction using an invariant colour model and object tracking

Pattern Recognition Letters
Sparse Disparity Map from Uncalibrated Infrared Stereo Images

CRV '06 Proceedings of the The 3rd Canadian Conference on Computer and Robot Vision
Dense Surface from Infrared Stereo

WACV '07 Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Foreground blobs in a mixed stereo pair of videos (visible and infrared sensors) allow a coarse evaluation of the distances between each blob and the uncalibrated cameras. The main goals of this work are to find common feature points in each type of image and to create pairs of corresponding points in order to obtain coarse positionning of blobs in space. Feature points are found by two methods: the skeleton and the Discrete Curve Evolution (DCE) algorithm. For each method, a feature-based algorithm creates the pairs of points. Blob pairing can help to create those pairs of points. Finally, a RANSAC algorithm filters all pairs of points in order to respect the epipolar geometrical constraints. The median horizontal disparities for each pair of blobs are evaluated with two different ground truths. In most cases, the nearest blob is detected and disparities are as accurate as the background subtraction allows.