Applying recursive em to scene segmentation

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a novel approach for the interdependent task of multiple object tracking and scene segmentation is presented. The method partitions a stereo image sequence of a dynamic 3-dimensional (3D) scene into its most prominent moving groups with similar 3D motion. The unknown set of motion parameters is recursively estimated using an iterated extended Kalman filter (IEKF) which will be derived from the expectation-maximization (EM) algorithm. The EM formulation is used to incorporate a probabilistic data association measure into the tracking process. In a subsequent segregation step, each image point is assigned to the object hypothesis with maximum a posteriori (MAP) probability. Within the association process, which is implemented as labeling problem, a Markov Random Field (MRF) is used to express our expectations on spatial continuity of objects. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bachmann, A. (2009). Applying recursive em to scene segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5748 LNCS, pp. 512–521). https://doi.org/10.1007/978-3-642-03798-6_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free