A Model-Selection Framework for Multibody Structure-and-Motion of Image Sequences

Given an image sequence of a scene consisting of multiple rigidly moving objects, multi-body structure-and-motion (MSaM) is the task to segment the image feature tracks into the different rigid objects and compute the multiple-view geometry of each object. We present a framework for multibody structure-and-motion based on model selection. In a recover-and-select procedure, a redundant set of hypothetical scene motions is generated. Each subset of this pool of motion candidates is regarded as a possible explanation of the image feature tracks, and the most likely explanation is selected with model selection. The framework is generic and can be used with any parametric camera model, or with a combination of different models. It can deal with sets of correspondences, which change over time, and it is robust to realistic amounts of outliers. The framework is demonstrated for different camera and scene model

Research on a modifeied RANSAC and its applications to ellipse detection from a static image and motion detection from active stereo video sequences

制度:新 ; 報告番号:甲3091号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2010/2/24 ; 早大学位記番号:新535

Motion segmentation based robust RGB-D SLAM

© 2014 IEEE. A sparse feature-based motion segmentation algorithm for RGB-D data is proposed which offers us a unified way to handle outliers and dynamic scenarios. Together with the pose-graph SLAM framework, they constitute an effective and robust solution that enable us to do RGB-D SLAM in wide range of situations, although traditionally they have been divided into different categories and treated separately using different kinds of methods. Through comparisons with RANSAC using simulated data and testing with different benchmark RGB-D datasets against the state-of-the-art method in RGB-D SLAM, we show that our solution is efficient and effective in handling general static and dynamic scenarios, some of which have not be achieved before

Randomized hybrid linear modeling by local best-fit flats

The hybrid linear modeling problem is to identify a set of d-dimensional affine sets in a D-dimensional Euclidean space. It arises, for example, in object tracking and structure from motion. The hybrid linear model can be considered as the second simplest (behind linear) manifold model of data. In this paper we will present a very simple geometric method for hybrid linear modeling based on selecting a set of local best fit flats that minimize a global l1 error measure. The size of the local neighborhoods is determined automatically by the Jones' l2 beta numbers; it is proven under certain geometric conditions that good local neighborhoods exist and are found by our method. We also demonstrate how to use this algorithm for fast determination of the number of affine subspaces. We give extensive experimental evidence demonstrating the state of the art accuracy and speed of the algorithm on synthetic and real hybrid linear data.Comment: To appear in the proceedings of CVPR 201