Search NASA⌕ Search

SEARCH · Search NASA

Results for “reconstruction algorithms”

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 469 records · Page 26

Comparative mapping of Pluto's sub-Charon hemisphere - Three least squares models based on mutual event lightcurves

Observations of Charon transits are used here to derive preliminary maps of Pluto's sub-Charon hemisphere. Three models are used to describe the brightness of Pluto's surface as functions of latitude and longitude. Mapping results are presented using spherical harmonic functions, polynomial functions, and finite elements. A smoothing algorithm applied to the maps is described and the validity and resolution of the maps is tested by reconstruction from synthetic data. A preliminary finding from the maps is that the south polar region has the highest albedo of any location on the planet.

Young, Eliot F.↗

Astronomical data analysis software and systems I; Proceedings of the 1st Annual Conference, Tucson, AZ, Nov. 6-8, 1991

Consideration is given to a definition of a distribution format for X-ray data, the Einstein on-line system, the NASA/IPAC extragalactic database, COBE astronomical databases, Cosmic Background Explorer astronomical databases, the ADAM software environment, the Groningen Image Processing System, search for a common data model for astronomical data analysis systems, deconvolution for real and synthetic apertures, pitfalls in image reconstruction, a direct method for spectral and image restoration, and a discription of a Poisson imagery super resolution algorithm. Also discussed are multivariate statistics on HI and IRAS images, a faint object classification using neural networks, a matched filter for improving SNR of radio maps, automated aperture photometry of CCD images, interactive graphics interpreter, the ROSAT extreme ultra-violet sky survey, a quantitative study of optimal extraction, an automated analysis of spectra, applications of synthetic photometry, an algorithm for extra-solar planet system detection and data reduction facilities for the William Herschel telescope.

Worrall, Diana M.↗

Extraction of Martian valley networks from digital topography

We have developed a novel method for delineating valley networks on Mars. The valleys are inferred from digital topography by an autonomous computer algorithm as drainage networks, instead of being manually mapped from images. Individual drainage basins are precisely defined and reconstructed to restore flow continuity disrupted by craters. Drainage networks are extracted from their underlying basins using the contributing area threshold method. We demonstrate that such drainage networks coincide with mapped valley networks verifying that valley networks are indeed drainage systems. Our procedure is capable of delineating and analyzing valley networks with unparalleled speed and consistency. We have applied this method to 28 Noachian locations on Mars exhibiting prominent valley networks. All extracted networks have a planar morphology similar to that of terrestrial river networks. They are characterized by a drainage density of approx.0.1/km, low in comparison to the drainage density of terrestrial river networks. Slopes of "streams" in Martian valley networks decrease downstream at a slower rate than slopes of streams in terrestrial river networks. This analysis, based on a sizable data set of valley networks, reveals that although valley networks have some features pointing to their origin by precipitation-fed runoff erosion, their quantitative characteristics suggest that precipitation intensity and/or longevity of past pluvial climate were inadequate to develop mature drainage basins on Mars.

Stepinski, T. F.↗

Optical Navigation for Autonomous Approach of Small Unknown Bodies

State of the practice in navigation around small celestial bodies heavily relies on ground sup- port and human skill, in particular, for perception-based operations such as optical navigation and mapping. This leads to longer duration and more complex mission operations and sub- sequently higher cost. Furthermore, it imposes limitations for certain missions such as fast fly-bys or multi-agent operations. In this work, we present an autonomous navigation strat- egy suitable for approaching small unexplored bodies. During the approach, we estimate the body’s physical properties as well as the spacecraft’s relative trajectory and associated un- certainties. The autonomous navigation strategy, which is solely based on optical measure- ments, begins as soon as the body becomes resolved in the navigation camera and terminates at the start of proximity operations, when the spacecraft makes its first trajectory correction to stay in the vicinity of the body. Our strategy uses multiple image-processing algorithms: light-curve analysis for estimating the target body’s rotation rate, Shape-from-Silhouette for reconstructing the 3D shape and estimating its rotation pole, and feature tracking tailored to Small-Body images for estimating relative navigation parameters. We used the Mission Analysis, Operations, and Navigation Toolkit Environment (MONTE) developed by the Jet Propulsion Laboratory to evaluate the feasibility of this multi-phase navigation strategy using simulated images of an approach trajectory. We used the Rosetta mission data to generate photorealistic images to characterise the performance of this approach. This work is based on the assumptions that the spacecraft attitude is known, the body is a principal-axis rotator, a-priori estimates of ephemerides and scale are available, and the body is observed from a zero sun phase only during initial approach. Preliminary results show orbit determination performance that is on par with the human navigation from the Rosetta mission; albeit with a 1% bias in spacecraft-target radial distance estimate. The bias error is likely due to the robustness and accuracy of the visual tracking under dynamic lighting conditions and per- spective changes, which decrease accuracy.

