Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “geometric search”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Use of Multi-Resolution Wavelet Feature Pyramids for Automatic Registration of Multi-Sensor Imagery

The problem of image registration, or alignment of two or more images representing the same scene or object, has to be addressed in various disciplines that employ digital imaging. In the area of remote sensing, just like in medical imaging or computer vision, it is necessary to design robust, fast and widely applicable algorithms that would allow automatic registration of images generated by various imaging platforms at the same or different times, and that would provide sub-pixel accuracy. One of the main issues that needs to be addressed when developing a registration algorithm is what type of information should be extracted from the images being registered, to be used in the search for the geometric transformation that best aligns them. The main objective of this paper is to evaluate several wavelet pyramids that may be used both for invariant feature extraction and for representing images at multiple spatial resolutions to accelerate registration. We find that the band-pass wavelets obtained from the Steerable Pyramid due to Simoncelli perform better than two types of low-pass pyramids when the images being registered have relatively small amount of nonlinear radiometric variations between them. Based on these findings, we propose a modification of a gradient-based registration algorithm that has recently been developed for medical data. We test the modified algorithm on several sets of real and synthetic satellite imagery.

Zavorin, Ilya↗
NASA NTRS2005

Use of multiresolution wavelet feature pyramids for automatic registration of multisensor imagery

The problem of image registration, or the alignment of two or more images representing the same scene or object, has to be addressed in various disciplines that employ digital imaging. In the area of remote sensing, just like in medical imaging or computer vision, it is necessary to design robust, fast, and widely applicable algorithms that would allow automatic registration of images generated by various imaging platforms at the same or different times and that would provide subpixel accuracy. One of the main issues that needs to be addressed when developing a registration algorithm is what type of information should be extracted from the images being registered, to be used in the search for the geometric transformation that best aligns them. The main objective of this paper is to evaluate several wavelet pyramids that may be used both for invariant feature extraction and for representing images at multiple spatial resolutions to accelerate registration. We find that the bandpass wavelets obtained from the steerable pyramid due to Simoncelli performs best in terms of accuracy and consistency, while the low-pass wavelets obtained from the same pyramid give the best results in terms of the radius of convergence. Based on these findings, we propose a modification of a gradient-based registration algorithm that has recently been developed for medical data. We test the modified algorithm on several sets of real and synthetic satellite imagery.

Evaluation Studies↗
NASA NTRS1990

A positional estimation technique for an autonomous land vehicle in an unstructured environment

This paper presents a solution to the positional estimation problem of an autonomous land vehicle navigating in an unstructured mountainous terrain. A Digital Elevation Map (DEM) of the area in which the robot is to navigate is assumed to be given. It is also assumed that the robot is equipped with a camera that can be panned and tilted, and a device to measure the elevation of the robot above the ground surface. No recognizable landmarks are assumed to be present in the environment in which the robot is to navigate. The solution presented makes use of the DEM information, and structures the problem as a heuristic search in the DEM for the possible robot location. The shape and position of the horizon line in the image plane and the known camera geometry of the perspective projection are used as parameters to search the DEM. Various heuristics drawn from the geometric constraints are used to prune the search space significantly. The algorithm is made robust to errors in the imaging process by accounting for the worst care errors. The approach is tested using DEM data of areas in Colorado and Texas. The method is suitable for use in outdoor mobile robots and planetary rovers.

Talluri, Raj↗
DOE OSTI2025

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1999

Fast Integer Ambiguity Resolution for GPS Attitude Determination

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

Lightsey, E. Glenn↗
NASA NTRS1990

Navigation path planning for autonomous aircraft - Voronoi diagram approach

The present technique for generating a search graph depicting topologically unique paths around mountain boundaries at constant altitudes involves a description of mountain boundaries as polygons; the search graph is then generated on the basis of a geometric construct. All nodes and arcs of the search graph are guaranteed to lie in free space, thereby ensuring an autonomous aircraft's avoidance of mountain obstacles. The solution path is generated by searching the graph for the optimal path from a start location to a finish location.

Krozel, Jimmy↗
NASA NTRS1989

Identification and verification of termination conditions in fine motion in presence of sensor errors and geometric uncertainties

