Computer Sciences Commons^™

Correspondence Expansion For Wide Baseline Stereo, Parris K. Egbert, Kevin L. Steele

Faculty Publications

We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, which rely on many correct matches to reduce error in the derived geometric structure. Given a small initial correspondence set we iteratively expand the set with nearby points exhibiting strong affine correlation, and then we constrain the set to an epipolar geometry using RANSAC. A key point to our algorithm is to allow a high error tolerance in the constraint, allowing the correspondence set to expand into many areas of an image before applying a lower …

Active Contours Using A Constraint-Based Implicit Representation, Weiming Liu, Bryan S. Morse, Kalpathi Subramanian, Terry S. Yoo

Faculty Publications

We present a new constraint-based implicit active contour, which shares desirable properties of both parametric and implicit active contours. Like parametric approaches, their representation is compact and can be manipulated interactively. Like other implicit approaches, they can naturally adapt to non-simple topologies. Unlike implicit approaches using level-set methods, representation of the contour does not require a dense mesh. Instead, it is based on specified on-curve and off-curve constraints, which are interpolated using radial basis functions. These constraints are evolved according to specified forces drawn from the relevant literature of both parametric and implicit approaches. This new type of active contour …

Improving And Extending Behavioral Animation Through Machine Learning, Jonathan J. Dinerstein

Theses and Dissertations

Behavioral animation has become popular for creating virtual characters that are autonomous agents and thus self-animating. This is useful for lessening the workload of human animators, populating virtual environments with interactive agents, etc. Unfortunately, current behavioral animation techniques suffer from three key problems: (1) deliberative behavioral models (i.e., cognitive models) are slow to execute; (2) interactive virtual characters cannot adapt online due to interaction with a human user; (3) programming of behavioral models is a difficult and time-intensive process. This dissertation presents a collection of papers that seek to overcome each of these problems. Specifically, these issues are alleviated …

Interactive Image Filling-In, Teryl Lynne Arnold

Theses and Dissertations

Removing unwanted scratches or objects from an image in an undetectable manner is a technique that has been researched for its many useful and varied applications, such as removing scratches, defects, super-imposed text, or even entire objects from a scene. Currently there is a wide variety of algorithms that fill in unwanted regions, none of which incorporate user preferences into the structure completion process. By building a framework to incorporate user preferences into the filling-in process, user input can be utilized to more effectively fill in damaged regions in an image. User input can influence the filling-in process in a …

T-Spline Merging, Heather Ipson

Theses and Dissertations

Geometric models, such as for use in CAD/CAM or animation, are often constructed in a piece-wise fashion. Historically, these models have been made of NURBS surfaces. For various reasons it is problematic and often times mathematically impossible to combine several NURBS models into one continuous surface. The recent invention of a surface type called T-splines has made the combining of NURBS surfaces into a single continuous surface possible, but much of the mathematics has yet to be explored. This thesis explores the mathematics and algorithms necessary to merge multiple NURBS, T-spline, or T-NURCC surfaces into a single continuous surface. This …

January: Search Based On Social Insect Behavior, Peter C. Lamborn

Theses and Dissertations

January is a group of interacting stateless model checkers. Each agent functions on a processor located on a super computer or a network of workstations (NOW). The agent's search pattern is a semi-random walk based on the behavior of the grey field slug (Agriolimax reticulatus), the house fly (Musca domestica), and the black ant (Lassius niger). The agents communicate to lessen the amount of duplicate work being done. Every algorithm has a memory threshold above which they search efficiently. This threshold varies not only by model but also by algorithm. Janaury's threshold is lower than the thresholds of other algorithms …

Improving Routing Security Using A Decentralized Public Key Distribution Algorithm, Jeremy C. Goold

Theses and Dissertations

Today's society has developed a reliance on networking infrastructures. Health, financial, and many other institutions deploy mission critical and even life critical applications on local networks and the global Internet. The security of this infrastructure has been called into question over the last decade. In particular, the protocols directing traffic through the network have been found to be vulnerable. One such protocol is the Open Shortest Path First (OSPF) protocol. This thesis proposes a security extension to OSPF containing a decentralized certificate authentication scheme (DecentCA) that eliminates the single point of failure/attack present in current OSPF security extensions. An analysis …

Prioritized Multiplicative Schwarz Procedures For Solving Linear Systems, Nathaniel Powell, Kevin Seppi, Quinn O. Snell, David Wingate

