Theory and Algorithms Commons^™

Zernike Moments And Genetic Algorithm : Tutorial And Application, Oluleye H. Babatunde, Leisa Armstrong, Jinsong Leng, Dean Diepeveen

Research outputs 2014 to 2021

Aims/ objectives: To demontrate effectiveness of Zernike Moments for Image Classification. Zernike moment(ZM) is an excellent region-based moment which has attracted the attentions of many image processing researchers since its first application to image analysis. Many papers have been published on several works done on ZM but no single paper ever give a detailed information of how the computation of ZM is done from the time the image is captured to the computation of ZM. This work showed how to effectively apply ZM on RGB images. We have demonstrated the effectiveness of Zernike moment in image classification system. A neuro-genetic …

Novel Image-Dependent Quality Assessment Measures, Asaad Hashim, Zahir Hussain

Research outputs 2014 to 2021

The image is a 2D signal whose pixels are highly correlated in a 2D manner. Hence, using pixel by pixel error what we called previously Mean-Square Error, (MSE) is not an efficient way to compare two similar images (e.g., an original image and a compressed version of it). Due to this correlation, image comparison needs a correlative quality measure. It is clear that correlation between two signals gives an idea about the relation between samples of the two signals. Generally speaking, correlation is a measure of similarity between the two signals. An important step in image similarity was introduced by …

Using Acl2 To Verify Loop Pipelining In Behavioral Synthesis, Disha Puri, Sandip Ray, Kecheng Hao, Fei Xie

Civil and Environmental Engineering Faculty Publications and Presentations

Behavioral synthesis involves compiling an Electronic System-Level (ESL) design into its RegisterTransfer Level (RTL) implementation. Loop pipelining is one of the most critical and complex transformations employed in behavioral synthesis. Certifying the loop pipelining algorithm is challenging because there is a huge semantic gap between the input sequential design and the output pipelined implementation making it infeasible to verify their equivalence with automated sequential equivalence checking techniques. We discuss our ongoing effort using ACL2 to certify loop pipelining transformation. The completion of the proof is work in progress. However, some of the insights developed so far may already be of …

Detection Of Seagrass Scars Using Sparse Coding And Morphological Filter, Ender Oguslu, Sertan Erkanli, Victoria J. Hill, W. Paul Bissett, Richard C. Zimmerman, Jiang Li, Charles R. Bostater Jr. (Ed.), Stelios P. Mertikas (Ed.), Xavier Neyt (Ed.)

OES Faculty Publications

We present a two-step algorithm for the detection of seafloor propeller seagrass scars in shallow water using panchromatic images. The first step is to classify image pixels into scar and non-scar categories based on a sparse coding algorithm. The first step produces an initial scar map in which false positive scar pixels may be present. In the second step, local orientation of each detected scar pixel is computed using the morphological directional profile, which is defined as outputs of a directional filter with a varying orientation parameter. The profile is then utilized to eliminate false positives and generate the final …

Classification With Hidden Markov Model, Badreddine Benyacoub, Souad Elbernoussi, Abdelhak Zoglat, Ismail El Moudden

Research and Infrastructure Service Enterprise (RISE) Faculty Publications

Classification and statistical learning by hidden markov model has achieved remarkable progress in the past decade. They have been applied in many areas like speech recognition and handwriting recognition. However, learning by Hidden Markov Model (HMM) is still restricted to supervised problems. In this paper, we propose a new learning method based on HMM techniques estimations, to built a model for classification. The approach consists of evaluation of the probability to belonging in one group, given the observations by a linear classifier. Our developed algorithm is based on discrete states and discrete observations cases of HMM. Experimental results show that …

A Hybrid Approach To Music Recommendation: Exploiting Collaborative Music Tags And Acoustic Features, Jaime C. Kaufman

UNF Graduate Theses and Dissertations

Recommendation systems make it easier for an individual to navigate through large datasets by recommending information relevant to the user. Companies such as Facebook, LinkedIn, Twitter, Netflix, Amazon, Pandora, and others utilize these types of systems in order to increase revenue by providing personalized recommendations. Recommendation systems generally use one of the two techniques: collaborative filtering (i.e., collective intelligence) and content-based filtering.

Systems using collaborative filtering recommend items based on a community of users, their preferences, and their browsing or shopping behavior. Examples include Netflix, Amazon shopping, and Last.fm. This approach has been proven effective due to increased popularity, and …

A Comparison Of Evidence Fusion Rules For Situation Recognition In Sensor-Based Environments, Susan Mckeever, Juan Ye

