Matching and compressing sequences of visual hulls

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.

Bibliographic Details
Main Author: Goela, Naveen, 1981-
Other Authors: Trevor Darrell.
Format: Thesis
Language:en_US
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/28409
_version_ 1811096201061203968
author Goela, Naveen, 1981-
author2 Trevor Darrell.
author_facet Trevor Darrell.
Goela, Naveen, 1981-
author_sort Goela, Naveen, 1981-
collection MIT
description Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
first_indexed 2024-09-23T16:40:11Z
format Thesis
id mit-1721.1/28409
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T16:40:11Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/284092019-04-11T13:55:50Z Matching and compressing sequences of visual hulls Goela, Naveen, 1981- Trevor Darrell. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. Includes bibliographical references (p. 61-63). In this thesis, we implement the polyhedral visual hull (PVH) algorithm in a modular software system to reconstruct 3D meshes from 2D images and camera poses. We also introduce the new idea of visual hull graphs. For data, using an eight camera synchronous system after multi-camera calibration, we collect video sequences to study the pose and motion of people. For efficiency in VH processing, we compress 2D input contours to reduce te number of triangles in the output mesh and demonstrate how subdivision surfaces smoothly approximate the irregular output mesh in 3D. After generating sequences of visual hulls from source video, to define a visual hull graph, we use a simple distance metric for pose by calculating Chamfer distances between 2D shape contours. At each frame of our graph, we store a view independent 3D pose and calculate the transition probability to any other frame based on similarity of pose. To test our approach, we synthesize new realistic motion by walking through cycles in the graph. Our results are new videos of arbitrary length and viewing direction based on a sample source video. by Naveen Goela. M.Eng. 2005-09-26T20:17:24Z 2005-09-26T20:17:24Z 2004 2004 Thesis http://hdl.handle.net/1721.1/28409 56985872 en_US M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 63 p. 2640606 bytes 2646449 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Goela, Naveen, 1981-
Matching and compressing sequences of visual hulls
title Matching and compressing sequences of visual hulls
title_full Matching and compressing sequences of visual hulls
title_fullStr Matching and compressing sequences of visual hulls
title_full_unstemmed Matching and compressing sequences of visual hulls
title_short Matching and compressing sequences of visual hulls
title_sort matching and compressing sequences of visual hulls
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/28409
work_keys_str_mv AT goelanaveen1981 matchingandcompressingsequencesofvisualhulls