Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

View graph of relations

Details

Original languageEnglish
Title of host publicationComputer Vision - ECCV 2012
Subtitle of host publication12th European Conference on Computer Vision, Proceedings
Pages445-458
Number of pages14
ISBN (electronic)978-3-642-33709-3
Publication statusPublished - 2012
Event12th European Conference on Computer Vision, ECCV 2012 - Florence, Italy
Duration: 7 Oct 201213 Oct 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7573
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

We present an approach for motion segmentation using independently detected keypoints instead of commonly used tracklets or trajectories. This allows us to establish correspondences over non- consecutive frames, thus we are able to handle multiple object occlusions consistently. On a frame-to-frame level, we extend the classical split-and-merge algorithm for fast and precise motion segmentation. Globally, we cluster multiple of these segmentations of different time scales with an accurate estimation of the number of motions. On the standard benchmarks, our approach performs best in comparison to all algorithms which are able to handle unconstrained missing data. We further show that it works on benchmark data with more than 98% of the input data missing. Finally, the performance is evaluated on a mobile-phone-recorded sequence with multiple objects occluded at the same time.

ASJC Scopus subject areas

Cite this

Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation. / Dragon, Ralf; Rosenhahn, Bodo; Ostermann, Jörn.
Computer Vision - ECCV 2012: 12th European Conference on Computer Vision, Proceedings. 2012. p. 445-458 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7573 , No. PART 2).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Dragon, R, Rosenhahn, B & Ostermann, J 2012, Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation. in Computer Vision - ECCV 2012: 12th European Conference on Computer Vision, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 7573 , pp. 445-458, 12th European Conference on Computer Vision, ECCV 2012, Florence, Italy, 7 Oct 2012. https://doi.org/10.1007/978-3-642-33709-3_32
Dragon, R., Rosenhahn, B., & Ostermann, J. (2012). Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation. In Computer Vision - ECCV 2012: 12th European Conference on Computer Vision, Proceedings (pp. 445-458). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7573 , No. PART 2). https://doi.org/10.1007/978-3-642-33709-3_32
Dragon R, Rosenhahn B, Ostermann J. Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation. In Computer Vision - ECCV 2012: 12th European Conference on Computer Vision, Proceedings. 2012. p. 445-458. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-642-33709-3_32
Dragon, Ralf ; Rosenhahn, Bodo ; Ostermann, Jörn. / Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation. Computer Vision - ECCV 2012: 12th European Conference on Computer Vision, Proceedings. 2012. pp. 445-458 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
Download
@inproceedings{4bca352a162241e499e5d931a89353d6,
title = "Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation",
abstract = "We present an approach for motion segmentation using independently detected keypoints instead of commonly used tracklets or trajectories. This allows us to establish correspondences over non- consecutive frames, thus we are able to handle multiple object occlusions consistently. On a frame-to-frame level, we extend the classical split-and-merge algorithm for fast and precise motion segmentation. Globally, we cluster multiple of these segmentations of different time scales with an accurate estimation of the number of motions. On the standard benchmarks, our approach performs best in comparison to all algorithms which are able to handle unconstrained missing data. We further show that it works on benchmark data with more than 98% of the input data missing. Finally, the performance is evaluated on a mobile-phone-recorded sequence with multiple objects occluded at the same time.",
author = "Ralf Dragon and Bodo Rosenhahn and J{\"o}rn Ostermann",
year = "2012",
doi = "10.1007/978-3-642-33709-3_32",
language = "English",
isbn = "9783642337086",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "445--458",
booktitle = "Computer Vision - ECCV 2012",
note = "12th European Conference on Computer Vision, ECCV 2012 ; Conference date: 07-10-2012 Through 13-10-2012",

}

Download

TY - GEN

T1 - Multi-scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation

AU - Dragon, Ralf

AU - Rosenhahn, Bodo

AU - Ostermann, Jörn

PY - 2012

Y1 - 2012

N2 - We present an approach for motion segmentation using independently detected keypoints instead of commonly used tracklets or trajectories. This allows us to establish correspondences over non- consecutive frames, thus we are able to handle multiple object occlusions consistently. On a frame-to-frame level, we extend the classical split-and-merge algorithm for fast and precise motion segmentation. Globally, we cluster multiple of these segmentations of different time scales with an accurate estimation of the number of motions. On the standard benchmarks, our approach performs best in comparison to all algorithms which are able to handle unconstrained missing data. We further show that it works on benchmark data with more than 98% of the input data missing. Finally, the performance is evaluated on a mobile-phone-recorded sequence with multiple objects occluded at the same time.

AB - We present an approach for motion segmentation using independently detected keypoints instead of commonly used tracklets or trajectories. This allows us to establish correspondences over non- consecutive frames, thus we are able to handle multiple object occlusions consistently. On a frame-to-frame level, we extend the classical split-and-merge algorithm for fast and precise motion segmentation. Globally, we cluster multiple of these segmentations of different time scales with an accurate estimation of the number of motions. On the standard benchmarks, our approach performs best in comparison to all algorithms which are able to handle unconstrained missing data. We further show that it works on benchmark data with more than 98% of the input data missing. Finally, the performance is evaluated on a mobile-phone-recorded sequence with multiple objects occluded at the same time.

UR - http://www.scopus.com/inward/record.url?scp=84867874527&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33709-3_32

DO - 10.1007/978-3-642-33709-3_32

M3 - Conference contribution

AN - SCOPUS:84867874527

SN - 9783642337086

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 445

EP - 458

BT - Computer Vision - ECCV 2012

T2 - 12th European Conference on Computer Vision, ECCV 2012

Y2 - 7 October 2012 through 13 October 2012

ER -

By the same author(s)