Results are reported from a search for reasonable constraints under which an automatic uncertainty-handling strategy (for robot part-mating tasks) is guaranteed to succeed. The concept of contact formations is introduced to describe contacts among parts in a system, aiming at reducing the dimensionality of assembly verification. Also described is a technique for identifying contact formations in spite of errors in sensing and geometric uncertainties. It is impossible to verify termination conditions in general. Design constraints for which verification can be guaranteed are formulated and shown to be reasonable in the sense that they do not impose unrealistic conditions on typical designs. Results of implementation on a robot system consisting of a PUMA robot with RTI force/torque sensors support the theoretical derivations and show empirically that good results can still be obtained when the theoretical constraints are relaxed somewhat.

Desai, Rajiv S.↗
NASA NTRS2008

Short- and Long-Term Propagation of Spacecraft Orbits

The Planetary Observer Planning Software (POPS) comprises four computer programs for use in designing orbits of spacecraft about planets. These programs are the Planetary Observer High Precision Orbit Propagator (POHOP), the Planetary Observer Long-Term Orbit Predictor (POLOP), the Planetary Observer Post Processor (POPP), and the Planetary Observer Plotting (POPLOT) program. POHOP and POLOP integrate the equations of motion to propagate an initial set of classical orbit elements to a future epoch. POHOP models shortterm (one revolution) orbital motion; POLOP averages out the short-term behavior but requires far less processing time than do older programs that perform long-term orbit propagations. POPP postprocesses the spacecraft ephemeris created by POHOP or POLOP (or optionally can use a less accurate internal ephemeris) to search for trajectory-related geometric events including, for example, rising or setting of a spacecraft as observed from a ground site. For each such event, POPP puts out such user-specified data as the time, elevation, and azimuth. POPLOT is a graphics program that plots data generated by POPP. POPLOT can plot orbit ground tracks on a world map and can produce a variety of summaries and generic ordinate-vs.-abscissa plots of any POPP data.

Smith, John C., Jr.↗
NASA NTRS1986

Planetary optical and infrared imaging

Images were acquired of a circumstellar disk of orbiting material around the nearby star beta Pictoris. This material is believed to be associated with the formation of planets and provides a first look at a planetary system much younger than our own. Preliminary work was also done to acquire multicolor photometric data and polarimetry on the beta Pictoris disk as well. A coronagraphic search for other proto-planetary systems is also underway. Coronagraphic imaging provided the first clear images and a determination of the geometric albedo of the rings of Uranus. A search for material around the asteroid Amphitrite showed that the region around the asteroid was free of particles larger than 500 meters in radius or diffuse material with an optical depth larger than .000001. NASA IRTF infrared images of Jupiter and Saturn are providing information on the relative heights and cloud top temperatures of atmospheric features.

Terrile, R. J.↗
DOE OSTI2021

Axom

Axom is an open-source library of "building block" software components that provide core infrastructure capabilities for HPC applications. Such capabilities include: input file parsing and verification for various file formats, format specification for material shape input to multi-material simulations and tools for placing those shapes on meshes, parallel distributed coordination of diagnostic messages, geometric primitives, spatial queries and spatial search acceleration data structures, in memory key-value data store for managing simulation data and parallel file I/O. Axom components are used widely across LLNL Advanced Simulation and Computing program applications. It is also part of the LLNL institutionally-supported RADIUSS project, which promotes and funds its adoption by projects across LLNL.

Zagaris, George↗
NASA NTRS1987

IRAS known asteroid prediction and association

Techniques and procedures employed to obtain data concerning the known asteroids from IRAS observations are discussed. The IRAS observations covered 95 percent of the sky with at least four scans of the telescope field of view. A search was first carried out for geometrical intersections of the trajectories of a given asteroid and the telescope boresight, following which a matched sighting was sought for each such intersection among the actual IRAS point source detections. By using ground based measurements of visual magnitudes, IRAS observations of IR brightness, and a thermal model, albedos and diameters have been computed for 1,822 known asteroids, increasing the amount of this kind of information by about an order of magnitude.

Kia, Tooraj↗
NASA NTRS2017

Vortex Generators in a Streamline-Traced, External-Compression Supersonic Inlet