Villa, Jacopo↗

Commissioning of the Mu2e tracker DAQ, planning for the Vertical Slice Test and pre-pattern recognition studies

The primary objective of the Mu2e experiment at Fermilab is to search for the neutrino-less coherent $\mu \rightarrow e$ conversion in the field of an aluminum nucleus ($\mu^- \text{Al} \rightarrow e^- \text{Al}$). The signature of this process is a monochromatic Conversion Electron (CE) with an energy of approximately 104.97 MeV \cite{bartoszek2015mu2e}. Within the Standard Model (SM), the branching ratio for this process, including neutrino masses and oscillation, is expected to be less than $\mathcal{O}(10^{-50})$. This value is far beyond current experimental capabilities. However, models of physics beyond the SM predict much higher relative rates, approaching an observable level. The SINDRUM II experiment set an upper limit on muon conversion at $7 \times 10^{-13}$ (90\% CL) on Au target \cite{SINDRUMII:2006dvw}, and the Mu2e collaboration aims to improve this limit by four orders of magnitude. Observing this process would provide a clear evidence of physics beyond the Standard Model. A brief discussion of the theoretical and experimental aspects is provided in Chapter \ref{intr}. Mu2e adopts a sophisticated experimental setup to achieve its goals, further described in Chapter \ref{mu2echapter}. The central part of the Mu2e detector is the tracker, that consists of 18 tracking stations. The tracker must provide excellent momentum resolution, approximately 1 MeV/c, to distinguish the monochromatic CE signal from the background. To minimize the energy losses, a straw tube tracker will be used \cite{bobbb}. Chapter \ref{chaptertrk} provides an overview of the straw tracker design and its working principles. This Thesis presents a comprehensive study of the Mu2e tracker, covering complementary aspects from initial commissioning to optimization and first steps of the calibration processes. My work at Fermilab has been focused on the complete Data Acquisition (DAQ) testing from both hardware and software perspectives. I was involved in the commissioning of the Mu2e DAQ system and the Vertical Slice Test (VST) of the tracker. The VST encompasses the entire testing chain, from the straws to the readout, and to processed data on disk. I was also focused on the offline analysis, especially on pre-pattern recognition studies, to explore the best methods for identifying $\delta$-electrons during the data taking. Chapter \ref{commissioning} details the commissioning of the tracker DAQ system, emphasizing the importance of understanding of the readout process before the data acquisition. This includes validating the readout logic and firmware through Monte Carlo simulations to confirm functionality and buffering, monitoring the quality of the data from the tracker preamplifiers and front-end electronics, and assessing overall DAQ performance to ensure reliability during future calibration and data-taking. Chapter \ref{planning} discusses the initial steps towards the tracker calibration. The ultimate goal is to perform a time calibration of the first assembled station of the tracker using cosmic muons, aiming for a longitudinal hit position resolution better than 4 cm. This involves determining the signal propagation times and channel-to-channel delays. I performed a Monte Carlo study to determine the impact of the station orientation on the quality of the calibration, in particular on the cosmic track reconstruction, focusing on potential biases that could arise. These studies provide essential insights into the operation, optimization, and calibration of the Mu2e tracker system. Given the high data volume expected during Mu2e operations, estimated at approximately 7 PBytes per year, optimizing memory usage and minimizing CPU consumption are critical. A significant challenge lies in effectively flagging $\delta$-electron hits, which are the primary source of hits in the tracker, without compromising the efficiency of CE hit detection and track reconstruction. A detailed study of pre-pattern recognition and a thorough comparison of two $\delta$-electron flagging algorithms is provided in Chapter \ref{delta}. In Chapter \ref{conclusions}, the findings are concisely summarized, offering a comprehensive synthesis of the research and emphasizing the key insights derived from this study.

