Search NASA⌕ Search

SEARCH · Search NASA

Results for “convolution”

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 73 records · Page 4

Impedance-Aware Graph Convolutional Networks for Voltage Estimation in Active Distribution Networks

Voltage estimation plays a key role in ensuring the effective control and reliability of distribution networks. However, traditional machine learning methods often fail to capture the details of the distribution network’s topology. To overcome this challenge, graph convolutional networks (GCN) have emerged as an alternative. Graph convolutional networks inherently capture the topology of the grid, utilizing correlations to achieve precise voltage estimation. Other machine learning models and conventional GCNs fail to account for the distribution line characteristics found in the real world, limiting their effectiveness. This paper proposes an advanced variant of GCN called the Impedance-Aware Graph Convolutional Network (IA-GCN). The IA-GCN layer incorporates the magnitude of the impedance into the graph convolution mechanism, allowing it to capture topological nuances and provide valuable insights into node interrelationships by considering impedance as an intrinsic dimension. The performance of the IA-GCN layer is then compared with that of GCN and GraphSAGE layers through a surrogate model for voltage estimation. The performance analysis demonstrates that IA-GCN outperforms GCN by reducing the MAE by 87.55% and improving the R-squared value by 98%.

Ravi, Abhijith↗

SU-E-T-328: The Volume Effect Correction of Probe-Type Dosimetric Detectors Derived From the Convolution Model

Purpose: To derive and introduce a new correction factor kV, the “volume effect correction factor”, that accounts for not only the dose averaging over the detector's sensitive volume but also the secondary electron generation and transport inclusive of the disturbance of the field of secondary electrons within the detector. Materials and Methods: Mathematical convolutions and Fourier's convolution theorem have been used. Monte Carlo simulations of photon pencil beams were performed using EGSnrc. Detector constructions were adapted from manufacturers' information. Results: For the calculation of kV, the three basic convolution kernels have to be taken into account: the dose deposition kernel KD(x) (fluence to dose), the photon fluence response kernel KM(x) (photon fluence to detector signal) and the “dose response kernel” K(x) (dose to detector signal). K(x) is calculated from FT[K(x)] = [1/sqrt(2”)]FT[KM(x)]/FT[KD(x)], where the magnitude of kV(x) can be thereby calculated for arbitrary photon beam profiles and the areanormalized K(x). Conclusions: n order to take into account for the dimensions of dosimetric detectors in narrow photon beams, the “volume effect correction factor” kV has been introduced into the fundamental equation of probe-type dosimetry, and the convolution method has proven to be a method for the derivation of its numerical values. For narrow photon beams, whose width is comparable to the secondary electron ranges, kV can reach very high values, but it can be shown that the signals of small diamond detectors are well representing the absorbed dose to water averaged over the detector volume.

07 ISOTOPE AND RADIATION SOURCES↗

SU-E-T-607: An Experimental Validation of Gamma Knife Based Convolution Algorithm On Solid Acrylic Anthropomorphic Phantom

Purpose: To perform dosimetric evaluation of convolution algorithm in Gamma Knife (Perfexion Model) using solid acrylic anthropomorphic phantom. Methods: An in-house developed acrylic phantom with ion chamber insert was used for this purpose. The middle insert was designed to fit ion chamber from top(head) as well as from bottom(neck) of the phantom, henceforth measurement done at two different positions simultaneously. Leksell frame fixed to phantom simulated patient treatment. Prior to dosimetric study, hounsfield units and electron density of acrylic material were incorporated into the calibration curve in the TPS for convolution algorithm calculation. A CT scan of phantom with ion chamber (PTW Freiberg, 0.125cc) was obtained with following scanning parameters: Tube voltage-110kV, Slice thickness-1mm and FOV-240mm. Three separate single shot plans were generated in LGP TPS (Version 10.1.) with collimators 16mm, 8mm and 4mm respectively for both ion chamber positions. Both TMR10 and Convolution algorithm based planning (CABP) were used for dose calculation. A dose of 6Gy at 100% isodose was prescribed at centre of ion chamber visible in the CT scan. The phantom with ion chamber was positioned in the treatment couch for dose delivery. Results: The ion chamber measured dose was 5.98Gy for 16mm collimator shot plan with less than 1% deviation for convolution algorithm whereas with TMR10 measured dose was 5.6Gy. For 8mm and 4mm collimator plan merely a dose of 3.86Gy and 2.18Gy respectively were delivered at TPS calculated time for CABP. Conclusion: CABP is expected to perform accurate prediction of time for dose delivery for all collimators, but significant variation in measured dose was observed for 8mm and 4mm collimator which may be due collimator size effect. Effect of metal artifacts caused by pins and frame on the CT scan also may have role in misinterpreting CABP. The study carried out requires further investigation.

