Search NASA⌕ Search

SEARCH · Search NASA

Results for “Affine Transformations”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Generic buckling curves for specially orthotropic rectangular plates

Using a double affine transformation, the classical buckling equation for specially orthotropic plates and the corresponding virtual work theorem are presented in a particularly simple fashion. These dual representations are characterized by a single material constant, called the generalized rigidity ratio, whose range is predicted to be the closed interval from 0 to 1 (if this prediction is correct then the numerical results using a ratio greater than 1 in the specially orthotropic plate literature are incorrect); when natural boundary conditions are considered a generalized Poisson's ratio is introduced. Thus the buckling results are valid for any specially orthotropic material; hence the curves presented in the text are generic rather than specific. The solution trends are twofold; the buckling coefficients decrease with decreasing generalized rigidity ratio and, when applicable, they decrease with increasing generalized Poisson's ratio. Since the isotropic plate is one limiting case of the above analysis, it is also true that isotropic buckling coefficients decrease with increasing Poission's ratio.

Brunnelle, E. J.↗
NASA NTRS1985

A Preliminary Assessment of LANDSAT-4 Thematic Mapper Data

The geometric errors for image to map rectification of one Thematic Mapper (TM) scene of an area near Windsor, Ontario were studied. The scene had been produced on computer compatible tape by NASA and contained radiometric and system corrections for geometric distortions. The geometric properties of TM photographic imagery permitted very good fitting to map detail using simple scaling techniques to localized areas and, using simple scaling, the overall geometry remained with 500 meters or 0.4 mm at the image scale of 1:1,141,600. An affine transformation, permitting differential scaling, slightly improves the fit to about 400 meters or 0.35 mm at image scale. The imagery shows promise of having the needed additional resolution and spectral discrimination to provide map revision information in urban-rural areas where the MSS sensor is considered inadequate. The late-season prairie image, however, did not hold such promise, and judgement must be reserved until images are acquired at other seasons in this particular geographic area.

Goodenough, D. G.↗
NASA NTRS1987

On self-similarity of crack layer

The crack layer (CL) theory of Chudnovsky (1986), based on principles of thermodynamics of irreversible processes, employs a crucial hypothesis of self-similarity. The self-similarity hypothesis states that the value of the damage density at a point x of the active zone at a time t coincides with that at the corresponding point in the initial (t = 0) configuration of the active zone, the correspondence being given by a time-dependent affine transformation of the space variables. In this paper, the implications of the self-similarity hypothesis for qusi-static CL propagation is investigated using polystyrene as a model material and examining the evolution of damage distribution along the trailing edge which is approximated by a straight segment perpendicular to the crack path. The results support the self-similarity hypothesis adopted by the CL theory.

Botsis, J.↗
NASA NTRS1992

Mesh generation/refinement using fractal concepts and iterated function systems

A novel method of mesh generation is proposed which is based on the use of fractal concepts to derive contractive, affine transformations. The transformations are constructed in such a manner that the attractors of the resulting maps are a union of the points, lines and surfaces in the domain. In particular, the mesh nodes may be generated recursively as a sequence of points which are obtained by applying the transformations to a coarse background mesh constructed from the given boundary data. A Delaunay triangulation or similar edge connection approach can then be performed on the resulting set of nodes in order to generate the mesh. Local refinement of an existing mesh can also be performed using the procedure. The method is easily extended to three dimensions, in which case the Delaunay triangulation is replaced by an analogous 3D tesselation.

Bova, S. W.↗
NASA NTRS1991

Mid-course multi-target tracking using continuous representation

The thrust of this paper is to present a new approach to multi-target tracking for the mid-course stage of the Strategic Defense Initiative (SDI). This approach is based upon a continuum representation of a cluster of flying objects. We assume that the velocities of the flying objects can be embedded into a smooth velocity field. This assumption is based upon the impossibility of encounters in a high density cluster between the flying objects. Therefore, the problem is reduced to an identification of a moving continuum based upon consecutive time frame observations. In contradistinction to the previous approaches, here each target is considered as a center of a small continuous neighborhood subjected to a local-affine transformation, and therefore, the target trajectories do not mix. Obviously, their mixture in plane of sensor view is apparent. The approach is illustrated by an example.

Zak, Michail↗
NASA NTRS1997

Efficient algorithms for robust feature matching

One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.

Mount, David M.↗
NASA NTRS1947

Calculation of the Pressure Distribution on Bodies of Revolution in the Subsonic Flow of a Gas: Axially Symmetrical Flow - Part 1

