Theory and Algorithms Commons^™

Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang

Research Collection School Of Computing and Information Systems

The exponential growth of online videos, along with increasing user involvement in video-related activities, has been observed as a constant phenomenon during the last decade. User's time spent on video capturing, editing, uploading, searching, and viewing has boosted to an unprecedented level. The massive publishing and sharing of videos has given rise to the existence of an already large amount of near-duplicate content. This imposes urgent demands on near-duplicate video retrieval as a key role in novel tasks such as video search, video copyright protection, video recommendation, and many more. Driven by its significance, near-duplicate video retrieval has recently attracted …

Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch

Research Collection School Of Computing and Information Systems

Despite the advantages of fast and stable learning, Adaptive Resonance Theory (ART) still relies on an empirically fixed vigilance parameter value to determine the vigilance regions of all of the clusters in the category field (F 2 ), causing its performance to depend on the vigilance value. It would be desirable to use different values of vigilance for different category field nodes, in order to fit the data with a smaller number of categories. We therefore introduce two methods, the Activation Maximization Rule (AMR) and the Confliction Minimization Rule (CMR). Despite their differences, both ART with AMR (AM-ART) and with …

Applying Search In An Automatic Contract-Based Testing Tool, Alexey Kolesnichenko, Christopher M. Poskitt, Bertrand Meyer

Research Collection School Of Computing and Information Systems

Automated random testing has been shown to be effective at finding faults in a variety of contexts and is deployed in several testing frameworks. AutoTest is one such framework, targeting programs written in Eiffel, an object-oriented language natively supporting executable pre- and postconditions; these respectively serving as test filters and test oracles. In this paper, we propose the integration of search-based techniques—along the lines of Tracey—to try and guide the tool towards input data that leads to violations of the postconditions present in the code; input data that random testing alone might miss, or take longer to find. Furthermore, we …

An Empirical Analysis Of A Network Of Expertise, Le Truc Viet, Minh Thap Nguyen

Research Collection School Of Computing and Information Systems

In this paper, we analyze the network of expertise constructed from the interactions of users on the online questionanswering (QA) community of Stack Overflow. This community was built with the intention of helping users with their programming tasks and, thus, questions are expected to be highly factual. This also indicates that the answers one provides may be highly indicative of one's level of expertise on the subject matter. Therefore, our main concern is how to model and characterize the user's expertise based on the constructed network and its centrality measures. We used the user's reputation established on Stack Overflow as …

Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models, Siyuan Liu, Yisong Yue, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

We consider the problem of adaptively routing a fleet of cooperative vehicles within a road network in the presence of uncertain and dynamic congestion conditions. To tackle this problem, we first propose a Gaussian Process Dynamic Congestion Model that can effectively characterize both the dynamics and the uncertainty of congestion conditions. Our model is efficient and thus facilitates real-time adaptive routing in the face of uncertainty. Using this congestion model, we develop an efficient algorithm for non-myopic adaptive routing to minimize the collective travel time of all vehicles in the system. A key property of our approach is the ability …

Optimization Of Solar Cell Arrays Using The Fibonacci Search Algorithm, Felicia Tyyan Farrow

Electrical & Computer Engineering Theses & Dissertations

In our energy hungry world, there is a growing demand to develop creative mechanisms to extract, conserve, and use energy from different resources. The use of solar cells to extract and convert solar energy into electrical energy is a growing and popular field of study because solar energy is clean, free, and renewable. One limitation for photovoltaic (PU) or solar technology is its loss in efficiency and availability as a result of shading or partial shading. Shading or partial shading decreases the total capable output power that the PV system can produce because the array is receiving irradiation from the …

Linear Programming Algorithm With Mixed Real-Integer Variables In Matlab Environments, Gelareh Bakhtyar

Civil & Environmental Engineering Theses & Dissertations

Efficient numerical procedures for solving general Linear Programming (LP) problems with mixed real-integer variables are developed in this work. The proposed algorithms employ the revised dual simplex with Branch and Bound (B&B) algorithms, with special procedures for limited search of subsequent branches. Computational time can be significantly reduced by incorporating the updated inverse formulas into the developed procedures. Both generic LP problems and deterministic pavement maintenance and rehabilitation (M&R) problems are used in this study to vaiidate the developed procedures. Medium to large-scale examples ( 11 pavement M&R) presented in this work have demonstrated that the developed numerical procedures consistently …

Guidance In Feature Extraction To Resolve Uncertainty, Boris Kovalerchuk, Michael Kovalerchuk, Simon Streltsov, Matthew Best

Computer Science Faculty Scholarship

Automated Feature Extraction (AFE) plays a critical role in image understanding. Often the imagery analysts extract features better than AFE algorithms do, because analysts use additional information. The extraction and processing of this information can be more complex than the original AFE task, and that leads to the “complexity trap”. This can happen when the shadow from the buildings guides the extraction of buildings and roads. This work proposes an AFE algorithm to extract roads and trails by using the GMTI/GPS tracking information and older inaccurate maps of roads and trails as AFE guides.

Protocases, Christopher M. Polis

Computer Engineering

Design and implementation of a 3D printing web application.

Integrated Collision Avoidance System Sensor Evaluation Final Design Project, Alex F. Graebe, Bridgette S. Kimball, Drew T. Lavoise