07 ISOTOPE AND RADIATION SOURCES↗

SU-E-T-31: A Fast Finite Size Pencil Beam (FSPB) Convolution Algorithm for a New Co-60 Arc Therapy Machine

Purpose: Present a fast Finite Size Pencil Beam (FSPB) convolution algorithm for a new Co-60 arc therapy machine. The FSPB algorithm accounts for (i) strong angular divergence (short SAD), (ii) heterogeneity effect for primary attenuation, and (iii) source energy spectrum. Methods: The FSPB algorithm is based on a 0.5×0.5-cm2 dose kernel calculated using the GEPTS (Gamma Electron and Positron Transport System) Monte Carlo code. The dose kernel is tabulated using a thin XYZ mesh (0.1 mm steps in lateral directions) for radius less than 1 cm and using an RZ mesh (with varying steps) for larger radial distance. To account for SSD effect, 11 dose kernels with SSDs varying between 30 cm to 80 cm are calculated. Maynord factor and “lateral stretching” are applied to account for differences between closest and actual SSD. Appropriate rotations and second order interpolation are used to calculate the dose from a given beamlet to a point. Results: Accuracy: Dose distributions in water with 80 cm SSD are calculated using the new FSPB convolution algorithm and full Monte Carlo simulation (gold standard). Figs 1–4 show excellent agreements between FSPB and Monte Carlo calculations for different field sizes and at different depths. The dose distribution for a prostate case is calculated using FSPB (Fig.5). Sixty conformal beams with rectum blocking are assumed. Figs 6–8 show the comparison with Monte Carlo simulation based on the same beam apertures. The excellent agreement demonstrates the accuracy of the new algorithm in handling SSD variation, oblique incidence, and scatter contribution.Speed: The FSPB convolution algorithm calculates 28 million dose points per second using a single 2.2-GHz CPU. The present algorithm is seven times faster than a similar algorithm from Gu et al. (Phys. Med. Biol. 54, 2009, 6287–6297). Conclusion: A fast and accurate FSPB convolution algorithm was developed and benchmarked.

60 APPLIED LIFE SCIENCES↗

Comparison of convolutional and block code performance on the Rician channel

The paper is concerned with the relative performance of short constraint length convolutional codes vis-a-vis block codes when used in conjunction with either BPSK or DPSK modulation on the classical Rician fading channel. A variety of soft-decision decoding algorithms is considered for block codes while the Viterbi algorithm is used exclusively for decoding convolutional codes. Results indicate a substantial performance/complexity advantage in favor of short constraint length convolutional codes and Viterbi decoding which increases with fading severity. The work reported here extends the well-known performance advantage of convolutional codes on the AWGN channel to representative fading channels.

Mui, S. Y.↗

A parallel-pipeline architecture of the fast polynomial transform for computing a two-dimensional cyclic convolution

It is pointed out that the two-dimensional cyclic convolution is a useful tool for many two-dimensional digital signal processing applications. Two important applications are related to spaceborne high-resolution synthetic aperture radar (SAR) processing and image processing. Nussbaumer and Quandalle (1978) showed that a radix-2 polynomial transform analogous to the conventional radix-2 FFT algorithm can be used to compute a two-dimensional cyclic convolution. On the basis of results reported by Arambepola and Rayner (1979), a radix-2 polynomial transform can be defined to compute a multidimensional cyclic convolution. Truong et al. (1981) used the considered ideas together with the Chinese Theorem to further reduce the complexity of the radix-2 fast polynomial transform (FPT). Reed et al. (1981) demonstrated that such a new FPT algorithm is significantly faster than the FFT algorithm for computing a two-dimensional convolution. In the present investigation, a parallel-pipeline architecture is considered for implementing the FPT developed by Truong et al.