The present report concerns a method of computing the velocity and pressure distributions on bodies of revolution in axially symmetrical flow in the subsonic range. The differential equation for the velocity potential Phi of a compressible fluid motion is linearized tn the conventional manner, and then put in the form Delta(Phi) = 0 by affine transformation. The quantity Phi represents the velocity potential of a fictitious incompressible flow, for which a constant superposition of sources by sections is secured by a method patterned after von Karman which must comply with the boundary condition delta(phi)/delta(n) = 0 at the originally specified contour. This requirement yields for the "pseudo-stream function" psi a differential equation which must be fulfilled for as many points on the contour as source lengths are assumed. In this manner, the problem of defining the still unknown source intensities is reduced to the solution of an inhomogeneous equation system. The pressure distribution is then determined with the aid of Bernoulli's equation and adiabatic equation of state. Lastly, the pressure distributions in compressible and incompressible medium are compared on a model problem.

Bilharz, Herbert↗
NASA NTRS2006

Real-time Enhancement, Registration, and Fusion for a Multi-Sensor Enhanced Vision System

Over the last few years NASA Langley Research Center (LaRC) has been developing an Enhanced Vision System (EVS) to aid pilots while flying in poor visibility conditions. The EVS captures imagery using two infrared video cameras. The cameras are placed in an enclosure that is mounted and flown forward-looking underneath the NASA LaRC ARIES 757 aircraft. The data streams from the cameras are processed in real-time and displayed on monitors on-board the aircraft. With proper processing the camera system can provide better-than- human-observed imagery particularly during poor visibility conditions. However, to obtain this goal requires several different stages of processing including enhancement, registration, and fusion, and specialized processing hardware for real-time performance. We are using a real-time implementation of the Retinex algorithm for image enhancement, affine transformations for registration, and weighted sums to perform fusion. All of the algorithms are executed on a single TI DM642 digital signal processor (DSP) clocked at 720 MHz. The image processing components were added to the EVS system, tested, and demonstrated during flight tests in August and September of 2005. In this paper we briefly discuss the EVS image processing hardware and algorithms. We then discuss implementation issues and show examples of the results obtained during flight tests. Keywords: enhanced vision system, image enhancement, retinex, digital signal processing, sensor fusion

Hines, Glenn D.↗
NASA NTRS2006

Real-time Enhancement, Registration, and Fusion for an Enhanced Vision System

Over the last few years NASA Langley Research Center (LaRC) has been developing an Enhanced Vision System (EVS) to aid pilots while flying in poor visibility conditions. The EVS captures imagery using two infrared video cameras. The cameras are placed in an enclosure that is mounted and flown forward-looking underneath the NASA LaRC ARIES 757 aircraft. The data streams from the cameras are processed in real-time and displayed on monitors on-board the aircraft. With proper processing the camera system can provide better-than-human-observed imagery particularly during poor visibility conditions. However, to obtain this goal requires several different stages of processing including enhancement, registration, and fusion, and specialized processing hardware for real-time performance. We are using a real-time implementation of the Retinex algorithm for image enhancement, affine transformations for registration, and weighted sums to perform fusion. All of the algorithms are executed on a single TI DM642 digital signal processor (DSP) clocked at 720 MHz. The image processing components were added to the EVS system, tested, and demonstrated during flight tests in August and September of 2005. In this paper we briefly discuss the EVS image processing hardware and algorithms. We then discuss implementation issues and show examples of the results obtained during flight tests.

Hines, Glenn D.↗
NASA NTRS2011

Image Segmentation, Registration, Compression, and Matching

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Yadegar, Jacob↗
NASA NTRS2018

Automated Pneumothorax Diagnosis using Deep Neural Networks

Thoracic ultrasound can provide information leading to rapid diagnosis of pneumothorax with improved accuracy over the standard physical examination and with higher sensitivity than anteroposterior chest radiography. However, the clinical We have Furthermore, remote environments, such as the battlefield or deep-space exploration, may lack expertise for diagnosing developed an automated image interpretation pipeline for the analysis of thoracic ultrasound data and the classification of pneumothorax events to provide decision support in such situations. Our pipeline consists of image preprocessing, data augmentation, and deep learning architectures for medical diagnosis. In this work, we demonstrate that robust, accurate interpretation of chest images and video can be achieved using deep neural networks. A number of novel image processing techniques were employed to achieve this result. Affine transformations were applied for data augmentation. Hyperparameters were optimized for learning rate, dropout regularization, batch size, and epoch iteration by a sequential model-based Bayesian approach. In addition, we utilized pretrained architecturesinterpretation of a patient medical image is highly operator dependent. certain pathologies., applying transfer learning and fine-tuning techniques to fully connected layers. Our pipeline yielded binary classification validation accuracies of 98.3% for M-mode images and 99.8% with B-mode video frames.

US Army collaboration↗
NASA NTRS2019

Template Matching Used for Small Body Optical Navigation with Poorly Detailed Objects

