Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convolutional”

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 127 records · Page 7

Statistical Treatment of Convolutional Neural Network Superresolution of Inland Surface Wind for Subgrid-Scale Variability Quantification

Abstract Machine learning models have been employed to perform either physics-free data-driven or hybrid dynamical downscaling of climate data. Most of these implementations operate over relatively small downscaling factors because of the challenge of recovering fine-scale information from coarse data. This limits their compatibility with many global climate model outputs, often available between ∼50- and 100-km resolution, to scales of interest such as cloud resolving or urban scales. This study systematically examines the capability of a type of superresolving convolutional neural network (SR-CNNs) to downscale surface wind speed data over land from different coarse resolutions (25-, 48-, and 100-km resolution) to 3 km. For each downscaling factor, we consider three convolutional neural network (CNN) configurations that generate superresolved predictions of fine-scale wind speed, which take between one and three input fields: coarse wind speed, fine-scale topography, and diurnal cycle. In addition to fine-scale wind speeds, probability density function parameters are generated through which sample wind speeds can be generated, accounting for the intrinsic stochasticity of wind speed. For assessing generalization to new data, CNN models are tested on regions with different topography and climate that are unseen during training. The evaluation of superresolved predictions focuses on subgrid-scale variability and the recovery of extremes. Models with coarse wind and fine topography as inputs exhibit the best performance when compared with other model configurations, operating across the same downscaling factor. Our diurnal cycle encoding results in lower out-of-sample generalizability when compared with other input configurations.

17 WIND ENERGY↗

Radar Super Resolution using a Deep Convolutional Neural Network

Super-resolution involves synthetically increasing the resolution of gridded data beyond its native resolution. Typically, this is done using interpolation schemes, which estimate sub-grid scale values from neighboring data, and perform the same operation everywhere regardless of the large-scale context, or by requiring a network of radars with overlapping fields of view. Recently, significant progress has been made in single image super resolution using convolutional neural networks. Conceptually, a neural network may be able to learn relations between large scale precipitation features and the associated sub-pixel scale variability and outperform interpolation schemes. Here, we use a deep convolutional neural network to artificially enhance the resolution of NEXRAD PPI scans. The model is trained on 6-months of reflectivity observations from the Langley Hill WA (KLGX) radar, and we find that it substantially outperforms common interpolation schemes for x4 and x8 resolution increases based on several objective error and perceptual quality metrics.

radar, machine learning, super resolution, Remote ↗

DISTEMA: distance map-based estimation of single protein model accuracy with attentive 2D convolutional neural network

Abstract Background Estimation of the accuracy (quality) of protein structural models is important for both prediction and use of protein structural models. Deep learning methods have been used to integrate protein structure features to predict the quality of protein models. Inter-residue distances are key information for predicting protein’s tertiary structures and therefore have good potentials to predict the quality of protein structural models. However, few methods have been developed to fully take advantage of predicted inter-residue distance maps to estimate the accuracy of a single protein structural model. Result We developed an attentive 2D convolutional neural network (CNN) with channel-wise attention to take only a raw difference map between the inter-residue distance map calculated from a single protein model and the distance map predicted from the protein sequence as input to predict the quality of the model. The network comprises multiple convolutional layers, batch normalization layers, dense layers, and Squeeze-and-Excitation blocks with attention to automatically extract features relevant to protein model quality from the raw input without using any expert-curated features. We evaluated DISTEMA’s capability of selecting the best models for CASP13 targets in terms of ranking loss of GDT-TS score. The ranking loss of DISTEMA is 0.079, lower than several state-of-the-art single-model quality assessment methods. Conclusion This work demonstrates that using raw inter-residue distance information with deep learning can predict the quality of protein structural models reasonably well. DISTEMA is freely at https://github.com/jianlin-cheng/DISTEMA

59 BASIC BIOLOGICAL SCIENCES↗

Exploring 2D X-ray diffraction phase fraction analysis with convolutional neural networks: Insights from kinematic-diffraction simulations

Abstract Deep-learning models are effective for analyzing the complex information in 2D X-ray diffraction (XRD) patterns. Accurately collecting parameters of the material sample is crucial during model training, significantly impacting model performance. In this study, we employ a kinematic-diffraction simulator to generate simulated 2D XRD patterns for Ti–6Al–4V alloy, allowing precise control of sample parameters. These simulated patterns are used to train convolutional neural networks, predicting $$\upbeta$$ β -phase volume fractions. The training data set consists exclusively of 2D XRD patterns with pure $$\upalpha$$ α - or pure $$\upbeta$$ β -phase, while the testing set incorporates patterns with intermediate phase volume fraction. In particular, we investigate how the architectures of the model influence prediction reliability and computational performance. Experimental results reveal that, with appropriate training, the convolutional neural network accurately detects intermediate phase volume fractions even trained with only pure-phase patterns, achieving a mean square error accuracy of $$9.4 \times 10^{-4}$$ 9.4 × 10 - 4 . Graphical abstract

