Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Edge Based”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

WE-D-9A-04: Improving Multi-Modality Image Registration Using Edge-Based Transformations

Purpose: Multi-modality deformable image registration (DIR) for head and neck (HN) radiotherapy is difficult, particularly when matching computed tomography (CT) scans with magnetic resonance imaging (MRI) scans. We hypothesized that the ‘shared information’ between images of different modalities was to be found in some form of edge-based transformation, and that novel edge-based DIR methods might outperform standard DIR methods. Methods: We propose a novel method that combines gray-scale edge-based morphology and mutual information (MI) in two stages. In the first step, we applied a modification of a previously published mathematical morphology method as an efficient gray scale edge estimator, with denoising function. The results were fed into a MI-based solver (plastimatch). The method was tested on 5 HN patients with pretreatment CT and MR datasets and associated follow-up weekly MR scans. The followup MRs showed significant regression in tumor and normal structure volumes as compared to the pretreatment MRs. The MR images used in this study were obtained using fast spin echo based T2w images with a 1 mm isotropic resolution and FOV matching the CT scan. Results: In all cases, the novel edge-based registration method provided better registration quality than MI-based DIR using the original CT and MRI images. For example, the mismatch in carotid arteries was reduced from 3–5 mm to within 2 mm. The novel edge-based method with different registration regulation parameters did not show any distorted deformations as compared to the non-realistic deformations resulting from MI on the original images. Processing time was 1.3 to 2 times shorter (edge vs. non-edge). In general, we observed quality improvement and significant calculation time reduction with the new method. Conclusion: Transforming images to an ‘edge-space,’ if designed appropriately, greatly increases the speed and accuracy of DIR.

60 APPLIED LIFE SCIENCES↗

Enhancing Community Detection By Affinity-based Edge Weighting Scheme

Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is ideal for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.

97 MATHEMATICS AND COMPUTING↗

QoS-aware edge AI placement and scheduling with multiple implementations in FaaS-based edge computing

Resource constraints on the computing continuum require that we make smart decisions for serving AI-based services at the network edge. AI-based services typically have multiple implementations (e.g., image classification implementations include SqueezeNet, DenseNet, and others) with varying trade-offs (e.g., latency and accuracy). The question then is how should AI-based services be placed across Function-as-a-Service (FaaS) based edge computing systems in order to maximize total Quality-of-Service (QoS). To address this question, we propose a problem that jointly aims to solve (i) edge AI service placement and (ii) request scheduling. These are done across two time-scales (one for placement and one for scheduling). Here we first cast the problem as an integer linear program. We then decompose the problem into separate placement and scheduling subproblems and prove that both are NP-hard. We then propose a novel placement algorithm that places services while considering device-to-device communication across edge clouds to offload requests to one another. Our results show that the proposed placement algorithm is able to outperform a state-of-the-art placement algorithm for AI-based services, and other baseline heuristics, with regard to maximizing total QoS. Additionally, we present a federated learning-based framework, FLIES, to predict the future incoming service requests and their QoS requirements. Our results also show that our FLIES algorithm is able to outperform a standard decentralized learning baseline for predicting incoming requests and show comparable predictive performance when compared to centralized training.

97 MATHEMATICS AND COMPUTING↗

A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS

Existing approaches for allocating resources on edge environments are inefficient and lack the support of heterogeneous edge devices, which in turn fail to optimize the dependency on cloud infrastructures or datacenters. To this extent, we propose in this paper OpERA, a multi-layered edge-based resource allocation optimization framework that supports heterogeneous and seamless execution of offloadable tasks across edge, fog, and cloud computing layers and architectures. By capturing offloadable task requirements, OpERA is capable of identifying suitable resources within nearby edge or fog layers, thus optimizing the execution process. Throughout the paper, we present results which show the effectiveness of our proposed optimization strategy in terms of reducing costs, minimizing energy consumption, and promoting other residual gains in terms of processing computations, network bandwidth, and task execution time. We also demonstrate that by optimizing resource allocation in computation offloading, it is then possible to increase the likelihood of successful task offloading, particularly for computationally intensive tasks that are becoming integral as part of many IoT applications such robotic surgery, autonomous driving, smart city monitoring device grids, and deep learning tasks. The evaluation of our OpERA optimization algorithm reveals that the TOPSIS MCDM technique effectively identifies optimal compute resources for processing offloadable tasks, with a 96% success rate. Moreover, the results from our experiments with a diverse range of use cases show that our OpERA optimization strategy can effectively reduce energy consumption by up to 88%, and operational costs by 76%, by identifying relevant compute resources.

