In this paper we propose a technique to robustly estimate the background in a cluttered sequence, i.e., a sequence where occluding objects persist in the same position for a considerable portion of time. As pixel-level heuristic are not sufficient in this case, we introduce spatial support. First the sequence is subdivided in patches that are clustered along the time-line in order to narrow down the number of background candidates. Then the background is grown incrementally by selecting at each step the best continuation of the current background, according to the principles of visual grouping. The method rests on sound principles in all its stages, and only few, intelligible parameters are needed. Experiments with real sequences illustrate the approach.
Background Initialization in Cluttered Sequences
FUSIELLO, Andrea;
2006-01-01
Abstract
In this paper we propose a technique to robustly estimate the background in a cluttered sequence, i.e., a sequence where occluding objects persist in the same position for a considerable portion of time. As pixel-level heuristic are not sufficient in this case, we introduce spatial support. First the sequence is subdivided in patches that are clustered along the time-line in order to narrow down the number of background candidates. Then the background is grown incrementally by selecting at each step the best continuation of the current background, according to the principles of visual grouping. The method rests on sound principles in all its stages, and only few, intelligible parameters are needed. Experiments with real sequences illustrate the approach.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
