Other Computer Engineering Commons^™

Distributed Iterative Graph Processing Using Nosql With Data Locality, Ayam Pokhrel

LSU Master's Theses

A tremendous amount of data is generated every day from a wide range of sources such as social networks, sensors, and application logs. Among them, graph data is one type that represents valuable relationships between various entities. Analytics of large graphs has become an essential part of business processes and scientific studies because it leads to deep and meaningful insights into the related domain based on the connections between various entities. However, the optimal processing of large-scale iterative graph computations is very challenging due to the issues like fault tolerance, high memory requirement, parallelization, and scalability. Most of the contemporary …

Image Processing Applications In Real Life: 2d Fragmented Image And Document Reassembly And Frequency Division Multiplexed Imaging, Houman Kamran Habibkhani

LSU Doctoral Dissertations

In this era of modern technology, image processing is one the most studied disciplines of signal processing and its applications can be found in every aspect of our daily life. In this work three main applications for image processing has been studied.

In chapter 1, frequency division multiplexed imaging (FDMI), a novel idea in the field of computational photography, has been introduced. Using FDMI, multiple images are captured simultaneously in a single shot and can later be extracted from the multiplexed image. This is achieved by spatially modulating the images so that they are placed at different locations in the …

Evaluating Classifiers' Optimal Performances Over A Range Of Misclassification Costs By Using Cost-Sensitive Classification, Ramy Al-Saffar

LSU Master's Theses

We believe that using the classification accuracy is not enough to evaluate the performances of classification algorithms. It can be misleading due to overlooking an important element which is the cost if classification is inaccurate. Furthermore, the Receiver Operational Characteristic (ROC) is one of the most popular graphs used to evaluate classifiers performances. However, one of the biggest ROC’s shortcomings is the assumption of equal costs for all misclassified data. Therefore, our goal is to reduce the total cost of decision making by selecting the classifier that has the least total misclassification cost. Nevertheless, the exact misclassification cost is usually …

Data-Driven Abstraction, Vivian Mankau Ho

LSU Master's Theses

Given a program analysis problem that consists of a program and a property of interest, we use a data-driven approach to automatically construct a sequence of abstractions that approach an ideal abstraction suitable for solving that problem. This process begins with an infinite concrete domain that maps to a finite abstract domain defined by statistical procedures resulting in a clustering mixture model. Given a set of properties expressed as formulas in a restricted and bounded variant of CTL, we can test the success of the abstraction with respect to a predefined performance level. In addition, we can perform iterative abstraction-refinement …

Compiler And Runtime Optimization Techniques For Implementation Scalable Parallel Applications, Zahra Khatami

LSU Doctoral Dissertations

The compiler is able to detect the data dependencies in an application and is able to analyze the specific sections of code for parallelization potential. However, all of these techniques provided by a compiler are usually applied at compile time, so they rely on static analysis, which is insufficient for achieving maximum parallelism and desired application scalability. These compiler techniques should consider both the static information gathered at compile time and dynamic analysis captured at runtime about the system to generate a safe parallel application. On the other hand, runtime information is often speculative. Solely relying on it doesn't guarantee …