Artificial Intelligence and Robotics Commons^™

Hybrid Methods For Feature Selection, Iunniang Cheng

Masters Theses & Specialist Projects

Feature selection is one of the important data preprocessing steps in data mining. The feature selection problem involves finding a feature subset such that a classification model built only with this subset would have better predictive accuracy than model built with a complete set of features. In this study, we propose two hybrid methods for feature selection. The best features are selected through either the hybrid methods or existing feature selection methods. Next, the reduced dataset is used to build classification models using five classifiers. The classification accuracy was evaluated in terms of the area under the Receiver Operating Characteristic ...

An Architecture For Believable Socially Aware Agents, Arvand Dorgoly

University of Western Ontario - Electronic Thesis and Dissertation Repository

The main focus of this thesis is to solve the believability problem in video game agents by integrating necessary psychological and sociological foundations by means of role based architecture. Our design agent also has the capability to reason and predict the decisions of other actors by using its own mental model. The agent has a separate mental model for every actor.

Practical Tractability Of Csps By Higher Level Consistency And Tree Decomposition, Shant Karakashian

Computer Science and Engineering: Theses, Dissertations, and Student Research

Constraint Satisfaction is a flexible paradigm for modeling many decision problems in Engineering, Computer Science, and Management. Constraint Satisfaction Problems (CSPs) are in general NP-complete and are usually solved with search. Research has identified various islands of tractability, which enable solving certain CSPs with backtrack-free search. For example, one sufficient condition for tractability relates the consistency level of a CSP to treewidth of the CSP's constraint network. However, enforcing higher levels of consistency on a CSP may require the addition of constraints, thus altering the topology of the constraint network and increasing its treewidth. This thesis addresses the following ...

Brain Function Differences In Language Processing In Children And Adults With Autism, Diane L. Williams, Vladimir L. Cherkassky, Robert A. Mason, Timothy A. Keller, Nancy J. Minshew, Marcel Adam Just

Marcel Adam Just

No abstract provided.

Csc Senior Project: Nlpstats, Michael Mease

Computer Science

Natural Language Processing has recently increased in popularity. The field of authorship analysis, specifically, uses various characteristics of text quantified by markers. NLPStats serves as a tool designed to streamline marker extraction based on user needs. A flexible query system allows for custom marker requests, adjustment of result formatting, and preprocessing options. Furthermore, an efficiently designed structure ensures that users retrieve information quickly. As a whole, NLPStats enables anyone, regardless of NLP experience, to extract important information about the text of a document.

Lifelong Robotic Object Perception, Alvaro Collet Romea

Dissertations

In this thesis, we study the topic of Lifelong Robotic Object Perception. We propose, as a long-term goal, a framework to recognize known objects and to discover unknown objects in the environment as the robot operates, for as long as the robot operates. We build the foundations for Lifelong Robotic Object Perception by focusing our study on the two critical components of this framework: 1) how to recognize and register known objects for robotic manipulation, and 2) how to automatically discover novel objects in the environment so that we can recognize them in the future.

Our work on Object Recognition ...

Vision-Based Control Of A Handheld Micromanipulator For Robot-Assisted Retinal Surgery, Brian C. Becker

Dissertations

Surgeons increasingly need to perform complex operations on extremely small anatomy. Many existing and promising new surgeries are effective, but difficult or impossible to perform because humans lack the extraordinary control required at sub-millimeter scales. Using micromanipulators, surgeons gain higher positioning accuracy and additional dexterity as the instrument removes tremor and scales hand motions. While these aids are advantageous, they do not actively consider the goals or intentions of the operator and thus cannot provide context-specific behaviors, such as motion scaling around anatomical targets, prevention of unwanted contact with pre-defined tissue areas, compensation for moving anatomy, and other helpful task-dependent ...

Google And The World Brain, Dereck Daschke

Journal of Religion & Film

This is a film review of Google and the World Brain (2013) directed by Ben Lewis.

Math, Minds, Machines, Christopher V. Carlile

University of Tennessee Honors Thesis Projects

No abstract provided.

Automatic Classification Of Epilepsy Lesions, Junwei Sun

Electronic Thesis and Dissertation Repository

Epilepsy is a common and diverse set of chronic neurological disorders characterized by seizures. Epileptic seizures result from abnormal, excessive or hypersynchronous neuronal activity in the brain. Seizure types are organized firstly according to whether the source of the seizure within the brain is localized or distributed. In this work, our objective is to validate the use of MRI (Magnetic Resonance Imaging) for localizing seizure focus for improved surgical planning. We apply computer vision and machine learning techniques to tackle the problem of epilepsy lesion classification. First datasets of digitized histology images from brain cortexes of different patients are obtained ...

