Bayesian Formulation of Image Patch Matching Using Cross-correlation
Author
Summary, in English
A classical solution for matching two image patches is to use the cross-correlation coefficient. This works well if there is a lot of structure within the patches, but not so well if the patches are close to uniform. This means that some patches are matched with more confidence than others. By estimating this uncertainty, more weight can be put on the confident matches than those that are more uncertain. To enable this two distribution functions for two different cases are used: (i) the correlation between two patches showing the same object but with different lighting conditions and different noise realisations and (ii) the correlation between two unrelated patches.
Using these two distributions the patch matching problem is, in this paper, formulated as a binary classification problem. The probability of two patches matching is derived. The model depends on the signal to noise ratio. The noise level is reasonably invariant over time, while the signal level, represented by the amount of structure in the patch or its spatial variance, has to be measured for every frame.
A common application where this is useful is feature point matching between different images. Another application is background/foreground segmentation. This paper will concentrate on the latter application. It is shown how the theory can be used to implement a very fast background/foreground segmentation algorithm by transforming the calculations to the DCT-domain and processing a motion-JPEG stream without uncompressing it. This allows the algorithm to be embedded on a 150 MHz ARM based network camera. It is also suggested to use recursive quantile estimation to estimate the background model. This gives very accurate background models even if there is a lot of foreground present during the initialisation of the model.
Using these two distributions the patch matching problem is, in this paper, formulated as a binary classification problem. The probability of two patches matching is derived. The model depends on the signal to noise ratio. The noise level is reasonably invariant over time, while the signal level, represented by the amount of structure in the patch or its spatial variance, has to be measured for every frame.
A common application where this is useful is feature point matching between different images. Another application is background/foreground segmentation. This paper will concentrate on the latter application. It is shown how the theory can be used to implement a very fast background/foreground segmentation algorithm by transforming the calculations to the DCT-domain and processing a motion-JPEG stream without uncompressing it. This allows the algorithm to be embedded on a 150 MHz ARM based network camera. It is also suggested to use recursive quantile estimation to estimate the background model. This gives very accurate background models even if there is a lot of foreground present during the initialisation of the model.
Department/s
Publishing year
2012
Language
English
Pages
72-87
Publication/Series
Journal of Mathematical Imaging and Vision
Volume
43
Issue
1
Document type
Journal article
Publisher
Springer
Topic
- Mathematics
Keywords
- Patch-matching · Lighting variations ·Background/Foreground-segmentation · Bayesianclassification
Status
Published
Research group
- Mathematical Imaging Group
ISBN/ISSN/Other
- ISSN: 0924-9907