Conference papers

Dempster-Shafer (DS) theory, and its associated Dempster rule of combination, has been widely used to determine belief based on uncertain evi-dence sources. Variations to the original Dempster rule of combination have appeared in the literature to support particular scenarios where unreliable results may result from the use of original DS theory. While theoretical explanations of the rule variations are explained, there is a lack of empirical comparisons of the DS theory and its variations against real data sets. In this work, we examine several variations to DS theory. Using two real-world sensor data sets, we com-pare the performance of DS …

An Analysis Of Peer-To-Peer Distributed Hash Algorithms In Improving Fault Tolerance In The Hadoop Running Environment, Benjamin R. Knaus

Honors Theses

Cloud computing is a “new frontier” in the world of computing. One of the cloud architectures widely used is the Hadoop running environment. Hadoop consists of many parts—including MapReduce, TaskTrackers, and JobTrackers. Right now, there is no fault-tolerance for JobTrackers in Hadoop. This paper analyzes four different distributed hash algorithms (Pastry, Tapestry, CAN, and Chord) that could be implemented inside Hadoop to improve JobTracker fault-tolerance. We recommend Chord as the best suited for integration and improvement of Hadoop.

An Efficient Partial Shape Matching Algorithm For 3d Tooth Recognition, Zhiyuan Zhang, Xin Zhong, Sim Heng Ong, Kelvin W. C. Foong

Research Collection School Of Computing and Information Systems

As a new biometric strategy, tooth recognition has drawn much attention in recent years. However, most existing work focus mainly on 2D dental radiographs which are less informative and vulnerable to noise and pose variance. Although there are already several attempts on 3D tooth recognition, the results are still inaccurate and performance is inefficient. Moreover, existing methods cannot recognize precisely when the post-mortem data contains incomplete teeth. In this work, we propose an efficient and accurate partial shape matching algorithm to recognize 3D teeth for human identification. Given the ante-mortem and post-mortem teeth models which were taken from patients using …

Application Of Ntru Cryptographic Algorithm For Securing Scada Communication, Amritha Puliadi Premnath

UNLV Theses, Dissertations, Professional Papers, and Capstones

Supervisory Control and Data Acquisition (SCADA) system is a control system which is widely used in Critical Infrastructure System to monitor and control industrial processes autonomously. Most of the SCADA communication protocols are vulnerable to various types of cyber-related attacks. The currently used security standards for SCADA communication specify the use of asymmetric cryptographic algorithms like RSA or ECC for securing SCADA communications. There are certain performance issues with cryptographic solutions of these specifications when applied to SCADA system with real-time constraints and hardware limitations. To overcome this issue, in this thesis we propose the use of a faster and …

In Perfect Xen, A Performance Study Of The Emerging Xen Scheduler, Ryan Hnarakis

Master's Theses

Fifty percent of Fortune 500 companies trust Xen, an open-source bare-metal hypervisor, to virtualize their websites and mission critical services in the cloud. Providing superior fault tolerance, scalability, and migration, virtualization allows these companies to run several isolated operating systems simultaneously on the same physical server. These isolated operating systems, called virtual machines, require a virtual traffic guard to cooperate with one another. This guard known as the Credit2 scheduler along with the newest Xen hypervisor was recently developed to supersede the older schedulers. Since wasted CPU cycles can be costly, the Credit2 prototype must undergo significant performance validation before …

Object Detection Using Contrast Enhancement And Dynamic Noise Reduction, Justin Lee Baker

UNLV Theses, Dissertations, Professional Papers, and Capstones

Edge detection is one of the most important steps a computer must perform to gain understanding of an object in a digital image either from disk or from video feed. Edge detection allows for the computer to describe the shape of the objects in an image and create a pixel boundary defining what is considered part of an object, and what is not. Cannys edge detection algorithm is one of the most robust and accurate of these edge detection algorithms. However, as with many algorithms in image processing, there are many cases where the algorithm does not perform as well …

Algorithms For Grid Graphs In The Mapreduce Model, Taylor P. Spangler

School of Computing: Dissertations, Theses, and Student Research

The MapReduce programming paradigm has seen widespread use in analyzing large data sets. Often these large data sets can be formulated as graphs. Many algorithms, such as filtering based algorithms, are designed to work efficiently for dense graphs - graphs with substantially more number of edges than the number of vertices. These algorithms are not optimized for sparse graphs - graphs where the number of edges is of the same order as the number of vertices. However, sparse graphs are also common in big data sets. In this thesis we present algorithms for maximal matching, approximate edge covering, and approximate …

