Self-Organizing Neural Network For Adaptive Operator Selection In Evolutionary Search,
2016
Singapore Management University
Self-Organizing Neural Network For Adaptive Operator Selection In Evolutionary Search, Teck Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Evolutionary Algorithm is a well-known meta-heuristics paradigm capable of providing high-quality solutions to computationally hard problems. As with the other meta-heuristics, its performance is often attributed to appropriate design choices such as the choice of crossover operators and some other parameters. In this chapter, we propose a continuous state Markov Decision Process model to select crossover operators based on the states during evolutionary search. We propose to find the operator selection policy efficiently using a self-organizing neural network, which is trained offline using randomly selected training samples. The trained neural network is then verified on test instances not used for …
Dual Formulations For Optimizing Dec-Pomdp Controllers,
2016
Singapore Management University
Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDP is an expressive model for multi-agent planning. Finite-state controllers (FSCs)---often used to represent policies for infinite-horizon problems---offer a compact, simple-to-execute policy representation. We exploit novel connections between optimizing decentralized FSCs and the dual linear program for MDPs. Consequently, we describe a dual mixed integer linear program (MIP) for optimizing deterministic FSCs. We exploit the Dec-POMDP structure to devise a compact MIP and formulate constraints that result in policies executable in partially-observable decentralized settings. We show analytically that the dual formulation can also be exploited within the expectation maximization (EM) framework to optimize stochastic FSCs. The resulting EM algorithm …
Movie Script Shot Lister,
2016
San Jose State University
Movie Script Shot Lister, David Robert Smith
Master's Projects
The making of a motion picture almost always starts with the script, the written version of a story envisioned within the mind of its creator. The script is then broken down into shots. Each individual shot is filmed and then they are edited together to create the motion picture. The goal of the Movie Script Shot Lister thesis project is to be able to read in a script for a movie or television show, and automatically generate a shot list. While a script is text, a shot list is the blue print for how to visualize that script, so the …
Multiple Sequence Alignment With Pro Le Hidden Markov Models,
2016
San Jose State University
Multiple Sequence Alignment With Pro Le Hidden Markov Models, Shubhangi Rakhonde
Master's Projects
The human genome consists of various patterns and sequences that are of biolog- ical signi cance. Capturing these patterns can help us in resolving various mysteries related to the genome, like how genomes evolve, how diseases occur due to genetic mutation, how viruses mutate to cause new disease and what is the cure for these diseases. All these applications are covered in the study of bioinformatics.
One of the very common tasks in bioinformatics involves simultaneous alignment of a number of biological sequences. In bioinformatics, this is widely known as Mul- tiple Sequence Alignment. Multiple sequence alignments help in grouping …
Hive - An Agent Based Modeling Framework,
2016
San Jose State University
Hive - An Agent Based Modeling Framework, Roohi Bharti
Master's Projects
This thesis begins by defining agent based modeling. Agent based models are used to model the emergent behavior of complex systems with many interacting components, known as agents. Several model examples are given using NetLogo, which is a popular agent-based modeling platform. A model of concurrent computation is described that uses message passing as the only form of communication between the model’s components, which are called actors. The model is called an actor model. Actors are primitive objects of concurrency in an actor model. In particular, we describe the actor model implemented by Akka, which is Scala’s new actor library. …
Automatic Classification Of Perceived Gender From Face Images,
2016
Central Washington University
Automatic Classification Of Perceived Gender From Face Images, Joseph Lemley, Sami Abdul-Wahid, Dipayan Banik
Symposium Of University Research and Creative Expression (SOURCE)
Building software that can visually and accurately perceive gender from face images is an important step in making more intelligent machines. Several approaches to this problem have been suggested in the literature. We evaluate Histogram of Oriented Gradients, Dual Tree Complex Wavelet Transform (DTCWT) Principal Component Analysis (PCA) with Support Vector Machines (SVM) and compare them to Convolutional Neural Networks for this task. We train and test our classifiers with two benchmarks containing thousands of facial images. As expected, convolutional neural networks had the best performance while the performance of DTCWT varied most depending on the dataset used
Applying Machine Learning To Predict Stock Value,
2016
Central Washington University
Applying Machine Learning To Predict Stock Value, Joseph Lemley, Yishui Liu, Dipayan Banik, Sadia Afroze
Symposium Of University Research and Creative Expression (SOURCE)
The purpose of this study was to compare machine learning techniques for short term stock prediction and evaluate their effectiveness. Stock value analysis is an important element of modern economies. The ability to predict future stock prices from historical price values is of tremendous interest to investors. The prediction of stock performance is still an unsolved problem with a variety of techniques being proposed. Real stock values are affected by many elements, some of which cannot be measured. In this study, we limit our analysis to stock closing prices. We use these prices to predict the future stock value using …
Detection Of Locations Of Key Points On Facial Images,
2016
San Jose State University
Detection Of Locations Of Key Points On Facial Images, Manoj Gyanani
Master's Projects
In field of computer vision research, One of the most important branch is Face recognition. It targets at finding size and location of human face on digital image, by identifying and separating faces from the surrounding objects like building, plants etc. For the purpose of developing an advanced face recognition algorithm, Detection of facial key points is the basic and very important task, basically it is about finding out the location of specific key points on facial images. This key points can be mouths, noses, left eyes, right eyes and so on.
For implementation of solution, I have used amazon …
Automatically Characterizing Product And Process Incentives In Collective Intelligence,
2016
Washington University in St. Louis
Automatically Characterizing Product And Process Incentives In Collective Intelligence, Allen Brockhurst Lavoie
McKelvey School of Engineering Graduate Student Theses & Dissertations
Social media facilitate interaction and information dissemination among an unprecedented number of participants. Why do users contribute, and why do they contribute to a specific venue? Does the information they receive cover all relevant points of view, or is it biased? The substantial and increasing importance of online communication makes these questions more pressing, but also puts answers within reach of automated methods. I investigate scalable algorithms for understanding two classes of incentives which arise in collective intelligence processes. Product incentives exist when contributors have a stake in the information delivered to other users. I investigate product-relevant user behavior changes, …
Texture Modelling Using Convolutional Neural Networks,
2016
University of Tuebingen
Texture Modelling Using Convolutional Neural Networks, Leon A. Gatys, Alexander S. Ecker, Matthias Bethge
MODVIS Workshop
We introduce a new model of natural textures based on the feature spaces of convolutional neural networks optimised for object recognition. Samples from the model are of high perceptual quality demonstrating the generative power of neural networks trained in a purely discriminative fashion. Within the model, textures are represented by the correlations between feature maps in several layers of the network. We show that across layers the texture representations increasingly capture the statistical properties of natural images while making object information more and more explicit. Extending this framework to texture transfer, we introduce A Neural Algorithm of Artistic Style that …
Focusing On Selection For Fixation,
2016
York University
Focusing On Selection For Fixation, John K. Tsotsos, Calden Wloka, Yulia Kotseruba
MODVIS Workshop
Building on our presentation at MODVIS 2015, we continue in our quest to discover a functional, computational, explanation of the relationship among visual attention, interpretation of visual stimuli, and eye movements, and how these produce visual behavior. Here, we focus on one component, how selection is accomplished for the next fixation. The popularity of saliency map models drives the inference that this is solved; we suggested otherwise at MODVIS 2015. Here, we provide additional empirical and theoretical arguments. We then develop arguments that a cluster of complementary, conspicuity representations drive selection, modulated by task goals and history, leading to a …
Collecting Image Cropping Dataset: A Hybrid System Of Machine And Human Intelligence,
2016
Portland State University
Collecting Image Cropping Dataset: A Hybrid System Of Machine And Human Intelligence, Uyen T. Mai, Feng Liu
Student Research Symposium
Image cropping is a common tool that exists in almost any image editor, yet automatic cropping is still a difficult problem in Computer Vision. Since images nowadays can be easily collected through the web, machine learning is a promising approach to solve this problem. However, an image cropping dataset is not yet available and gathering such a large-scale dataset is a non-trivial task. Although a crowdsourcing website such as Mechanical Turk seems to be a solution to this task, image cropping is a sophisticated task that is vulnerable to unreliable annotation; furthermore, collecting a large-scale high-quality dataset through crowdsourcing is …
Ant Colony Optimization For Continuous Spaces,
2016
University of Arkansas, Fayetteville
Ant Colony Optimization For Continuous Spaces, Rachel Findley
Computer Science and Computer Engineering Undergraduate Honors Theses
Ant Colony Optimization (ACO) is an optimization algorithm designed to find semi-optimal solutions to Combinatorial Optimization Problems. The challenge of modifying this algorithm to effectively optimize over a continuous domain is one that has been tackled by several researchers. In this paper, ACO has been modified to use several variations of the algorithm for continuous spaces. An aspect of ACO which is crucial to its success when optimizing over a continuous space is choosing the appropriate object (solution component) out of an infinite set to add to the ant's path. This step is highly important in shaping good solutions. Important …
Improving Electroencephalography-Based Imagined Speech Recognition With A Simultaneous Video Data Stream,
2016
University of Arkansas, Fayetteville
Improving Electroencephalography-Based Imagined Speech Recognition With A Simultaneous Video Data Stream, Sarah J. Stolze
Computer Science and Computer Engineering Undergraduate Honors Theses
Electroencephalography (EEG) devices offer a non-invasive mechanism for implementing imagined speech recognition, the process of estimating words or commands that a person expresses only in thought. However, existing methods can only achieve limited predictive accuracy with very small vocabularies; and therefore are not yet sufficient to enable fluid communication between humans and machines. This project proposes a new method for improving the ability of a classifying algorithm to recognize imagined speech recognition, by collecting and analyzing a large dataset of simultaneous EEG and video data streams. The results from this project suggest confirmation that complementing high-dimensional EEG data with similarly …
Inferring Intrinsic Beliefs Of Digital Images Using A Deep Autoencoder,
2016
University of Arkansas, Fayetteville
Inferring Intrinsic Beliefs Of Digital Images Using A Deep Autoencoder, Seok H. Lee
Computer Science and Computer Engineering Undergraduate Honors Theses
Training a system of artificial neural networks on digital images is a big challenge. Often times digital images contain a large amount of information and values for artificial neural networks to understand. In this work, the inference model is proposed in order to absolve this problem. The inference model is composed of a parameterized autoencoder that endures the loss of information caused by the rescaling of images and transition model that predicts the effect of an action on the observation. To test the inference model, the images of a moving robotic arm were given as the data set. The inference …
Two-Player Game Ai,
2016
Morehead State University
Two-Player Game Ai, Hunter Noble, Ashraf Aly
Celebration of Student Scholarship Poster Sessions Archive
No abstract provided.
Efficient 3d Dental Identification Via Signed Feature Histogram And Learning Keypoint Detection,
2016
Singapore Management University
Efficient 3d Dental Identification Via Signed Feature Histogram And Learning Keypoint Detection, Zhiyuan Zhang, Sim Heng Ong, Xin Zhong, Kelvin W. C. Foong
Research Collection School Of Computing and Information Systems
Current methods of dental identification are mainly based on 2D dental radiographs which suffer from speed and accuracy limitations. In this paper, we present an efficient dental identification approach based on 3D dental models. We propose a novel shape descriptor, the Signed Feature Histogram (SFH), which is highly discriminative and can be easily computed to describe the local surface. Based on the SFH, a learning keypoint detection method is adopted to accurately detect the desired keypoints on both antemortem (AM) and postmortem (PM) models. For a given PM model, the optimal initial alignment to the AM model to be matched …
Efficient Algorithms For Clustering Polygonal Obstacles,
2016
University of Nevada, Las Vegas
Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar
UNLV Theses, Dissertations, Professional Papers, and Capstones
Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.
Evaluation Of Topic Models For Content-Based Popularity Prediction On Social Microblogs,
2016
Boise State University
Evaluation Of Topic Models For Content-Based Popularity Prediction On Social Microblogs, Axel Magnuson
Boise State University Theses and Dissertations
Online social networks are an increasingly central medium of communication in the 21st century. We have seen a proliferation of competing social networks which differentiate themselves by serving different niches of communication. Among these, Twitter has risen to prominence as a leader among microblogging communities, characterized by publicly visible 140-character messages called tweets. The wide visibility of Twitter messages has enabled some users to curate large followings, and has facilitated content creators who wish to reach as many viewers as possible. Researchers have since investigated many methods for predicting which messages will become popular or even go viral on Twitter. …
Robust Influence Maximization,
2016
Singapore Management University
Robust Influence Maximization, Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar
Research Collection School Of Computing and Information Systems
Influence Maximization is the problem of finding a fixed size set of nodes, which will maximize the expected number of influenced nodes in a social network. The number of influenced nodes is dependent on the influence strength of edges that can be very noisy. The noise in the influence strengths can be modeled using a random noise or adversarial noise model. It has been shown that all random processes that independently affect edges of the graph can be absorbed into the activation probabilities themselves and hence random noise can be captured within the independent cascade model. On the other hand, …