Object and template matching becomes difficult when an image lacks detail. This is particularly worrisome when typical matching techniques, cross-correlation, log-polar mapping, and key point matching fail. Work herein describes a formulation that identifies objects of interest, estimates the affine transformation between a template object and scene using Principal Component Analysis (PCA), and provides a fit value for the objects and template incorporating Hu's Moments. The algorithm presented is tested on synthetic images and images obtained from the OSIRIS-REx mission while the spacecraft was approaching its target, Bennu. Results for the current formulation show that, with the presence of large-scale variations and rotation, the fitting scheme performs well when compared with other techniques.

Lyzhoft, Joshua R.↗
NASA NTRS2018

Augmented Reality Data Generation for Training Deep Learning Neural Network

One of the major challenges in deep learning is retrieving sufficiently large labeled training datasets, which can become expensive and time consuming to collect. A unique approach to training segmentation is to use Deep Neural Network (DNN) models with a minimal amount of initial labeled training samples. The procedure involves creating synthetic data and using image registration to calculate affine transformations to apply to the synthetic data. The method takes a small dataset and generates a highquality augmented reality synthetic dataset with strong variance while maintaining consistency with real cases. Results illustrate segmentation improvements in various target features and increased average target confidence.

Torres, Gil↗
DOE OSTI2020

Application of Dynamical System Scaling to Bubble Dynamics

Dynamical System Scaling (DSS) provides a useful method for analyzing, categorizing and scaling time-dependent processes. A key feature of DSS is the temporal displacement rate, D, which relates the natural process time to the reference clock time. Because of its property of being invariant under a two-parameter affine transformation, it provides an underlying basis for process scaling. Application of DSS to bubble dynamics serves to elucidate the physical significance of the temporal displacement rate and its role in scaling a variety of bubble dynamics processes. This paper shows that the temporal displacement rate consists of the sum of dimensionless groups that govern the bubble dynamics. Preserving the temporal displacement rate for a prototype and a scaled model results in similitude of the time-dependent normalized bubble size, growth rates and interfacial accelerations for different fluid conditions. For vapor bubble growth in a superheated liquid, it is shown that inertial controlled bubble growth occurs when D=0 and thermally controlled bubble growth occurs when D=1 .

dynamical system scaling, SMR, bubble dynamics, DS↗
DOE OSTI2022

Do Neural Networks Trained with Topological Features Learn Different Internal Representations?

There is a growing body of work that leverages features extracted via topological data analysis to train machine learning models. While this field, sometimes known as topological machine learning (TML), has seen some notable successes, an understanding of how the process of learning from topological features differs from the process of learning from raw data is still limited. In this work, we begin to address one component of this larger issue by asking whether a model trained with topological features learns internal representations of data that are fundamentally different than those learned by a model trained with the original raw data. To quantify ``different'', we exploit two popular metrics that can be used to measure the similarity of the hidden representations of data within neural networks, neural stitching and centered kernel alignment. From these we draw a range of conclusions about how training with topological features does and does not change the representations that a model learns. Perhaps unsurprisingly, we find that structurally, the hidden representations of models trained and evaluated on topological features differ substantially compared to those trained and evaluated on the corresponding raw data. On the other hand, our experiments show that in some cases, these representations can be reconciled (at least to the degree required to solve the corresponding task) using a simple affine transformation. We conjecture that this means that neural networks trained on raw data may extract some limited topological features in the process of making predictions.

McGuire, Sarah L.↗
NASA NTRS1976

A study and evaluation of image analysis techniques applied to remotely sensed data

An analysis of phenomena causing nonlinearities in the transformation from Landsat multispectral scanner coordinates to ground coordinates is presented. Experimental results comparing rms errors at ground control points indicated a slight improvement when a nonlinear (8-parameter) transformation was used instead of an affine (6-parameter) transformation. Using a preliminary ground truth map of a test site in Alabama covering the Mobile Bay area and six Landsat images of the same scene, several classification methods were assessed. A methodology was developed for automatic change detection using classification/cluster maps. A coding scheme was employed for generation of change depiction maps indicating specific types of changes. Inter- and intraseasonal data of the Mobile Bay test area were compared to illustrate the method. A beginning was made in the study of data compression by applying a Karhunen-Loeve transform technique to a small section of the test data set. The second part of the report provides a formal documentation of the several programs developed for the analysis and assessments presented.

Atkinson, R. J.↗
DOE OSTI2023

TwoFold: Highly accurate structure and affinity prediction for protein-ligand complexes from sequences

We describe our development of ab initio protein-ligand binding pose prediction models based on transformers and binding affinity prediction models based on the neural tangent kernel (NTK). Folding both protein and ligand, the TwoFold models achieve efficient and quality predictions matching state-of-the-art implementations while additionally reconstructing protein structures. In conclusion, solving NTK models points to a new use case for highly optimized linear solver benchmarking codes on HPC.

60 APPLIED LIFE SCIENCES↗