Yue, Weiqi↗

Regression Convolutional Neural Network for Energy Estimation in NOvA

Regression Convolutional Neural Network for Energy Estimation in NOvA" Abstract: "NOvA (NuMI Off-Axis $\nu_e$ Appearance) is a long baseline neutrino experiment designed to measure neutrino oscillations over a distance of 810 km. NOvA employs a near and far detector to observe $\nu_\mu$ disappearance and $\nu_e$ appearance of neutrinos produced by the NuMI beam at Fermilab. Energy reconstruction is critical for precise measurements of neutrino oscillation parameters and cross sections, which are functions of neutrino energy. Energy estimation remains difficult due to the complexity of detector response and final state particle kinematics. We present a regression-based convolutional neural network (CNN) method that reconstructs neutrino and lepton energies based on raw pixel inputs for NOvA. The trained model is able to reconstruct event energy for different interaction modes and complex final states containing leptons and hadrons. Studies of regression CNN networks show improved energy resolution and reduced sensitivity to calibration scale uncertainties relative to traditional kinematics-based energy reconstruction techniques. The results demonstrate the potential of the regression CNN method for neutrino physics analyses by improving on standard kinematics-based reconstruction.

Zhao, Larry [UC, Irvine (main)]↗

Identifying Critical Infrastructure in Imagery Data Using Explainable Convolutional Neural Networks

To date, no method utilizing satellite imagery exists for detailing the locations and functions of critical infrastructure across the United States, making response to natural disasters and other events challenging due to complex infrastructural interdependencies. This paper presents a repeatable, transferable, and explainable method for critical infrastructure analysis and implementation of a robust model for critical infrastructure detection in satellite imagery. This model consists of a DenseNet-161 convolutional neural network, pretrained with the ImageNet database. The model was provided additional training with a custom dataset, containing nine infrastructure classes. The resultant analysis achieved an overall accuracy of 90%, with the highest accuracy for airports (97%), hydroelectric dams (96%), solar farms (94%), substations (91%), potable water tanks (93%), and hospitals (93%). Critical infrastructure types with relatively low accuracy are likely influenced by data commonality between similar infrastructure components for petroleum terminals (86%), water treatment plants (78%), and natural gas generation (78%). Local interpretable model-agnostic explanations (LIME) was integrated into the overall modeling pipeline to establish trust for users in critical infrastructure applications. The results demonstrate the effectiveness of a convolutional neural network approach for critical infrastructure identification, with higher than 90% accuracy in identifying six of the critical infrastructure facility types.

97 MATHEMATICS AND COMPUTING↗

Fast, High-fidelity Lyα Forests with Convolutional Neural Networks

Full-physics cosmological simulations are powerful tools for studying the formation and evolution of structure in the universe but require extreme computational resources. Here, we train a convolutional neural network to use a cheaper N-body-only simulation to reconstruct the baryon hydrodynamic variables (density, temperature, and velocity) on scales relevant to the Lyα forest, using data from Nyx simulations. We show that our method enables rapid estimation of these fields at a resolution of ~20 kpc, and captures the statistics of the Lyα forest with much greater accuracy than existing approximations. Because our model is fully convolutional, we can train on smaller simulation boxes and deploy on much larger ones, enabling substantial computational savings. Furthermore, as our method produces an approximation for the hydrodynamic fields instead of Lyα flux directly, it is not limited to a particular choice of ionizing background or mean transmitted flux.

79 ASTRONOMY AND ASTROPHYSICS↗

On the structure of rate 1/n convolutional codes.

It is shown what choice there is in assigning output digits to transitions of binary rate 1/n code trellis so that the latter will correspond to a convolutional code. A new upper bound on free distance of rate 1/n convolutional codes is also derived, and the results obtained are used to determine the length of the largest input sequence that can conceivably result in an output whose weight is equal to the free distance of a code of rate 1/2.

Bahl, L.↗

Performance evaluation of a class of systematic, rate (M-1)/M, convolutional codes

The implementation and performance evaluation are described for a class of rate (M-1)/M, systematic, convolutional codes being decoded with a simple majority logic decoder. The encoding logic appends one parity bit for each PCM telemetry word. It is shown that over the critical range of received PCM telemetry signal-to-noise ratios, this coding procedure produces a net coding gain of from 1.5 to 2.5 db relative to an equal power transmission of uncoded PCM telemetry. Being a low-redundancy systematic code, it is possible to process this data without convolutional decoding with a small rate loss penalty of about 0.5 db.

