Search NASASearch

SEARCH · Search NASA

Results for “matrix reconstruction”

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 19 records

4D beam matrix reconstruction in particle accelerators

Transverse beam parameters in particle accelerators are commonly described using the Twiss parameters, which are experimentally accessible yet inherently limited because they neglect correlations between different transverse coordinates. Such correlations frequently arise from uncompensated cathode magnetic fields or misaligned focusing quadrupoles, affecting beam quality and accelerator performance. To address this limitation, we propose and validate a novel diagnostic method for the complete four-dimensional (4D) transverse beam matrix. Our method involves passing the beam through a beamline comprising both conventional and skew quadrupole magnets, followed by downstream measurements of the resulting two-dimensional (2D) beam profiles. These measurements represent distinct 2D projections of the underlying 4D transverse phase–space distribution. By systematically varying quadrupole strengths, multiple independent projections of the beam phase space are obtained. We reconstruct the original 4D beam matrix from these measured projections using an optimization-based least-square fit, providing fast and robust reconstruction regardless of the specific beamline configuration. Through extensive numerical simulations and realistic particle-tracking studies, we demonstrate the diagnostic’s accuracy, robustness, and capability to achieve reconstruction uncertainties smaller than measurement errors, particularly when employing sufficient numbers of quadrupole scans. This method presents a powerful and flexible approach for comprehensive beam characterization and accelerator tuning.

43 PARTICLE ACCELERATORS

Sparse matrix wavefront reconstruction: simulations and experiments

Adaptive optics systems with Shack-Hartmann wavefront sensors require reconstruction of the atmospheric phase error from slope measurements, with every sensor in the array being used in the computation of each actuator command. This fully populated reconstruction matrix can result in a significant computational burden for adaptive optics systems with large numbers of actuators. A method for generating sparse wavefront reconstruction matrices for adaptive optics isproposed. The method exploits the relevance of nearby slope measurements for control of an individual actuator, and relies upon the limited extent of the influence function for a zonal deformable mirror. Relying only on nearby sensor information can significantly reduce the calculation time for wavefront reconstruction. In addition, a hierarchic controller is proposed to recover some of the global wavefront information. The performance of these sparse wavefront reconstruction matrices was evaluated in simulation, and tested on the Palomar Adaptive Optics System. This paper will present some initial results from the simulations and experiments.

space

Bench top interferometric test bed for LISA

Adaptive optics systems with Shack-Hartmann wavefront sensors require reconstruction of the atmospheric phase error from slope measurements, with every sensor in the array being used in the computation of each actuator command. This fully populated reconstruction matrix can result in a significant computational burden for adaptive optics systems with large numbers of actuators. A method for generating sparse wavefront reconstruction matrices for adaptive optics is proposed. The method exploits the relevance of nearby slope measurements for control of an individual actuator, and relies upon the limited extent of the influence function for a zonal deformable mirror. Relying only on nearby sensor information can significantly reduce the calculation time for wavefront reconstruction. In addition, a hierarchic controller is proposed to recover some of the global wavefront information. The performance of these sparse wavefront reconstruction matrices was evaluated in simulation, and tested on the Palomar Adaptive Optics System. This paper will present some initial results from the simulations and experiments.

LISA

Three-Dimensional High-Order Spectral Finite Volume Method for Unstructured Grids

Many areas require a very high-order accurate numerical solution of conservation laws for complex shapes. This paper deals with the extension to three dimensions of the Spectral Finite Volume (SV) method for unstructured grids, which was developed to solve such problems. We first summarize the limitations of traditional methods such as finite-difference, and finite-volume for both structured and unstructured grids. We then describe the basic formulation of the spectral finite volume method. What distinguishes the SV method from conventional high-order finite-volume methods for unstructured triangular or tetrahedral grids is the data reconstruction. Instead of using a large stencil of neighboring cells to perform a high-order reconstruction, the stencil is constructed by partitioning each grid cell, called a spectral volume (SV), into 'structured' sub-cells, called control volumes (CVs). One can show that if all the SV cells are partitioned into polygonal or polyhedral CV sub-cells in a geometrically similar manner, the reconstructions for all the SVs become universal, irrespective of their shapes, sizes, orientations, or locations. It follows that the reconstruction is reduced to a weighted sum of unknowns involving just a few simple adds and multiplies, and those weights are universal and can be pre-determined once for all. The method is thus very efficient, accurate, and yet geometrically flexible. The most critical part of the SV method is the partitioning of the SV into CVs. In this paper we present the partitioning of a tetrahedral SV into polyhedral CVs with one free parameter for polynomial reconstructions up to degree of precision five. (Note that the order of accuracy of the method is one order higher than the reconstruction degree of precision.) The free parameter will be determined by minimizing the Lebesgue constant of the reconstruction matrix or similar criteria to obtain optimized partitions. The details of an efficient, parallelizable code to solve three-dimensional problems for any order of accuracy are then presented. Important aspects of the data structure are discussed. Comparisons with the Discontinuous Galerkin (DG) method are made. Numerical examples for wave propagation problems are presented.