Truong, T. K.↗

Parallel architectures for computing cyclic convolutions

In the paper two parallel architectural structures are developed to compute one-dimensional cyclic convolutions. The first structure is based on the Chinese remainder theorem and Kung's pipelined array. The second structure is a direct mapping from the mathematical definition of a cyclic convolution to a computational architecture. To compute a d-point cyclic convolution the first structure needs d/2 inner product cells, while the second structure and Kung's linear array require d cells. However, to compute a cyclic convolution, the second structure requires less time than both the first structure and Kung's linear array. Another application of the second structure is to multiply a Toeplitz matrix by a vector. A table is listed to compare these two structures and Kung's linear array. Both structures are simple and regular and are therefore suitable for VLSI implementation.

Yeh, C.-S.↗

Convoluted nozzle design for the RL10 derivative 2B engine

The convoluted nozzle is a conventional refractory metal nozzle extension that is formed with a portion of the nozzle convoluted to show the extendible nozzle within the length of the rocket engine. The convoluted nozzle (CN) was deployed by a system of four gas driven actuators. For spacecraft applications the optimum CN may be self-deployed by internal pressure retained, during deployment, by a jettisonable exit closure. The convoluted nozzle is included in a study of extendible nozzles for the RL10 Engine Derivative 2B for use in an early orbit transfer vehicle (OTV). Four extendible nozzle configurations for the RL10-2B engine were evaluated. Three configurations of the two position nozzle were studied including a hydrogen dump cooled metal nozzle and radiation cooled nozzles of refractory metal and carbon/carbon composite construction respectively.

Source record↗

Some easily analyzable convolutional codes

Convolutional codes have played and will play a key role in the downlink telemetry systems on many NASA deep-space probes, including Voyager, Magellan, and Galileo. One of the chief difficulties associated with the use of convolutional codes, however, is the notorious difficulty of analyzing them. Given a convolutional code as specified, say, by its generator polynomials, it is no easy matter to say how well that code will perform on a given noisy channel. The usual first step in such an analysis is to computer the code's free distance; this can be done with an algorithm whose complexity is exponential in the code's constraint length. The second step is often to calculate the transfer function in one, two, or three variables, or at least a few terms in its power series expansion. This step is quite hard, and for many codes of relatively short constraint lengths, it can be intractable. However, a large class of convolutional codes were discovered for which the free distance can be computed by inspection, and for which there is a closed-form expression for the three-variable transfer function. Although for large constraint lengths, these codes have relatively low rates, they are nevertheless interesting and potentially useful. Furthermore, the ideas developed here to analyze these specialized codes may well extend to a much larger class.

Mceliece, R.↗

A simulation study of the performance of the NASA (2,1,6) convolutional code on RFI/burst channels

In an earlier report, the LINKABIT Corporation studied the performance of the (2,1,6) convolutional code on the radio frequency interference (RFI)/burst channel using analytical methods. Using an R(sub 0) analysis, the report concluded that channel interleaving was essential to achieving reliable performance. In this report, Monte Carlo simulation techniques are used to study the performance of the convolutional code on the RFI/burst channel in more depth. The basic system model under consideration is shown. The convolutional code is the NASA standard code with generators g(exp 1) = 1+D(exp 2)+D(exp 3)+D(exp 5)+D(exp 6) and g(exp 2) = 1+D+D(exp 2)+D(exp 3)+D(exp 6) and d(sub free) = 10. The channel interleaver is of the convolutional or periodic type. The binary output of the channel interleaver is transmitted across the channel using binary phase shift keying (BPSK) modulation. The transmitted symbols are corrupted by an RFI/burst channel consisting of a combination of additive white Gaussian noise (AWGN) and RFI pulses. At the receiver, a soft-decision Viterbi decoder with no quantization and variable truncation length is used to decode the deinterleaved sequence.

