Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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 1,693 records · Page 94

Shearlet Features for Registration of Remotely Sensed Multitemporal Images

We investigate the role of anisotropic feature extraction methods for automatic image registration of remotely sensed multitemporal images. Building on the classical use of wavelets in image registration, we develop an algorithm based on shearlets, a mathematical generalization of wavelets that offers increased directional sensitivity. Experimental results on multitemporal Landsat images are presented, which indicate superior performance of the shearlet algorithm when compared to classical wavelet algorithms.

Science Data Processing↗

Shearlet Features for Registration of Remotely Sensed Multitemporal Images

We investigate the role of anisotropic feature extraction methods for automatic image registration of remotely sensed multitemporal images. Building on the classical use of wavelets in image registration, we develop an algorithm based on shearlets, a mathematical generalization of wavelets that offers increased directional sensitivity. Experimental results on multitemporal Landsat images are presented, which indicate superior performance of the shearlet algorithm when compared to classical wavelet algorithms.

Science Data Processing↗

Universal dwell time optimization for deterministic optics fabrication

Computer-Controlled Optical Surfacing (CCOS) has been greatly developed and widely used for precision optical fabrication in the past three decades. It relies on robust dwell time solutions to determine how long the polishing tools must dwell at certain points over the surfaces to achieve the expected forms. However, as dwell time calculations are modeled as ill-posed deconvolution, it is always non-trivial to reach a reliable solution that 1) is non-negative, since CCOS systems are not capable of adding materials, 2) minimizes the residual in the clear aperture 3) minimizes the total dwell time to guarantee the stability and efficiency of CCOS processes, 4) can be flexibly adapted to different tool paths, 5) the parameter tuning of the algorithm is simple, and 6) the computational cost is reasonable. In this study, we propose a novel Universal Dwell time Optimization (UDO) model that universally satisfies these criteria. First, the matrix-based discretization of the convolutional polishing model is employed so that dwell time can be flexibly calculated for arbitrary dwell points. Second, UDO simplifies the inverse deconvolution as a forward scalar optimization for the first time, which drastically increases the solution stability and the computational efficiency. Finally, the dwell time solution is improved by a robust iterative refinement and a total dwell time reduction scheme. The superiority and general applicability of the proposed algorithm are verified on the simulations of different CCOS processes. A real application of UDO in improving a synchrotron X-ray mirror using Ion Beam Figuring (IBF) is then demonstrated. The simulation indicates that the estimated residual in the 92.3 mm × 15.7 mm CA can be reduced from 6.32 nm Root Mean Square (RMS) to 0.20 nm RMS in 3.37 min. After one IBF process, the measured residual in the CA converges to 0.19 nm RMS, which coincides with the simulation.

36 MATERIALS SCIENCE↗

SU-C-18A-02: Image-Based Camera Tracking: Towards Registration of Endoscopic Video to CT

Purpose: Endoscopic examinations are routinely performed on head and neck and esophageal cancer patients. However, these images are underutilized for radiation therapy because there is currently no way to register them to a CT of the patient. The purpose of this work is to develop a method to track the motion of an endoscope within a structure using images from standard clinical equipment. This method will be incorporated into a broader endoscopy/CT registration framework. Methods: We developed a software algorithm to track the motion of an endoscope within an arbitrary structure. We computed frame-to-frame rotation and translation of the camera by tracking surface points across the video sequence and utilizing two-camera epipolar geometry. The resulting 3D camera path was used to recover the surrounding structure via triangulation methods. We tested this algorithm on a rigid cylindrical phantom with a pattern spray-painted on the inside. We did not constrain the motion of the endoscope while recording, and we did not constrain our measurements using the known structure of the phantom. Results: Our software algorithm can successfully track the general motion of the endoscope as it moves through the phantom. However, our preliminary data do not show a high degree of accuracy in the triangulation of 3D point locations. More rigorous data will be presented at the annual meeting. Conclusion: Image-based camera tracking is a promising method for endoscopy/CT image registration, and it requires only standard clinical equipment. It is one of two major components needed to achieve endoscopy/CT registration, the second of which is tying the camera path to absolute patient geometry. In addition to this second component, future work will focus on validating our camera tracking algorithm in the presence of clinical imaging features such as patient motion, erratic camera motion, and dynamic scene illumination.