Greene, E. P.↗

Design of communication systems using short-constraint-length convolutional codes.

A method is presented for calculating the effect of carrier-phase reference error in a receiver phase-locked loop on bit error rates in convolutionally coded data, for the practical design of systems using short-constraint-length convolutional codes. A set of design curves shows the relation between design bit error rate, uplink carrier tracking loop SNR, downlink total SNR, and downlink modulation index. These curves make possible rapid and simple system optimization.

Merrill, H. M.↗

Method and apparatus for decoding compatible convolutional codes

This invention relates to learning decoders for decoding compatible convolutional codes. The decoder decodes signals which have been encoded by a convolutional coder and allows performance near the theoretical limit of performance for coded data systems. The decoder includes a sub-bit shift register wherein the received sub-bits are entered after regeneration and shifted in synchronization with a clock signal recovered from the received sub-bit stream. The received sub-bits are processed by a sub-bit decision circuit, entered into a sub-bit shift register, decoded by a decision circuit, entered into a data shift register, and updated to reduce data errors. The bit decision circuit utilizes stored sub-bits and stored data bits to determine subsequent data-bits. Data errors are reduced by using at least one up-date circuit.

Doland, G. D.↗

Utilization of low-redundancy convolutional codes

This paper suggests guidelines for the utilization of low-redundancy convolutional codes with emphasis on providing a quick look capability (no decoding) and a moderate amount of coding gain. The performance and implementation complexity of threshold, Viterbi, and sequential decoding when used with low-redundancy, systematic, convolutional codes is discussed. An extensive list of optimum, short constraint length codes is found for use with Viterbi decoding, and several good, long constraint length codes are found for use with sequential decoding.

Cain, J. B.↗

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.↗

Performance of convolutional codes on fading channels typical of planetary entry missions

The performance of convolutional codes in fading channels typical of the planetary entry channel is examined in detail. The signal fading is due primarily to turbulent atmospheric scattering of the RF signal transmitted from an entry probe through a planetary atmosphere. Short constraint length convolutional codes are considered in conjunction with binary phase-shift keyed modulation and Viterbi maximum likelihood decoding, and for longer constraint length codes sequential decoding utilizing both the Fano and Zigangirov-Jelinek (ZJ) algorithms are considered. Careful consideration is given to the modeling of the channel in terms of a few meaningful parameters which can be correlated closely with theoretical propagation studies. For short constraint length codes the bit error probability performance was investigated as a function of E sub b/N sub o parameterized by the fading channel parameters. For longer constraint length codes the effect was examined of the fading channel parameters on the computational requirements of both the Fano and ZJ algorithms. The effects of simple block interleaving in combatting the memory of the channel is explored, using the analytic approach or digital computer simulation.

Modestino, J. W.↗

Robustly optimal rate one-half binary convolutional codes

Three optimality criteria for convolutional codes are considered in this correspondence: namely, free distance, minimum distance, and distance profile. Here we report the results of computer searches for rate one-half binary convolutional codes that are 'robustly optimal' in the sense of being optimal for one criterion and optimal or near-optimal for the other two criteria. Comparisons with previously known codes are made. The results of a computer simulation are reported to show the importance of the distance profile to computational performance with sequential decoding.

Johannesson, R.↗

Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile

A tabulation of binary systematic convolutional codes with an optimum distance profile for rates 1/3 and 1/4 is given. A number of short rate 1/3 binary nonsystematic convolutional codes are listed. These latter codes are simultaneously optimal for the following distance measures: distance profile, minimum distance, and free distance; they appear attractive for use with Viterbi decoders. Comparisons with previously known codes are made.

Johannesson, R.↗

Spectral interpolation - Zero fill or convolution

Zero fill, or augmentation by zeros, is a method used in conjunction with fast Fourier transforms to obtain spectral spacing at intervals closer than obtainable from the original input data set. In the present paper, an interpolation technique (interpolation by repetitive convolution) is proposed which yields values accurate enough for plotting purposes and which lie within the limits of calibration accuracies. The technique is shown to operate faster than zero fill, since fewer operations are required. The major advantages of interpolation by repetitive convolution are that efficient use of memory is possible (thus avoiding the difficulties encountered in decimation in time FFTs) and that is is easy to implement.

Forman, M. L.↗

There is no MacWilliams identity for convolutional codes

An example is provided of two convolutional codes that have the same transmission gain but whose dual codes do not. This shows that no analog of the MacWilliams identity for block codes can exist relating the transmission gains of a convolutional code and its dual.

Shearer, J. B.↗