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 1,783 records · Page 99

Wave-by-Wave Forecasting via Assimilation of Marine Radar Data

Abstract This work describes a phase-resolving wave-forecasting algorithm that is based on the assimilation of marine radar image time series. The algorithm is tested against synthetic data and field observations. The algorithm couples X-band marine radar observations with a phase-resolving wave model that uses the linear mild slope equations for reconstruction of water surface elevations over a large domain of O (km) and a prescribed time window of O (min). The reconstruction also enables wave-by-wave forecasting through forward propagation in space and time. Marine radar image time series provide the input wave observations through a previously given relationship between backscatter intensity and the radial component of the sea surface slope. The algorithm assimilates the wave slope information into the model via a best-fit wave source function at the boundary that minimizes the slope reconstruction error over an annular region at the outer ranges of the radar images. The wave model is then able to propagate the waves across a polar domain to a location of interest at nearer ranges. The constraints on the method for achieving real-time forecasting are identified, and the algorithm is verified against synthetic data and tested using field observations.

Engineering↗

Determining the Ensemble N -Representability of Reduced Density Matrices

The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled pseudo-Trotter variational quantum algorithm to probe pure-state N-representability of reduced density matrices [J. Chem. Theory Comput. 2024, 20, 9968], in this work we propose a practical framework for determining the ensemble N-representability of a p-body matrix. This is accomplished using a purification strategy that embeds an ensemble state into a pure state defined on an extended Hilbert space, such that the reduced density matrices of the purified state reproduce those of the original ensemble. By iteratively applying variational unitaries to an initial purified state, the proposed algorithm minimizes the Hilbert-Schmidt distance between its p-body reduced density matrix and a specified target p-body matrix, which serves as a measure of the N-representability of the target. This methodology facilitates both error correction of defective ensemble reduced density matrices and quantum-state reconstruction on a quantum computer, offering a route for density-matrix refinement. We validate the algorithm with numerical simulations on systems of two, three, and four electrons in both simple models as well as molecular systems at finite temperature, demonstrating its robustness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full Waveform Inversion

Concrete is a major construction material worldwide and plays a crucial role in the nuclear industry. The elastic properties of concrete are prone to change and degrade while in service, as it is often subjected to extreme operational and environmental conditions. An accurate evaluation of concrete's elastic properties is thus essential to ensure structural integrity and safety. This is especially true for concrete in nuclear power plants, where irradiation effects significantly impact concrete mechanical properties. There are various methods to assess these properties, with ultrasound-based techniques showing high potential due to their nondestructive nature, cost-effectiveness, and safety. While several nondestructive evaluation methods exist, most rely on idealizations such as assuming homogeneous material and plane wavefronts. In this work, we address these issues by introducing an ultrasound-based nondestructive method aimed at reconstructing spatially varying images of concrete mechanical properties. By accurately modeling wave physics, including scattering and reflection, we overcome several of the aforementioned idealizations and aim to utilize the full waveform for imaging material properties through depth, resulting in more reliable images. Full waveform inversion (FWI) was first introduced by geophysicists to reconstruct subsurface elastic property images. The goal is to minimize the difference between simulated and recorded wavefield signals, often through gradient-based optimization algorithms. While FWI is primarily conducted using the acoustic approximation of the wave equation, few works focus on elastic FWI, where the goal is to reconstruct images of not only the pressure wave speed but also the shear wave speed and density (or their equivalents). This work explores the potential of using elastic FWI to predict concrete mechanical properties as an initial effort for a more accurate monitoring of concrete conditions in service. Reconstructing images of different elastic parameters enables more specificity and accurate condition diagnosis. This paper will detail this approach and provide examples demonstrating the effectiveness of elastic FWI in reconstructing comprehensive maps of concrete mechanical properties.

42 - ENGINEERING↗

FEASIBILITY OF LOW‐FREQUENCY STRAIGHT‐RAY GUIDED WAVE TOMOGRAPHY

Many aging pipelines and aircraft are suffering from corrosion and the corrosion patches are often inaccessible. There is therefore a need for a rapid, accurate, long range inspection technique to measure the remaining thickness in corrosion patches. Low‐frequency guided wave tomography is a potentially attractive technique to rapidly evaluate the thickness of large sections of partially accessible structures. This paper demonstrates that in the low‐frequency regime the ray theory may not be valid which compromises the use of any straight‐ray tomography algorithm. This paper also shows, in simulations and experimentally, that the same frequency regime can be used to successfully reconstruct thickness reduction in plates with diffraction tomography.

42 ENGINEERING↗

SIRENA Software for Athena X-IFU Event Reconstruction

