Search NASA⌕ Search

SEARCH · Search NASA

Results for “relevancy algorithm”

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.

624 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Even Higher-Level Synthesis: An Exploration of AI Hardware Accelerators using HLS4ML

With the rise of artificial intelligence, the popularization of deep learning, and a constantly evolving industry, the demand for flexible and efficient tools has never been greater. As algorithms grow more complex, their runtime and energy consumption increase exponentially. Customized hardware accelerators, long used for specific mathematical operations, remain essential for managing modern applications' computational and power demands. Hardware accelerators can speed up complex computations by orders of magnitude, but their manual design and verification processes are often challenging and time-consuming. High-Level Synthesis (HLS) provides a solution by transforming high-level algorithm descriptions, typically written in C++ or SystemC, into synthesizable RTL suitable for hardware implementation. This approach reduces development time for RTL engineers while offering flexibility beyond what traditional handwritten RTL can provide. We extended this capability to the machine-learning domain with the open-source framework hls4ml, which allows neural networks trained in Python frameworks like Tensorflow or PyTorch to be synthesized into efficient hardware representations for the traditional FPGA and ASIC flows. This breakthrough addresses the growing need for reduced design turnaround and easy verification of ML hardware accelerators with low latency and power efficiency constraints. During this tutorial, we will demonstrate how Python complements HLS by simplifying the ML design process, bridging the gap between software and hardware development. Attendees will explore how we translate neural networks modeled in Python into fixed-point C++ models suitable for HLS workflows. We will dive into strategies like Value-Range Analysis and Quantization-Aware Training, which optimize these designs for deployment and evaluate their accuracy, power consumption, and energy efficiency. To exemplify these concepts, experts from Fermilab will share their experiences applying this technology to high-energy physics experiments, where real-time, low-latency processing is critical. Over the years, Fermilab engineers have demonstrated how deep neural networks, optimized for hardware using hls4ml, can meet the stringent requirements of trigger systems at the CERN Large Hadron Collider. These systems rely on rapid decision-making to process immense data volumes while retaining only the most relevant events for further analysis. The application of hls4ml has also been extended to innovative technologies like smart pixel arrays. These smart pixels integrate ML inference capabilities directly into sensor devices, enabling localized data processing at the pixel level. This approach drastically reduces the need to transmit raw data to external processing units, significantly decreasing power consumption and latency. By embedding neural networks within the pixel architecture, the smart pixels can identify and prioritize relevant data in real time, providing a highly efficient solution for edge computing in scenarios such as particle detectors and imaging systems. Fermilab's work highlights the potential of hardware-accelerated ML in scenarios where both speed and power efficiency are mission-critical. Through this tutorial, attendees will gain valuable insights into the challenges and solutions of deploying ML in hardware. Understanding how HLS and hls4ml streamline the development of neural network-based hardware accelerators is fundamental for the industry's future. Participants will learn how these technologies are shaping the future of AI and scientific computing.

Di Guglielmo, Giuseppe [Fermilab]↗
DOE OSTI2024

Low-Cost Heliostat for High-Flux Small-Area Receivers (Final Technical Report)

