Discrete and continuous optimization for motion estimation / Ryan Kennedy.

Format:

Book

Manuscript

Thesis/Dissertation

Author/Creator:

Kennedy, Ryan, active 2015- author.

Contributor:

Taylor, Camillo J., degree supervisor.

Gallier, Jean, degree committee member.

Daniilidis, Kostas, degree committee member.

Shi, Jianbo, degree committee member.

Szeliski, Rick, degree committee member.

University of Pennsylvania. Department of Computer and Information Science, degree granting institution.

Language:

English

Subjects (All):

Penn dissertations--Computer and information science.

Computer and information science--Penn dissertations.

Local Subjects:

Penn dissertations--Computer and information science.

Computer and information science--Penn dissertations.

Physical Description:

xii, 144 leaves : color illustrations ; 29 cm

Production:

[Philadelphia, Pennsylvania] : University of Pennsylvania, 2015.

Summary:

The study of motion estimation reaches back decades and has become one of the central topics of research in computer vision. Even so, there are situations where current approaches fail, such as when there are extreme lighting variations, significant occlusions, or very large motions. In this thesis, we propose several approaches to address these issues. First, we propose a novel continuous optimization framework for estimating optical flow based on a decomposition of the image domain into triangular facets. We show how this allows for occlusions to be easily and naturally handled within our optimization framework without any post-processing. We also show that a triangular decomposition enables us to use a direct Cholesky decomposition to solve the resulting linear systems by reducing its memory requirements. Second, we introduce a simple method for incorporating additional temporal information into optical flow using "inertial estimates" of the flow, which leads to a significant reduction in error. We evaluate our methods on several datasets and achieve state-of-the-art results on MPI-Sintel. Finally, we introduce a discrete optimization framework for optical flow computation. Discrete approaches have generally been avoided in optical flow because of the relatively large label space that makes them computationally expensive. In our approach, we use recent advances in image segmentation to build a tree-structured graphical model that conforms to the image content. We show how the optimal solution to these discrete optical flow problems can be computed efficiently by making use of optimization methods from the object recognition literature, even for large images with hundreds of thousands of labels.

Notes:

Ph. D. University of Pennsylvania 2015.

Department: Computer and Information Science.

Supervisor: Camillo J. Taylor.

Includes bibliographical references.

OCLC:

951160793