Vortex generators within a streamline-traced, external-compression supersonic inlet for Mach 1.66 were investigated to determine their ability to increase total pressure recovery and reduce total pressure distortion. The vortex generators studied were rectangular vanes arranged in counter-rotating and co-rotating arrays. The vane geometric factors of interest included height, length, spacing, angle-of-incidence, and positions upstream and downstream of the inlet terminal shock. The flow through the inlet was simulated numerically through the solution of the steady-state, Reynolds-averaged Navier-Stokes equations on multi-block, structured grids using the Wind-US flow solver. The vanes were simulated using a vortex generator model. The inlet performance was characterized by the inlet total pressure recovery and the radial and circumferential total pressure distortion indices at the engine face. Design of experiments and statistical analysis methods were applied to quantify the effect of the geometric factors of the vanes and search for optimal vane arrays. Co-rotating vane arrays with negative angles-of-incidence positioned on the supersonic diffuser were effective in sweeping low-momentum flow from the top toward the sides of the subsonic diffuser. This distributed the low-momentum flow more evenly about the circumference of the subsonic diffuser and reduced distortion. Co-rotating vane arrays with negative angles-of-incidence or counter-rotating vane arrays positioned downstream of the terminal shock were effective in mixing higher-momentum flow with lower-momentum flow to increase recovery and decrease distortion. A strategy of combining a co-rotating vane array on the supersonic diffuser with a counter-rotating vane array on the subsonic diffuser was effective in increasing recovery and reducing distortion.

computational fluid dynamics↗
NASA NTRS1987

Constraint-based stereo matching

The major difficulty in stereo vision is the correspondence problem that requires matching features in two stereo images. Researchers describe a constraint-based stereo matching technique using local geometric constraints among edge segments to limit the search space and to resolve matching ambiguity. Edge segments are used as image features for stereo matching. Epipolar constraint and individual edge properties are used to determine possible initial matches between edge segments in a stereo image pair. Local edge geometric attributes such as continuity, junction structure, and edge neighborhood relations are used as constraints to guide the stereo matching process. The result is a locally consistent set of edge segment correspondences between stereo images. These locally consistent matches are used to generate higher-level hypotheses on extended edge segments and junctions to form more global contexts to achieve global consistency.

Kuan, D. T.↗
DOE OSTI2024

Predicted High-Pressure Hot Superconductivity in Li 2 CaH 16 and Li 2 CaH 17 Phases that Resemble the Type-II Clathrate Structure

High-temperature high-pressure superconducting hydrides are typically characterized by cage-like hydrogenic lattices filled with electropositive metal atoms. Here, density functional theory based evolutionary crystal structure searches find two phases that possess these geometric features and are related to the Type-II clathrate structure. In these Fd$\overline{3}$m Li 2 CaH 16 and R$\overline{3}$m Li 2 CaH 17 phases the calcium atom occupies the larger cage and the lithium atom the smaller one. The highest superconducting critical temperatures predicted within the isotropic Eliashberg formalism, 330 K at 350 GPa for Fd$\overline{3}$m Li 2 CaH 16 and 370 K at 300 GPa for R$\overline{3}$m Li 2 CaH 17 , suggest these structures are another example of hot superconducting hydrides. As pressure is lowered the cage-like lattices distort with the emergence of quasimolecular hydrogenic motifs; nonetheless Li 2 CaH 17 is predicted to be superconducting down to 160 GPa at 205 K.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Quantum Spin Dynamics Due to Strong Kitaev Interactions in the Triangular-Lattice Antiferromagnet CsCeSe 2

The extraordinary properties of the Kitaev model have motivated an intense search for new physics in materials that combine geometrical and bond frustration. In this Letter, we employ inelastic neutron scattering, spin wave theory, and exact diagonalization to study the spin dynamics in the perfect triangular-lattice antiferromagnet (TLAF) CsCeSe 2 . This material orders into a stripe phase, which is demonstrated to arise as a consequence of the off-diagonal bond-dependent terms in the spin Hamiltonian. By studying the spin dynamics at intermediate fields, we identify an interaction between the single-magnon state and the two-magnon continuum that causes decay of coherent magnon excitations, level repulsion, and transfer of spectral weight to the continuum that are controlled by the strength of the magnetic field. Our results provide a microscopic mechanism for the stabilization of the stripe phase in TLAF and show how complex many-body physics can be present in the spin dynamics in a magnet with strong Kitaev coupling even in an ordered ground state. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1979

LACIE registration processing

The basic requirements for the LACIE processing system are to extract specified test sites (sample segments) from LANDSAT MSS data, and to apply geometric corrections and perform correlations to ensure registration between successive data acquisitions to within 1 pixel (root mean square). The general flow within the LACIE processing system is described with emphasis on (1) determination of line and pixel location of a search area within an MSS frame; (2) determination of the geometric correction coefficient and the application of geometric corrections; (3) edge detection; and (4) correlation by coincidence of edges.

Grebowsky, G. J.↗
NASA NTRS1972

Algebraic, geometric, and stochastic aspects of genetic operators

Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.

Foo, N. Y.↗
DOE OSTI2026

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