Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Electronic Theses and Dissertations

Discipline
Institution
Keyword
Publication Year

Articles 451 - 480 of 567

Full-Text Articles in Computer Sciences

Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms, Greg Tener Jan 2009

Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms, Greg Tener

Electronic Theses and Dissertations

The graph isomorphism problem has received a great deal of attention on both theoretical and practical fronts. However, a polynomial algorithm for the problem has yet to be found. Even so, the best of the existing algorithms perform well in practice; so well that it is challenging to find hard instances for them. The most efficient algorithms, for determining if a pair of graphs are isomorphic, are based on the individualization-refinement paradigm, pioneered by Brendan McKay in 1981 with his algorithm nauty. Nauty and various improved descendants of nauty, such as bliss and saucy, solve the graph isomorphism problem by …


Concept Learning By Example Decomposition, Sameer Joshi Jan 2009

Concept Learning By Example Decomposition, Sameer Joshi

Electronic Theses and Dissertations

For efficient understanding and prediction in natural systems, even in artificially closed ones, we usually need to consider a number of factors that may combine in simple or complex ways. Additionally, many modern scientific disciplines face increasingly large datasets from which to extract knowledge (for example, genomics). Thus to learn all but the most trivial regularities in the natural world, we rely on different ways of simplifying the learning problem. One simplifying technique that is highly pervasive in nature is to break down a large learning problem into smaller ones; to learn the smaller, more manageable problems; and then to …


Visual Inspection Of Railroad Tracks, Pavel Babenko Jan 2009

Visual Inspection Of Railroad Tracks, Pavel Babenko

Electronic Theses and Dissertations

In this dissertation, we have developed computer vision methods for measurement of rail gauge, and reliable identification and localization of structural defects in railroad tracks. The rail gauge is the distance between the innermost sides of the two parallel steel rails. We have developed two methods for evaluation of rail gauge. These methods were designed for different hardware setups: the first method works with two pairs of unaligned video cameras while the second method works with depth maps generated by paired laser range scanners. We have also developed a method for detection of rail defects such as damaged or missed …


Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks, Xingbo Gao Jan 2009

Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks, Xingbo Gao

Electronic Theses and Dissertations

Optical networking, employing wavelength division multiplexing (WDM), is seen as the technology of the future for the Internet. This dissertation investigates several important problems affecting optical circuit switching (OCS) and optical burst switching (OBS) networks. Novel algorithms and new approaches to improve the performance of these networks through effective routing and channel scheduling are presented. Extensive simulations and analytical modeling have both been used to evaluate the effectiveness of the proposed algorithms in achieving lower blocking probability, better fairness as well as faster switching. The simulation tests were performed over a variety of optical network topologies including the ring and …


Modeling Scenes And Human Activities In Videos, Arslan Basharat Jan 2009

Modeling Scenes And Human Activities In Videos, Arslan Basharat

Electronic Theses and Dissertations

In this dissertation, we address the problem of understanding human activities in videos by developing a two-pronged approach: coarse level modeling of scene activities and fine level modeling of individual activities. At the coarse level, where the resolution of the video is low, we rely on person tracks. At the fine level, richer features are available to identify different parts of the human body, therefore we rely on the body joint tracks. There are three main goals of this dissertation: (1) identify unusual activities at the coarse level, (2) recognize different activities at the fine level, and (3) predict the …


Geometric Invariance In The Analysis Of Human Motion In Video Data, Yuping Shen Jan 2009

Geometric Invariance In The Analysis Of Human Motion In Video Data, Yuping Shen

Electronic Theses and Dissertations

Human motion analysis is one of the major problems in computer vision research. It deals with the study of the motion of human body in video data from different aspects, ranging from the tracking of body parts and reconstruction of 3D human body configuration, to higher level of interpretation of human action and activities in image sequences. When human motion is observed through video camera, it is perspectively distorted and may appear totally different from different viewpoints. Therefore it is highly challenging to establish correct relationships between human motions across video sequences with different camera settings. In this work, we …