60 APPLIED LIFE SCIENCES↗

Contribution of Meteorological Downscaling to Skill and Precision of Seasonal Drought Forecasts

Research in meteorological prediction on sub-seasonal to seasonal (S2S) timescales has seen growth in recent years. Concurrent with this, demand for seasonal drought forecasting has risen. While there is obvious synergy between these fields, S2S meteorological forecasting has typically focused on low resolution global models, while the development of drought can be sensitive to the local expression of weather anomalies and their interaction with local surface properties and processes. This suggests that downscaling might play an important role in the application of meteorological S2S forecasts to skillful forecasting of drought. Here, we apply the Generalized Analog Regression Downscaling (GARD) algorithm to downscale meteorological hindcasts from the NASA Goddard Earth Observing System (GEOS) global S2S forecast system. Downscaled meteorological fields are then applied to drive offline simulations with the Catchment Land Surface Model (CLSM) to forecast United States Drought Monitor (USDM) style drought indicators derived from simulated surface hydrology variables. We compare the representation of drought in these downscaled hindcasts to hindcasts that are not downscaled, using the North American Land Data Assimilation System Phase 2 (NLDAS-2) dataset as an observational reference. We find that downscaling using GARD improves hindcasts of temperature and temperature anomalies, but the results for precipitation are mixed and generally small. Overall, GARD downscaling led to improved hindcast skill for total drought across the Contiguous United States (CONUS), and improvements were greatest for extreme (D3) and exceptional (D4) drought categories.

Ryan A Zamora↗

Tests of a Semi-Analytical Case 1 and Gelbstoff Case 2 SeaWiFS Algorithm with a Global Data Set

A semi-analytical algorithm was tested with a total of 733 points of either unpackaged or packaged-pigment data, with corresponding algorithm parameters for each data type. The 'unpackaged' type consisted of data sets that were generally consistent with the Case 1 CZCS algorithm and other well calibrated data sets. The 'packaged' type consisted of data sets apparently containing somewhat more packaged pigments, requiring modification of the absorption parameters of the model consistent with the CalCOFI study area. This resulted in two equally divided data sets. A more thorough scrutiny of these and other data sets using a semianalytical model requires improved knowledge of the phytoplankton and gelbstoff of the specific environment studied. Since the semi-analytical algorithm is dependent upon 4 spectral channels including the 412 nm channel, while most other algorithms are not, a means of testing data sets for consistency was sought. A numerical filter was developed to classify data sets into the above classes. The filter uses reflectance ratios, which can be determined from space. The sensitivity of such numerical filters to measurement resulting from atmospheric correction and sensor noise errors requires further study. The semi-analytical algorithm performed superbly on each of the data sets after classification, resulting in RMS1 errors of 0.107 and 0.121, respectively, for the unpackaged and packaged data-set classes, with little bias and slopes near 1.0. In combination, the RMS1 performance was 0.114. While these numbers appear rather sterling, one must bear in mind what mis-classification does to the results. Using an average or compromise parameterization on the modified global data set yielded an RMS1 error of 0.171, while using the unpackaged parameterization on the global evaluation data set yielded an RMS1 error of 0.284. So, without classification, the algorithm performs better globally using the average parameters than it does using the unpackaged parameters. Finally, the effects of even more extreme pigment packaging must be examined in order to improve algorithm performance at high latitudes. Note, however, that the North Sea and Mississippi River plume studies contributed data to the packaged and unpackaged classess, respectively, with little effect on algorithm performance. This suggests that gelbstoff-rich Case 2 waters do not seriously degrade performance of the semi-analytical algorithm.

