Search Constraints

Start Over
Filtering by: Creator Conrey, Richard M. Remove constraint Creator: Conrey, Richard M. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Action Segmentation with Limited Supervision

    Creator:
    Li, Jun
    Abstract:
    In this dissertation, we address action segmentation in videos under limited supervision. The goal of action segmentation is to predict an action class for each frame of a video. The limited supervision means ground truth labels of video frames are not available in training. We focus on three types of...
    Resource Type:
    Dissertation
    Full Text:
    the video. For set supervision, for a video with T frames with a set of M unique unordered actions

  • Agile Bipedal Locomotion via Hierarchical Control by Incorporating Physical Principles, Learning, and Optimization

    Creator:
    Green, Kevin
    Abstract:
    Robotic Bipedal locomotion holds the potential for efficient, robust traversal of difficult terrain. The difficulty lies in the dynamics of locomotion which complicate control and motion planning. Bipedal locomotion dynamics are dimensionally large problems, extremely nonlinear, and operate on the limits of actuator capabilities, which limit the performance of generic...
    Resource Type:
    Dissertation
    Full Text:
    labels. . . 101 7.4 Body and foot traces for an optimized 1.0 m/s walking gait from the actuated SLIP

  • Applying hierarchical and adaptive control to coordinating simple robots

    Creator:
    Knudson, Matthew D.
    Abstract:
    Coordinating multiple robots to achieve a complex task requires solving two distinct control problems: the high-level control problem of ensuring that each robot aims to perform a useful task (e.g., coordination) and the low-level control problem of ensuring that each robot actually performs the correct actions to achieve its task...
    Resource Type:
    Masters Thesis

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    as QM = {Q1,Q2, ...,QM}, where M is the total number of possible con- strained experiments, and let

  • Characterizing and Addressing Dataset Shift with Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    This dissertation delves into understanding, characterizing, and addressing dataset shift in deep learning, a pervasive issue for deployed machine learning systems. Integral aspects of the problem are examined: We start with the use of counterfactual explanations in order to characterize the behavior of deep reinforcement learning agents in visual input...
    Resource Type:
    Dissertation
    Full Text:
    vs. StyleGAN-R. And CelebA-M is a control dataset we create that does not contain glasses, ties and

  • Deep Convolutional Network on Point Clouds for 3D Scene Understanding

    Creator:
    Wu, Wenxuan
    Abstract:
    As one of the most popular data types, the point cloud is widely used in various appli- cations, including computer vision, computer graphics and robotics. The capability to directly measure 3D point clouds is invaluable in those applications as depth information could remove a lot of the segmentation ambiguities in...
    Resource Type:
    Dissertation
    Full Text:
    . This figure shows how the features are encoded and propagated in the network for a m classes

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    the modeling of pseudoknot structures. . . . . . . 35 3.15 M→I fixes in Figure 3.13 are an enriched

  • Domain-Independent Planning for Markov Decision Processes with Factored State and Action Spaces

    Creator:
    Raghavan, Aswin
    Abstract:
    Markov Decision Processes (MDPs) are the de-facto formalism for studying sequential decision making problems with uncertainty, ranging from classical problems such as inventory control and path planning, to more complex problems such as reservoir control under rainfall uncertainty and emergency response optimization for fire and medical emergencies. Most prior research...
    Resource Type:
    Dissertation
    Full Text:
    Factored Action Regression (MBFAR) is initialized with Z = ∅. The maximum size M is compared to the number

  • Efficient Incremental Panorama Reconstruction from Multiple Videos

    Creator:
    Feng, Zhongyuan
    Abstract:
    Constructing a panorama from a set of videos is a long-standing problem in computer vision. A panorama represents an enhanced still-image representation of an entire scene captured in a set of videos, where each video shows only a part of the scene. Importantly, a panorama shows only the scene background,...
    Resource Type:
    Capstone Project
    Full Text:
    to construct a balanced tree in high dimensional space Fm (feature space, where m = 128 for SIFT

  • Efficient training and feature induction in sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Sequential supervised learning problems arise in many real applications. This dissertation focuses on two important research directions in sequential supervised learning: efficient training and feature induction. In the direction of efficient training, we study the training of conditional random fields (CRFs), which provide a flexible and powerful model for sequential...
    Resource Type:
    Dissertation
    Full Text:
    parameter vector after iteration m, Θm, is a sum of an initial parameter vector Θ0 and a series of gradient