Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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.

At least 181 records · Page 10

Accommodating Sensor Uncertainty in the Cones Method: Polycones and Fuzzycones

The "cones method" is an analytical algorithm to combine a pair of angle observations into a common vector. Two new algorithms have been developed to optimize the "cones method" solutions when more than two observation angles are available and when estimates of measurement uncertainties can be made. The polycones algorithm consists of determining a simple weighted average of the solution vectors over all possible pairs of measurements with the weights determined from the measurement uncertainty. The Fuzzycones method finds the vector of maximum probability. Both of these methods have been implemented and tested and both reduce errors in computed vector positions.

Hashmall, Joseph A.↗

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

An application of oil film interferometry (OFI) to measure skin friction on the 3D flow over an NACA 0015 airfoil with 30° of sweep is presented. Local flow direction must be known to apply OFI to complex 3D flows such as this. A recently developed surface flow vector extraction method was integrated into the OFI analysis algorithm. Surface flow vectors were used to calculate the surface streamlines and hence provided local flow direction to the OFI analysis. After calibration using photogrammetry, the surface flow vectors also enabled decomposition of the skin friction coefficient into different components (such as chordwise and spanwise). The presented method successfully measured skin friction at locations with different flow characteristics such as high skin friction regions, strong spanwise flow regions, and 3D flow separated regions. In the current OFI analysis, multiple interferogram images acquired at different times were analyzed for the same location. The multiple interferogram analysis enabled averaging, which reduced the scatter the skin friction data. The results presented herein demonstrate the capability of the current approach, thereby extending OFI skin friction measurements to complex 3D flows.

Skin friction measurement↗

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

An application of oil film interferometry (OFI) to measure skin friction on the 3D flow over an NACA 0015 airfoil with 30° of sweep is presented. Local flow direction must be known to apply OFI to complex 3D flows such as this. A recently developed surface flow vector extraction method was integrated into the OFI analysis algorithm. Surface flow vectors were used to calculate the surface streamlines and hence provided local flow direction to the OFI analysis. After calibration using photogrammetry, the surface flow vectors also enabled decomposition of the skin friction coefficient into different components (such as chordwise and spanwise). The presented method successfully measured skin friction at locations with different flow characteristics such as high skin friction regions, strong spanwise flow regions, and 3D flow separated regions. In the current OFI analysis, multiple interferogram images acquired at different times were analyzed for the same location. The multiple interferogram analysis enabled averaging, which reduced the scatter the skin friction data. The results presented herein demonstrate the capability of the current approach, thereby extending OFI skin friction measurements to complex 3D flows.

Skin friction measurement↗

A Multi-Function AAA Algorithm Applied to Frequency-Dependent Line Modeling: Preprint

We present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages respect to the popular Vector Fitting (VF) algorithm using examples of approximations of admittance matrices discussed in a very recent paper and by the creators of VF. We show that not only MIAAA outperforms VF in terms of achieving better accuracy using a smaller number of poles, but also has no numerical issues to achieve convergence. In contrast to VF, MIAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles.

97 MATHEMATICS AND COMPUTING↗

Three-axis attitude determination from vector observations

Two computationally efficient algorithms are presented for determining three-axis attitude from two or more vector observations. The first of these, the TRIAD algorithm, provides a deterministic (i.e., nonoptimal) solution for the attitude based on two vector observations. The second, the QUEST algorithm, is an optimal algorithm which determines the attitude that achieves the best weighted overlap of an arbitrary number of reference and observation vectors. Analytical expressions are given for the covariance matrices for the two algorithms using a fairly realistic model for the measurement errors. The mathematical relationship of the two algorithms and their relative merits are discussed and numerical examples are given. The advantage of computing the covariance matrix in the body frame rather than in the inertial frame (e.g., in terms of Euler angles) is emphasized. These results are valuable when a single-frame attitude must be computed frequently. They will also be useful to the mission analyst or spacecraft engineer for the evaluation of launch-window constraints or of attitude accuracies for different attitude sensor configurations.

Shuster, M. D.↗

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗

Reducing On-Board Computer Propagation Errors Due to Omitted Geopotential Terms by Judicious Selection of Uploaded State Vector