Carder, Kendall L.↗

Remote Sensing of Cloud Properties using Ground-based Measurements of Zenith Radiance

An extensive verification of cloud property retrievals has been conducted for two algorithms using zenith radiances measured by the Atmospheric Radiation Measurement (ARM) Program ground-based passive two-channel (673 and 870 nm) Narrow Field-Of-View Radiometer. The underlying principle of these algorithms is that clouds have nearly identical optical properties at these wavelengths, but corresponding spectral surface reflectances (for vegetated surfaces) differ significantly. The first algorithm, the RED vs. NIR, works for a fully three-dimensional cloud situation. It retrieves not only cloud optical depth, but also an effective radiative cloud fraction. Importantly, due to one-second time resolution of radiance measurements, we are able, for the first time, to capture detailed changes in cloud structure at the natural time scale of cloud evolution. The cloud optical depths tau retrieved by this algorithm are comparable to those inferred from both downward fluxes in overcast situations and microwave brightness temperatures for broken clouds. Moreover, it can retrieve tau for thin patchy clouds, where flux and microwave observations fail to detect them. The second algorithm, referred to as COUPLED, couples zenith radiances with simultaneous fluxes to infer 2. In general, the COUPLED and RED vs. NIR algorithms retrieve consistent values of tau. However, the COUPLED algorithm is more sensitive to the accuracies of measured radiance, flux, and surface reflectance than the RED vs. NIR algorithm. This is especially true for thick overcast clouds where it may substantially overestimate z.

Chiu, J. Christine↗

Chaos control of Hastings–Powell model by combining chaotic motions

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings–Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: “losing + losing = winning.” If “loosing” is replaced with “chaos” and, “winning” with “order” (as the opposite to “chaos”), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write “chaos + chaos = regular.” Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Thermodynamically consistent algorithms for models of incompressible multiphase polymer solutions with a variable mobility

Here we present a general strategy for developing structure and property preserving numerical algorithms for thermodynamically consistent models of incompressible multiphase polymer solutions with a variable mobility. We first present a formalism to derive thermodynamically consistent, incompressible, multiphase polymer models. Then, we develop the general strategy, known as the supplementary variable method, to devise thermodynamically consistent numerical approximations to the models. We illustrate the numerical strategy using newly developed models of incompressible diblock copolymer solutions coupled with an electric and a magnetic field, respectively. Mesh refinement is conducted to verify convergence rates of the developed schemes. Some numerical examples are given to exhibit underlying dynamics absent from and driven by the external fields, respectively, highlighting differences between models with the variable and constant mobilities.

97 MATHEMATICS AND COMPUTING↗

CELFE: Coupled Eulerian-Lagrangian Finite Element program for high velocity impact. Part 1: Theory and formulation

A 3-D finite element program capable of simulating the dynamic behavior in the vicinity of the impact point, together with predicting the dynamic response in the remaining part of the structural component subjected to high velocity impact is discussed. The finite algorithm is formulated in a general moving coordinate system. In the vicinity of the impact point contained by a moving failure front, the relative velocity of the coordinate system will approach the material particle velocity. The dynamic behavior inside the region is described by Eulerian formulation based on a hydroelasto-viscoplastic model. The failure front which can be regarded as the boundary of the impact zone is described by a transition layer. The layer changes the representation from the Eulerian mode to the Lagrangian mode outside the failure front by varying the relative velocity of the coordinate system to zero. The dynamic response in the remaining part of the structure described by the Lagrangian formulation is treated using advanced structural analysis. An interfacing algorithm for coupling CELFE with NASTRAN is constructed to provide computational capabilities for large structures.

Lee, C. H.↗

A New Pivoting and Iterative Text Detection Algorithm for Biomedical Images

