Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Planetary Atmosphere Dynamics and Radiative Transfer

This research program has dealt with two projects in the field of planetary atmosphere dynamics and radiative energy transfer, one theoretical and one experimental. The first project, in radiative energy transfer, incorporated the capability to isolate and quantify the contribution of individual atmospheric components to the Venus radiative balance and thermal structure to greatly improve the current understanding of the radiative processes occurring within the Venus atmosphere. This is possible by varying the mixing ratios of each gas species, and the location, number density and aerosol size distributions of the clouds. This project was a continuation of the work initiated under a 1992 University Consortium Agreement. Under the just completed grant, work has continued on the use of a convolution-based algorithm that provided the capability to calculate the k coefficients of a gas mixture at different temperatures, pressures and spectral intervals from the separate k-distributions of the individual gas species. The second primary goal of this research dealt with the Doppler wind retrieval for the Successful Galileo Jupiter probe mission in December, 1995. In anticipation of the arrival of Galileo at Jupiter, software development continued to read the radioscience and probe/orbiter trajectory data provided by the Galileo project and required for Jupiter zonal wind measurements. Sample experiment radioscience data records and probe/orbiter trajectory data files provided by the Galileo Radioscience and Navigation teams at the Jet Propulsion Laboratory, respectively, were used for the first phase of the software development. The software to read the necessary data records was completed in 1995. The procedure by which the wind retrieval takes place begins with initial consistency checks of the raw data, preliminary data reductions, wind recoveries, iterative reconstruction of the probe descent profile, and refined wind recoveries. At each stage of the wind recovery consistency is checked and maintained between the orbiter navigational data, the radioscience data, and the probe descent profile derived by the Atmospheric Instrument Team. Preliminary results show that the zonal winds at Jupiter increase with depth to approximately 150 m/s.

Atkinson, David H.↗
NASA NTRS1990

Hierarchical approach to reconstruct surfaces by using iteratively rectified imagery

A new approach to reconstruct the 3D surface of the object space from digital images is described. All the object points obtained by an automatic orientation procedure lead to a first approximation of the surface. Edges are computed for one image and matched to the other image by grey level correlation or least-squares matching through the scale space. To every discrete step in the scale space there exists the digital stereopair (image pyramid), the corresponding surface digital elevation model (DEM), and the warped images. The warped images in this discrete scale space representation correspond to digital orthophotos obtained from the DEMs that result from matching the image pyramid. The warped images will be used on every successive level in the image pyramid in order to reduce the foreshortening problems associated with any area-based matching method.

Schenk, Toni↗
NASA NTRS2019

Reconstruction of the Adaptable Deployable Entry and Placement Technology Sounding Rocket One Flight Test

The Adaptable Deployable Entry and Placement Technology Sounding Rocket One flight test is a demonstration experiment for deployable atmospheric decelerator technologies. The suborbital flight test occurred on 12 September 2018, at the White Sands Missile Range. Data from on-board and ground-based sensors were collected, from which the as-flown trajectory was reconstructed using an iterative extended Kalman filter-smoother. This paper describes the methodology, test vehicle instrumentation, and data analysis results from the flight test trajectory reconstruction.

Tynis, Jake A.↗
NASA NTRS2024

Iterated Sigma-Point Kalman Filtering for Trajectory Reconstruction

Two second-order Kalman filtering methods are added to the New Statistical Trajec-tory Estimation Program (NewSTEP). The two filters are of the class of Sigma-Point Kalman Filters, namely the Unscented Kalman Filter and the Divided Difference Filter. Both filters are implemented with an iterative measurement update step. Results from simulation test case and a flight data test case are provided to show the filter performance. The results indicate that the new second-order filters pro-duce trajectory estimates with reduced uncertainties when compared to the existing first-order filtering method.

Sophia Vedvik↗
NASA NTRS1980

Methods of using closure phases in radio aperture synthesis

A simple iterative algorithm for reconstructing the images of compact radio sources from very-long-baseline interferometry (VLBI) measurements of visibility amplitudes and 'closure' phases is described. The method makes efficient use of redundant sampling of spatial frequencies by making a global solution of phase 'closure' equations for a complete set of observations.

Rogers, A. E. E.↗
NASA NTRS1987

A new art code for tomographic interferometry

A new algebraic reconstruction technique (ART) code based on the iterative refinement method of least squares solution for tomographic reconstruction is presented. Accuracy and the convergence of the technique is evaluated through the application of numerically generated interferometric data. It was found that, in general, the accuracy of the results was superior to other reported techniques. The iterative method unconditionally converged to a solution for which the residual was minimum. The effects of increased data were studied. The inversion error was found to be a function of the input data error only. The convergence rate, on the other hand, was affected by all three parameters. Finally, the technique was applied to experimental data, and the results are reported.

Tan, H.↗
NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗
NASA NTRS1984

Tomography by iterative convolution - Empirical study and application to interferometry