Faculty Publications

We describe a new algorithm designed to quickly and robustly solve general linear problems of the form Ax = b. We describe both serial and parallel versions of the algorithm, which can be considered a prioritized version of an Alternating Multiplicative Schwarz procedure. We also adopt a general view of alternating Multiplicative Schwarz procedures which motivates their use on arbitrary problems (even which may not have arisen from problems that are naturally decomposable) by demonstrating that, even in a serial context, algorithms should use many, many partitions to accelerate convergence; having such an over-partitioned system also allows easy parallelization of …

A Statistical Performance Model Of Homogeneous Raidb Clusters, Brandon Lamar Rogers

Theses and Dissertations

The continual growth of the Internet and e-commerce is driving demand for speed, reliability and processing power. With the rapid development and maturation of e-commerce, the need for a quick access to large amounts of information is steadily rising. Traditionally, database systems have been used for information storage and retrieval. However, with online auctions, rapid Internet searches, and data archival, the need for more powerful database systems is also growing. One type of distributed database is called Redundant Arrays of Inexpensive Databases (RAIDb). RAIDb clusters are middleware-driven to promote interoperability and portability. RAIDb clusters allow for multiple levels of data …

Thor: The Hybrid Online Repository, Timothy W. Van Der Horst

Theses and Dissertations

Digital credentials enable users to perform secure interactions by proving either their identity or that they posses certain attributes. Special care is taken to protect these credentials and their associated private keys during transaction time. However, protection of these items outside of the transaction is often delegated to a secure credential repository. A mobile environment creates significant challenges for secure repositories. We examine these challenges with respect to existing repository practices and produce a set of requirements that a repository must meet in order to cope with the harshness of a mobile environment. We also present the design and implementation …

Fast And Robust Incremental Action Prediction For Interactive Agents, Jonathan Dinerstein, Parris K. Egbert, Dan A. Ventura

Faculty Publications

The ability for a given agent to adapt on-line to better interact with another agent is a difficult and important problem. This problem becomes even more difficult when the agent to interact with is a human, since humans learn quickly and behave non-deterministically. In this paper we present a novel method whereby an agent can incrementally learn to predict the actions of another agent (even a human), and thereby can learn to better interact with that agent. We take a case-based approach, where the behavior of the other agent is learned in the form of state-action pairs. We generalize these …

A Framework For Extraction Plans And Heuristics In An Ontology-Based Data-Extraction System, Alan E. Wessman

Theses and Dissertations

Extraction of information from semi-structured or unstructured documents, such as Web pages, is a useful yet complex task. Research has demonstrated that ontologies may be used to achieve a high degree of accuracy in data extraction while maintaining resiliency in the face of document changes. Ontologies do not, however, diminish the complexity of a data-extraction system. As research in the field progresses, the need for a modular data-extraction system that de-couples the various functional processes involved continues to grow.

In this thesis we propose a framework for such a system. The nature of the framework allows new algorithms and ideas …

Java Performance Of The Rijndael Encryption Algorithm Across Compilers And Virtual Machines, Gregory Leavitt Orgill

Theses and Dissertations

The Rijndael encryption algorithm has recently been published as the Advanced Encryption Standard (AES), a Federal Information Processing Standard, and is being accepted by developers and designers as the algorithm of choice where encryption is required. Java is becoming the language of choice for E-Business applications, many of which require cryptography. The performance of any Java application is dependent on the compiler and virtual machine used to compile and interpret. Prior research has provided performance information for the Rijndael algorithm in Java for specific virtual machines. This research includes the development of a Rijndael implementation in Java. Using Java system …

Computer-Simulation-Assisted Lean Manufacturing Training, Luoding Wang

Theses and Dissertations

This thesis assesses the potential of using computer simulation to aid existing lean manufacturing training methods such as lecture and live simulation. An investigation of this possibility was carried out in conjunction with UMEP's Lean 101 class. In the study, two experimental computer simulation models demonstrating the push and pull production scenarios were constructed using ProModel software. Simulation models were equipped with a Visual Basic interface to aid trainees to manipulate the model via ActiveX. Constructed computer simulation was compared with live simulation to answer these research questions: 1. Was computer simulation able to teach additional lean concepts not covered …

Prioritization Methods For Accelerating Mdp Solvers, Kevin Seppi, David Wingate

Faculty Publications