There is interest to expand the reach of literature mining to include the analysis of biomedical images, which often contain a paper's key findings. Examples include recent studies that use Optical Character Recognition (OCR) to extract image text, which is used to boost biomedical image retrieval and classification. Such studies rely on the robust identification of text elements in biomedical images, which is a non-trivial task. In this work, we introduce a new text detection algorithm for biomedical images based on iterative projection histograms. We study the effectiveness of our algorithm by evaluating the performance on a set of manually labeled random biomedical images, and compare the performance against other state-of-the-art text detection algorithms. We demonstrate that our projection histogram-based text detection approach is well suited for text detection in biomedical images, and that the iterative application of the algorithm boosts performance to an F score of .60. We provide a C++ implementation of our algorithm freely available for academic use.

60 APPLIED LIFE SCIENCES↗

A Simplified Algorithm for Statistical Investigation of Damage Spreading

On the way to simulating adaptive evolution of complex system describing a living object or human developed project, a fitness should be defined on node states or network external outputs. Feedbacks lead to circular attractors of these states or outputs which make it difficult to define a fitness. The main statistical effects of adaptive condition are the result of small change tendency and to appear, they only need a statistically correct size of damage initiated by evolutionary change of system. This observation allows to cut loops of feedbacks and in effect to obtain a particular statistically correct state instead of a long circular attractor which in the quenched model is expected for chaotic network with feedback. Defining fitness on such states is simple. We calculate only damaged nodes and only once. Such an algorithm is optimal for investigation of damage spreading i.e. statistical connections of structural parameters of initial change with the size of effected damage. It is a reversed-annealed method--function and states (signals) may be randomly substituted but connections are important and are preserved. The small damages important for adaptive evolution are correctly depicted in comparison to Derrida annealed approximation which expects equilibrium levels for large networks. The algorithm indicates these levels correctly. The relevant program in Pascal, which executes the algorithm for a wide range of parameters, can be obtained from the author.

99 GENERAL AND MISCELLANEOUS↗

Stochastic quasi-steady state approximations for asymptotic solutions of the chemical master equation

In this paper, we propose two methods to carry out the quasi-steady state approximation in stochastic models of enzyme catalytic regulation, based on WKB asymptotics of the chemical master equation or of the corresponding partial differential equation for the generating function. The first of the methods we propose involves the development of multiscale generalisation of a WKB approximation of the solution of the master equation, where the separation of time scales is made explicit which allows us to apply the quasi-steady state approximation in a straightforward manner. To the lowest order, the multi-scale WKB method provides a quasi-steady state, Gaussian approximation of the probability distribution. The second method is based on the Hamilton-Jacobi representation of the stochastic process where, as predicted by large deviation theory, the solution of the partial differential equation for the corresponding characteristic function is given in terms of an effective action functional. The optimal transition paths between two states are then given by those paths that maximise the effective action. Such paths are the solutions of the Hamilton equations for the Hamiltonian associated to the effective action functional. The quasi-steady state approximation is applied to the Hamilton equations thus providing an approximation to the optimal transition paths and the transition time between two states. Using this approximation we predict that, unlike the mean-field quasi-steady approximation result, the rate of enzyme catalysis depends explicitly on the initial number of enzyme molecules. The accuracy and validity of our approximated results as well as that of our predictions regarding the behaviour of the stochastic enzyme catalytic models are verified by direct simulation of the stochastic model using Gillespie stochastic simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of autonomous multirotor platform for exploration missions

This paper outlines development process of unmanned multirotor aerial vehicle HF-4X, which consists of design and manufacturing semi-autonomous UAV dedicated for indoor flight, which would be capable of stable and controllable mission flight. A micro air vehicle was designed to participate in the International Micro Air Vehicle Conference and Flight Competition. In this paper much attention was paid to the structure of flight control system, stabilization algorithms, analysis of IMU sensors, fusion algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DYNAMIC STABILITY OF THE SOLAR SYSTEM: STATISTICALLY INCONCLUSIVE RESULTS FROM ENSEMBLE INTEGRATIONS