Liu, Yen

Real-Time Wavefront Control for the PALM-3000 High Order Adaptive Optics System

We present a cost-effective scalable real-time wavefront control architecture based on off-the-shelf graphics processing units hosted in an ultra-low latency, high-bandwidth interconnect PC cluster environment composed of modules written in the component-oriented language of nesC. The architecture enables full-matrix reconstruction of the wavefront at up to 2 KHz with latency under 250 us for the PALM-3000 adaptive optics systems, a state-of-the-art upgrade on the 5.1 meter Hale Telescope that consists of a 64 x 64 subaperture Shack-Hartmann wavefront sensor and a 3368 active actuator high order deformable mirror in series with a 241 active actuator tweeter DM. The architecture can easily scale up to support much larger AO systems at higher rates and lower latency.

GPU

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees

Applications such as reconstructing cell lineage trees (represented as phylogenetic trees) from single-cell sequencing data require reconstructing a {0,1}-matrix that has many errors and missing entries. We introduce Sempervirens, a very fast matrix reconstruction algorithm for noisy and incomplete matrix representations of phylogenetic trees. Sempervirens uses an iterative maximum-likelihood approach to determine the topology tree represented by the corrupted data. We show that Sempervirens is at least three orders of magnitude faster than other methods on thousand by thousand matrices, with the speed gap widening with larger matrices. We also show that Sempervirens matches state-of-the-art methods in reconstruction accuracy. The speed of Sempervirens enables it to be tractably applied to reconstructing much larger matrices than those that other methods can reconstruct. In addition to experimental results, we justify the algorithm with a mathematical treatment of its subprocedures.

algorithms

Fatigue loading history reconstruction based on the rainflow technique

Methods are considered of reducing a non-random fatigue loading history to a concise description and then of reconstructing a time history similar to the original. In particular, three methods of reconstruction based on a rainflow cycle counting matrix are presented. A rainflow matrix consists of the numbers of cycles at various peak and valley combinations. Two methods are based on a two-dimensional rainflow matrix, and the third on a three-dimensional rainflow matrix. Histories reconstructed by any of these methods produce a rainflow matrix identical to that of the original history, and the resulting time history is expected to produce a fatigue life similar to that for the original. The procedures described allow lengthy loading histories to be stored in compact form.

Khosrovaneh, A. K.

Fatigue loading history reconstruction based on the rain-flow technique

Methods are considered for reducing a non-random fatigue loading history to a concise description and then for reconstructing a time history similar to the original. In particular, three methods of reconstruction based on a rain-flow cycle counting matrix are presented. A rain-flow matrix consists of the numbers of cycles at various peak and valley combinations. Two methods are based on a two dimensional rain-flow matrix, and the third on a three dimensional rain-flow matrix. Histories reconstructed by any of these methods produce a rain-flow matrix identical to that of the original history, and as a result the resulting time history is expected to produce a fatigue life similar to that for the original. The procedures described allow lengthy loading histories to be stored in compact form.

Khosrovaneh, A. K.

Reconstruction of the 4D beam matrix

The widely used transverse parameters characterizing particle beams are the Twiss parameters. These parameters can be measured experimentally but they do not fully characterize the beam since they do not account for possible correlations in particle distribution between two transverse coordinates. These correlations may occur due to uncompensated magnetic field at the cathode or misalignment of focusing quadrupoles in the transport beamline. We test a novel diagnostic for diagnosing full 4D beam matrix which may be used to identify such imperfections. The diagnostic is based on transporting the beam through the beamline which includes a quadrupole and a skew quadrupole magnets and measuring the resulting 2D beam distribution at the screen downstream. Such a measurement can be viewed as measuring a 2D projection of the 4D distribution. Different settings of the quads provide measurements of different slices of the phase space. The reconstruction of the original beam matrix from a number of measurements is done using machine learning algorithm, which provides a fast and reliable way of reconstruction for an arbitrary configuration of the scanning beamline. In August 2024, we set up the diagnostic beamline to perform a quadrupole scan of the beam. The setup includes a skew quadrupole, a regular quadrupole, and a screen. The images on the screen were post-processed to remove experimental artifacts and enhance contrast by eliminating background noise outside the core of the distribution=. The rms parameters of the distribution were then calculated and used as inputs for the reconstruction algorithm. This algorithm attempts to determine the initial beam matrix that produces expected images on the screen closely matching the observed images across all quadrupole settings. The algorithm found a solution in which the expected rms parameters closely align with the observations. Validation of the results is planned for FY25.