Mechanical Engineering

Following the development of Aircraft Collision Avoidance Technology (ACAT) by the National Aeronautics and Space Administration (NASA), a need arose to transition the life-saving technology to aid the general aviation community. Considering the realistic cost of implementation, it was decided that the technology should be adapted to function on any smartphone, using that device as an end-to-end solution to sense, process, and alert the pilot to imminent threats. In September of 2012, the SAS (Sense and Survive) Senior Project Team at California Polytechnic University (Cal Poly), San Luis Obispo was assigned the task of using smartphone technology to accurately sense …

Understanding Sequential Decisions Via Inverse Reinforcement Learning, Siyuan Liu, Miguel Araujo, Emma Brunskill, Rosaldo Rossetti, Joao Barros, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

The execution of an agent's complex activities, comprising sequences of simpler actions, sometimes leads to the clash of conflicting functions that must be optimized. These functions represent satisfaction, short-term as well as long-term objectives, costs and individual preferences. The way that these functions are weighted is usually unknown even to the decision maker. But if we were able to understand the individual motivations and compare such motivations among individuals, then we would be able to actively change the environment so as to increase satisfaction and/or improve performance. In this work, we approach the problem of providing highlevel and intelligible descriptions …

Visual Tracking Via Locality Sensitive Histograms, Shengfeng He, Qingxiong Yang, Rynson W.H. Lau, Jian Wang, Ming-Hsuan Yang

Research Collection School Of Computing and Information Systems

This paper presents a novel locality sensitive histogram algorithm for visual tracking. Unlike the conventional image histogram that counts the frequency of occurrences of each intensity value by adding ones to the corresponding bin, a locality sensitive histogram is computed at each pixel location and a floating-point value is added to the corresponding bin for each occurrence of an intensity value. The floating-point value declines exponentially with respect to the distance to the pixel location where the histogram is computed, thus every pixel is considered but those that are far away can be neglected due to the very small weights …

Iterative Statistical Verification Of Probabilistic Plans, Colin M. Potts

Lawrence University Honors Projects

Artificial intelligence seeks to create intelligent agents. An agent can be anything: an autopilot, a self-driving car, a robot, a person, or even an anti-virus system. While the current state-of-the-art may not achieve intelligence (a rather dubious thing to quantify) it certainly achieves a sense of autonomy. A key aspect of an autonomous system is its ability to maintain and guarantee safety—defined as avoiding some set of undesired outcomes. The piece of software responsible for this is called a planner, which is essentially an automated problem solver. An advantage computer planners have over humans is their ability to consider and …

Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala

UNLV Theses, Dissertations, Professional Papers, and Capstones

The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q₂||C_max. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q₂||C_max using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T²) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is …

Detecting Student Dropouts Using Fuzzy Inferencing, Shahriar Husainy

Theses and Dissertations

Fuzzy logic provides a methodology for reasoning using imprecise rules and assertions. Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. The mapping then provides a basis from which decisions can be made, or patterns discerned. This study concerns the development of a Fuzzy Inference System (FIS) for identifying likely student dropouts at Columbus State University (CSU). The fuzzy inference based model uses a hybrid knowledge extraction process to predict how likely each freshman student will be to drop their program of study at the end of their first semester. …

Real Time Digital Night Vision Using Nonlinear Contrast Enhancement, Nishikar Sapkota

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis describes a nonlinear contrast enhancement technique to implement night vision in digital video. It is based on the global histogram equalization algorithm. First, the effectiveness of global histogram equalization is examined for images taken in low illumination environments in terms of Peak signal to noise ratio (PSNR) and visual inspection of images. Our analysis establishes the existence of an optimum intensity for which histogram equalization yields the best results in terms of output image quality in the context of night vision. Based on this observation, an incremental approach to histogram equalization is developed which gives better results than …

Calibration Of Traffic Flow Models, Victor Molano

College of Engineering: Graduate Celebration Programs

This study proposes a methodology to calibrate microscopic traffic flow simulation models. A Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm searches for the set of model parameters that minimizes the difference between actual and simulated values

Fast Sobel Edge Detection Using Parallel Pipeline-Based Architecture On Fpga, Mohammad Shokrolah Shirazi, Brendan Morris

College of Engineering: Graduate Celebration Programs

Implementing image processing algorithms on FPGA has recently become more popular since it provides high speed in comparison with software-based approaches. In this paper, we have presented fast pipeline-based architecture for one of the most popular edge detection algorithms called Sobel edge detection. The objective of our work is to present two fast pipeline-based architectures for Sobel edge detection on FPGA benefiting one and two way parallelism. We used Verilog language to implement our designs and we synthesized each one for Cyclone IV FPGA. Experimental results show that our pipeline-based architectures perform edge detection process more than 379 and 751 …

On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu

College of Engineering: Graduate Celebration Programs

Decimal computations are required in finance, and etc.

• Precise representation for decimals (E.g. 0.2, 0.7… )
• Performance Requirements (Software simulations are very slow)

Image Processing Algorithms For Improving Planetary Exploration And Understanding, Ali Pouryazdanpanah

College of Engineering: Graduate Celebration Programs

• To design a fully automated tool-set that allows to detect and extract the sky region in planetary images.

• To develop the new method for rock segmentation in planetary stereo images.
• To develop the new method for shadow detection in planetary images