97 MATHEMATICS AND COMPUTING↗

Moisture ingress prediction in polyisobutylene-based edge seal with molecular sieve desiccant

Often photovoltaic modules are constructed with materials that are sensitive to water. This is most often the case with thin film technologies, including perovskite cells, where the active layers are a few microns thick and can be sensitive to moisture, liquid water or both. When moisture or liquid water can ingress, a small amount of water can lead to corrosion and depending on the resulting reactions, a larger local detrimental effect is possible. To prevent moisture from contacting photovoltaic components, impermeable frontsheets and backsheets are used with a polyisobutylene (PIB)-based edge seal material around the perimeter. Here, we evaluate the ability of a PIB-based edge seal using a molecular sieve desiccant to keep moisture out for the expected module lifetime. Moisture ingress is evaluated using test coupons where the edge seal is placed between 2 pieces of glass, one of which has a metallic calcium film on it, and monitoring the moisture ingress distance as a function of time. We expose samples to different temperature and humidity conditions to create permeation models useful for extrapolation to field use. This extrapolation indicates that this PIB material is capable of keeping moisture out of a module for the desired lifetime.

14 SOLAR ENERGY↗

High Performance Vertical GaN-on-GaN p-n Power Diodes With Hydrogen-Plasma-Based Edge Termination

This letter reports the first implementation of a hydrogen-plasma-based edge termination technique (HPET) in vertical GaN p-n power diodes grown on bulk GaN substrates using metalorganic chemical vapor deposition. The device with a 9-μm-thick drift layer exhibited a high breakdown voltage (V bd ) of 1.57 kV, a low ON-resistance (R ON ) of 0.45 mQ · cm 2 (or 0.70 mQ · cm 2 with current spreading considered) and a high Baliga's figure-of-merit (V $2\atop{bd}$/R ON ) of 5.5 GW/cm 2 (or 3.6 GW/cm 2 ) without passivation or field plate, which are close to the theoretical limit of GaN. This technique enabled a significant reduction in leakage current (~10 6 times at -300 V) and a huge enhancement in V bd (from ~300 V to 1.57 kV). Furthermore, the device showed good forward characteristics with a turn-ON voltage of 3.5 V, an ON-current of ~2 kA/cm 2 (or 1.3 kA/cm 2 ), an ON/OFF ratio of -10 9 , and an ideality factor of 1.4. This work shows the HPET can serve as an effective, low cost, and easy-to-implement edge termination technique for high voltage and high power GaN p-n power diodes.

36 MATERIALS SCIENCE↗

WiP Abstract: Edge-Based Privacy of Naturalistic Driving Data Collection

Collecting large driving datasets is important for data-driven transportation research and studied in naturalistic driving [3]. Due to the standard implementation of a Controller Area Network (CAN) bus for a vehicle’s inter-module communication, many off-the-shelf devices can easily transform a vehicle into a rich data collection utility [2]. Vehicles with Adaptive Cruise Control (ACC) are an example of a feature resulting in emergent traffic behavior when scaled [4]. While these utilities were designed with particular data use cases, data may be publicly shared to benefit other researchers through online tools like CyVerse [1]. However, such data should only be shared when any private information is removed. This private information may exist as a set of GPS coordinates, since the start and end points of a trip may designate a driver’s place of residence or work. When considering larger continuously-collected data sets with a focus on naturalistic driving, many drivers are needed to make data collection feasible. Removal of private information becomes much more of a challenge since every driver may uniquely define their geographic privacy. This project aims to build upon the foundation of libpanda [2] by adding features of edge-based data privacy enforcement. In it’s current form, libpanda uses a GPS in conjunction with a CAN interface to record data. Libpanda feature s a set of startup and shutdown scripts to perform automatic data collection and upload. With additional support hardware on a Raspberry Pi, the Pi can maintain power on vehicle shutdown to automatically upload data before shutdown.