43 PARTICLE ACCELERATORS↗

Three-Dimensional Imaging and Numerical Reconstruction of Graphite/Epoxy Composite Microstructure Based on Ultra-High Resolution X-Ray Computed Tomography

A combined experimental and computational study aimed at high-resolution 3D imaging, visualization, and numerical reconstruction of fiber-reinforced polymer microstructures at the fiber length scale is presented. To this end, a sample of graphite/epoxy composite was imaged at sub-micron resolution using a 3D X-ray computed tomography microscope. Next, a novel segmentation algorithm was developed, based on concepts adopted from computer vision and multi-target tracking, to detect and estimate, with high accuracy, the position of individual fibers in a volume of the imaged composite. In the current implementation, the segmentation algorithm was based on Global Nearest Neighbor data-association architecture, a Kalman filter estimator, and several novel algorithms for virtualfiber stitching, smoothing, and overlap removal. The segmentation algorithm was used on a sub-volume of the imaged composite, detecting 508 individual fibers. The segmentation data were qualitatively compared to the tomographic data, demonstrating high accuracy of the numerical reconstruction. Moreover, the data were used to quantify a) the relative distribution of individual-fiber cross sections within the imaged sub-volume, and b) the local fiber misorientation relative to the global fiber axis. Finally, the segmentation data were converted using commercially available finite element (FE) software to generate a detailed FE mesh of the composite volume. The methodology described herein demonstrates the feasibility of realizing an FE-based, virtual-testing framework for graphite/fiber composites at the constituent level.

Czabaj, M. W.↗

Demonstration of Algorithm for Sensor Placement Optimization using Simulation Data

This deliverable reports FY26 progress in advancing a neural-network-based Green’s-function framework for reconstructing neutron-flux distributions from ex-core measurements and for translating reconstruction requirements into a practical detector-layout strategy. Building on the FY25 formulation, the present work had two main objectives: (1) refine and re-evaluate the reconstruction methodology on an updated Purdue University Reactor Number One (PUR-1) model, and (2) develop a systematic, Green’s-function-guided procedure for boundary detector placement.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Magnetospheric Radio Tomography: Observables, Algorithms, and Experimental Analysis

This grant supported research towards developing magnetospheric electron density and magnetic field remote sensing techniques via multistatic radio propagation and tomographic image reconstruction. This work was motivated by the need to better develop the basic technique of magnetospheric radio tomography, which holds substantial promise as a technology uniquely capable of imaging magnetic field and electron density in the magnetosphere on large scales with rapid cadence. Such images would provide an unprecedented and needed view into magnetospheric processes. By highlighting the systems-level interconnectedness of different regions, our understanding of space weather processes and ability to predict them would be dramatically enhanced. Three peer-reviewed publications and 5 conference presentations have resulted from this work, which supported 1 PhD student and 1 postdoctoral researcher. One more paper is in progress and will be submitted shortly. Because the main results of this research have been published or are soon to be published in refereed journal articles listed in the reference section of this document, we provide here an overview of the research and accomplishments without describing all of the details that are contained in the articles.

Cummer, Steven↗

Automated Approach to Accurate, Precise, and Fast Detector Simulation and Reconstruction