The X-ray Observatory Athena was proposed in April 2014 as the mission to implement the science theme "The Hot and Energetic Universe" selected by ESA for L2 (the second Large-class mission in ESAs Cosmic Vision science programme). One of the two X-ray detectors designed to be onboard Athena is X-IFU, a cryogenic microcalorimeter based on Transition Edge Sensor (TES) technology that will provide spatially resolved high-resolution spectroscopy. X-IFU will be developed by an international consortium led by IRAP (PI), SRON (co-PI) and IAPS/INAF (co-PI) and involving ESA Member States, Japan and the United States. In Spain, IFCA (CSIC-UC) has an anticipated contribution to X-IFU through the Digital Readout Electronics (DRE) unit, in particular in the Event Processor Subsytem. For this purpose and in collaboration with the Athena end-to-end simulations team, we are currently developing the SIRENA package as part of the publicly available SIXTE end-to-end simulator. SIRENA comprises a set of processing algorithms aimed at recognizing, from a noisy signal, the intensity pulses generated by the absorption of the X-ray photons, to lately reconstruct their energy, position and arrival time. This poster describes the structure of the package and the different algorithms currently implemented as well as their comparative performance in the energy resolution achieved in the reconstruction of the instrument events.

M T Ceballos↗

Measurement of the top quark mass and pp{yields}tt cross section in the all-hadronic mode with the CDF II detector

We present a measurement of the top quark mass and of the top-antitop (tt) pair production cross section using pp data collected with the CDF II detector at the Tevatron Collider at the Fermi National Accelerator Laboratory and corresponding to an integrated luminosity of 2.9 fb{sup -1}. We select events with six or more jets satisfying a number of kinematical requirements imposed by means of a neural-network algorithm. At least one of these jets must originate from a b quark, as identified by the reconstruction of a secondary vertex inside the jet. The mass measurement is based on a likelihood fit incorporating reconstructed mass distributions representative of signal and background, where the absolute jet energy scale (JES) is measured simultaneously with the top quark mass. The measurement yields a value of 174.8{+-}2.4(stat+JES){sub -1.0}{sup +1.2}(syst) GeV/c{sup 2}, where the uncertainty from the absolute jet energy scale is evaluated together with the statistical uncertainty. The procedure also measures the amount of signal from which we derive a cross section, {sigma}{sub tt}=7.2{+-}0.5(stat){+-}1.0(syst){+-}0.4(lum) pb, for the measured values of top quark mass and JES.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dictionary construction in sparse methods for image restoration

Sparsity-based methods have achieved very good performance in a wide variety of image restoration problems, including denoising, inpainting, super-resolution, and source separation. These methods are based on the assumption that the image to be reconstructed may be represented as a superposition of a few known components, and the appropriate linear combination of components is estimated by solving an optimization such as Basis Pursuit De-Noising (BPDN). Considering that the K-SVD constructs a dictionary which has been optimised for mean performance over a training set, it is not too surprising that better performance can be achieved by selecting a custom dictionary for each individual block to be reconstructed. The nearest neighbor dictionary construction can be understood geometrically as a method for estimating the local projection into the manifold of image blocks, whereas the K-SVD dictionary makes more sense within a source-coding framework (it is presented as a generalization of the k-means algorithm for constructing a VQ codebook), is therefore, it could be argued, less appropriate in principle, for reconstruction problems. One can, of course, motivate the use of the K-SVD in reconstruction application on practical grounds, avoiding the computational expense of constructing a different dictionary for each block to be denoised. Since the performance of the nearest neighbor dictionary decreases when the dictionary becomes sufficiently large, this method is also superior to the approach of utilizing the entire training set as a dictionary (and this can also be understood within the image block manifold model). In practical terms, the tradeoff is between the computational cost of a nearest neighbor search (which can be achieved very efficiently), or of increased cost at the sparse optimization.

99 GENERAL AND MISCELLANEOUS↗

SU-D-18A-02: Towards Real-Time On-Board Volumetric Image Reconstruction for Intrafraction Target Verification in Radiation Therapy