Consistent Stereo Image Editing, Tao Yan, Shengfeng He, Rynson W.H. Lau, Yun Xu

Research Collection School Of Computing and Information Systems

Stereo images and videos are very popular in recent years, and techniques for processing this media are attracting a lot of attention. In this paper, we extend the shift-map method for stereo image editing. Our method simultaneously processes the left and right images on pixel level using a global optimization algorithm. It enforces photo consistence between the two images and preserves 3D scene structures. It also addresses the occlusion and disocclusion problem, which may enable many stereo image editing functions, such as depth mapping, object depth adjustment and non-homogeneous image resizing. Our experiments show that the proposed method produces high …

Parallel Implementations Of The Frank-Wolfe Algorithms For The Traffic Assignment Problem, Shawn Eugene Allen

Computational Modeling & Simulation Engineering Theses & Dissertations

Transportation planners seek to understand how to best invest limited resources for future transportation network development. The traffic assignment problem is one algorithm of great importance to planners because it provides insight into how traffic will flow within the network. The Frank-Wolfe algorithm is a traditional solution method for this optimization problem, but it has been characterized by its slow rate of convergence and poor computational performance. This thesis examines and implements several modern advancements in this algorithm which are designed to improve the rate of convergence.

In addition to algorithm changes, another method to improve the performance of an …

Todmis: Mining Communities From Trajectories, Siyuan Liu, Shuhui Wang, Kasthuri Jayarajah, Archan Misra, Rammaya Krishnan

Research Collection School Of Computing and Information Systems

Existing algorithms for trajectory-based clustering usually rely on simplex representation and a single proximity-related distance (or similarity) measure. Consequently, additional information markers (e.g., social interactions or the semantics of the spatial layout) are usually ignored, leading to the inability to fully discover the communities in the trajectory database. This is especially true for human-generated trajectories, where additional fine-grained markers (e.g., movement velocity at certain locations, or the sequence of semantic spaces visited) can help capture latent relationships between cluster members. To address this limitation, we propose TODMIS: a general framework for Trajectory cOmmunity Discovery using Multiple Information Sources. TODMIS combines …

A Robust Rgbd Slam System For 3d Environment With Planar Surfaces, Po-Chang Su, Ju Shen, Sen-Ching S. Cheung

Computer Science Faculty Publications

With the increasing popularity of RGB-depth (RGB-D) sensors such as the Microsoft Kinect, there have been much research on capturing and reconstructing 3D environments using a movable RGB-D sensor. The key process behind these kinds of simultaneous location and mapping (SLAM) systems is the iterative closest point or ICP algorithm, which is an iterative algorithm that can estimate the rigid movement of the camera based on the captured 3D point clouds. While ICP is a well-studied algorithm, it is problematic when it is used in scanning large planar regions such as wall surfaces in a room. The lack of depth …

Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation, Pierpaolo Dondio

Articles

Given an argumentation framework – with a finite set of arguments and the attack relation identifying the graph – we study how the grounded labelling of a generic argument a varies in all the subgraphs of . Since this is an intractable problem of above-polynomial complexity, we present two non-naïve algorithms to find the set of all the subgraphs where the grounded semantic assigns to argument a specific label . We report the results of a series of empirical tests over graphs of increasing complexity. The value of researching the above problem is two-fold. First, knowing how an argument behaves …

Reaper – Toward Automating Mobile Cloud Communication, Daniel R. Ward

LSU New Orleans Theses and Dissertations

Mobile devices connected to cloud based services are becoming a mainstream method of delivery up-to-date and context aware information to users. Connecting mobile applications to cloud service require significant developer effort. Yet this communication code usually follows certain patterns, varying accordingly to the specific type of data sent and received from the server. By analyzing the causes of theses variations, we can create a system that can automate the code creation for communication from a mobile device to a cloud server. To automate code creation, a general pattern must extracted. This general solution can then be applied to any database …

Using Contracts To Guide The Search-Based Verification Of Concurrent Programs, Christopher M. Poskitt, Simon Poulding

Research Collection School Of Computing and Information Systems

Search-based techniques can be used to identify whether a concurrent program exhibits faults such as race conditions, deadlocks, and starvation: a fitness function is used to guide the search to a region of the program’s state space in which these concurrency faults are more likely occur. In this short paper, we propose that contracts specified by the developer as part of the program’s implementation could be used to provide additional guidance to the search. We sketch an example of how contracts might be used in this way, and outline our plans for investigating this verification approach.