Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Mathematics (3)
- Computer Science (2)
- Art (1)
- Art vectorization (1)
- BCH Codes (1)
-
- Bakry Emery curvature (1)
- Bezier Curves (1)
- College of Natural Science and Mathematics (1)
- Combinatorics (1)
- Consolidation (1)
- Cooper's Philosophy (1)
- Curves (1)
- Cyclic Codes (1)
- General Error Locator Polynomials (1)
- Graph embeddings (1)
- Graph theory (1)
- Graphics (1)
- Gröbner Bases (1)
- Heuristics (1)
- Human motion event detection (1)
- Local-global results (1)
- Low Discrepancy Action Selection (1)
- Machine Learning (1)
- Motion tracking (1)
- Optimization (1)
- Parameterization (1)
- Raster (1)
- Reinforcement Learning (1)
- SPAITR (1)
- Search algorithms (1)
Articles 1 - 7 of 7
Full-Text Articles in Other Mathematics
Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew
Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew
Honors Program Theses
Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …
Local-Global Results On Discrete Structures, Alexander Lewis Stevens
Local-Global Results On Discrete Structures, Alexander Lewis Stevens
Electronic Theses and Dissertations
Local-global arguments, or those which glean global insights from local information, are central ideas in many areas of mathematics and computer science. For instance, in computer science a greedy algorithm makes locally optimal choices that are guaranteed to be consistent with a globally optimal solution. On the mathematical end, global information on Riemannian manifolds is often implied by (local) curvature lower bounds. Discrete notions of graph curvature have recently emerged, allowing ideas pioneered in Riemannian geometry to be extended to the discrete setting. Bakry- Émery curvature has been one such successful notion of curvature. In this thesis we use combinatorial …
Highlights Generation For Tennis Matches Using Computer Vision, Natural Language Processing And Audio Analysis, Alon Liberman
Highlights Generation For Tennis Matches Using Computer Vision, Natural Language Processing And Audio Analysis, Alon Liberman
Senior Independent Study Theses
This project uses computer vision, natural language processing and audio analysis to automatize the highlights generation task for tennis matches. Computer vision techniques such as camera shot detection, hough transform and neural networks are used to extract the time intervals of the points. To detect the best points, three approaches are used. Point length suggests which points correspond to rallies and aces. The audio waves are analyzed to search for the highest audio peaks, which indicate the moments where the crowd cheers the most. Sentiment analysis, a natural language processing technique, is used to look for points where the commentators …
Stroke Clustering And Fitting In Vector Art, Khandokar Shakib
Stroke Clustering And Fitting In Vector Art, Khandokar Shakib
Senior Independent Study Theses
Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Honors Theses
In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …
Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg
Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg
Electronic Theses and Dissertations
In reinforcement learning the process of selecting an action during the exploration or exploitation stage is difficult to optimize. The purpose of this thesis is to create an action selection process for an agent by employing a low discrepancy action selection (LDAS) method. This should allow the agent to quickly determine the utility of its actions by prioritizing actions that are dissimilar to ones that it has already picked. In this way the learning process should be faster for the agent and result in more optimal policies.
Realtime Event Detection In Sports Sensor Data With Machine Learning, Mallory Cashman
Realtime Event Detection In Sports Sensor Data With Machine Learning, Mallory Cashman
Honors Theses and Capstones
Machine learning models can be trained to classify time series based sports motion data, without reliance on assumptions about the capabilities of the users or sensors. This can be applied to predict the count of occurrences of an event in a time period. The experiment for this research uses lacrosse data, collected in partnership with SPAITR - a UNH undergraduate startup developing motion tracking devices for lacrosse. Decision Tree and Support Vector Machine (SVM) models are trained and perform with high success rates. These models improve upon previous work in human motion event detection and can be used a reference …