Automatic Foreground Initialization For Binary Image Segmentation, Wei Li

Electronic Thesis and Dissertation Repository

Foreground segmentation is a fundamental problem in computer vision. A popular approach for foreground extraction is through graph cuts in energy minimization framework. Most existing graph cuts based image segmentation algorithms rely on user’s initialization. In this work, we aim to find an automatic initialization for graph cuts. Unlike many previous methods, no additional training dataset is needed. Collecting a training set is not only expensive and time consuming, but it also may bias the algorithm to the particular data distribution of the collected dataset. We assume that the foreground differs significantly from the background in some unknown feature ...

Spectral Approaches To Learning Predictive Representations, Byron Boots

Dissertations

A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must obtain an accurate environment model, and then plan to maximize reward. However, for complex domains, specifying a model by hand can be a time consuming process. This motivates an alternative approach: learning a model directly from observations. Unfortunately, learning algorithms often recover a model that is too inaccurate to support planning or too large and complex for planning to succeed; or, they require excessive prior domain knowledge or fail to provide guarantees such as statistical consistency ...

Real-Time Mobile Stereo Vision, Bryan Hale Bodkin

Masters Theses

Computer stereo vision is used extract depth information from two aligned cameras and there are a number of hardware and software solutions to solve the stereo correspondence problem. However few solutions are available for inexpensive mobile platforms where power and hardware are major limitations. This Thesis will proposes a method that competes with an existing OpenCV stereo correspondence method in speed and quality, and is able to run on generic multi core CPU’s.

Identification Of Tcp Protocols, Juan Shao

Computer Science and Engineering: Theses, Dissertations, and Student Research

Recently, many new TCP algorithms, such as BIC, CUBIC, and CTCP, have been deployed in the Internet. Investigating the deployment statistics of these TCP algorithms is meaningful to study the performance and stability of the Internet. Currently, there is a tool named Congestion Avoidance Algorithm Identification (CAAI) for identifying the TCP algorithm of a web server and then for investigating the TCP deployment statistics. However, CAAI using a simple k-NN algorithm can not achieve a high identification accuracy. In this thesis, we comprehensively study the identification accuracy of five popular machine learning models. We find that the random forest model ...

Toward Large-Scale Agent Guidance In An Urban Taxi Service., Agussurja Lucas, Hoong Chuin Lau

Research Collection School of Information Systems (Open Access)

Empty taxi cruising represents a wastage of resources in the context of urban taxi services. In this work, we seek to minimize such wastage. An analysis of a large trace of taxi operations reveals that the services’ inefficiency is caused by drivers’ greedy cruising behavior. We model the existing system as a continuous time Markov chain. To address the problem, we propose that each taxi be equipped with an intelligent agent that will guide the driver when cruising for passengers. Then, drawing from AI literature on multiagent planning, we explore two possible ways to compute such guidance. The first formulation ...

Uncertain Congestion Games With Assorted Human Agent Populations , Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng

Research Collection School of Information Systems (Open Access)

Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the ...

Decision Support For Assorted Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng

Research Collection School of Information Systems (Open Access)

This research is motivated by large scale problems in urban transportation and labor mobility where there is congestion for resources and uncertainty in movement. In such domains, even though the individual agents do not have an identity of their own and do not explicitly interact with other agents, they effect other agents. While there has been much research in handling such implicit effects, it has primarily assumed deterministic movements of agents. We address the issue of decision support for individual agents that are identical and have involuntary movements in dynamic environments. For instance, in a taxi fleet serving a city ...

Dynamic Stochastic Orienteering Problems For Risk-Aware Applications, Hoong Chuin Lau, William Yeoh, Pradeep Reddy Varakantham, Duc Thien Nguyen

Research Collection School of Information Systems (Open Access)

Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations travel times between cities are assumed to be time independent and the route provided is independent of the risk preference (with respect to violating the deadline) of the user. To address these issues, we make the following contributions: We introduce (1) a dynamic ...

Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng

Research Collection School of Information Systems (Open Access)

Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the ...

Decision Support For Agent Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Shih-Fen Cheng, Geoff Gordon, Asrar Ahmed

Research Collection School of Information Systems (Open Access)

This research is motivated by large scale problems in urban transportation and labor mobility where there is congestion for resources and uncertainty in movement. In such domains, even though the individual agents do not have an identity of their own and do not explicitly interact with other agents, they effect other agents. While there has been much research in handling such implicit effects, it has primarily assumed deterministic movements of agents. We address the issue of decision support for individual agents that are identical and have involuntary movements in dynamic environments. For instance, in a taxi fleet serving a city ...