Vectorpad: A Tool For Visualizing Vector Operations, Jared Bott Jan 2009

Vectorpad: A Tool For Visualizing Vector Operations, Jared Bott

Electronic Theses and Dissertations

Visualization of three-dimensional vector operations can be very helpful in understanding vector mathematics. However, creating these visualizations using traditional WIMP interfaces can be a troublesome exercise. In this thesis, we present VectorPad, a pen-based application for three-dimensional vector mathematics visualization. VectorPad allows users to define vectors and perform mathematical operations upon them through the recognition of handwritten mathematics. The VectorPad user interface consists of a sketching area, where the user can write vector definitions and other mathematics, and a 3D graph for visualization. After recognition, vectors are visualized dynamically on the graph, which can be manipulated by the user. A …


Efficient Techniques For Relevance Feedback Processing In Content-Based Image Retrieval, Danzhou Liu Jan 2009

Efficient Techniques For Relevance Feedback Processing In Content-Based Image Retrieval, Danzhou Liu

Electronic Theses and Dissertations

In content-based image retrieval (CBIR) systems, there are two general types of search: target search and category search. Unlike queries in traditional database systems, users in most cases cannot specify an ideal query to retrieve the desired results for either target search or category search in multimedia database systems, and have to rely on iterative feedback to refine their query. Efficient evaluation of such iterative queries can be a challenge, especially when the multimedia database contains a large number of entries, and the search needs many iterations, and when the underlying distance measure is computationally expensive. The overall processing costs, …


Learning Semantic Features For Visual Recognition, Jingen Liu Jan 2009

Learning Semantic Features For Visual Recognition, Jingen Liu

Electronic Theses and Dissertations

Visual recognition (e.g., object, scene and action recognition) is an active area of research in computer vision due to its increasing number of real-world applications such as video (image) indexing and search, intelligent surveillance, human-machine interaction, robot navigation, etc. Effective modeling of the objects, scenes and actions is critical for visual recognition. Recently, bag of visual words (BoVW) representation, in which the image patches or video cuboids are quantized into visual words (i.e., mid-level features) based on their appearance similarity using clustering, has been widely and successfully explored. The advantages of this representation are: no explicit detection of objects or …


Realnav: Exploring Natural User Interfaces For Locomotion In Video Games, Brian Williamson Jan 2009

Realnav: Exploring Natural User Interfaces For Locomotion In Video Games, Brian Williamson

Electronic Theses and Dissertations

We present an exploration into realistic locomotion interfaces in video games using spatially convenient input hardware. In particular, we use Nintendo Wii Remotes to create natural mappings between user actions and their representation in a video game. Targeting American Football video games, we used the role of the quarterback as an exemplar since the game player needs to maneuver effectively in a small area, run down the field, and perform evasive gestures such as spinning, jumping, or the "juke". In our study, we developed three locomotion techniques. The first technique used a single Wii Remote, placed anywhere on the user's …


New Computational Approaches For Multiple Rna Alignment And Rna Search, Daniel Deblasio Jan 2009

New Computational Approaches For Multiple Rna Alignment And Rna Search, Daniel Deblasio

Electronic Theses and Dissertations

In this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in O(n2) time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence structure the problem becomes even harder. Multiple RNA structure alignment is particularly challenging because covarying mutations make sequence …


Detecting Curved Objects Against Cluttered Backgrounds, Jan Prokaj Jan 2008

Detecting Curved Objects Against Cluttered Backgrounds, Jan Prokaj

Electronic Theses and Dissertations

Detecting curved objects against cluttered backgrounds is a hard problem in computer vision. We present new low-level and mid-level features to function in these environments. The low-level features are fast to compute, because they employ an integral image approach, which makes them especially useful in real-time applications. The mid-level features are built from low-level features, and are optimized for curved object detection. The usefulness of these features is tested by designing an object detection algorithm using these features. Object detection is accomplished by transforming the mid-level features into weak classifiers, which then produce a strong classifier using AdaBoost. The resulting …


Multi-View Approaches To Tracking, 3d Reconstruction And Object Class Detection, Saad Khan Jan 2008