Bunting, Matt↗

Deep Reinforcement Learning-Based Edge Caching in Wireless Networks

With the purpose to offload data traffic in wireless networks, content caching techniques have recently been studied intensively. Using these techniques and caching a portion of the popular files at the local content servers, the users can be served with less delay. Most of the content replacement policies are based on the content popularity, that depends on the users' preferences. In practice, such information varies over time. Therefore, an approach to determine the file popularity patterns must be incorporated into caching policies. In this context, we study content caching at the wireless network edge using a deep reinforcement learning framework with Wolpertinger architecture. In particular, we propose deep actor-critic reinforcement learning based policies for both centralized and decentralized content caching. For centralized edge caching, we aim at maximizing the cache hit rate. In decentralized edge caching, we consider both the cache hit rate and transmission delay as performance metrics. These proposed frameworks are assumed to neither have any prior information on the file popularities nor know the potential variations in such information. Via simulation results, the superiority of the proposed frameworks is verified by comparing them with other policies, including least frequently used (LFU), least recently used (LRU), and first-in-first-out (FIFO) policies.

42 ENGINEERING↗

Phase Segmentation in Atom-Probe Tomography Using Deep Learning-Based Edge Detection

Abstract Atom-probe tomography (APT) facilitates nano- and atomic-scale characterization and analysis of microstructural features. Specifically, APT is well suited to study the interfacial properties of granular or heterophase systems. Traditionally, the identification of the interface between, for precipitate and matrix phases, in APT data has been obtained either by extracting iso-concentration surfaces based on a user-supplied concentration value or by manually perturbing the concentration value until the iso-concentration surface qualitatively matches the interface. These approaches are subjective, not scalable, and may lead to inconsistencies due to local composition inhomogeneities. We introduce a digital image segmentation approach based on deep neural networks that transfer learned knowledge from natural images to automatically segment the data obtained from APT into different phases. This approach not only provides an efficient way to segment the data and extract interfacial properties but does so without the need for expensive interface labeling for training the segmentation model. We consider here a system with a precipitate phase in a matrix and with three different interface modalities—layered, isolated, and interconnected—that are obtained for different relative geometries of the precipitate phase. We demonstrate the accuracy of our segmentation approach through qualitative visualization of the interfaces, as well as through quantitative comparisons with proximity histograms obtained by using more traditional approaches.

47 OTHER INSTRUMENTATION↗

Accelerating data acquisition with FPGA-based edge machine learning: a case study with LCLS-II

New scientific experiments and instruments generate vast amounts of data that need to be transferred for storage or further processing, often overwhelming traditional systems. Edge machine learning (EdgeML) addresses this challenge by integrating machine learning (ML) algorithms with edge computing, enabling real-time data processing directly at the point of data generation. EdgeML is particularly beneficial for environments where immediate decisions are required, or where bandwidth and storage are limited. In this paper, we demonstrate a high-speed configurable ML model in a fully customizable EdgeML system using a field programmable gate array (FPGA). Our demonstration focuses on an angular array of electron spectrometers, referred to as the ‘CookieBox,’ developed for the Linac Coherent Light Source II project. The EdgeML system captures 51.2 Gbps from a 6.4 GS s −1 analog to digital converter and is designed to integrate data pre-processing and ML inside an FPGA. Our implementation achieves an inference latency of 0.2 µs for the ML model, and a total latency of 0.4 µs for the complete EdgeML system, which includes pre-processing, data transmission, digitization, and ML inference. The modular design of the system allows it to be adapted for other instrumentation applications requiring low-latency data processing.

97 MATHEMATICS AND COMPUTING↗

Plasma-based edge terminations for gallium nitride power devices

A p-n diode includes a first electrode, a n-GaN layer on the first electrode, a p-GaN layer on the n-GaN layer, and a second electrode on a first portion of the p-GaN layer. A region of the p-GaN layer surrounding the electrode is a passivated region. Treating a GaN power device having a p-GaN layer includes covering a portion of the p-GaN layer with a metal layer, exposing the p-GaN layer to a hydrogen plasma, and thermally annealing the p-GaN layer, thereby passivating a region of the p-GaN layer proximate the metal layer.

