The Long Wavelength Array Software Library

The Long Wavelength Array Software Library (LSL) is a Python module that provides a collection of utilities to analyze and export data collected at the first station of the Long Wavelength Array, LWA1. Due to the nature of the data format and large-N ($\gtrsim$100 inputs) challenges faced by the LWA, currently available software packages are not suited to process the data. Using tools provided by LSL, observers can read in the raw LWA1 data, synthesize a filter bank, and apply incoherent de-dispersion to the data. The extensible nature of LSL also makes it an ideal tool for building data analysis pipelines and applying the methods to other low frequency arrays.Comment: accepted to the Journal of Astronomical Instrumentation; 24 pages, 4 figure

Gaussian process inference modelling of dynamic robot control for expressive piano playing

Piano is a complex instrument, which humans learn to play after many years of practice. This paper investigates the complex dynamics of the embodied interactions between a human and piano, in order to gain insights into the nature of humans’ physical dexterity and adaptability. In this context, the dynamic interactions become particularly crucial for delicate expressions, often present in advanced music pieces, which is the main focus of this paper. This paper hypothesises that the relationship between motor control for key-pressing and the generated sound is a manifold problem, with high-degrees of non-linearity in nature. We employ a minimalistic experimental platform based on a robotic arm equipped with a single elastic finger in order to systematically investigate the motor control and resulting outcome of piano sounds. The robot was programmed to run 3125 key-presses on a physical digital piano with varied control parameters. The obtained data was applied to a Gaussian Process (GP) inference modelling method, to train a network in terms of 10 playing styles, corresponding to different expressions generated by a Musical Instrument Digital Interface (MIDI). By analysing the robot control parameters and the output sounds, the relationship was confirmed to be highly nonlinear, especially when the rich expressions (such as a broad range of sound dynamics) were necessary. Furthermore this relationship was difficult and time consuming to learn with linear regression models, compared to the developed GPbased approach. The performance of the robot controller was also compared to that of an experienced human player. The analysis shows that the robot is able to generate sounds closer to humans’ in some expressions, but requires additional investigations for othersEPSR

Template Based Recognition of On-Line Handwriting

Software for recognition of handwriting has been available for several decades now and research on the subject have produced several different strategies for producing competitive recognition accuracies, especially in the case of isolated single characters. The problem of recognizing samples of handwriting with arbitrary connections between constituent characters (emph{unconstrained handwriting}) adds considerable complexity in form of the segmentation problem. In other words a recognition system, not constrained to the isolated single character case, needs to be able to recognize where in the sample one letter ends and another begins. In the research community and probably also in commercial systems the most common technique for recognizing unconstrained handwriting compromise Neural Networks for partial character matching along with Hidden Markov Modeling for combining partial results to string hypothesis. Neural Networks are often favored by the research community since the recognition functions are more or less automatically inferred from a training set of handwritten samples. From a commercial perspective a downside to this property is the lack of control, since there is no explicit information on the types of samples that can be correctly recognized by the system. In a template based system, each style of writing a particular character is explicitly modeled, and thus provides some intuition regarding the types of errors (confusions) that the system is prone to make. Most template based recognition methods today only work for the isolated single character recognition problem and extensions to unconstrained recognition is usually not straightforward. This thesis presents a step-by-step recipe for producing a template based recognition system which extends naturally to unconstrained handwriting recognition through simple graph techniques. A system based on this construction has been implemented and tested for the difficult case of unconstrained online Arabic handwriting recognition with good results

Logsig-RNN: a novel network for robust and efficient skeleton-based action recognition

This paper contributes to the challenge of skeleton-based human action recognition in videos. The key step is to develop a generic network architecture to extract discriminative features for the spatio-temporal skeleton data. In this paper, we propose a novel module, namely Logsig-RNN, which is the combination of the log-signature layer and recurrent type neural networks (RNNs). The former one comes from the mathematically principled technology of signatures and log-signatures as representations for streamed data, which can manage high sample rate streams, non-uniform sampling and time series of variable length. It serves as an enhancement of the recurrent layer, which can be conveniently plugged into neural networks. Besides we propose two path transformation layers to significantly reduce path dimension while retaining the essential information fed into the Logsig-RNN module. (The network architecture is illustrated in Figure 1 (Right).) Finally, numerical results demonstrate that replacing the RNN module by the LogsigRNN module in SOTA networks consistently improves the performance on both Chalearn gesture data and NTU RGB+D 120 action data in terms of accuracy and robustness. In particular, we achieve the state-of-the-art accuracy on Chalearn2013 gesture data by combining simple path transformation layers with the Logsig-RNN