This project analyzed a two-stage heliostat concept consisting of a tracking stage and a concentrating stage. The tracking stage uses mirrors mounted on a common drive that move to track the sun. The concentrating stage consists of stationary mirrors that each have a unique angle to direct rays towards a small-area, high-flux, point-focused receiver. By splitting the collection and concentrating process into two stages, multiple small, inexpensive mirrors can share a structure and be controlled by a single drive in the tracking stage. The project effort developed modeling techniques that were specifically relevant to this two-stage heliostat concept. Both field-level and unit-level models were developed. The field-level model does not explicitly consider unit-level losses which are predicted by the unit-level model and then integrated into the field-level model through a correlation referred to as an efficiency modifier. This approach is referred to as the two-model approach; the development and demonstration of this two-model approach for a multi-stage heliostat technology is a key outcome of this work. The field-level model is used to design a field that hits a specific design day power given a set of heliostat design parameters. An oversized field is simulated and then heliostat units are removed based on their annual energy production in order to generate the highest performing field. The field reduction procedure fits a smooth curve fit to annual energy production as a function of position in the field which has the effect of reducing the noise that is otherwise caused by the Monte Carlo ray tracing technique. This approach is referred to as the annual energy fit method and substantially reduces computational run time for a given field level modeling accuracy. The annual energy fit approach enables the selection of a properly sized, high-performing field using orders of magnitude fewer rays than would otherwise be possible and the development of this approach is a second key outcome of this work. These models are used within a genetic optimization algorithm in order to optimize the geometric parameters associated with a heliostat in order to achieve the lowest cost per unit of collected design day power. The cost modeling that underlies the optimization is a simple, scaling type analysis backed up by a much more detailed Design for Manufacture and Assembly (DFMA) analysis. Although the figure of merit used for optimization was not cost per mirror area, this metric is reasonable to use as a means of comparison. The optimally designed 500 kW design has a tracking mirror specific cost of $181.85/m 2 , which is significantly larger than the target value and also larger than the current state of the art. The cost of the torque-tube type linkages contributed substantially to the overall cost. Based on this observation, potentially attractive alternative design configuration utilizing a capstan type actuation system should be investigated. Finally, NREL compared the performance of the two-stage heliostat to the performance of a focused and different sized flat conventional heliostats and showed that, as expected, additional losses versus the convention heliostat caused by a worse cosine efficiency, two stages of reflection, and interstage interactions. The two-stage heliostat requires around 75% more reflective area than a flat 1x1 meter conventional heliostat (similar to a focused heliostat) and 40% more than a flat 2x2 meter conventional heliostat.

14 SOLAR ENERGY↗
DOE OSTI2024

Theory for Equivariant Quantum Neural Networks

Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2016

Seasonal Monitoring and Estimation of Regional Aerosol Distribution over Po Valley, Northern Italy, Using a High-Resolution MAIAC Product

In this work, the new 1-km-resolved Multi-Angle Implementation of Atmospheric Correction (MAIAC) algorithm is employed to characterize seasonal AOD-PM10 correlations over northern Italy. The accuracy of the new dataset is assessed versus the widely used Moderate Resolution Imaging Spectroradiometer (MODIS) Collection 5.1 Aerosol Optical Depth (AOD) data, retrieved at 0.55 microns with spatial resolution of 10 km (MYD04). We focused on evaluating the ability of these two products to characterize both temporal and spatial distributions of aerosols within urban and suburban areas. Ground PM10 measurements were obtained from 73 of the Italian Regional Agency for Environmental Protection (ARPA) monitoring stations, spread across northern Italy, for a three-year period from 2010 to 2012. The Po Valley area (northern Italy) was chosen as the study domain because of severe urban air pollution, resulting from the highest population and industrial manufacturing density in the country, being located in a valley where two surrounding mountain chains favor the stagnation of pollutants. We found that the global correlations between PM10 and AOD are R(sup 2) = 0.83 and R(sup 2) = 0.44 for MYD04_L2 and for MAIAC, respectively, suggesting for a greater sensitiveness of the high-resolution product to small-scale deviations. However, the introduction of Relative Humidity (RH) and Planetary Boundary Layer (PBL) depth corrections gave a significant improvement to the PM AOD correlation, which led to similar performance: R(sup 2) = 0.96 for MODIS and R(sup 2) = 0.95 for MAIAC. Furthermore, the introduction of the PBL information in the corrected AOD values was found to be crucial in order to capture the clear seasonal cycle shown by measured PM10 values. The study allowed us to define four seasonal linear correlations that estimate PM10 concentrations satisfactorily from the remotely sensed MAIAC AOD retrieval. Overall, the results show that the high resolution provided by MAIAC retrieval data is much more relevant than 10km MODIS data to characterize PM10 in this region of Italy which has a pretty limited geographical domain, but a broad variety of land usages and consequent particulate concentrations.