Perez, Lance C.↗

Application of the Convolution Formalism to the Ocean Tide Potential: Results from the Gravity and Recovery and Climate Experiment (GRACE)

A computationally efficient approach to reducing omission errors in ocean tide potential models is derived and evaluated using data from the Gravity Recovery and Climate Experiment (GRACE) mission. Ocean tide height models are usually explicitly available at a few frequencies, and a smooth unit response is assumed to infer the response across the tidal spectrum. The convolution formalism of Munk and Cartwright (1966) models this response function with a Fourier series. This allows the total ocean tide height, and therefore the total ocean tide potential, to be modeled as a weighted sum of past, present, and future values of the tide-generating potential. Previous applications of the convolution formalism have usually been limited to tide height models, but we extend it to ocean tide potential models. We use luni-solar ephemerides to derive the required tide-generating potential so that the complete spectrum of the ocean tide potential is efficiently represented. In contrast, the traditionally adopted harmonic model of the ocean tide potential requires the explicit sum of the contributions from individual tidal frequencies. It is therefore subject to omission errors from neglected frequencies and is computationally more intensive. Intersatellite range rate data from the GRACE mission are used to compare convolution and harmonic models of the ocean tide potential. The monthly range rate residual variance is smaller by 4-5%, and the daily residual variance is smaller by as much as 15% when using the convolution model than when using a harmonic model that is defined by twice the number of parameters.

models↗

A Convolutional Neural Network for Enhancement of Multi-Scale Localization in Granular Metallic Representative Unit Cells

A convolutional neural network was used to enhance the localization of strain and stress for a generalized method of cells model of a metallic microstructure. Enhanced shear strains, measured in terms of the linear regression coefficients as a function of ground truth strains, were improved from inaccurate and uncorrelated (slope=0.003, Rsq=0.000) to accurate and well correlated (slope=0.890, Rsq=0.882) relative to ground truth (slope=1.0, Rsq=1.0). In applying the convolutional neural network, a convolutional stride of 1.0 (padding=’same’) was only modestly effective while strides of 2 or 3 were more effective yet at higher cost. Additional convolutional layers were generally more expensive than additional dense layers, often with limited benefit. The accuracy of enhanced localized shear strains and stress is expected to yield benefits for damage progression models, especially in the context of hierarchical multi-scale methods where the generalized method of cells is applied at the intermediate scale.

Machine Learning↗

Building Extraction at Scale Using Convolutional Neural Network: Mapping of the United States

Establishing up-to-date large scale building maps is essential to understand the urban dynamics, such as estimating population, urban planning, and many other applications. Although many computer vision tasks have been successfully carried out with deep convolutional neural networks, there is a growing need to understand their large scale impact on building mapping with remote sensing imagery. In this paper, taking advantage of the scalability of convolutional neural networks (CNNs) and using only few areas with the abundance of building footprints, for the first time we conduct a comparative analysis of four state-of-the-art CNNs for extracting building footprints across the entire continental United States. The four CNN architectures namely: Branch-out CNN, fully convolutional network (FCN), conditional random field as recurrent neural network (CRFasRNN), and SegNet, support semantic pixelwise labeling and focus on capturing textural information at multiscale. We use 1-meter resolution aerial images from National Agriculture Imagery Program as the test-bed, and compare the extraction results across the four methods. In addition, we propose to combine signed-distance labels with SegNet, the preferred CNN architecture identified by our extensive evaluations, to advance building extraction results to instance level. We further demonstrate the usefulness of fusing additional near IR information into the building extraction framework. Large scale experimental evaluations are conducted and reported using metrics that include: Precision, recall rate, intersection over union, and the number of buildings extracted. With the improved CNN model and no requirement of further postprocessing, we have generated building maps for the United States with an average processing time less than one minute for an area of size &#x223C;<!-- ~ --> 56 km 2 . Finally, the quality of extracted buildings and processing time demonstrated that the proposed CNN based framework fits the need of building extraction at scale.

97 MATHEMATICS AND COMPUTING↗