Several future, and some current missions, use an on-board computer (OBC) force model that is very limited. The OBC geopotential force model typically includes only the J(2), J(3), J(4), C(2,2) and S(2,2) terms to model non-spherical Earth gravitational effects. The Tropical Rainfall Measuring Mission (TRMM), Wide-field Infrared Explorer (WIRE), Transition Region and Coronal Explorer (TRACE), Submillimeter Wave Astronomy Satellite (SWAS), and X-ray Timing Explorer (XTE) all plan to use this geopotential force model on-board. The Solar, Anomalous, and Magnetospheric Particle Explorer (SAMPEX) is already flying this geopotential force model. Past analysis has shown that one of the leading sources of error in the OBC propagated ephemeris is the omission of the higher order geopotential terms. However, these same analyses have shown a wide range of accuracies for the OBC ephemerides. Analysis was performed using EUVE state vectors that showed the EUVE four day OBC propagated ephemerides varied in accuracy from 200 m. to 45 km. depending on the initial vector used to start the propagation. The vectors used in the study were from a single EUVE orbit at one minute intervals in the ephemeris. Since each vector propagated practically the same path as the others, the differences seen had to be due to differences in the inital state vector only. An algorithm was developed that will optimize the epoch of the uploaded state vector. Proper selection can reduce the previous errors of anywhere from 200 m. to 45 km. to generally less than one km. over four days of propagation. This would enable flight projects to minimize state vector uploads to the spacecraft. Additionally, this method is superior to other methods in that no additional orbit estimates need be done. The definitive ephemeris generated on the ground can be used as long as the proper epoch is chosen. This algorithm can be easily coded in software that would pick the epoch within a specified time range that would minimize the OBC propagation error. This techniques should greatly improve the accuracy of the OBC propagation on-board future spacecraft such as TRMM, WIRE, SWAS, and XTE without increasing complexity in the ground processing.

Greatorex, Scott↗

An all digital implementation of a modified Hamming net for video compression with prediction and quantization circuits

The hardware and algorithms used to vector quantize (VQ) predicted pixel intensity differences for real-time video compression are described. The hardware is designed for rapid vector quantization performance, which entails the development of application-specific associative memory circuits. A modified DPCM algorithm is originally examined to determine how neural circuitry could enhance its operation. It was determined that quantization and encoding could be improved by consolidating these two functions into one, and by increasing the amount of information (i.e. number of pixels) quantized at a time. The result is a predictive scheme that vector quantizes differential values. Some of the disadvantages of VQ algorithms are solved using associative memories. The video compression algorithm and the associative memory design are described.

Kaul, Richard↗

Machine Learning (ML) Classifier to Assist Metadata Creation

The Atmospheric Radiation Measurement (ARM) Data Center is responsible for the timely collection, archival, and curation of science data products. These products are freely available through an online data repository. Metadata creation is paramount for scientific users to find and access over seven petabytes of atmospheric science data. The hierarchical metadata structure allows users to search for information at both broad and narrow levels. This project aims to leverage 30 years’ worth of manually created metadata to enable machine predictions of broad-term classifications from narrow-term descriptions. These classification predictions would assist metadata coordinators with their term selections. This paper discusses the cleaning and preprocessing of the training data, the pipeline developed to determine the best model for this task, and the creation of an API metadata classifier for ARM measurement metadata. Our results show that the Linear Support Vector Classification (LinearSVC) algorithm, along with the Term Frequency – Inverse Document Frequency (TF-IDF) vectorizer, is well-suited for our multi-class classification task. Lengthier input training data led to better results, and artificial balancing was unnecessary for this particular use case. This predictive classifier enhances efficiency in metadata creation, as well as supports greater consistency and accuracy in metadata tagging.

Collier, Hannah [ORNL] (ORCID:0000000341284292)↗

Notes from 1999 on computational algorithm of the Local Wave-Vector (LWV) model for the dynamical evolution of the second-rank velocity correlation tensor starting from the mean-flow-coupled Navier-Stokes equations

