Linear Stochastic Sampling(LSS) in Computer Graphics

Rao, Jun (2018) Linear Stochastic Sampling(LSS) in Computer Graphics. Masters thesis, Northern Arizona University.

Text Rao_J_2018_Linear_stochastic_sampling_computer_graphics.pdf - Published Version Restricted to Repository staff only Download (3MB) | Request a copy

Abstract

This thesis presents a new technique to randomly sample from the large datasets in linear order. Existing stochastic sampling methods work well but are limited to the small datasets. If existing stochastic sampling methods are implemented for large datasets, thrashing results, wherein the Operating System will spend most of its time swapping the pages of memory rather than executing instructions. We make two contributions to our research. First, we derive explicit formulas that minimize the stochastic sampling time and generate a higher quality of the output images at the same time. Second, we analyze the new algorithm in the context of visual quality, memory usage, and performance. The results of our analysis show that this technique is competitive with other stochastic sampling methods while avoiding thrashing and using computer memory more efficiently. Key Words: stochastic, sampling, linear algorithm, thrashing, efficiency

Item Type:	Thesis (Masters)
Publisher’s Statement:	© Copyright is held by the author. Digital access to this material is made possible by the Cline Library, Northern Arizona University. Further transmission, reproduction or presentation of protected items is prohibited except with permission of the author.
Subjects:	T Technology > TA Engineering (General). Civil engineering (General)
NAU Depositing Author Academic Status:	Student
Department/Unit:	Graduate College > Theses and Dissertations College of Engineering, Informatics, and Applied Sciences > Civil Engineering, Construction Management and Environmental Engineering
Date Deposited:	04 Jun 2021 17:37
URI:	http://openknowledge.nau.edu/id/eprint/5474

Actions (login required)

IR Staff Record View

Downloads