MODIS↗
DOE OSTI2024

Autonomous hybrid optimization of a SiO 2 plasma etching mechanism

Computational modeling of plasma etching processes at the feature scale relevant to the fabrication of nanometer semiconductor devices is critically dependent on the reaction mechanism representing the physical processes occurring between plasma produced reactant fluxes and the surface, reaction probabilities, yields, rate coefficients, and threshold energies that characterize these processes. The increasing complexity of the structures being fabricated, new materials, and novel gas mixtures increase the complexity of the reaction mechanism used in feature scale models and increase the difficulty in developing the fundamental data required for the mechanism. This challenge is further exacerbated by the fact that acquiring these fundamental data through more complex computational models or experiments is often limited by cost, technical complexity, or inadequate models. In this paper, we discuss a method to automate the selection of fundamental data in a reduced reaction mechanism for feature scale plasma etching of SiO 2 using a fluorocarbon gas mixture by matching predictions of etch profiles to experimental data using a gradient descent (GD)/Nelder–Mead (NM) method hybrid optimization scheme. These methods produce a reaction mechanism that replicates the experimental training data as well as experimental data using related but different etch processes.

36 MATERIALS SCIENCE↗
NASA NTRS2016

Predicting Real-Time Safety of the National Airspace System

To gain the situational awareness necessary for informed decision making regarding avoidance of airspace hazards, each operator must consolidate operations-relevant information from disparate sources and apply extensive domain knowledge to correctly interpret not just the current state of the NAS but forecast its (combined) evolution over the duration of the operation. This time- and workload-intensive process is periodically repeated throughout the operation so that changes can be managed in a timely manner.The imprecision, inaccuracies, inconsistency, and incompleteness of the incoming data further challenges the process. To facilitate informed decision making, this paper presents a model-based framework for the textitautomated real-time monitoring and prediction of possible effects of airspace hazards on the safety of the National Airspace System (NAS). First, hazards to flight are identified and transformed into sms, that is, quantities of interest that could be evaluated based on available data and are predictive of an unsafe event. The sms and associated thresholds that specify when an event transitions from emphsafe to emphunsafe are combined with models of airspace operations and aircraft dynamics. The framework can include any hazard to flight that can be modeled quantitatively. Models can be detailed and complex, or they can be considerably simplifed, as appropriate to the application. Real-time NAS safety monitoring and prediction begins with an estimate of the state of the NAS using the dynamic models. Given the state estimate and a probability distribution of future inputs to the NAS, we can then predict the evolution of the NAS - the future state - and the occurrence of hazards and unsafe events. The entire probability distribution of airspace sms is computed, not just point estimates, without significant assumptions regarding the distribution type andor parameters. We demonstrate our overall approach through a simulated scenario in which we predict the occurrence of some unsafe events and show how these predictions evolve in time as flight operations progress. Predictions accounting for common sources of uncertainty are included and it is shown how the predictions improve in time, become more confident, and change dynamically as new information is made available to the prediction algorithm.

safety↗
DOE OSTI2024

Predictive analytics of selections of russet potatoes