Multi-View Approaches To Tracking, 3d Reconstruction And Object Class Detection, Saad Khan

Electronic Theses and Dissertations

Multi-camera systems are becoming ubiquitous and have found application in a variety of domains including surveillance, immersive visualization, sports entertainment and movie special effects amongst others. From a computer vision perspective, the challenging task is how to most efficiently fuse information from multiple views in the absence of detailed calibration information and a minimum of human intervention. This thesis presents a new approach to fuse foreground likelihood information from multiple views onto a reference view without explicit processing in 3D space, thereby circumventing the need for complete calibration. Our approach uses a homographic occupancy constraint (HOC), which states that if …


Improving Branch Prediction Accuracy Via Effective Source Information And Prediction Algorithms, Hongliang Gao Jan 2008

Improving Branch Prediction Accuracy Via Effective Source Information And Prediction Algorithms, Hongliang Gao

Electronic Theses and Dissertations

Modern superscalar processors rely on branch predictors to sustain a high instruction fetch throughput. Given the trend of deep pipelines and large instruction windows, a branch misprediction will incur a large performance penalty and result in a significant amount of energy wasted by the instructions along wrong paths. With their critical role in high performance processors, there has been extensive research on branch predictors to improve the prediction accuracy. Conceptually a dynamic branch prediction scheme includes three major components: a source, an information processor, and a predictor. Traditional works mainly focus on the algorithm for the predictor. In this dissertation, …


A Framework For Efficient Data Distribution In Peer-To-Peer Networks., Darshan Purandare Jan 2008

A Framework For Efficient Data Distribution In Peer-To-Peer Networks., Darshan Purandare

Electronic Theses and Dissertations

Peer to Peer (P2P) models are based on user altruism, wherein a user shares its content with other users in the pool and it also has an interest in the content of the other nodes. Most P2P systems in their current form are not fair in terms of the content served by a peer and the service obtained from swarm. Most systems suffer from free rider's problem where many high uplink capacity peers contribute much more than they should while many others get a free ride for downloading the content. This leaves high capacity nodes with very little or no …


Real-Time Realistic Rendering Of Nature Scenes With Dynamic Lighting, Kevin Boulanger Jan 2008

Real-Time Realistic Rendering Of Nature Scenes With Dynamic Lighting, Kevin Boulanger

Electronic Theses and Dissertations

Rendering of natural scenes has interested the scientific community for a long time due to its numerous applications. The targeted goal is to create images that are similar to what a viewer can see in real life with his/her eyes. The main obstacle is complexity: nature scenes from real life contain a huge number of small details that are hard to model, take a lot of time to render and require a huge amount of memory unavailable in current computers. This complexity mainly comes from geometry and lighting. The goal of our research is to overcome this complexity and to …


Taming Crowded Visual Scenes, Saad Ali Jan 2008

Taming Crowded Visual Scenes, Saad Ali

Electronic Theses and Dissertations

Computer vision algorithms have played a pivotal role in commercial video surveillance systems for a number of years. However, a common weakness among these systems is their inability to handle crowded scenes. In this thesis, we have developed algorithms that overcome some of the challenges encountered in videos of crowded environments such as sporting events, religious festivals, parades, concerts, train stations, airports, and malls. We adopt a top-down approach by first performing a global-level analysis that locates dynamically distinct crowd regions within the video. This knowledge is then employed in the detection of abnormal behaviors and tracking of individual targets …


Automated Regression Testing Approach To Expansion And Refinement Of Speech Recognition Grammars, Raul Dookhoo Jan 2008

Automated Regression Testing Approach To Expansion And Refinement Of Speech Recognition Grammars, Raul Dookhoo

Electronic Theses and Dissertations

This thesis describes an approach to automated regression testing for speech recognition grammars. A prototype Audio Regression Tester called ART has been developed using Microsoft's Speech API and C#. ART allows a user to perform any of three tasks: automatically generate a new XML-based grammar file from standardized SQL database entries, record and cross-reference audio files for use by an underlying speech recognition engine, and perform regression tests with the aid of an oracle grammar. ART takes as input a wave sound file containing speech and a newly created XML grammar file. It then simultaneously executes two tests: one with …