43 PARTICLE ACCELERATORS

Improved Three-Dimensional Reconstructions in Electron Ptychography through Defocus Series Measurements

A detailed analysis of ptychography for three-dimensional (3D) phase reconstructions of thick specimens is performed. Here, we introduce multi-focus ptychography, which incorporates a 4D-STEM defocus series to enhance the quality of 3D reconstructions along the beam direction through a higher overdetermination ratio. This method is compared with established multi-slice ptychography techniques, such as conventional ptychography, regularized ptychography, and multi-mode ptychography. Additionally, we contrast multi-focus ptychography with an alternative method that uses virtual optical sectioning through a reconstructed scattering matrix (S-matrix), which offers more precise 3D structure information compared to conventional ptychography. Our findings from multiple 3D reconstructions based on simulated and experimental data demonstrate that multi-focus ptychography surpasses other techniques, particularly in accurately reconstructing the surfaces and interface regions of thick specimens.

3D reconstruction

A multidimensional approach to quantum state tomography of photoelectron wavepackets

There is a growing interest in reconstructing the density matrix of photoelectron wavepackets, in particular in complex systems where decoherence can be introduced either by a partial measurement of the system or through coupling with a stochastic environment. To this end, several methods to reconstruct the density matrix, quantum state tomography protocols, have been developed and tested on photoelectrons ejected from noble gases following absorption of extreme ultraviolet (XUV) photons from attosecond pulses. It remains a challenge to obtain model-free, single scan protocols that can reconstruct the density matrix with high fidelities. Current methods require extensive measurements or involve complex fitting of the signal. Efficient single-scan reconstructions would be of great help to increase the number of systems that can be studied. We propose a new and more efficient protocol that is able to reconstruct the continuous variable density matrix of a photoelectron in a single time delay scan. It is based on measuring the coherences of a photoelectron created by absorption of an XUV pulse using a broadband infrared (IR) probe that is scanned in time and a narrowband IR reference that is temporally fixed to the XUV pulse. We illustrate its performance for a Fano resonance in He as well as mixed states in Ar arising from spin-orbit splitting. We show that the protocol results in excellent fidelities and near-perfect estimation of the purity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications

Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.

complex networks

An investigative study of multispectral data compression for remotely-sensed images using vector quantization and difference-mapped shift-coding

A study is conducted to investigate the effects and advantages of data compression techniques on multispectral imagery data acquired by NASA's airborne scanners at the Stennis Space Center. The first technique used was vector quantization. The vector is defined in the multispectral imagery context as an array of pixels from the same location from each channel. The error obtained in substituting the reconstructed images for the original set is compared for different compression ratios. Also, the eigenvalues of the covariance matrix obtained from the reconstructed data set are compared with the eigenvalues of the original set. The effects of varying the size of the vector codebook on the quality of the compression and on subsequent classification are also presented. The output data from the Vector Quantization algorithm was further compressed by a lossless technique called Difference-mapped Shift-extended Huffman coding. The overall compression for 7 channels of data acquired by the Calibrated Airborne Multispectral Scanner (CAMS), with an RMS error of 15.8 pixels was 195:1 (0.41 bpp) and with an RMS error of 3.6 pixels was 18:1 (.447 bpp). The algorithms were implemented in software and interfaced with the help of dedicated image processing boards to an 80386 PC compatible computer. Modules were developed for the task of image compression and image analysis. Also, supporting software to perform image processing for visual display and interpretation of the compressed/classified images was developed.

Jaggi, S.

Using Temporal Fill Factor to Reduce Frame Reconstruction Rates

The newer active matrix display technologies such as TFT-LCD, DMD, PDP maintain their pixel values through the entire frame time, presenting a 100% temporal fill factor, in contrast to the duty cycle produced by the phosphor impulse response of the CRT. This sample-and-hold characteristic can be exploited to lower the displayed frame rate without affecting visual quality. The lower frame rate results in significantly lower transmission bandwidth, power, and cost.

Larimer, James

DCT quantization matrices visually optimized for individual images