The performance of value and policy iteration can be dramatically improved by eliminating redundant or useless backups, and by backing up states in the right order. We study several methods designed to accelerate these iterative solvers, including prioritization, partitioning, and variable reordering. We generate a family of algorithms by combining several of the methods discussed, and present extensive empirical evidence demonstrating that performance can improve by several orders of magnitude for many problems, while preserving accuracy and convergence guarantees.

Autonomous Vehicle Technologies For Small Fixed-Wing Uavs, Randal Beard, Derek Kingston, Morgan Quigley, Deryl Snyder, Reed Christiansen, Walt Johnson, Timothy Mclain, Michael A. Goodrich

Faculty Publications

The objective of this paper is to describe the design and implementation of a small semi-autonomous fixed-wing unmanned air vehicle. In particular we describe the hardware and software architectures used in the design. We also describe a low weight, low cost autopilot developed at Brigham Young University and the algorithms associated with the autopilot. Novel PDA and voice interfaces to the UAV are described. In addition, we overview our approach to real-time path planning, trajectory generation, and trajectory tracking. The paper is augmented with movie files that demonstrate the functionality of the UAV and its control software.

A Bayesian Technique For Task Localization In Multiple Goal Markov Decision Processes, James Carroll, Kevin Seppi

Faculty Publications

In a reinforcement learning task library system for Multiple Goal Markov Decision Process (MGMDP), localization in the task space allows the agent to determine whether a given task is already in its library in order to exploit previously learned experience. Task localization in MGMDPs can be accomplished through a Bayesian approach, however a trivial approach fails when the rewards are not distributed normally. This can be overcome through our Bayesian Task Localization Technique (BTLT).

Variable Resolution Discretization In The Joint Space, Christopher K. Monson, Kevin Seppi, David Wingate, Todd S. Peterson

Faculty Publications

We present JoSTLe, an algorithm that performs value iteration on control problems with continuous actions, allowing this useful reinforcement learning technique to be applied to problems where a priori action discretization is inadequate. The algorithm is an extension of a variable resolution technique that works for problems with continuous states and discrete actions. Results are given that indicate that JoSTLe is a promising step toward reinforcement learning in a fully continuous domain.

Automating The Extraction Of Domain-Specific Information From The Web-A Case Study For The Genealogical Domain, Troy L. Walker

Theses and Dissertations

Current ways of finding genealogical information within the millions of pages on the Web are inadequate. In an effort to help genealogical researchers find desired information more quickly, we have developed GeneTIQS, a Genealogy Target-based Information Query System. GeneTIQS builds on ontology-based methods of data extraction to allow database-style queries on the Web. This thesis makes two main contributions to GeneTIQS. (1) It builds a framework to do generic ontology-based data extraction. (2) It develops a hybrid record separator based on Vector Space Modeling that uses both formatting clues and data clues to split pages into component records. The record …

Target-Dominant Chinese-English Machine Translation, Dan Su

Theses and Dissertations

Information exchange is increasing rapidly with the advent of globalization. As the language spoken by the most people in today's world, Chinese will play an important role in information exchange in the future. Therefore, we need an efficient and practical means to access the increasingly large volume of Chinese data. This thesis describes a target-dominant Chinese-English machine translation system, which can translate a given Chinese news sentence into English. We conjecture that we can improve the state of the art of MT using a TDMT approach. This system has participated in the NIST (National Institute of Standards and Technology) 2004 …

Does The Halting Necessary For Hardware Trace Collection Inordinately Perturb The Results?, Myles G. Watson

Theses and Dissertations

Processor address traces are invaluable for characterizing workloads and testing proposed memory hierarchies. Long traces are needed to exercise modern cache designs and produce meaningful results, but are difficult to collect with hardware monitors because microprocessors access memory too frequently for disks or other large storage to keep up. The small, fast buffers of the monitors fill quickly; in order to obtain long contiguous traces, the processor must be stopped while the buffer is emptied. This halting may perturb the traces collected, but this cannot be measured directly, since long uninterrupted traces cannot be collected. We make the case that …

Real-Time Image Enhancement Using Texture Synthesis, Matthew J. Sorensen

Theses and Dissertations

This thesis presents an approach to real-time image enhancement using texture synthesis. Traditional image enhancement techniques are typically time consuming, lack realistic detail, or do not scale well for large magnification factors.