Detector simulation and reconstruction are a significant computational bottleneck in particle physics. Here, we develop particle-flow neural-assisted simulations (parnassus) to address this challenge. Our deep learning model takes as input a point cloud (particles impinging on a detector) and produces a point cloud (reconstructed particles). By combining detector simulations and reconstruction into one step, we aim to minimize resource utilization and enable fast surrogate models suitable for application both inside and outside large collaborations. We demonstrate this approach using a publicly available dataset of jets passed through the full simulation and reconstruction pipeline of the Compact Muon Solenoid (CMS) experiment. We show that parnassus accurately mimics the CMS particle flow algorithm on the (statistically) same events it was trained on and can generalize to jet momentum and type outside of the training distribution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multiplicity dependence of charged-particle intra-jet properties in pp collisions at $\sqrt{s}$ = 13 TeV

The first measurement of the multiplicity dependence of intra-jet properties of leading charged-particle jets in proton–proton (pp) collisions is reported. The mean charged particle multiplicity and jet fragmentation distributions are measured in minimum-bias and high-multiplicity pp collisions at center-of-mass energy $\sqrt{s}$ = 13 TeV using the ALICE detector. Jets are reconstructed from charged particles produced in the midrapidity region (|η| < 0.9) using the sequential recombination anti-k T algorithm with jet resolution parameters R = 0.2, 0.3, and 0.4 for the trans verse momentum (p T ) interval 5–110 GeV/c. The high multiplicity events are selected by the forward V0 scintilla tor detectors. The mean charged-particle multiplicity inside the leading jet cone rises monotonically with increasing jet p T in qualitative agreement with previous measurements at lower energies. The distributions of jet fragmentation function variables z ch and ξ ch are measured for different jet-p T intervals. Jet-p T independent fragmentation of leading jets is observed for wider jets except at high- and low-z ch values. The observed “hump-backed plateau” structure in the ξ ch distribution indicates suppression of low-p T particles. In high-multiplicity events, an enhancement of the fragmen tation probability of low-z ch particles accompanied by a suppression of high-zch particles is observed compared to minimum-bias events. This behavior becomes more promi nent for low-p T jets with larger jet radius. The results are compared with predictions of QCD-inspired event generators, PYTHIA 8 with Monash 2013 tune and EPOS LHC. It is found that PYTHIA 8 qualitatively reproduces the jet modification in high-multiplicity events except at high jet p T . These measurements provide important constraints to models of jet fragmentation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A robust adaptive flightpath reconstruction technique

Computational schemes are presented that allow accurate reconstruction of an aircraft's flightpath in real-time. The reconstruction of the flightpath is formulated as a linear state reconstruction problem, which can be solved via Kalman filtering (KF) techniques. This imposes some conditions upon the flight-test equipment. A reliable square root covariance KF (SRCF) implementation is chosen and further developed into a fully adaptive flightpath reconstruction scheme. Therefore, the basic SRCF is modified in order to cope with several practical problems such as: the automatic control of the convergence of the recursive KF calculations, time varying zero-bias errors on the input signal of the system model used in the KF, and the changing aircraft dynamics owing to a change in reference flight condition. The developed solutions for these problems are all implemented in a numerically stable way, which guarantees the overall flightpath reconstruction scheme to be robust. Furthermore, some special features of the used system model are exploited to make the algorithmic implementation very efficient. An experimental simulation study using simulated flight test data demonstrated these different capabilities.

Verhaegen, M. H.↗

A Generalized, Compactly-Supported Correlation Function for Data Assimilation Applications

