We present a novel approach to change detection based on a coarse-to-fine strategy. An efficient coarse-level detection is proposed that filters out most of the possible false changes, thus attaining reliable and tight course-grain super-masks of the truly changed areas. The subsequent fine-level detection can thus "focus the attention" just on the "interesting" parts of the frame and perform a robust selective background updating procedure by considering the complement of these masks. Besides, the analysis of a strip of pixels surrounding each coarse-grain blob allows to infer information on light changes possibly occurring in the blob's vicinity. Although any algorithm can be used as the final fine-level detection, here we show how the approach applies to a particular algorithm we devised, based on a non-parametric statistical modelling of the camera noise.
Bevilacqua, A., Di Stefano, L., Lanza, A. (2005). Coarse-to-fine strategy for robust and efficient change detectors. 345 E 47TH ST, NEW YORK, NY 10017 USA : IEEE.
Coarse-to-fine strategy for robust and efficient change detectors
Bevilacqua, A;
2005
Abstract
We present a novel approach to change detection based on a coarse-to-fine strategy. An efficient coarse-level detection is proposed that filters out most of the possible false changes, thus attaining reliable and tight course-grain super-masks of the truly changed areas. The subsequent fine-level detection can thus "focus the attention" just on the "interesting" parts of the frame and perform a robust selective background updating procedure by considering the complement of these masks. Besides, the analysis of a strip of pixels surrounding each coarse-grain blob allows to infer information on light changes possibly occurring in the blob's vicinity. Although any algorithm can be used as the final fine-level detection, here we show how the approach applies to a particular algorithm we devised, based on a non-parametric statistical modelling of the camera noise.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.