Real-time Enhancement using Texture Synthesis (RETS) combines interpolation, classification, and patch-based texture synthesis to enhance low-resolution imagery, particularly aerial imagery. RETS uses as input a low-resolution source image and several high-resolution sample textures. The output of RETS is a high-resolution image with the structure of the source image, but with detail consistent with the high-resolution sample textures. We show that RETS can enhance large amounts of imagery in …

Improved Signal Integrity In Ieee 1149.1 Boundary Scan Designs, Efren De Jesus Rangel Taboada

Theses and Dissertations

This work is an analysis of solutions to problems derived from inherent timing and signal integrity issues in the use and application of the IEEE 1149.1 Standard at the board level in conjunction with its test system. Setup or hold times violations may occur in a boundary scan chain using IEEE 1149.1 compliant devices. A practical study of the TDI-TDO scan data path has been conducted to show where problems may arise in relationship to a particular board topology and test system. This work points to differences between passing and failing scan path tests for problem characterization. Serial data flow …

Disk Based Model Checking, Tonglaga Bao

Theses and Dissertations

Disk based model checking does not receive much attention in the model checking field becasue of its costly time overhead. In this thesis, we present a new disk based algorithm that can get close to or faster verification speed than a RAM based algorithm that has enough memory to complete its verification. This algorithm also outperforms Stern and Dill's original disk based algorithm. The algorithm partitions the state space to several files, and swaps files into and out of memory during verification. Compared with the RAM only algorithm, the new algoritm reduces hash table insertion time by reducing the cost …

Vision-Based Human Directed Robot Guidance, Richard B. Arthur

Theses and Dissertations

This paper describes methods to track a user-defined point in the vision of a robot as it drives forward. This tracking allows a robot to keep itself directed at that point while driving so that it can get to that user-defined point. I develop and present two new multi-scale algorithms for tracking arbitrary points between two frames of video, as well as through a video sequence. The multi-scale algorithms do not use the traditional pyramid image, but instead use a data structure called an integral image (also known as a summed area table). The first algorithm uses edge-detection to track …

Network-Layer Selective Security, Casey T. Deccio

Theses and Dissertations

The Internet and other large computer networks have become an integral part of numerous daily processes. Security at the network layer is necessary to maintain infrastructure survivability in the case of cyber attacks aimed at routing protocols. In order to minimize undesired overhead associated with added security at this level, the notion of selective security is proposed. This thesis identifies elements in network topologies that are most important to the survivability of the network. The results show that the strategic placement of network security at critical elements will improve overall network survivability without the necessity of universal deployment.

Jumpstarting Phylogenetic Analysis, Mark J. Clement, Keith A. Crandall, Kevin Seppi, Quinn O. Snell

Faculty Publications

When a new epidemic strikes, it is often important to determine the relationship between the current organism and others that have been successfully treated previously. The phylogenetic analysis problem generates the most likely family tree for a group of organisms based on DNA sequence data. This process can take a prohibitively long period of time with current algorithms. If trees resulting from prior searches are used to seed the search, correct trees can be found much more quickly. This jumpstarting algorithm can generate superior phylogenetic solutions much more quickly than existing algorithms.

An Ecological Display For Robot Teleoperation, Robert W. Ricks

Theses and Dissertations

This thesis presents an interface for effectively teleoperating robots that combines an ecological display of range and video information with quickening based on dead-reckoning prediction. This display is built by viewing range and video information from a virtual camera trailing the robot. This is rendered in 3-D by using standard hardware acceleration and 3-D graphics software. Our studies demonstrate that this interface improves performance for most people, including those that do not have much previous experience with robotics. These studies involved 32 test subjects in a simulated environment and 8 in the real world. Subjects were required to drive the …

A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin

Theses and Dissertations

Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. During an active session, the goal is to keep the device connected over the best transport currently available. To accomplish that, this thesis introduces a two-phase decision making protocol. In phase one, intra-device prioritization, users indicate the relative importance of criteria such as speed, power, service charge, or signal …

T-Spline Simplification And Local Refinement, David L. Cardon, G. Thomas Finnigan, Nicholas S. North, Thomas W. Sederberg, Jianmin Zheng, Tom Lyche

Faculty Publications

A typical NURBS surface model has a large percentage of superfluous control points that significantly interfere with the design process. This paper presents an algorithm for eliminating such superfluous control points, producing a T-spline. The algorithm can remove substantially more control points than competing methods such as B-spline wavelet decomposition. The paper also presents a new T-spline local refinement algorithm and answers two fundamental open questions on T-spline theory.