Physical Sciences and Mathematics Commons^™

Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik

Electronic Thesis and Dissertation Repository

Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by triangular sets) and then, with some generic assumptions, to l many hypersurfaces.

Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.

Energy Based Multi-Model Fitting And Matching Problems, Hossam N. Isack

Electronic Thesis and Dissertation Repository

Feature matching and model fitting are fundamental problems in multi-view geometry. They are chicken-&-egg problems: if models are known it is easier to find matches and vice versa. Standard multi-view geometry techniques sequentially solve feature matching and model fitting as two independent problems after making fairly restrictive assumptions. For example, matching methods rely on strong discriminative power of feature descriptors, which fail for stereo images with repetitive textures or wide baseline. Also, model fitting methods assume given feature matches, which are not known a priori. Moreover, when data supports multiple models the fitting problem becomes challenging even with known matches …

On The Applications Of Lifting Techniques, Esmaeil Mehrabi

Electronic Thesis and Dissertation Repository

Lifting techniques are some of the main tools in solving a variety of different computational problems related to the field of computer algebra. In this thesis, we will consider two fundamental problems in the fields of computational algebraic geometry and number theory, trying to find more efficient algorithms to solve such problems.

The first problem, solving systems of polynomial equations, is one of the most fundamental problems in the field of computational algebraic geometry. In this thesis, We discuss how to solve bivariate polynomial systems over either k(T ) or Q using a combination of lifting and modular composition techniques. …

On The Parallelization Of Integer Polynomial Multiplication, Farnam Mansouri

Electronic Thesis and Dissertation Repository

With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort for taking advantage of those architectures by designing parallel algorithms has been made. To achieve this goal, one needs to consider both algebraic complexity and parallelism, plus making efficient use of memory traffic, cache, and reducing overheads in the implementations.

Polynomial multiplication is at the core of many algorithms in symbolic computation such as real root isolation which will be our main application for now.

In this thesis, we first investigate the multiplication of dense univariate polynomials with integer coefficients targeting multi-core processors. Some of the proposed …

Optimizing The Analysis Of Electroencephalographic Data By Dynamic Graphs, Mehrsasadat Golestaneh

Electronic Thesis and Dissertation Repository

The brain’s underlying functional connectivity has been recently studied using tools offered by graph theory and network theory. Although the primary research focus in this area has so far been mostly on static graphs, the complex and dynamic nature of the brain’s underlying mechanism has initiated the usage of dynamic graphs, providing groundwork for time sensi- tive and finer investigations. Studying the topological reconfiguration of these dynamic graphs is done by exploiting a pool of graph metrics, which describe the network’s characteristics at different scales. However, considering the vast amount of data generated by neuroimaging tools, heavy computation load and …

High Multiplicity Strip Packing, Devin Price

Electronic Thesis and Dissertation Repository

An instance of the two-dimensional strip packing problem is specified by n rectangular items, each having a width, 0 < w_n ≤ 1, and height, 0 < h_n ≤ 1. The objective is to place these items into a strip of width 1, without rotations, such that they are nonoverlapping and the total height of the resulting packing is minimized. In this thesis, we consider the version of the two-dimensional strip packing problem where there is a constant number K of distinct rectangle sizes and present an OPT + K - 1 polynomial-time approximation algorithm for it. This beats a previous algorithm …

Image Fusion And Axial Labeling Of The Spine, Brandon Miles

Electronic Thesis and Dissertation Repository

In order to improve radiological diagnosis of back pain and spine disease, two new algorithms have been developed to aid the 75% of Canadians who will suffer from back pain in a given year. With the associated medical imaging required for many of these patients, there is a potential for improvement in both patient care and healthcare economics by increasing the accuracy and efficiency of spine diagnosis. A real-time spine image fusion system and an automatic vertebra/disc labeling system have been developed to address this. Both magnetic resonance (MR) images and computed tomography (CT) images are often acquired for patients. …