Purpose: To expedite on-board volumetric image reconstruction from limited-angle kV—MV projections for intrafraction verification. Methods: A limited-angle intrafraction verification (LIVE) system has recently been developed for real-time volumetric verification of moving targets, using limited-angle kV—MV projections. Currently, it is challenged by the intensive computational load of the prior-knowledge-based reconstruction method. To accelerate LIVE, we restructure the software pipeline to make it adaptable to model and algorithm parameter changes, while enabling efficient utilization of rapidly advancing, modern computer architectures. In particular, an innovative two-level parallelization scheme has been designed: At the macroscopic level, data and operations are adaptively partitioned, taking into account algorithmic parameters and the processing capacity or constraints of underlying hardware. The control and data flows of the pipeline are scheduled in such a way as to maximize operation concurrency and minimize total processing time. At the microscopic level, the partitioned functions act as independent modules, operating on data partitions in parallel. Each module is pre-parallelized and optimized for multi-core processors (CPUs) and graphics processing units (GPUs). Results: We present results from a parallel prototype, where most of the controls and module parallelization are carried out via Matlab and its Parallel Computing Toolbox. The reconstruction is 5 times faster on a data-set of twice the size, compared to recently reported results, without compromising on algorithmic optimization control. Conclusion: The prototype implementation and its results have served to assess the efficacy of our system concept. While a production implementation will yield much higher processing rates by approaching full-capacity utilization of CPUs and GPUs, some mutual constraints between algorithmic flow and architecture specifics remain. Based on a careful analysis of the prototype performance, it will be feasible to resolve such issues through appropriate algorithmic modifications or special-purpose hardware, thus enabling target verification in seconds with the LIVE system. This work was partially supported by a research grant from Varian Medical Systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Phase-retrieval algorithms for a complicated optical system

Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradient-search algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterization of complicated optical systems from their point spread functions.

Fienup, J. R.↗

Beam-Based Diagnostics of Electric Guide Fields and Lattice Parameters for Run-1 of the Muon g-2 Storage Ring at Fermilab

A portion of the Muon g-2 Storage Ring electric system, which provides vertical beam focusing, exhibited an unexpected time dependence that produced a characteristic evolution of the stored beam during Run-1 of the Muon g-2 Experiment at Fermilab (E989). A method to reconstruct the Run-1 electric guide fields has been developed, which is based on a numerical model of the muon storage ring and optimization algorithms supported by COSY INFINITY. This method takes beam profile measurements from the Muon g-2 straw tracking detectors as input, and it produces a full reconstruction of the time-dependent fields. The fields can then be used for the reproduction of detailed beam tracking simulations and the calculation of ring lattice parameters for acceptance studies and systematic error evaluations.

43 PARTICLE ACCELERATORS↗

Magnetic particle imaging of blood coagulation

We investigated the feasibility of visualizing blood coagulation using a system for magnetic particle imaging (MPI). A magnetic field-free line is generated using two opposing neodymium magnets and transverse images are reconstructed from the third-harmonic signals received by a gradiometer coil, using the maximum likelihood-expectation maximization algorithm. Our MPI system was used to image the blood coagulation induced by adding CaCl{sub 2} to whole sheep blood mixed with magnetic nanoparticles (MNPs). The “MPI value” was defined as the pixel value of the transverse image reconstructed from the third-harmonic signals. MPI values were significantly smaller for coagulated blood samples than those without coagulation. We confirmed the rationale of these results by calculating the third-harmonic signals for the measured viscosities of samples, with an assumption that the magnetization and particle size distribution of MNPs obey the Langevin equation and log-normal distribution, respectively. We concluded that MPI can be useful for visualizing blood coagulation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Recent numerical and algorithmic advances within the volume tracking framework for modeling interfacial flows

A review of recent advances made in numerical methods and algorithms within the volume tracking framework is presented. The volume tracking method, also known as the volume-of-fluid method has become an established numerical approach to model and simulate interfacial flows. Its advantage is its strict mass conservation. However, because the interface is not explicitly tracked but captured via the material volume fraction on a fixed mesh, accurate estimation of the interface position, its geometric properties and modeling of interfacial physics in the volume tracking framework remain difficult. Several improvements have been made over the last decade to address these challenges. In this study, the multimaterial interface reconstruction method via power diagram, curvature estimation via heights and mean values and the balanced-force algorithm for surface tension are highlighted.

97 MATHEMATICS AND COMPUTING↗

Flexible Learning-Free Segmentation and Reconstruction of Neural Volumes

Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specifc contextual clues and requires no training. This approach generalizes across diferent modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal refectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fdelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufcient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively.

47 OTHER INSTRUMENTATION↗

Publisher Correction: Flexible Learning-Free Segmentation and Reconstruction of Neural Volumes

Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual clues and requires no training. This approach generalizes across different modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fidelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufficient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively.

Shahbazi, Ali↗

Lowering the Energy Threshold of the CUORE Experiment: Benefits in the Surface Alpha Events Reconstruction