Due to the chaotic nature of the solar system, the question of its long-term stability can only be answered in a statistical sense, for instance, based on numerical ensemble integrations of nearby orbits. Destabilization of the inner planets, leading to close encounters and/or collisions can be initiated through a large increase in Mercury's eccentricity, with a currently assumed likelihood of ∼1%. However, little is known at present about the robustness of this number. Here I report ensemble integrations of the full equations of motion of the eight planets and Pluto over 5 Gyr, including contributions from general relativity. The results show that different numerical algorithms lead to statistically different results for the evolution of Mercury's eccentricity (e{sub M}). For instance, starting at present initial conditions (e{sub M}≃0.21), Mercury's maximum eccentricity achieved over 5 Gyr is, on average, significantly higher in symplectic ensemble integrations using heliocentric rather than Jacobi coordinates and stricter error control. In contrast, starting at a possible future configuration (e{sub M}≃0.53), Mercury's maximum eccentricity achieved over the subsequent 500 Myr is, on average, significantly lower using heliocentric rather than Jacobi coordinates. For example, the probability for e{sub M} to increase beyond 0.53 over 500 Myr is >90% (Jacobi) versus only 40%-55% (heliocentric). This poses a dilemma because the physical evolution of the real system—and its probabilistic behavior—cannot depend on the coordinate system or the numerical algorithm chosen to describe it. Some tests of the numerical algorithms suggest that symplectic integrators using heliocentric coordinates underestimate the odds for destabilization of Mercury's orbit at high initial e{sub M}.

79 ASTRONOMY AND ASTROPHYSICS↗

A parallel multigrid preconditioner for the simulation of large fracture networks

Computational modeling of a fracture in disordered materials using discrete lattice models requires the solution of a linear system of equations every time a new lattice bond is broken. Solving these linear systems of equations successively is the most expensive part of fracture simulations using large three-dimensional networks. In this paper, we present a parallel multigrid preconditioned conjugate gradient algorithm to solve these linear systems. Numerical experiments demonstrate that this algorithm performs significantly better than the algorithms previously used to solve this problem.

99 GENERAL AND MISCELLANEOUS↗

A generalized approach for determining electric machine drive switching schemes using evolutionary optimization algorithms

The number of inverter switching events in one fundamental cycle of an electric machine can be limited by many factors such as inverter switching frequency, rotational speed, and computational time required by control algorithms. Even at low and moderate speeds, switching harmonics cause distortion in the phase current, which can lead to increased torque ripple and core losses when compared to operation with ideal waveforms. Furthermore, as rotational speed increases and voltage limitations are encountered, overmodulation schemes must be implemented to overcome increasing reactance and back-EMF (or pseudo back-EMF). The goal of this paper is to establish a framework and demonstrate methods for determining optimal switching times for a set number of switching events in a fundamental cycle using particle swarm optimization and multivariable fitness functions.

Burress, Timothy↗

A Scalable Parallel Wideband MLFMA for Efficient Electromagnetic Simulations on Large Scale Clusters

The development of the multilevel fast multipole algorithm (MLFMA) and its multiscale variants have enabled the use of integral equation (IE) based solvers to compute scattering from complicated structures. Development of scalable parallel algorithms, to extend the reach of these solvers, has been a topic of intense research for about a decade. In this paper, we present a new algorithm for parallel implementation of IE solver that is augmented with a wideband MLFMA and scalable on large number of processors. The wideband MLFMA employed here, to handle multiscale problems, is a hybrid combination of the accelerated Cartesian expansion (ACE) and the classical MLFMA. The salient feature of the presented parallel algorithm is that it is implicitly load balanced and exhibits higher performance. This is achieved by developing a strategy to partition the MLFMA tree, and hence the associated computations, in a self-similar fashion among the parallel processors. As detailed in the paper, the algorithm employs both spatial and direction partitioning approaches in a flexible manner to ensure scalable performance. Plethora of results are presented here to exhibit the scalability of this algorithm on 512 and more processors.

99 GENERAL AND MISCELLANEOUS↗