Zhao, Yuji↗

Multi-scale fusion algorithm of intensity and polarization-difference images based on edge information enhancement

To better integrate complementary and redundant information from different source images, improve the edge information, and facilitate the target detection. A multi-scale fusion algorithm of intensity and polarization-difference (PD) images based on edge information enhancement is proposed. Firstly, intensity images are obtained by the polarization information analysis method. PD images are obtained by the adaptive polarization-difference imaging approach based on the principle of minimum mutual information. Secondly, guided filter, affine transformations and Block-Matching and 3D filtering are embedded in visibility enhancement to improve the intensity and PD images. Thirdly, the two images are decomposed into high-frequency and low-frequency images by the dual-tree complex wavelet transform (DT-CWT). The high-frequency and low-frequency images are fused by the fusion rules based on edge detection and the regional variance matching degree respectively. Finally, the fusion image is obtained by the inverse DT-CWT. Experimental results demonstrate that fusion images of the proposed algorithm are significantly improved in information entropy, average gradient, and spatial frequency. Compared with the existing methods, it can achieve a better edge enhancement for images in a turbid medium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Intelligent Garbage Sorting System Based on Edge Computing and Visual Understanding of Social Internet of Vehicles

In order to enable Social Internet of Vehicles devices to achieve the purpose of intelligent and autonomous garbage classification in a public environment, while avoiding network congestion caused by a large amount of data accessing the cloud at the same time, it is therefore considered to combine mobile edge computing with Social Internet of Vehicles to give full play to mobile edge computing features of high bandwidth and low latency. At the same time, based on cutting-edge technologies such as deep learning, knowledge graph, and 5G transmission, the paper builds an intelligent garbage sorting system based on edge computing and visual understanding of Social Internet of Vehicles. First of all, for the massive multisource heterogeneous Social Internet of Vehicles big data in the public environment, different item modal data adopts different processing methods, aiming to obtain a visual understanding model. Secondly, using the 5G network, the model is deployed on the edge device and the cloud for cloud-side collaborative management, aiming to avoid the waste of edge node resources, while ensuring the data privacy of the edge node. Finally, the Social Internet of Vehicles devices is used to make intelligent decision-making on the big data of the items. First, the items are judged as garbage, and then the category is judged, and finally the task of grabbing and sorting is realized. The experimental results show that the system proposed in this paper can efficiently process the big data of Social Internet of Vehicles and make valuable intelligent decisions. At the same time, it also has a certain role in promoting the promotion of Social Internet of Vehicles devices.

Shen, Xuehao↗

An identity privacy scheme for blockchain‐based on edge computing

Abstract Blockchain has decentralization characteristics and requires more targeted security schemes to protect user privacy. In contrast, existing signature schemes have many high‐complexity operations and impose an enormous computational burden on wireless nodes. This article proposes a light‐weighted identity privacy scheme for blockchain‐based on edge computing. We construct linkable identity privacy and non‐linkable identity privacy, which can resist collusion attacks while virtually guaranteeing blockchain nodes' identity privacy. Since edge computing offloads heavily, the proposed scheme has lower computational complexity than the existing techniques.

Mu, Rui↗

An Iris Segmentation Algorithm based on Edge Orientation for Off-angle Iris Recognition

Iris recognition is known as one of the most accurate and reliable biometrics. However, the accuracy of iris recognition systems depends on the quality of data capture and is negatively affected by several factors such as angle, occlusion, and dilation. In this paper, we present a segmentation algorithm for off-angle iris images that uses edge detection, edge elimination, edge classification, and ellipse fitting techniques. In our approach, we first detect all candidate edges in the iris image by using the canny edge detector; this collection contains edges from the iris and pupil boundaries as well as eyelash, eyelids, iris texture etc. Edge orientation is used to eliminate the edges that cannot be part of the iris or pupil. Then, we classify the remaining edge points into two sets as pupil edges and iris edges. Finally, we randomly generate subsets of iris and pupil edge points, fit ellipses for each subset, select ellipses with similar parameters, and average to form the resultant ellipses. Based on the results from real experiments, the proposed method shows effectiveness in segmentation for off-angle iris images.

Karakaya, Mahmut↗