Convolutional Dictionary Learning: A Comparative Review and New Algorithms

Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. Additionally, while effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses this deficiency and proposes some new approaches that outperform existing ones in certain contexts. A thorough set of performance comparisons indicates a very wide range of performance differences among the existing and proposed methods, and clearly identifies those that are the most effective.

97 MATHEMATICS AND COMPUTING↗

The predictive skill of convolutional neural networks models for disease forecasting

In this paper we investigate the utility of one-dimensional convolutional neural network (CNN) models in epidemiological forecasting. Deep learning models, in particular variants of recurrent neural networks (RNNs) have been studied for ILI (Influenza-Like Illness) forecasting, and have achieved a higher forecasting skill compared to conventional models such as ARIMA. In this study, we adapt two neural networks that employ one-dimensional temporal convolutional layers as a primary building block—temporal convolutional networks and simple neural attentive meta-learners—for epidemiological forecasting. We then test them with influenza data from the US collected over 2010-2019. We find that epidemiological forecasting with CNNs is feasible, and their forecasting skill is comparable to, and at times, superior to, plain RNNs. Thus CNNs and RNNs bring the power of nonlinear transformations to purely data-driven epidemiological models, a capability that heretofore has been limited to more elaborate mechanistic/compartmental disease models.

59 BASIC BIOLOGICAL SCIENCES↗

Upsampling Monte Carlo Reactor Simulation Tallies in Depleted Sodium-Cooled Fast Reactor Assemblies Using a Convolutional Neural Network

The computational demand of neutron Monte Carlo transport simulations can increase rapidly with the spatial and energy resolution of tallied physical quantities. Convolutional neural networks have been used to increase the resolution of Monte Carlo simulations of light water reactor assemblies while preserving accuracy with negligible additional computational cost. Here, we show that a convolutional neural network can also be used to upsample tally results from Monte Carlo simulations of sodium-cooled fast reactor assemblies, thereby extending the applicability beyond thermal systems. The convolutional neural network model is trained using neutron flux tallies from 300 procedurally generated nuclear reactor assemblies simulated using OpenMC. Validation and test datasets included 16 simulations of procedurally generated assemblies, and a realistic simulation of a European sodium-cooled fast reactor assembly was included in the test dataset. We show the residuals between the high-resolution flux tallies predicted by the neural network and high-resolution Monte Carlo tallies on relative and absolute bases. The network can upsample tallies from simulations of fast reactor assemblies with diverse and heterogeneous materials and geometries by a factor of two in each spatial and energy dimension. The network’s predictions are within the statistical uncertainty of the Monte Carlo tallies in almost all cases. This includes test assemblies for which burnup values and geometric parameters were well outside the ranges of those in assemblies used to train the network.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Utilizing Convolutional Neural Networks for Global Seagrass Habitat Mapping

Convolutional neural networks (CNNs) are becoming an increasingly prevalent machine learning algorithm due to their high accuracy and lack of reliance on heuristic processes. One of the major drawbacks of convolutional neural networks is their reliance on large amounts of training data in order to generate sensible results. This talk will cover how our team has utilized the strengths and overcome the weaknesses of convolutional neural networks as they apply to seagrass habitat mapping. We will share our technical CNN results over time, detail the requirements and challenges that our team overcame and explore how other teams can better incorporate a stronger seagrass component into their machine learning projects.

Convolutional↗

The convolutional double copy: a case study with a point

The double copy relates scattering amplitudes in gauge and gravity theories. It has also been extended to classical solutions, and a number of approaches have been developed for doing so. One of these involves expressing fields in a variety of (super-)gravity theories in terms of convolutions of gauge fields, including also BRST ghost degrees of freedom that map neatly to their corresponding counterparts in gravity. In this paper, we spell out how to use the convolutional double copy to map gauge and gravity solutions in the manifest Lorenz and de Donder gauges respectively. We then apply this to a particular example, namely the point charge in pure gauge theory. As well as clarifying how to use the convolutional approach, our results provide an alternative point of view on a recent discussion concerning whether point charges map to the Schwarzschild solution, or the more general two-parameter JNW solution, which includes a dilaton field. We confirm the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