2010 13th International Conference on Information Fusion 2010
DOI: 10.1109/icif.2010.5712108
|View full text |Cite
|
Sign up to set email alerts
|

Depth gradient based segmentation of overlapping foreground objects in range images

Abstract: Using standard background modeling approaches, close or overlapping objects are often detected as a single blob. In this paper we propose a new and effective method to distinguish between overlapping foreground objects in data obtained from a time of flight sensor. For this we use fusion of the infrared and the range data channels. In addition a further processing step is introduced to evaluate if connected components should be further divided. This is done using nonmaximum suppression on strong depth gradient… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 8 publications
(8 reference statements)
0
9
0
Order By: Relevance
“…The overall ranking across categories RC¡ of ¡th method is computed as the mean of the single RM¡ across all the sequences. In the following paragraphs we compare the performance of the following algorithms: the proposed adaptive weighted classifier CL W ; the two weak classifiers CL C and CL D ; the MoG algorithm proposed in [18] M0G RG B-D\ and the binary combinations of the foreground masks obtained by two independent modules based on depth and color data as proposed in [19] (by using MoG) and in [20] (by using ViBe), we refer to these algorithm as M0G Bin and Vibe B ¡". Finally we adapt to the RGBD feature space the neural networks algorithm proposed in [17] (SOM) and the modified MoG algorithm proposed in [14] (MoG Z w).lt has to be noted that no post-processing stages, such as morphological filtering, are applied to the resulting foreground masks.…”
Section: Benchmark Data and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The overall ranking across categories RC¡ of ¡th method is computed as the mean of the single RM¡ across all the sequences. In the following paragraphs we compare the performance of the following algorithms: the proposed adaptive weighted classifier CL W ; the two weak classifiers CL C and CL D ; the MoG algorithm proposed in [18] M0G RG B-D\ and the binary combinations of the foreground masks obtained by two independent modules based on depth and color data as proposed in [19] (by using MoG) and in [20] (by using ViBe), we refer to these algorithm as M0G Bin and Vibe B ¡". Finally we adapt to the RGBD feature space the neural networks algorithm proposed in [17] (SOM) and the modified MoG algorithm proposed in [14] (MoG Z w).lt has to be noted that no post-processing stages, such as morphological filtering, are applied to the resulting foreground masks.…”
Section: Benchmark Data and Resultsmentioning
confidence: 99%
“…MoG is also proposed in [19], where depth and infrared data are combined to detect foreground objects. Two independent background models are built and each pixel is classified as background or foreground only if the two models matching conditions agree.…”
Section: Foreground/background Segmentation With Depth Datamentioning
confidence: 99%
“…The overall ranking RC; for the /th method is then computed taking into account all the sequences RC¡ = -£RM¡, [31], which computes abinary combination of foreground masks obtained by two independent modules using MoG; VibeBin [23], which is based on a binary combination of foreground masks obtained by means of the ViBe algorithm [4]; PBAS [18], which first models the background using the recent history of pixel values, and then computes the foreground using a decision threshold calculated dynamically for each pixel; SOBS [25], which adopts a neural-network based approach to detect foreground objects without making any assumption about the pixel distribution; and CLw [9], which uses a probabilistic classifier to fuse a set of foreground masks, which are computed by a mixture of Gaussian approach that uses color and depth information. Regarding the PBAS and SOBS algorithms, we have to state that they have been extended to use RGB-D imagery, since originally they only employed color imagery.…”
Section: Ac\b S(a B) = (20) Aubmentioning
confidence: 99%
“…The MoG algorithm has been also used in [31], where depth and infrared data are combined for moving object detection. In this work, two independent background models are estimated, and the corresponding foreground regions are identified when the classification of these two models agree.…”
Section: Introductionmentioning
confidence: 99%
“…The MoG algorithm has been also used by Stormer et al (2010) to combine depth and infrared data. Two independent per-pixel background models are built, and pixels are classified as foreground when both models agree, otherwise the pixels are classified as background.…”
Section: Introductionmentioning
confidence: 99%