SSS Abstracts  Fall 2008

Presented by James McCann, CSD

In my gradient-domain paint system, users specify color differences between pixels instead of (as in a traditional paint program) specifying pixel colors explicitly. While such a modality may at first seem unintuitive, it's actually quite easy to get the hang of -- in fact, given the way humans perceive color, it may make more sense than a traditional paint program!

In this talk I'll describe the work in graphics and perceptual psychology that led me to create such a program, the underlying technology (GPU-based multigrid) that keeps things running at interactive rates, and the brushes and blend modes that allow users to perform gradient-domain edits.

If you'd like to try out the paint system (and have a decent graphics card), visit http://gradient-paint.com where you can find binaries for Linux, OSX, and Windows as well as source code.

Squigl: A game for detecting objects in images

Friday, September 26^th, 2008 from 12-1 pm in Wean 5409.

Presented by Bryant Lee, CSD

We report on a fun web game we developed, called Squigl, where players label object locations for the purpose of training object detection algorithms. We explain how we deployed the game on a live gaming website and collected fifty thousand data points. We also perform a test by using some of the data in an actual object detection algorithm to see how it performs and how it compares with existing, state of the art databases for object detection. The results of the test showed that our data was as good as data collected from traditional methods. The contribution of this paper is a large and diverse dataset for training object detection algorithms and also the description of the successful methodology of using a web game to collect this data cheaply and easily. Using games to collect data has been applied previously, for example by the ESP Game, but Squigl represents a novel application to a broad area of AI not previously explored with this method.

Joint Work with: Luis von Ahn

Walking the way of duality (in programming)

Friday, October 10^th, 2008 from 12-1 pm in Wean 5409.

Presented by Noam Zeilberger, CSD

"So much time and so little to do. Wait a minute. Strike that. Reverse it." As Willy Wonka once observed, duality is a powerful tool for reorganizing old ideas, and for generating new ones. In this talk, I will explore ways in which duality can be used to give a simpler account of existing programming languages, as well as to build more expressive new languages. After reviewing some basic PL terminology such as "value", "continuation", "pattern-matching", and "evaluation order", I will explain how to view program evaluation abstractly as a game between two players: Valerie the value and Conor the continuation. This will lead us to discussing two different forms of duality. On the one hand, the players are dual in the sense that they must be able to respond to each other's moves (pattern-matching). On the other hand, there is a duality between games in which Valerie moves first, and games in which Conor moves first (evaluation order).

Finally, through the Curry-Howard correspondence, Valerie and Conor play the opposing roles of proof and refutation. In that case, the two forms of duality let us make sense of the ancient Aristotelian concept of the "square of opposition".

(In Partial Fulfillment of the Speaking Skills Requirement.)

TBD

Friday, October 17^th, 2008 from 12-1 pm in Wean 5409.

Presented by Dan Licata, CSD

A Computational Theory of the Organizational Merger

Friday, December 12^th, 2008 from 12-1 pm in Wean 5409.

Presented by Terrill L. Frantz, ISR

Web contact: sss+www@cs