Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- 3D Scanning (1)
- 3d (1)
- Algorithm development (1)
- Algorithms (1)
- Arm (1)
-
- Assessment (1)
- Autonomous (1)
- Biomedicine (1)
- Centralized (1)
- Clothing (1)
- Computer engineering (1)
- Cooperative (1)
- Current controlled current source (1)
- Databases (1)
- Detection and tracking algorithms (1)
- Environmental Conditions (1)
- Fusion (1)
- Gps-denied (1)
- Image Processing (1)
- Impact (1)
- Integrated circuits -- Design and construction (1)
- Lithium (1)
- Map (1)
- Multiple (1)
- Onboard (1)
- Poisson compressed sensing; positron emission tomography (1)
- Principal component analysis (1)
- Rgb-d (1)
- Robot (1)
- Ros (1)
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Theory and Algorithms
Projected Nesterov’S Proximal-Gradient Signal Recovery From Compressive Poisson Measurements, Renliang Gu, Aleksandar Dogandžić
Projected Nesterov’S Proximal-Gradient Signal Recovery From Compressive Poisson Measurements, Renliang Gu, Aleksandar Dogandžić
Aleksandar Dogandžić
We develop a projected Nesterov’s proximal-gradient (PNPG) scheme for reconstructing sparse signals from compressive Poisson-distributed measurements with the mean signal intensity that follows an affine model with known intercept. The objective function to be minimized is a sum of convex data fidelity (negative log-likelihood (NLL)) and regularization terms. We apply sparse signal regularization where the signal belongs to a nonempty closed convex set within the domain of the NLL and signal sparsity is imposed using total-variation (TV) penalty. We present analytical upper bounds on the regularization tuning constant. The proposed PNPG method employs projected Nesterov’s acceleration step, function restart, and …
Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni
Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni
Dissertations and Theses
This research presents a methodology to evaluate data path topologies that implement a conditional statement for an average-case performance that is better than the worst-case performance. A conditional statement executes one of many alternatives depending on how Boolean conditions evaluate to true or false. Alternatives with simple computations take less time to execute. The self-timed designs can exploit the faster executing alternatives and provide an average-case behavior, where the average depends on the frequency of simple and complex computations, and the difference in the completion times of simple and complex computations. The frequency of simple and complex computations depends on …
State Preserving Extreme Learning Machine For Face Recognition, Md. Zahangir Alom, Paheding Sidike, Vijayan K. Asari, Tarek M. Taha
State Preserving Extreme Learning Machine For Face Recognition, Md. Zahangir Alom, Paheding Sidike, Vijayan K. Asari, Tarek M. Taha
Electrical and Computer Engineering Faculty Publications
Extreme Learning Machine (ELM) has been introduced as a new algorithm for training single hidden layer feed-forward neural networks (SLFNs) instead of the classical gradient-based algorithms. Based on the consistency property of data, which enforce similar samples to share similar properties, ELM is a biologically inspired learning algorithm with SLFNs that learns much faster with good generalization and performs well in classification applications. However, the random generation of the weight matrix in current ELM based techniques leads to the possibility of unstable outputs in the learning and testing phases. Therefore, we present a novel approach for computing the weight matrix …
Cooperative 3-D Map Generation Using Multiple Uavs, Andrew Erik Lawson
Cooperative 3-D Map Generation Using Multiple Uavs, Andrew Erik Lawson
University Scholar Projects
This report aims to demonstrate the feasibility of building a global 3-D map from multiple UAV robots in a GPS-denied, indoor environment. Presented are the design of each robot and the reasoning behind choosing its hardware and software components, the process in which a single robot obtains a individual 3-D map entirely onboard, and lastly how the mapping concept is extended to multiple robotic agents to form a global 3-D map using a centralized server. In the latter section, this report focuses on two algorithms, Online Mapping and Map Fusion, developed to facilitate the cooperative approach. A limited selection …
Assessment Of The Impact Of Clothing And Environmental Conditions On Visible Light 3d Scanning, Pann Ajjimaporn, Jeremy Straub, Scott Kerlin
Assessment Of The Impact Of Clothing And Environmental Conditions On Visible Light 3d Scanning, Pann Ajjimaporn, Jeremy Straub, Scott Kerlin
Jeremy Straub
The quality of models produced by visible light 3D scanners is influenced by multiple factors. To max-imize model accuracy and detail levels, the correct combination of lighting texture, subject posture and software usage must be selected. The work described herein has been performed to measure the effect of different lighting and envi-ronmental conditions on human 3D scanning results.
Efficient Thermal Image Segmentation Through Integration Of Nonlinear Enhancement With Unsupervised Active Contour Model, Fatema Albalooshi, Evan Krieger, Paheding Sidike, Vijayan K. Asari
Efficient Thermal Image Segmentation Through Integration Of Nonlinear Enhancement With Unsupervised Active Contour Model, Fatema Albalooshi, Evan Krieger, Paheding Sidike, Vijayan K. Asari
Electrical and Computer Engineering Faculty Publications
Thermal images are exploited in many areas of pattern recognition applications. Infrared thermal image segmentation can be used for object detection by extracting regions of abnormal temperatures. However, the lack of texture and color information, low signal-to-noise ratio, and blurring effect of thermal images make segmenting infrared heat patterns a challenging task. Furthermore, many segmentation methods that are used in visible imagery may not be suitable for segmenting thermal imagery mainly due to their dissimilar intensity distributions.
Thus, a new method is proposed to improve the performance of image segmentation in thermal imagery. The proposed scheme efficiently utilizes nonlinear intensity …
Gaussian Weighted Neighborhood Connectivity Of Nonlinear Line Attractor For Learning Complex Manifolds, Theus H. Aspiras, Vijayan K. Asari, Wesam Sakla
Gaussian Weighted Neighborhood Connectivity Of Nonlinear Line Attractor For Learning Complex Manifolds, Theus H. Aspiras, Vijayan K. Asari, Wesam Sakla
Electrical and Computer Engineering Faculty Publications
The human brain has the capability to process high quantities of data quickly for detection and recognition tasks. These tasks are made simpler by the understanding of data, which intentionally removes redundancies found in higher dimensional data and maps the data onto a lower dimensional space. The brain then encodes manifolds created in these spaces, which reveal a specific state of the system. We propose to use a recurrent neural network, the nonlinear line attractor (NLA) network, for the encoding of these manifolds as specific states, which will draw untrained data towards one of the specific states that the NLA …
Adaptive Graph Construction For Isomap Manifold Learning, Loc Tran, Zezhong Zheng, Guoquing Zhou, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)
Adaptive Graph Construction For Isomap Manifold Learning, Loc Tran, Zezhong Zheng, Guoquing Zhou, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)
Electrical & Computer Engineering Faculty Publications
Isomap is a classical manifold learning approach that preserves geodesic distance of nonlinear data sets. One of the main drawbacks of this method is that it is susceptible to leaking, where a shortcut appears between normally separated portions of a manifold. We propose an adaptive graph construction approach that is based upon the sparsity property of the ℓ1 norm. The ℓ1 enhanced graph construction method replaces k-nearest neighbors in the classical approach. The proposed algorithm is first tested on the data sets from the UCI data base repository which showed that the proposed approach performs better than …