Person:
Dellaert, Frank

Permanent Link
https://hdl.handle.net/1853/71202
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Filters

2005 - 2006 4
4
3 1
4
Reset filters

Settings
Author: Oh, Sang Min × End date: 2009 × search.filters.applied.f.isOrgUnitOfPublicationTitle: College of Computing ×

Publication Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    On-line Learning of the Traversability of Unstructured Terrain for Outdoor Robot Navigation
    (Georgia Institute of Technology, 2006) Oh, Sang Min ; Rehg, James M. ; Dellaert, Frank
  • Thumbnail Image
    Item
    Data-Driven MCMC for Learning and Inference in Switching Linear Dynamic Systems
    (Georgia Institute of Technology, 2005-07) Oh, Sang Min ; Rehg, James M. ; Balch, Tucker ; Dellaert, Frank
    Switching Linear Dynamic System (SLDS) models are a popular technique for modeling complex nonlinear dynamic systems. An SLDS has significantly more descriptive power than an HMM, but inference in SLDS models is computationally intractable. This paper describes a novel inference algorithm for SLDS models based on the Data- Driven MCMC paradigm. We describe a new proposal distribution which substantially increases the convergence speed. Comparisons to standard deterministic approximation methods demonstrate the improved accuracy of our new approach. We apply our approach to the problem of learning an SLDS model of the bee dance. Honeybees communicate the location and distance to food sources through a dance that takes place within the hive. We learn SLDS model parameters from tracking data which is automatically extracted from video. We then demonstrate the ability to successfully segment novel bee dances into their constituent parts, effectively decoding the dance of the bees.
  • Thumbnail Image
    Item
    Mixture Trees for Modeling and Fast Conditional Sampling with Applications in Vision and Graphics
    (Georgia Institute of Technology, 2005-06) Dellaert, Frank ; Kwatra, Vivek ; Oh, Sang Min
    We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tree models data efficiently at multiple resolutions, and present fast conditional sampling as one of many possible applications. In particular, the development of this datastructure was spurred by a multi-target tracking application, where memory-based motion modeling calls for fast conditional sampling from large empirical densities. However, it is also suited to applications such as texture synthesis, where conditional densities play a central role. Results will be presented for both these applications.
  • Thumbnail Image
    Item
    Segmental Switching Linear Dynamic Systems
    (Georgia Institute of Technology, 2005) Oh, Sang Min ; Rehg, James M. ; Dellaert, Frank
    We introduce Segmental Switching Linear Dynamic Systems (S-SLDS), which improve on standard SLDSs by explicitly incorporating duration modeling capabilities. We show that S-SLDSs can adopt arbitrary finite-sized duration models that describe data more accurately than the geometric distributions induced by standard SLDSs. We also show that we can convert an S-SLDS to an equivalent standard SLDS with sparse structure in the resulting transition matrix. This insight makes it possible to adopt existing inference and learning algorithms for the standard SLDS models to the S-SLDS framework. As a consequence, the more powerful S-SLDS model can be adopted with only modest additional effort in most cases where an SLDS model can be applied. The experimental results on honeybee dance decoding tasks demonstrate the robust inference capabilities of the proposed S-SLDS model.