Correlation functions play an essential role in modern data assimilation, where they are used to model covariances given a set of tunable parameters or applied as tapering functions to localize covariances in ensemble-based schemes. One of the most widely-used correlation functions in data assimilation is the Gaspari and Cohn (1999) piecewise-rational, compactly-supported parametric correlation function (hereafter referred to as GC99). The GC99 correlation function is useful due to its tunable cut-off parameter c and Gaussian-like shape achieved when the parameter a is set to one-half. These properties are attractive for tapering functions in data assimilation applications. However, the GC99 correlation function is homogeneous over Euclidean 3-space and isotropic when restricted to the sphere, properties that may be less than ideal for some geophysical applications. GC99 is also compactly-supported on a sphere of fixed radius, which requires tuning of the cut-off parameter c that can depend on the specific application. This work presents a generalization of the GC99 correlation function that allows the cut-off parameter c and shape parameter a to vary over space to gain more flexibility in shape while maintaining its compact support property. The function, which we call the Generalized Gaspari Cohn (GenGC) correlation function, introduces inhomogeneity in Euclidean 3-space and anisotropy when restricted to the sphere by allowing both parameters c and a to vary, as functions, over the spatial domain. The GC99 correlation function is a special case of GenGC where the functions c and a are held constant, as fixed parameters rather than functions. The GenGC correlation function also generalizes the follow-on to the work of Gaspari and Cohn (1999) presented in Gaspari et al. (2006), which allowed a to vary while keeping c fixed. We illustrate through simple one- and two-dimensional examples the variety of inhomogeneous and anisotropic correlation functions GenGC can produce by varying c and a over space, and suggest applications where they may be useful in data assimilation, such as covariance modeling or localization. In particular, we describe how the GenGC correlation function can be used to construct covariances using correlation length and variance fields derived from dynamics. For example, the correlation length field for advective dynamics is governed by a partial differential equation (PDE) in N spatial dimensions, where N is the number of space dimensions of the state. Correlation length fields can be determined from this PDE and used with GenGC to construct the corresponding correlations. We can then approximate the full covariance by rescaling by the variance, which also satisfies a PDE in N spatial dimensions for advective dynamics. Thus we can approximate the full covariance without solving the covariance PDE, which is in 2N spatial dimensions, by solving just two PDEs each in only N spatial dimensions. This approach to evolving the correlation length and variance fields, then reconstructing the correlations using GenGC, is suggested as an alternative to current methods of covariance modeling in data assimilation algorithms.

GC99↗

Autonomous Image Analysis for Future Mars Missions

To explore high priority landing sites and to prepare for eventual human exploration, future Mars missions will involve rovers capable of traversing tens of kilometers. However, the current process by which scientists interact with a rover does not scale to such distances. Specifically, numerous command cycles are required to complete even simple tasks, such as, pointing the spectrometer at a variety of nearby rocks. In addition, the time required by scientists to interpret image data before new commands can be given and the limited amount of data that can be downlinked during a given command cycle constrain rover mobility and achievement of science goals. Experience with rover tests on Earth supports these concerns. As a result, traverses to science sites as identified in orbital images would require numerous science command cycles over a period of many weeks, months or even years, perhaps exceeding rover design life and other constraints. Autonomous onboard science analysis can address these problems in two ways. First, it will allow the rover to preferentially transmit "interesting" images, defined as those likely to have higher science content. Second, the rover will be able to anticipate future commands. For example, a rover might autonomously acquire and return spectra of "interesting" rocks along with a high-resolution image of those rocks in addition to returning the context images in which they were detected. Such approaches, coupled with appropriate navigational software, help to address both the data volume and command cycle bottlenecks that limit both rover mobility and science yield. We are developing fast, autonomous algorithms to enable such intelligent on-board decision making by spacecraft. Autonomous algorithms developed to date have the ability to identify rocks and layers in a scene, locate the horizon, and compress multi-spectral image data. We are currently investigating the possibility of reconstructing a 3D surface from a sequence of images acquired by a robotic arm camera. This would then allow the return of a single completely in focus image constructed only from those portions of individual images that lie within the camera's depth of field. Output from these algorithms could be used to autonomously obtain rock spectra, determine which images should be transmitted to the ground, or to aid in image compression. We will discuss these algorithms and their performance during a recent rover field test.

Gulick, V. C.↗

Efficient Model-Based Diagnosis Engine

An efficient diagnosis engine - a combination of mathematical models and algorithms - has been developed for identifying faulty components in a possibly complex engineering system. This model-based diagnosis engine embodies a twofold approach to reducing, relative to prior model-based diagnosis engines, the amount of computation needed to perform a thorough, accurate diagnosis. The first part of the approach involves a reconstruction of the general diagnostic engine to reduce the complexity of the mathematical-model calculations and of the software needed to perform them. The second part of the approach involves algorithms for computing a minimal diagnosis (the term "minimal diagnosis" is defined below). A somewhat lengthy background discussion is prerequisite to a meaningful summary of the innovative aspects of the present efficient model-based diagnosis engine. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD (see figure). Diagnosis - the task of finding faulty components - is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. A minimal diagnosis stands in contradistinction to the trivial solution, in which all components are deemed to be faulty, and which, therefore, always explains all inconsistencies.