CUORE is a tonne-scale cryogenic experiment located at the Laboratori Nazionali del Gran Sasso that exploits bolometric technique to search for neutrinoless double beta decay of 130 Te. Thanks to its very low background and large mass, CUORE is also a powerful tool to study a broad class of phenomena, such as solar axions and WIMP scattering. The ability to conduct such sensitive searches crucially depends on the energy threshold, which has to be kept as low as possible. Here, we show how the trigger algorithm affects the sensitivity to low-energy phenomena and the interpretation of the energy spectrum. In particular, we focus on the impact that the trigger algorithm has on the identification of the coincidence events among different crystals and, consequently, on the reconstruction of the background.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Worst configurations (instantons) for compressed sensing over reals: a channel coding approach

We consider Linear Programming (LP) solution of a Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation as a channel-coding problem, and it guarantees the error-free reconstruction over reals for properly chosen measurement matrix and sufficiently sparse error vectors. In this manuscript, we examine how the BasP performs on a given measurement matrix and develop a technique to discover sparse vectors for which the BasP fails. The resulting algorithm is a generalization of our previous results on finding the most probable error-patterns, so called instantons, degrading performance of a finite size Low-Density Parity-Check (LDPC) code in the error-floor regime. The BasP fails when its output is different from the actual error-pattern. We design CS-Instanton Search Algorithm (ISA) generating a sparse vector, called CS-instanton, such that the BasP fails on the instanton, while its action on any modification of the CS-instanton decreasing a properly defined norm is successful. We also prove that, given a sufficiently dense random input for the error-vector, the CS-ISA converges to an instanton in a small finite number of steps. Performance of the CS-ISA is tested on example of a randomly generated 512 * 120 matrix, that outputs the shortest instanton (error vector) pattern of length 11.

99 GENERAL AND MISCELLANEOUS↗

A Segmentation Algorithm for X-ray 3D Angiography and Vessel Catheterization

Vessel Catheterization is a clinical procedure usually performed by a specialist by means of X-ray fluoroscopic guide with contrast-media. In the present paper, we present a simple and efficient algorithm for vessel segmentation which allows vessel separation and extraction from the background (noise and signal coming from other organs). This would reduce the number of projections (X-ray scans) to reconstruct a complete and accurate 3D vascular model and the radiological risk, in particular for the patient. In what follows, the algorithm is described and some preliminary experimental results are reported illustrating the behaviour of the proposed method.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The potential of positron emission tomography for intratreatment dynamic lung tumor tracking: A phantom study

Purpose: This study aims to evaluate the potential and feasibility of positron emission tomography for dynamic lung tumor tracking during radiation treatment. The authors propose a center of mass (CoM) tumor tracking algorithm using gated-PET images combined with a respiratory monitor and investigate the geometric accuracy of the proposed algorithm. Methods: The proposed PET dynamic lung tumor tracking algorithm estimated the target position information through the CoM of the segmented target volume on gated PET images reconstructed from accumulated coincidence events. The information was continuously updated throughout a scan based on the assumption that real-time processing was supported (actual processing time at each frame ≈10 s). External respiratory motion and list-mode PET data were acquired from a phantom programmed to move with measured respiratory traces (external respiratory motion and internal target motion) from human subjects, for which the ground truth target position was known as a function of time. The phantom was cylindrical with six hollow sphere targets (10, 13, 17, 22, 28, and 37 mm in diameter). The measured respiratory traces consisted of two sets: (1) 1D-measured motion from ten healthy volunteers and (2) 3D-measured motion from four lung cancer patients. The authors evaluated the geometric accuracy of the proposed algorithm by quantifying estimation errors (Euclidean distance) between the actual motion of targets (1D-motion and 3D-motion traces) and CoM trajectories estimated by the proposed algorithm as a function of time. Results: The time-averaged error of 1D-motion traces over all trajectories of all targets was 1.6 mm. The error trajectories decreased with time as coincidence events were accumulated. The overall error trajectory of 1D-motion traces converged to within 2 mm in approximately 90 s. As expected, more accurate results were obtained for larger targets. For example, for the 37 mm target, the average error over all 1D-motion traces was 1.1 mm; and for the 10 mm target, the average error over all 1D-motion traces was 2.8 mm. The overall time-averaged error of 3D-motion traces was 1.6 mm, which was comparable to that of the 1D-motion traces. There were small variations in the errors between the 3D-motion traces, although the motion trajectories were very different. The accuracy of the estimates was consistent for all targets except for the smallest. Conclusions: The authors developed an algorithm for dynamic lung tumor tracking using list-mode PET data and a respiratory motion signal, and demonstrated proof-of-principle for PET-guided lung tumor tracking. The overall tracking error in phantom studies is less than 2 mm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