These notes present an account of the Local Wave Vector (LWV) model of a turbulent flow defined throughout physical space. The previously-developed Local Wave Number (LWN) model is taken as a point of departure. Some general properties of turbulent fields and appropriate notation are given first. The LWV model is presently restricted to incompressible flows and the incompressibility assumption is introduced at an early point in the discussion. The assumption that the turbulence is homogeneous is also introduced early on. This assumption can be relaxed by generalizing the space diffusion terms of LWN, but the present discussion is focused on a modeling of homogeneous turbulence.

97 MATHEMATICS AND COMPUTING↗

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗

Comparison of the MPP with other supercomputers for LANDSAT data processing

The massively parallel processor is compared to the CRAY X-MP and the CYBER-205 for LANDSAT data processing. The maximum likelihood classification algorithm is the basis for comparison since this algorithm is simple to implement and vectorizes very well. The algorithm was implemented on all three machines and tested by classifying the same full scene of LANDSAT multispectral scan data. Timings are compared as well as features of the machines and available software.

Ozga, Martin↗

Miniature Laser Magnetometer

A conceptual design has been developed for a miniature laser magnetometer (MLM) that will measure the scalar magnitude and vector components of near-Earth magnetic fields. The MLM incorporates a number of technical innovations to achieve high-accuracy and high-resolution performance while significantly reducing the size of the laser-pumped helium magnetometer for use on small satellites and unmanned aerial vehicles (UAVs). and electronics sections that has the capability of measuring both the scalar magnetic field magnitude and the vector magnetic field components. Further more, the high-accuracy scalar measurements are used to calibrate and correct the vector component measurements in order to achieve superior vector accuracy and stability. The correction algorithm applied to the vector components for calibration and the same cell for vector and scalar measurements are major innovations. The separate sensor and electronics section of the MLM instrument allow the sensor to be installed on a boom or otherwise located away from electronics and other noisy magnetic components. The MLM s miniaturization will be accomplished through the use of advanced miniaturized components and packaging methods for the MLM sensor and electronics. The MLM conceptual design includes three key innovations. The first is a new non-magnetic laser package that will allow the placement of the laser pump source near the helium cell sensing elements. The second innovation is the design of compact, nested, triaxial Braunbek coils used in the vector measurements that reduce the coil size by a factor of two compared to existing Helmholtz coils with similar field-generation performance. The third innovation is a compact sensor design that reduces the sensor volume by a factor of eight compared to MLM s predecessor.

Slocum, Robert↗

SU-F-J-77: Variations in the Displacement Vector Fields Calculated by Different Deformable Image Registration Algorithms Used in Helical, Axial and Cone-Beam CT Images of a Mobile

Purpose: To investigate quantitatively the displacement-vector-fields (DVF) obtained from different deformable image registration algorithms (DIR) in helical (HCT), axial (ACT) and cone-beam CT (CBCT) to register CT images of a mobile phantom and its correlation with motion amplitudes and frequencies. Methods: HCT, ACT and CBCT are used to image a mobile phantom which includes three targets with different sizes that are manufactured from water-equivalent material and embedded in low density foam. The phantom is moved with controlled motion patterns where a range of motion amplitudes (0–40mm) and frequencies (0.125–0.5Hz) are used. The CT images obtained from scanning of the mobile phantom are registered with the stationary CT-images using four deformable image registration algorithms including demons, fast-demons, Horn-Schunk and Locas-Kanade from DIRART software. Results: The DVF calculated by the different algorithms correlate well with the motion amplitudes that are applied on the mobile phantom where maximal DVF increase linearly with the motion amplitudes of the mobile phantom in CBCT. Similarly in HCT, DVF increase linearly with motion amplitude, however, its correlation is weaker than CBCT. In ACT, the DVF’s do not correlate well with the motion amplitudes where motion induces strong image artifacts and DIR algorithms are not able to deform the ACT image of the mobile targets to the stationary targets. Three DIR-algorithms produce comparable values and patterns of the DVF for certain CT imaging modality. However, DVF from fast-demons deviated strongly from other algorithms at large motion amplitudes. Conclusion: In CBCT and HCT, the DVF correlate well with the motion amplitude of the mobile phantom. However, in ACT, DVF do not correlate with motion amplitudes. Correlations of DVF with motion amplitude as in CBCT and HCT imaging techniques can provide information about unknown motion parameters of the mobile organs in real patients as demonstrated in this phantom visibility study.