Fijany, Amir↗

New graph-neural-network flavor tagger for Belle II and measurement of sin 2⁢𝜙 1 in 𝐵 0 → 𝐽/𝜓⁢𝐾$^0_ S$ decays

We present GFlaT, a new algorithm that uses a graph-neural-network to determine the flavor of neutral 𝐵 mesons produced in ϒ⁡(4⁢𝑆) decays. It improves previous algorithms by using the information from all charged final-state particles and the relations between them. We evaluate its performance using 𝐵 decays to flavor-specific hadronic final states reconstructed in a 362 fb −1 sample of electron-positron collisions collected at the ϒ⁡(4⁢𝑆) resonance with the Belle II detector at the SuperKEKB collider. We achieve an effective tagging efficiency of (37.40 ± 0.43 ± 0.36%), where the first uncertainty is statistical and the second systematic, which is 18% better than the previous Belle II algorithm. Demonstrating the algorithm, we use 𝐵 0 →𝐽/𝜓⁢𝐾$^0_ S$ decays to measure the mixing-induced and direct 𝐶⁢𝑃 violation parameters, 𝑆 = (0.724 ± 0.035 ± 0.009) and 𝐶 = (−0.035 ± 0.026 ± 0.029).

CP violation↗

Feasibility of automated dropsize distributions from holographic data using digital image processing techniques

An automated technique for measuring particle diameters and their spatial coordinates from holographic reconstructions is being developed. Preliminary tests on actual cold-flow holograms of impinging jets indicate that a suitable discriminant algorithm consists of a Fourier-Gaussian noise filter and a contour thresholding technique. This process identifies circular as well as noncircular objects. The desired objects (in this case, circular or possibly ellipsoidal) are then selected automatically from the above set and stored with their parametric representations. From this data, dropsize distributions as a function of spatial coordinates can be generated and combustion effects due to hardware and/or physical variables studied.

Feinstein, S. P.↗

Upper Atmosphere Research Satellite (UARS) Microwave Limb Sounder (MLS) mapping - Validation, early results and applications

The results of limitation studies performed with the UARS MLS are presented. A consistent set of algorithms allows the extraction of the spectral coefficients in time and longitude from asynoptically sampled satellite data and the subsequent reconstruction of synoptic maps from that spectral information. In addition to providing synoptic maps, the asynoptic technique allows the use of standard spectral analysis tools such as autocorrelation and cross correlation.

Elson, Lee S.↗

Polarized and unpolarized gluon PDFs: Generative machine learning applications for lattice QCD matrix elements at short distance and large momentum

Lattice quantum chromodynamics (QCD) calculations share a defining challenge by requiring a small finite range of spatial separation z between quark/gluon bilinears for controllable power corrections in the perturbative QCD factorization, and a large hadron boost p z for a successful determination of collinear parton distribution functions (PDFs). However, these two requirements make the determination of PDFs from lattice data very challenging. We present the application of generative machine learning algorithms to estimate the polarized and unpolarized gluon correlation functions utilizing short-distance data and extending the correlation up to z p z ≲ 14 , surpassing the current capabilities of lattice QCD calculations. We train physics-informed machine learning algorithms to learn from the short-distance correlation at z ≲ 0.36 fm and take the limit, p z → ∞ , thereby minimizing possible contamination from the higher-twist effects for a successful reconstruction of the polarized gluon PDF. We also expose the bias and problems with underestimating uncertainties associated with the use of model-dependent and overly constrained functional forms, such as x α ( 1 − x ) β and its variants to extract PDFs from the lattice data. We propose the use of generative machine learning algorithms to mitigate these issues and present our determination of the polarized and unpolarized gluon PDFs in the nucleon. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