TechConnect 2017
Prof Susan Rodger in Classroom
Recipients of grad student awards 2017-18
Poster day
Undergrad Poster BreatheMe
Graduation 2018
Undergrad poster presentation
Graduation 2018 Group Grad Students
Undergrad summer research group 2018
Graduation 2018
Poster by undergrad Aditya
Undergrad Research Poster 2018
Undergrad research poster
Undergrad Research Poster
Faculty, student, poster
Kristen Stephens Martinez
TMLD 2018
Undergrad Research Poster 2018
Graduation 2018
Graduation 2018 Faculty

Upcoming Events

Motion Boundaries without Optical Flow

Master's Defense
Speaker Name
Hannah Kim
Location
LSRC D344
Date and Time
-

We propose an architecture based on Convolutional Neural Networks (CNNs) for the detection of motion boundaries from two consecutive images of a video sequence. Existing learning-based approaches start with dense optical flow estimates, which are expensive to compute and often fail near motion boundaries, exactly where they are needed most. In contrast, we explore ways to detect motion boundaries without first computing optical flow. For efficiency, we hypothesize that motion boundaries occur at or near the edges of superpixels in an over-segmentation of the first image.

Getting More Out of the Existing Internet Infrastructure To Improve User Experiences

Ph. D. Defense
Speaker Name
Ilker Nadi Bozkurt
Location
LSRC D344
Date and Time
-

Providing a satisfactory quality of experience (QoE) to Internet users is crucial for content and service providers. When users get bad QoE from an application, such as the videos they are watching on a streaming provider keep freezing or the shopping Web site they are visiting takes a long time to load, they often spend less time on the application, return to it less frequently, or even worse they might switch to an alternative application, in all cases hurting the business financially.

LevioSA: Lightweight Secure Arithmetic Computation

Algorithms Seminar
Speaker Name
Muthu Venkitasubramaniam
Location
LSRC D344
Date and Time
-

We study the problem of secure two-party computation of arithmetic circuits. This problem is motivated by privacy-preserving numerical computations, such as ones arising in the context of machine learning training and classification. Recent works on the problem have mainly focused on passively secure protocols, whose security holds against passive (``semi-honest'') parties but may completely break down in the presence of active (``malicious'') parties who can deviate from the protocol.