We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato (Solanum tuberosum L.) clones in breeding trials by predicting their suitability for advancement. This study addresses the challenge of efficiently identifying high-yield, disease-resistant, and climate-resilient potato varieties that meet processing industry standards. Leveraging manually collected data from trials in the state of Oregon, we investigate the potential of a wide variety of state-of-the-art binary classification models. The dataset includes 1086 clones, with data on 38 attributes recorded for each clone, focusing on yield, size, appearance, and frying characteristics, with several control varieties planted consistently across four Oregon regions from 2013 to 2021. We conduct a comprehensive analysis of the dataset that includes preprocessing, feature engineering, and imputation to address missing values. We focus on several key metrics such as accuracy, F1-score, and Matthews correlation coefficient (MCC) for model evaluation. The top-performing models, namely a feedforward neural network classifier (Neural Net), a histogram-based gradient boosting classifier (HGBC), and a support vector machine classifier (SVM), demonstrate consistent and significant results. To further validate our findings, we conducted a simulation study using the aims, data-generating mechanisms, estimands, methods, and performance measures (ADEMP) framework, simulating different data-generating scenarios to assess model robustness and performance through true positive, true negative, false positive, and false negative distributions, area under the receiver operating characteristic curve (AUC-ROC) and MCC. The simulation results highlight that non-linear models like SVM and HGBC consistently show higher AUC-ROC and MCC than logistic regression, thus outperforming the traditional linear model across various distributions, and emphasizing the importance of model selection and tuning in agricultural trials. Variable selection further enhances model performance and identifies influential features in predicting trial outcomes. The findings emphasize the potential of machine learning in streamlining the selection process for potato varieties, offering benefits such as increased efficiency, substantial cost savings, and judicious resource utilization. Our study contributes insights into precision agriculture and showcases the relevance of advanced technologies for informed decision-making in breeding programs.

60 APPLIED LIFE SCIENCES↗
NASA NTRS2006

The Use of Dynamic Visual Acuity as a Functional Test of Gaze Stabilization Following Space Flight

After prolonged exposure to a given gravitational environment the transition to another is accompanied by adaptations in the sensorimotor subsystems, including the vestibular system. Variation in the adaptation time course of these subsystems, and the functional redundancies that exist between them make it difficult to accurately assess the functional capacity and physical limitations of astro/cosmonauts using tests on individual subsystems. While isolated tests of subsystem performance may be the only means to address where interventions are required, direct measures of performance may be more suitable for assessing the operational consequences of incomplete adaptation to changes in the gravitational environment. A test of dynamic visual acuity (DVA) is currently being used in the JSC Neurosciences Laboratory as part of a series of measures to assess the efficacy of a countermeasure to mitigate postflight locomotor dysfunction. In the current protocol, subjects visual acuity is determined using Landolt ring optotypes presented sequentially on a computer display. Visual acuity assessments are made both while standing and while walking at 1.8 m/s on a motorized treadmill. The use of a psychophysical threshold detection algorithm reduces the required number of optotype presentations and the results can be presented immediately after the test. The difference between the walking and standing acuity measures provides a metric of the change in the subject s ability to maintain gaze fixation on the visual target while walking. This functional consequence is observable regardless of the underlying subsystem most responsible for the change. Data from 15 cosmo/astronauts have been collected following long-duration (approx. 6 months) stays in space using a visual target viewing distance of 4.0 meters. An investigation of the group mean shows a change in DVA soon after the flight that asymptotes back to baseline approximately one week following their return to earth. The performance of some subjects nicely parallels the stereotypical recovery curve observed in the group mean data. Others show dramatic changes in DVA from one test day to another. These changes may be indicative of a re-adaptation process that is not characterized by a steady improvement with the passage of time, but is instead a dynamic search for appropriate coordinative strategy to achieve the desired gaze stabilization goal. Ground-based data have been collected in our lab using DVA with one of the goals being to improve the DVA test itself. In one of these studies, the DVA test was repeated using a visual target viewing distance of 0.5 meters. While walking, the relative contributions of the otoliths and semi-circular canals that are required to stabilize gaze are affected by visual target viewing distance. It may be possible to exploit this using the current treadmill DVA test to differentially assess changes in these vestibular subsystems. The postflight DVA evaluations currently used have been augmented to include the near target version of the test. Preliminary results from these assessments, as well as the results from the ground-based tests will also be reported. DVA provides a direct measure of a subject's ability to see clearly in the presence of self-motion. The use of the current tests for providing a functionally relevant metric is evident. However, it is possible to expand the scope of DVA testing to include scenarios other than walking. A facility for measuring DVA in the presence of passive movements is being created. Using a mechanized platform to provide the perturbation, it should be possible to simulate aircraft and automobile vibration profiles. Used in conjunction with the far and near visual displays this facility should be able to assess a subject s ability to clearly see distant objects as well as those that appear on the dashboard or instrument control panel during functionally relevant situations.