Alayzing The Effects Of Modularity On Search Spaces, Ozlem Garibay Jan 2008

Alayzing The Effects Of Modularity On Search Spaces, Ozlem Garibay

Electronic Theses and Dissertations

We are continuously challenged by ever increasing problem complexity and the need to develop algorithms that can solve complex problems and solve them within a reasonable amount of time. Modularity is thought to reduce problem complexity by decomposing large problems into smaller and less complex subproblems. In practice, introducing modularity into evolutionary algorithm representations appears to improve search performance; however, how and why modularity improves performance is not well understood. In this thesis, we seek to better understand the effects of modularity on search. In particular, what are the effects of module creation on the search space structure and how …


Vcluster: A Portable Virtual Computing Library For Cluster Computing, Hua Zhang Jan 2008

Vcluster: A Portable Virtual Computing Library For Cluster Computing, Hua Zhang

Electronic Theses and Dissertations

Message passing has been the dominant parallel programming model in cluster computing, and libraries like Message Passing Interface (MPI) and Portable Virtual Machine (PVM) have proven their novelty and efficiency through numerous applications in diverse areas. However, as clusters of Symmetric Multi-Processor (SMP) and heterogeneous machines become popular, conventional message passing models must be adapted accordingly to support this new kind of clusters efficiently. In addition, Java programming language, with its features like object oriented architecture, platform independent bytecode, and native support for multithreading, makes it an alternative language for cluster computing. This research presents a new parallel programming model …


Semantic Video Retrieval Using High Level Context, Yusuf Aytar Jan 2008

Semantic Video Retrieval Using High Level Context, Yusuf Aytar

Electronic Theses and Dissertations