60 APPLIED LIFE SCIENCES↗

An algorithm for computing the number of distinct spectral vectors in thematic mapper data

A computationally efficient method was developed to compute the number of distinct spectral vectors and their frequency of occurrence in Landsat-4 Thematic Mapper (TM) data. The algorithm first partitions the image into spectrally disjoint subsets and then computes the frequency distribution of distinct spectral vectors within each subset from a multidimensional histogram. The overall frequency distribution is tabulated by accumulating the results from each subset. The number of distinct spectral vectors could be used as a measure of potential storage compaction of alternate data representations for data compression, or as a measure of information content in the comparison of spectral band combinations and/or spatial resolutions for an image. Results from processing three 512 x 512 pixel Landsat-4 TM images and one Landsat-4 Multispectral Scanner (MSS) image are presented as examples. An algorithm for computing the frequency distribution of distinct spectral vectors in MSS data is given in the Appendix.

Wharton, S. W.↗

TH-EF-207A-01: Respiratory Motion Correction in 4D-Multi Pinhole Small Animal SPECT

Purpose: Respiration causes lesion smearing, image blurring and quality degradation, affecting lesion contrast and the ability to define correct lesion size. The spatial resolution of current multi pinhole SPECT (MPHS) scanners is sub-millimeter. Therefore, the effect of motion is more noticeable in comparison to conventional SPECT scanner. Gated imaging aims to reduce motion artifacts. A major issue in gating is the lack of statistics and individual reconstructed frames are noisy. The increased noise in each frame, deteriorates the quantitative accuracy of the MPHS Images. The objective of this work, is to enhance the image quality in 4D-MPHS imaging, by 4D image reconstruction. Methods: The new algorithm requires deformation vector fields (DVFs) that are calculated by non-rigid Demons registration. The algorithm is based on the motion-incorporated version of ordered subset expectation maximization (OSEM) algorithm. This iterative algorithm is capable to make full use of all projections to reconstruct each individual frame. To evaluate the performance of the proposed algorithm a simulation study was conducted. A fast ray tracing method was used to generate MPHS projections of a 4D digital mouse phantom with a small tumor in liver in eight different respiratory phases. To evaluate the 4D-OSEM algorithm potential, tumor to liver activity ratio was compared with other image reconstruction methods including 3D-MPHS and post reconstruction registered with Demons-derived DVFs. Results: Image quality of 4D-MPHS is greatly improved by the 4D-OSEM algorithm. When all projections are used to reconstruct a 3D-MPHS, motion blurring artifacts are present, leading to overestimation of the tumor size and 24% tumor contrast underestimation. This error reduced to 16% and 10% for post reconstruction registration methods and 4D-OSEM respectively. Conclusion: 4D-OSEM method can be used for motion correction in 4D-MPHS. The statistics and quantification are improved since all projection data are combined together to update the image.

60 APPLIED LIFE SCIENCES↗

Satellite Angular Rate Estimation From Vector Measurements

This paper presents an algorithm for estimating the angular rate vector of a satellite which is based on the time derivatives of vector measurements expressed in a reference and body coordinate. The computed derivatives are fed into a spacial Kalman filter which yields an estimate of the spacecraft angular velocity. The filter, named Extended Interlaced Kalman Filter (EIKF), is an extension of the Kalman filter which, although being linear, estimates the state of a nonlinear dynamic system. It consists of two or three parallel Kalman filters whose individual estimates are fed to one another and are considered as known inputs by the other parallel filter(s). The nonlinear dynamics stem from the nonlinear differential equation that describes the rotation of a three dimensional body. Initial results, using simulated data, and real Rossi X ray Timing Explorer (RXTE) data indicate that the algorithm is efficient and robust.

Azor, Ruth↗

Curved manifolds with conserved Runge-Lenz vectors

van Holten's algorithm is used to construct Runge-Lenz-type conserved quantities, induced by Killing tensors, on curved manifolds. For the generalized Taub-Newman-Unti-Tamburino metric, the most general external potential such that the combined system admits a conserved Runge-Lenz-type vector is found. In the multicenter case, the subclass of two-center metric exhibits a conserved Runge-Lenz-type scalar.

97 MATHEMATICS AND COMPUTING↗