This presentation describes how a vision model incorporating contrast sensitivity, contrast masking, and light adaptation is used to design visually optimal quantization matrices for Discrete Cosine Transform image compression. The Discrete Cosine Transform (DCT) underlies several image compression standards (JPEG, MPEG, H.261). The DCT is applied to 8x8 pixel blocks, and the resulting coefficients are quantized by division and rounding. The 8x8 'quantization matrix' of divisors determines the visual quality of the reconstructed image; the design of this matrix is left to the user. Since each DCT coefficient corresponds to a particular spatial frequency in a particular image region, each quantization error consists of a local increment or decrement in a particular frequency. After adjustments for contrast sensitivity, local light adaptation, and local contrast masking, this coefficient error can be converted to a just-noticeable-difference (jnd). The jnd's for different frequencies and image blocks can be pooled to yield a global perceptual error metric. With this metric, we can compute for each image the quantization matrix that minimizes the bit-rate for a given perceptual error, or perceptual error for a given bit-rate. Implementation of this system demonstrates its advantages over existing techniques. A unique feature of this scheme is that the quantization matrix is optimized for each individual image. This is compatible with the JPEG standard, which requires transmission of the quantization matrix.

Watson, Andrew B.

From Formal Errors Towards Realistic Uncertainties

Evaluation of uncertainties of geodetic parameter estimates is the problem that is not yet solved in a satisfactory way. A direct evaluation of the uncertainties derived from a least square solution is labeled "formal" and is usually biased, sometimes up to an order of magnitude. Customary, the use of formal errors for scientific analysis is discouraged. We claim that the root of the problem is neglecting off-diagonal elements in the variance-covariance matrix of the noise in the data. A careful reconstruction of the full variance-covariance matrix, including the off-diagonal terms greatly improves realism of uncertainty estimates derived from least squares. We processed the dataset of VLBI group delays and built a prior variance-covariance of the atmosphere-driven noise based on analysis of the output of NASA high-resolution numerical weather models. We found that the uncertainties of parameter estimates derived from this least square solution that uses such variance-covariance matrices become much closer to realistic errors. We consider approaches for implementation of this method in routine data analysis of space geodesy data.

Leonid Petrov

Implementation of Windowed Multipole into MCNP6.3

This work details the implementation of the Windowed MultiPole(WMP) method of generating cross sections into the monte carlo code MCNP6.3, the verification and validation performed, and potential future improvements to be implemented. Further, this work contextualizes WMP within the broader changes to how nuclear data is stored, iterated upon, and used that have been developing over the past decade.

97 MATHEMATICS AND COMPUTING

Mineral and organic matrix interaction in normally calcifying tendon visualized in three dimensions by high-voltage electron microscopic tomography and graphic image reconstruction

To define the ultrastructural accommodation of mineral crystals by collagen fibrils and other organic matrix components during vertebrate calcification, electron microscopic 3-D reconstructions were generated from the normally mineralizing leg tendons from the domestic turkey, Meleagris gallopavo. Embedded specimens containing initial collagen mineralizing sites were cut into 0.5-micron-thick sections and viewed and photographed at 1.0 MV in the Albany AEI-EM7 high-voltage electron microscope. Tomographic 3-D reconstructions were computed from a 2 degree tilt series of micrographs taken over a minimum angular range of +/- 60 degrees. Reconstructions of longitudinal tendon profiles confirm the presence of irregularly shaped mineral platelets, whose crystallographic c-axes are oriented generally parallel to one another and directed along the collagen long axes. The reconstructions also corroborate observations of a variable crystal length (up to 170 nm measured along crystallographic c-axes), the presence of crystals initially in either the hole or overlap zones of collagen, and crystal growth in the c-axis direction beyond these zones into adjacent overlap and other hole regions. Tomography shows for the first time that crystal width varies (30-45 nm) but crystal thickness is uniform (approximately 4-6 nm at the resolution limit of tomography); more crystals are located in the collagen hole zones than in the overlap regions at the earliest stages of tendon mineralization; the crystallographic c-axes of the platelets lie within +/- 15-20 degrees of one another rather than being perfectly parallel; adjacent platelets are spatially separated by a minimum of 4.2 +/- 1.0 nm; crystals apparently fuse in coplanar alignment to form larger platelets; development of crystals in width occurs to dimensions beyond single collagen hole zones; and a thin envelope of organic origin may be present along or just beneath the surfaces of individual mineral platelets. Implicit in the results is that the formation of crystals occurs at different sites and times by independent nucleation events in local regions of collagen. These data provide the first direct visual evidence from 3-D imaging describing the size, shape, orientation, and growth of mineral crystals in association with collagen of a normally mineralizing vertebrate tissue. They support concepts that c-axial crystal growth is unhindered by collage hole zone dimensions, that crystals are organized in the tendon in a series of generally parallel platelets, and that crystal growth in width across collagen fibrils may follow channels or grooves formed by adjacent hole zones in register.

Non-NASA Center