Peters, B. T.↗
NASA NTRS1988

Variability in surface ECG morphology: signal or noise?

Using data collected from canine models of acute myocardial ischemia, we investigated two issues of major relevance to electrocardiographic signal averaging: ECG epoch alignment, and the spectral characteristics of the beat-to-beat variability in ECG morphology. With initial digitization rates of 1 kHz, an iterative a posteriori matched filtering alignment scheme, and linear interpolation, we demonstrated that there is sufficient information in the body surface ECG to merit alignment to a precision of 0.1 msecs. Applying this technique to align QRS complexes and atrial pacing artifacts independently, we demonstrated that the conduction delay from atrial stimulus to ventricular activation may be so variable as to preclude using atrial pacing as an alignment mechanism, and that this variability in conduction time be modulated at the frequency of respiration and at a much lower frequency (0.02-0.03Hz). Using a multidimensional spectral technique, we investigated the beat-to-beat variability in ECG morphology, demonstrating that the frequency spectrum of ECG morphological variation reveals a readily discernable modulation at the frequency of respiration. In addition, this technique detects a subtle beat-to-beat alternation in surface ECG morphology which accompanies transient coronary artery occlusion. We conclude that physiologically important information may be stored in the variability in the surface electrocardiogram, and that this information is lost by conventional averaging techniques.

NASA Discipline Cardiopulmonary↗
DOE OSTI2025

PDF Entity Annotation Tool (PEAT)

While different text mining approaches – including the use of Artificial Intelligence (AI) and other machine based methods - continue to expand at a rapid pace, the tools used by researchers to create the labeled datasets required for training, modeling, and evaluation remain rudimentary. Labeled datasets contain the target attributes the machine is going to learn; for example, training an algorithm to delineate between images of a car or truck would generally require a set of images with a quantitative description of the underlying features of each vehicle type. Development of labeled textual data that can be used to build natural language machine learning models for scientific literature is not currently integrated into existing manual workflows used by domain experts. Published literature is rich with important information, such as different types of embedded text, plots, and tables that can all be used as inputs to train ML/natural language processing (NLP) models, when extracted and prepared in machine readable formats. Currently, both normalized data extraction of use to domain experts and extraction to support development of ML/NLP models are labor intensive and cumbersome manual processes. Automatic extraction of data and information from formats such as PDFs that are optimized for layout and human readability, not machine readability. The PDF (Portable Document Format) Entity Annotation Tool (PEAT) was developed with the goal of allowing users to annotate publications within their current print format, while also allowing those annotations to be captured in a machine-readable format. One of the main issues with traditional annotation tools is that they require transforming the PDF into plain text to facilitate the annotation process. While doing so lessens the technical challenges of annotating data, the user loses all structure and provenance that was inherent in the underlying PDF. Also, textual data extraction from PDFs can be an error prone process. Challenges include identifying sequential blocks of text and a multitude of document formats (multiple columns, font encodings, etc.). As a result of these challenges, using existing tools for development of NLP/ML models directly from PDFs is difficult because the generated outputs are not interoperable. We created a system that allows annotations to be completed on the original PDF document structure, with no plain text extraction. The result is an application that allows for easier and more accurate annotations. In addition, by including a feature that grants the user the ability to easily create a schema, we have developed a system that can be used to annotate text for different domain-centric schemas of relevance to subject matter experts. Different knowledge domains require distinct schemas and annotation tags to support machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning↗