Fuzzy Logic Classification of Handwritten Signature Based Computer Access and File Encryption

Often times computer access and file encryption is successful based on how complex a password will be, how often users could change their complex password, the length of the complex password and how creative users are in creating a complex passsword to stand against unauthorized access to computer resources or files. This research proposes a new way of computer access and file encryption based on the fuzzy logic classification of handwritten signatures. Feature extraction of the handwritten signatures, the Fourier transformation algorithm and the k-Nearest Algorithm could be implemented to determine how close the signature is to the signature on file to grant or deny users access to computer resources and encrypted files. lternatively implementing fuzzy logic algorithms and fuzzy k-Nearest Neighbor algorithm to the captured signature could determine how close a signature is to the one on file to grant or deny access to computer resources and files. This research paper accomplishes the feature recognition firstly by extracting the features as users sign their signatures for storage, and secondly by determining the shortest distance between the signatures. On the other hand this research work accomplish the fuzzy logic recognition firstly by classifying the signature into a membership groups based on their degree of membership and secondly by determining what level of closeness the signatures are from each other. The signatures were collected from three selected input devices- the mouse, I-Pen and the IOGear. This research demonstrates which input device users found efficient and flexible to sign their respective names. The research work also demonstrates the security levels of implementing the fuzzy logic, fuzzy k-Nearest Neighbor, Fourier Transform.Master'sCollege of Arts and Sciences: Computer ScienceUniversity of Michiganhttp://deepblue.lib.umich.edu/bitstream/2027.42/117719/1/Kwarteng.pd

Automatic signature verification system

Philosophiae Doctor - PhDIn this thesis, we explore dynamic signature verification systems. Unlike other signature models, we use genuine signatures in this project as they are more appropriate in real world applications. Signature verification systems are typical examples of biometric devices that use physical and behavioral characteristics to verify that a person really is who he or she claims to be. Other popular biometric examples include fingerprint scanners and hand geometry devices. Hand written signatures have been used for some time to endorse financial transactions and legal contracts although little or no verification of signatures is done. This sets it apart from the other biometrics as it is well accepted method of authentication. Until more recently, only hidden Markov models were used for model construction. Ongoing research on signature verification has revealed that more accurate results can be achieved by combining results of multiple models. We also proposed to use combinations of multiple single variate models instead of single multi variate models which are currently being adapted by many systems. Apart from these, the proposed system is an attractive way for making financial transactions more secure and authenticate electronic documents as it can be easily integrated into existing transaction procedures and electronic communication

Spatial modeling of propagule pressure in Ailanthus altissima

Ailanthus altissima (tree of heaven) is a non-native invasive tree spreading within central Appalachia. This dioecious, deciduous, and allelopathic species copiously produces samaras, capable of traveling at least 200 m through primary wind-dispersal. Removal of A. altissima individuals prior to timbering and other forest disturbances may help prevent spread into forest interiors. To aid in species management, this study investigated the use of remote sensing to identify the location and abundance of samaras in mixed mesophytic forests through supervised classifications. From empirical measurements, the estimated number of seeds per classified unit area was determined and the relationship between quantified propagule sources and individual seed primary dispersal was spatially modeled using a cellular automata model. The predicted seed dispersion pattern was compared to empirical seed trap measurements. Secondary seed dispersal, germination and seedling survival parameters were determined through field experiments. Specifically, I found that remote sensing can be successfully used to distinguish A. altissima samara clusters from surrounding closed canopy vegetation. The identified total area of classified A. altissima samara clusters was determined to be linearly related to total canopy seed yield, however model predictions of seed dispersal patterns generally predicted greater numbers of seeds per seed trap compared to measured outcomes. Seed dispersal predictions using all classified A. altissima samara clusters provided no positive relationships with observed values (Site II, p=0.2997; negative relationship at Site III, p=0.0053). Manually delineating seed sources through photo interpretation resulted in a positive relationship between model estimates and observed seed rain (Site II, p=0.0225), but may still contain commission errors (Site III, p=0.7002). Microsite survey observations of seed germination indicate the frequency of safe sites was high in disturbed environments (canopy gaps), but seedling survival was negligible in the year this study was performed. Measurements of secondary dispersal on land and water (hydrochory) indicate the species can be dispersed with multiple dispersal agents. Hydrochory was shown to be able to contribute greatly to the species\u27 long distance dispersal, as seeds can reach water bodies, stay viable for long periods of immersion, and can be dispersed downstream distances more than two orders of magnitude greater than primary dispersal. This was the first demonstration of hydrochory in this species. From these studies, it appears that polychory may contribute greatly to this species dispersal and I can infer the same polychory occurs in other terrestrial species, and may contribute to invasive success