2010
DOI: 10.1007/978-3-642-15986-2_49
|View full text |Cite
|
Sign up to set email alerts
|

Interactive Motion Segmentation

Abstract: Abstract. Interactive motion segmentation is an important task for scene understanding and analysis. Despite recent progress state-of-theart approaches still have difficulties in adapting to the diversity of spatially varying motion fields. Due to strong, spatial variations of the motion field, objects are often divided into several parts. At the same time, different objects exhibiting similar motion fields often cannot be distinguished correctly. In this paper, we propose to use spatially varying affine motio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…Bai et al [2] estimate foreground and background color likelihoods whose gradients are used to define weighted geodesic distances between each pixel and the user scribbles. Spatial information has also successfully been introduced into kernel density estimators, e.g., in the meanshift approach [10], in segmentation based on geodesic distances [2], or in motion analysis [24]. In [40], [30], [14], [17] distance-based sampling was applied to image matting.…”
Section: Previous Data Fidelity Termsmentioning
confidence: 99%
“…Bai et al [2] estimate foreground and background color likelihoods whose gradients are used to define weighted geodesic distances between each pixel and the user scribbles. Spatial information has also successfully been introduced into kernel density estimators, e.g., in the meanshift approach [10], in segmentation based on geodesic distances [2], or in motion analysis [24]. In [40], [30], [14], [17] distance-based sampling was applied to image matting.…”
Section: Previous Data Fidelity Termsmentioning
confidence: 99%
“…Several techniques based on graph cuts [11], random walks [32], and intermediate methods [60] have been proposed. The latest techniques are built upon variational convex relaxation methods [66], [19], [38], [45], which avoid the typical discretization artifacts of graph based formulations. The variational technique we propose here is in line with these methods.…”
Section: Related Workmentioning
confidence: 99%
“…If we use the spatially constant model the results are comparable to those obtained by Santner et al (RGB color information without texture). They obtain the best results combining CIELab and LBP features in a 21 dimensional vector based on a scribble brush of radius 13. We obtain better results on the benchmark by allowing for spatially varying color models.…”
Section: Results On the Graz Benchmarkmentioning
confidence: 94%
“…Furthermore, since the relaxed problems (13) and (18) are convex, we will always reach their global minimum independent of the label order. However, ambiguities also occur for PDE-based approaches in the multilabel case.…”
Section: Ambiguitiesmentioning
confidence: 99%
See 1 more Smart Citation