You are here
Fuzzycuda
- Date Issued:
- 2008
- Summary:
- Natural matte extraction is a difficult and generally unsolved problem. Generating a matte from a nonuniform background traditionally requires a tediously hand drawn matte. This thesis studies recent methods requiring the user to place only modest scribbles identifying the foreground and the background. This research demonstrates a new GPU-based implementation of the recently introduced Fuzzy- Matte algorithm. Interactive matte extraction was achieved on a CUDA enabled G80 graphics processor. Experimental results demonstrate improved performance over the previous CPU based version. In depth analysis of experimental data from the GPU and the CPU implementations are provided. The design challenges of porting a variant of Dijkstra's shortest distance algorithm to a parallel processor are considered.
Title: | Fuzzycuda: interactive matte extraction on a GPU. |
95 views
20 downloads |
---|---|---|
Name(s): |
Gibson, Joel College of Engineering and Computer Science Department of Computer and Electrical Engineering and Computer Science |
|
Type of Resource: | text | |
Genre: | Electronic Thesis Or Dissertation | |
Date Issued: | 2008 | |
Publisher: | Florida Atlantic University | |
Physical Form: | electronic | |
Extent: | x, 74 p. : ill. (some col.). | |
Language(s): | English | |
Summary: | Natural matte extraction is a difficult and generally unsolved problem. Generating a matte from a nonuniform background traditionally requires a tediously hand drawn matte. This thesis studies recent methods requiring the user to place only modest scribbles identifying the foreground and the background. This research demonstrates a new GPU-based implementation of the recently introduced Fuzzy- Matte algorithm. Interactive matte extraction was achieved on a CUDA enabled G80 graphics processor. Experimental results demonstrate improved performance over the previous CPU based version. In depth analysis of experimental data from the GPU and the CPU implementations are provided. The design challenges of porting a variant of Dijkstra's shortest distance algorithm to a parallel processor are considered. | |
Identifier: | 317620643 (oclc), 186288 (digitool), FADT186288 (IID), fau:2855 (fedora) | |
Note(s): |
by Joel Gibson. Thesis (M.S.C.S.)--Florida Atlantic University, 2008. Includes bibliography. Electronic reproduction. Boca Raton, Fla., 2008. Mode of access: World Wide Web. |
|
Subject(s): |
Computer graphics -- Scientific applications Information visualization High performance computing Real-time data processing |
|
Persistent Link to This Record: | http://purl.flvc.org/FAU/186288 | |
Use and Reproduction: | http://rightsstatements.org/vocab/InC/1.0/ | |
Host Institution: | FAU |