Skip to main content

Secondary navigation:

1999 Bachelors Theses

computer science

Author: Jun Kawai
download postscript
Title: Gaze Detection Via Self-Organizing Gray-Scale Units
Advisor: Margrit Betke
We present a gaze estimation system that detects an eye in a face image and estimates the gaze direction by computing the position of the pupil with respect to the center of the eye. Our system is based on unsupervised learning. It creates a map of self-organized gray-scale image units that collectively describe the eye outline. Our approach is information-conserving.
Author: Joe Jerista, Yun Pang
download pdf
Title: Hidden Surface Removal
Advisor: William Ames
Summary: We essentially created several algorithms which are able to reduce the number of calculations required to render a scene in a three-dimensional environment. The core of these algorithms is the ability to "see" what the user can view through the window of the computer screen into the world, perform the calculations in only what the user can see, draw it to screen, and ignore the remainder of the environment.
Author: Canh N. Cao  
download pdf
Title: Computer Generated Holography
Advisor: William Ames
Summary: In the computer science field, a computer generated holographic image is computed by numerically simulating the physical phenomena of light diffraction and interference. It is possible for a computer software to calculate the phase of light of an object. In my thesis, I implemented a computer program that is able to generate holograms by computing the phase of light of different objects such as points, lines, and wire frames.
Authors: Brad Alan and Andrew Gregory  
view html
Title: Implementing Beta Unification
Advisor: Robert Muller
Summary: Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, if possible. Kfoury and Wells developed an algorithm for computing principal typings for finite-rank intersection types. The algorithm depends on a new notion of unification, what is called beta-unification. We develop the first implementation of the beta-unification algorithm.