Home
Resource
Robust methods for multiple model discovery in structured and unstructured data
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(8.04 MB)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Anand, Saket. Robust methods for multiple model discovery in structured and unstructured data. Retrieved from https://doi.org/doi:10.7282/T3VQ30NR

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleRobust methods for multiple model discovery in structured and unstructured data
NameAnand, Saket (author); Meer, Peter (chair); RABINER, LAWRENCE (internal member); Petropulu, Athina (internal member); Dana, Kristin (internal member); Singh, Maneesh (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2013
Other Date2013-10 (degree)
SubjectElectrical and Computer Engineering, Semantics--Data processing, Three-dimensional imaging
Extentxiv, 107 p. : ill.
DescriptionHumans excel at identifying and locating multiple instances of objects or persons in a scene, despite large variations in lighting conditions, pose or scale. In order to achieve this level of robustness, humans naturally use high-level semantic information. The notion of semantics is hierarchical in nature, for example, a house is constituted of walls, floor and ceiling. When certain entities in this hierarchy can be modeled using a functional form known a priori, we refer to the data as structured, while when the functional form is unknown, the data is unstructured. In this thesis, we address the problem of discovering multiple instances of models in structured and unstructured data. The first part of this thesis deals with structured data. We identify planar regions in an indoor scene by using a single depth image from a Microsoft Kinect sensor. The clutter in the indoor scenes, the depth dependent measurement noise and the unknown number of planar regions pose serious challenges in model discovery. We propose a scalable bottom-up approach that leverages from a heteroscedastic, i.e., point dependent model of the measurement noise. The second part of the thesis addresses multiple model discovery in unstructured data in a semi-supervised setup. We develop a framework for using mean shift clustering in kernel spaces with a few user-specified pairwise constraints. A linear transformation of the initial kernel space is learned by the constrained minimization of a Bregman divergence based objective function. We automatically determine the adaptive bandwidth parameter to be used with mean shift clustering. Finally, we compare the performance with state-of-the-art semi-supervised clustering methods and show that kernel mean shift clustering performs particularly well when the number of clusters is large. We also propose a few directions for future research. Using the planar regions detected from the first frame of Kinect, a sequence of RGB-D images can be rapidly processed to dynamically generate a consistent 3D model of the scene. We also show that for the kernel learning problem, we can use ideas from group theory and semi-definite programming to devise a more efficient algorithm that only uses linearly independent constraints.
NotePh.D.
NoteIncludes bibliographical references
NoteIncludes vita
Noteby Saket Anand
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3VQ30NR
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024