An algorithm for computer tomography has been developed that is applicable to reconstruction from data having incomplete projections because an opaque object blocks some of the probing radiation as it passes through the object field. The algorithm is based on iteration between the object domain and the projection (Radon transform) domain. Reconstructions are computed during each iteration by the well-known convolution method. Although it is demonstrated that this algorithm does not converge, an empirically justified criterion for terminating the iteration when the most accurate estimate has been computed is presented. The algorithm has been studied by using it to reconstruct several different object fields with several different opaque regions. It also has been used to reconstruct aerodynamic density fields from interferometric data recorded in wind tunnel tests.

Vest, C. M.↗
NASA NTRS1981

X-ray scanning of overhead aurorae from rockets

Two Nike Tomahawk rocket payloads were launched into energetic auroral events in September, 1976 to investigate the structure of these events, as well as their effects on the atmosphere. X-ray scintillation detectors with energy discrimination in four ranges were used to measure the deposition of bremsstrahlung produced X-rays within the stratosphere and mesosphere. Iterative computer techniques were used to reconstruct X-ray source maps at 100 km, taking atmospheric absorption effects into account. Payload 18.178 was launched on September 21st into an aurora having two distinct azimuthal regions of optical brightness. The X-ray scanner detected the same features, and overlays of the X-ray source maps on all-sky photographs showed spatial coincidence of the X-ray with optical features at the lower energies (below 40 keV). Payload 18.179 was launched September 23rd into an aurora with a more diffuse character. The optical structure did not coincide as well with the measured X-ray structure. There was also an indication of a two-component spectrum for each event, with the hard component originating in the more diffuse, optically faint regions.

Barcus, J. R.↗
NASA NTRS1993

Quasi-linear regime of gravitational instability: Implication to density-velocity relation

The well known linear relation between density and peculiar velocity distributions is a powerful tool for studying the large-scale structure in the Universe. Potentially it can test the gravitational instability theory and measure Omega. At present it is used in both ways: the velocity is reconstructed, provided the density is given, and vice versa. Reconstructing the density from the velocity field usually makes use of the Zel'dovich approximation. However, the standard linear approximation in Eulerian space is used when the velocity is reconstructed from the density distribution. I show that the linearized Zel'dovich approximation, in other words the linear approximation in the Lagrangian space, is more accurate for reconstructing velocity. In principle, a simple iteration technique can recover both the density and velocity distributions in Lagrangian space, but its practical application may need an additional study.

Shandarin, Sergei F.↗
NASA NTRS1991

The analysis of a rocket tomography measurement of the N2+3914A emission and N2 ionization rates in an auroral arc

Techniques were developed for recovering two-dimensional distributions of auroral volume emission rates from rocket photometer measurements made in a tomographic spin scan mode. These tomographic inversion procedures are based upon an algebraic reconstruction technique (ART) and utilize two different iterative relaxation techniques for solving the problems associated with noise in the observational data. One of the inversion algorithms is based upon a least squares method and the other on a maximum probability approach. The performance of the inversion algorithms, and the limitations of the rocket tomography technique, were critically assessed using various factors such as (1) statistical and non-statistical noise in the observational data, (2) rocket penetration of the auroral form, (3) background sources of emission, (4) smearing due to the photometer field of view, and (5) temporal variations in the auroral form. These tests show that the inversion procedures may be successfully applied to rocket observations made in medium intensity aurora with standard rocket photometer instruments. The inversion procedures have been used to recover two-dimensional distributions of auroral emission rates and ionization rates from an existing set of N2+3914A rocket photometer measurements which were made in a tomographic spin scan mode during the ARIES auroral campaign. The two-dimensional distributions of the 3914A volume emission rates recoverd from the inversion of the rocket data compare very well with the distributions that were inferred from ground-based measurements using triangulation-tomography techniques and the N2 ionization rates derived from the rocket tomography results are in very good agreement with the in situ particle measurements that were made during the flight. Three pre-prints describing the tomographic inversion techniques and the tomographic analysis of the ARIES rocket data are included as appendices.

Mcdade, Ian C.↗
NASA NTRS2009

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗
NASA NTRS2005

Attitude Issues on the Huygens Probe: Balloon Dropped Mock up Role in Determining Reconstruction Strategies During Descent in Lower Atmosphere

As part of the collaboration with Italian Space Agency on HASI instrument for Huygens mission, University of Padova has been conducting since 2001 scientific activity on Stratospheric Balloon Launches from the Trapani base in Sicily. The most recent boomerang flight in July 2003 has successfully flown a mock up of the Huygens probe hosting spares of flight scientific units and extra housekeeping and scientific sensors on a parachuted descent from 33 kilometre altitude. This work presents the studies conducted on attitude reconstruction of the probe, as well as the utilisation of iterative extended Kalman filtering in investigating vanes induced spin rate and in providing a baseline for the performance evaluation of Huygens accelerometers operations. Finally some possible contributions on the reconstruction of the lower part of Titan descent for Huygens probe are suggested based on the confrontation of sensor data for 2003 flight.

Bettanini, C.↗
NASA NTRS1993

Multigrid properties of upwind-biased data reconstructions

The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

Warren, Gary P.↗
NASA NTRS1971

An iterative clustering procedure

Iterative clustering technique for minimizing probability of differences between binary data reconstructions from cluster codes and initial data

Dinstein, I.↗
NASA NTRS1993

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.↗