Video retrieval - searching and retrieving videos relevant to a user defined query - is one of the most popular topics in both real life applications and multimedia research. This thesis employs concepts from Natural Language Understanding in solving the video retrieval problem. Our main contribution is the utilization of the semantic word similarity measures for video retrieval through the trained concept detectors, and the visual co-occurrence relations between such concepts. We propose two methods for content-based retrieval of videos: (1) A method for retrieving a new concept (a concept which is not known to the system and no annotation …


Appearance-Driven Material Design, Mark Colbert Jan 2008

Appearance-Driven Material Design, Mark Colbert

Electronic Theses and Dissertations

In the computer graphics production environment, artists often must tweak specific lighting and material parameters to match a mind's eye vision of the appearance of a 3D scene. However, the interaction between a material and a lighting environment is often too complex to cognitively predict without visualization. Therefore, artists operate in a design cycle, where they tweak the parameters, wait for a visualization, and repeat, seeking to obtain a desired look. We propose the use of appearance-driven material design. Here, artists directly design the appearance of reflected light for a specific view, surface point, and time. In this thesis, we …


Phase-Shifting Haar Wavelets For Image-Based Rendering Applications, Mais Alnasser Jan 2008

Phase-Shifting Haar Wavelets For Image-Based Rendering Applications, Mais Alnasser

Electronic Theses and Dissertations

In this thesis, we establish the underlying research background necessary for tackling the problem of phase-shifting in the wavelet transform domain. Solving this problem is the key to reducing the redundancy and huge storage requirement in Image-Based Rendering (IBR) applications, which utilize wavelets. Image-based methods for rendering of dynamic glossy objects do not truly scale to all possible frequencies and high sampling rates without trading storage, glossiness, or computational time, while varying both lighting and viewpoint. This is due to the fact that current approaches are limited to precomputed radiance transfer (PRT), which is prohibitively expensive in terms of memory …


A Computational Chemistry Study Of Spin Traps., Jacob Fosso-Tande Aug 2007

A Computational Chemistry Study Of Spin Traps., Jacob Fosso-Tande

Electronic Theses and Dissertations

Many defects in physiological processes are due to free radical damage: reactive oxygen species, nitric oxide, and hydroxyl radicals have been implicated in the parthenogenesis of cancer, diabetes mellitus, and rheumatoid arthritis. We herein characterize the phenyl-N-ter-butyl nitrone (PBN) type spin traps in conjunction with the most studied dimethyl-1-pyrroline-N-oxide (DMPO) type spin traps using the hydroxyl radical. In this study, theoretical calculations are carried out on the two main types of spin traps (DMPO and PBN) at the density functional theory level (DFT). The energies of the optimized structures, hyperfine calculations in gaseous and aqueous phases of the spin traps …


Learning Geometry-Free Face Re-Lighting, Thomas Brendan Moore Jan 2007

Learning Geometry-Free Face Re-Lighting, Thomas Brendan Moore

Electronic Theses and Dissertations

The accurate modeling of the variability of illumination in a class of images is a fundamental problem that occurs in many areas of computer vision and graphics. For instance, in computer vision there is the problem of facial recognition. Simply, one would hope to be able to identify a known face under any illumination. On the other hand, in graphics one could imagine a system that, given an image, the illumination model could be identified and then used to create new images. In this thesis we describe a method for learning the illumination model for a class of images. Once …


Optimizing The High Dynamic Range Imaging Pipeline, Ahmet Oguz Akyuz Jan 2007

Optimizing The High Dynamic Range Imaging Pipeline, Ahmet Oguz Akyuz

Electronic Theses and Dissertations

High dynamic range (HDR) imaging is a rapidly growing field in computer graphics and image processing. It allows capture, storage, processing, and display of photographic information within a scene-referred framework. The HDR imaging pipeline consists of the major steps an HDR image is expected to go through from capture to display. It involves various techniques to create HDR images, pixel encodings and file formats for storage, tone mapping for display on conventional display devices and direct display on HDR capable screens. Each of these stages have important open problems, which need to be addressed for a smoother transition to an …


Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction, Feng Lu Jan 2007

Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction, Feng Lu

Electronic Theses and Dissertations

Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which …


Image-Space Approach To Real-Time Realistic Rendering, Musawir Shah Jan 2007

Image-Space Approach To Real-Time Realistic Rendering, Musawir Shah

Electronic Theses and Dissertations

One of the main goals of computer graphics is the fast synthesis of photorealistic image of virtual 3D scenes. The work presented in this thesis addresses this goal of speed and realism. In real-time realistic rendering, we encounter certain problems that are difficult to solve in the traditional 3-dimensional geometric space. We show that using an image-space approach can provide effective solutions to these problems. Unlike geometric space algorithms that operate on 3D primitives such as points, edges, and polygons, image-space algorithms operate on 2D snapshot images of the 3D geometric data. Operating in image-space effectively decouples the geometric complexity …


Behavior Of Variable-Length Genetic Algorithms Under Random Selection, Harold Stringer Jan 2007

Behavior Of Variable-Length Genetic Algorithms Under Random Selection, Harold Stringer

Electronic Theses and Dissertations

In this work, we show how a variable-length genetic algorithm naturally evolves populations whose mean chromosome length grows shorter over time. A reduction in chromosome length occurs when selection is absent from the GA. Specifically, we divide the mating space into five distinct areas and provide a probabilistic and empirical analysis of the ability of matings in each area to produce children whose size is shorter than the parent generation's average size. Diversity of size within a GA's population is shown to be a necessary condition for a reduction in mean chromosome length to take place. We show how a …


Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag Jan 2007

Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag

Electronic Theses and Dissertations

In recent years, the development of a large variety of mobile computing devices has led to wide scale deployment and use of wireless ad hoc and sensor networks. Wireless Sensor Networks consist of battery powered, tiny and cheap "motes", having sensing and wireless communication capabilities. Although wireless motes have limited battery power, communication and computation capabilities, the range of their application is vast. In the first part of the dissertation, we have addressed the specific application of Biomedical Sensor Networks. To solve the problem of data routing in these networks, we have proposed the Adaptive Least Temperature Routing (ALTR) algorithm …