Search NASA⌕ Search

SEARCH · Search NASA

Results for “MAP MATCHING”

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

Optimal experimental design for prediction based on push-forward probability measures

Incorporating experimental data is essential for increasing the credibility of simulation-aided decision making and design. This paper presents a method which uses a computational model to guide the optimal acquisition of experimental data to produce data-informed predictions of quantities of interest (QoI). Many strategies for optimal experimental design (OED) select data that maximize some utility that measures the reduction in uncertainty of uncertain model parameters, for example the expected information gain between prior and posterior distributions of these parameters. In this paper, we seek to maximize the expected information gained from the pushforward of an initial (prior) density to the push-forward of the updated (posterior) density through the parameter-to-prediction map. The formulation presented is based upon the solution of a specific class of stochastic inverse problems which seeks a probability density that is consistent with the model and the data in the sense that the push-forward of this density through the parameter-to-observable map matches a target density on the observable data. While this stochastic inverse problem forms the mathematical basis for our approach, we develop a one-step algorithm, focused on push-forward probability measures, that leverages inference-for-prediction to bypass constructing the solution to the stochastic inverse problem. A number of numerical results are presented to demonstrate the utility of this optimal experimental design for prediction and facilitate comparison of our approach with traditional OED.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing the Mechanism of Selective Phosphate Adsorption from Wastewater Using Aqueous and Synchrotron X-ray Characterization

Ion exchange shows promise for recovering phosphate from wastewater as value-added products, but requires high phosphate selectivity to compete with conventional treatment. Hybrid anion exchange (HAIX) resins, which contain non-selective basic functional groups and selective iron oxide nanoparticles (FeOnp), can effectively remove phosphate from wastewater. However, knowledge gaps remain regarding the mechanisms of phosphate selectivity and influence of competing ions, hindering needed efforts to model adsorption dynamics and design scalable adsorption processes for varying wastewaters. To address these gaps, we integrated aqueous-phase adsorption analysis with solid-phase, synchrotron-based X-ray characterization; this integration facilitated elucidation of the distribution and speciation of iron, phosphate, and competing anions on HAIX resins. We compared a quaternary ammonium-functionalized HAIX resin (SBA) to a tertiary amine version (WBA) to determine the role of functional groups. X-ray radiography revealed differences in FeOnp speciation (goethite vs. ferrihydrite) and distribution (peripheral vs. homogeneous) between the resins, resulting in varied phosphate affinity and intraparticle diffusion resistance. Using micro-X-ray fluorescence (μ-XRF) and micro-X-ray absorption near-edge structure (μ-XANES) spectroscopy, we identified differences in where and how phosphate binds across resin types and wastewaters. Across wastewater compositions, FeOnp sites in WBA contribute more to phosphate adsorption than in SBA, possibly due to variations in Fe distribution and speciation. Phosphate adsorption densities calculated from quantitative μ-XRF maps matched those from aqueous analysis, demonstrating the effectiveness of this integrated approach. Altogether, results demonstrate the use of synchrotron-based X-ray characterization for investigating adsorption mechanisms and advance HAIX as a phosphate recovery technology from complex wastewaters.

Nutrient recovery↗

A Fully Automatic Method for Rapidly Mapping Impacted Area by Natural Disaster

Deep learning based change detection methods have achieved the state-of-the-art performance in several recent studies. However, such methods usually are supervised, and therefore a large number of training samples is often a requisite. Manually preparing those training samples is not only expensive but also time-consuming, which does not fit the need of rapidly mapping the impacted area caused by nature disaster for further rescue mission and damage assessment. In this study, a fully automatic method was proposed to address the issue by automating training sample generation for mapping the impacted area caused by nature disaster. We used the 2011 tornado event in Joplin, Missouri, US, as an example of its application. The generated impacted area map was both visually and quantitatively evaluated against the ground truth data collected by US Federal Emergency Management Agency (FEMA). The results show that the map matches well with the FEMA ground truth data with 86% of major-damaged and destroyed buildings identified by FEMA on the ground also detected by this fully automatic framework using very high resolution (VHR) satellite images.

Liu, Tao↗

A model for simulation and processing of radar images

A model for recording, processing, presentation, and analysis of radar images in digital form is presented. The observed image is represented as having two random components, one which models the variation due to the coherent addition of electromagnetic energy scattered from different objects in the illuminated areas. This component is referred to as fading. The other component is a representation of the terrain variation which can be described as the actual signal which the radar is attempting to measure. The combination of these two components provides a description of radar images as being the output of a linear space-variant filter operating on the product of the fading and terrain random processes. In addition, the model is applied to a digital image processing problem using the design and implementation of enhancement scene. Finally, parallel approaches are being employed as possible means of solving other processing problems such as SAR image map-matching, data compression, and pattern recognition.

Stiles, J. A.↗

Sensor fusion III: 3-D perception and recognition; Proceedings of the Meeting, Boston, MA, Nov. 5-8, 1990

The volume on data fusion from multiple sources discusses fusing multiple views, temporal analysis and 3D motion interpretation, sensor fusion and eye-to-hand coordination, and integration in human shape perception. Attention is given to surface reconstruction, statistical methods in sensor fusion, fusing sensor data with environmental knowledge, computational models for sensor fusion, and evaluation and selection of sensor fusion techniques. Topics addressed include the structure of a scene from two and three projections, optical flow techniques for moving target detection, tactical sensor-based exploration in a robotic environment, and the fusion of human and machine skills for remote robotic operations. Also discussed are K-nearest-neighbor concepts for sensor fusion, surface reconstruction with discontinuities, a sensor-knowledge-command fusion paradigm for man-machine systems, coordinating sensing and local navigation, and terrain map matching using multisensing techniques for applications to autonomous vehicle navigation.

Schenker, Paul S.↗

Cellular-based preemption system

A cellular-based preemption system that uses existing cellular infrastructure to transmit preemption related data to allow safe passage of emergency vehicles through one or more intersections. A cellular unit in an emergency vehicle is used to generate position reports that are transmitted to the one or more intersections during an emergency response. Based on this position data, the one or more intersections calculate an estimated time of arrival (ETA) of the emergency vehicle, and transmit preemption commands to traffic signals at the intersections based on the calculated ETA. Additional techniques may be used for refining the position reports, ETA calculations, and the like. Such techniques include, without limitation, statistical preemption, map-matching, dead-reckoning, augmented navigation, and/or preemption optimization techniques, all of which are described in further detail in the above-referenced patent applications.

Bachelder, Aaron D.↗

Intersection-Controller Software Module

An important part of the emergency-vehicle traffic-light-preemption system summarized in the preceding article is a software module executed by a microcontroller in each intersection controller. This module monitors the broadcasts from all nearby participating emergency vehicles and intersections. It gathers the broadcast data pertaining to the positions and velocities of the vehicles and the timing of traffic and pedestrian lights and processes the data into predictions of the future positions of the vehicles. Analyzing the predictions by a combination of proximity tests, map-matching techniques, and statistical calculations designed to minimize the adverse effects of uncertainties in vehicle positions and headings, the module decides whether to preempt and issues the appropriate commands to the traffic lights, pedestrian lights, and electronic warning signs at the intersection. The module also broadcasts its state to all nearby vehicles and intersections. The module is designed to mitigate the effects of missing data and of unpredictable delays in the system. It has been intensively tested and refined so that it fails to warn in very few cases and issues very few false warnings.

Bachelder, Aaron↗

Trajectory Reconstruction of the ST-9 Sounding Rocket Experiment Using IMU and Landmark Data

This paper presents trajectory reconstruction of the ST-9 sounding rocket experiment using the onboard IMU data and descent imagery. The raw IMU accelerometer measurements are first converted into inertial acceleration and then used in trajectory integration. The descent images are pre-processed using a map-matching algorithm and unique landmarks for each image are created. Using the converted IMU data and descent images, the result from dead-reckoning and the kinematic-fix approaches are first compared with the GPS measurements. Then, both the IMU data and landmarks are processed together using a batch least-squares filter and the position, velocity, stochastic acceleration, and camera orientation of each image are estimated. The reconstructed trajectory is compared with the GPS data and the corresponding formal uncertainties are presented. The result shows that IMU data and descent images processed with a batch filter algorithm provide the trajectory accuracy required for pin-point landing.

Park, Ryan S.↗

Terrain Relative Navigation for Guided Descent on Titan

Titan’s dense atmosphere, low gravity, and high winds at high altitudes create descent times of >90 minutes with standard entry/descent/landing (EDL) architectures and result in large unguided landing ellipses, with 99% values of 110x110 km and 149x72 km in recent Titan lander proposals. Enabling precision landing on Titan could increase science return for the types of missions proposed to date and make additional types of landing sites accessible, opening up new possibilities for science investigations. Precision landing on Titan has unique challenges, because the hazy atmosphere makes it difficult to see the surface and because it requires guided descent with divert ranges that are one to two orders of magnitude larger than needed for other target bodies, i.e. up to on the order of 100 km. It is conceivable that such a divert capability could be provided economically by a parafoil or other steerable aerodynamic decelerator deployed several 10s of km above the surface. The long descent times lead to large inertial navigation errors, hence a need for terrain relative navigation (TRN). This would require a TRN capability that can operate at such altitudes, despite challenges of seeing the surface sufficiently clearly and of depending on map products that are two orders of magnitude lower in spatial resolution than those for Mars and airless bodies. We then develop algorithms for map matching and feature tracking with descent images and test these with synthetic images created from Cassini/Huygens data sets and our radiative transfer model. We also introduce new possibilities for TRN based on the potential to discriminate some specific types of terrain onboard in descent imagery, such as lake vs adjacent ground and dune vs interdune. We use sensor measurement noise models in simulations of state estimation with an extended Kalman filter that includes coordinates of a set of tracked features in the state vector. Case studies were done for two notional landing sites, one in a site with only dry ground and one in a Titan lake district. In both cases, the filter error model shows 3 position error at touchdown on the order of 2 km. More work is needed to validate these results with higher fidelity camera models and larger data sets, but this is very promising.

Matthies, Larry↗

Automated Classification of Vehicle Movements at Signalized Intersections Using Vehicle Trajectories

Accurate vehicle movement classification through signalized intersections is of paramount importance to the analysis of intersection performance and the optimization of traffic control strategies. Conventional techniques for tracking vehicle turning movements depend on infrastructure-based strategies like human counts, loop detectors, and video analytics, all of which are costly, prone to errors, and spatially constrained. High-frequency trajectory data can be utilized to determine vehicle movement patterns in a scalable and infrastructure-independent method due to the adoption of connected vehicles (CVs). In recent years, several studies have utilized connected vehicle data to generate performance measures. Most of the trajectory-based performance measures approaches, however, require map matching-i.e., extracting geospatial references from maps to identify the movements that individual vehicles make at a signalized intersection. These approaches are often time-consuming and hinder scalability since geographic features need to be provided for an analysis to be conducted. Map matching methods are prone to errors as different map versions change these geographic features. This research presents a novel automatic classification pipeline that uses CV trajectory data to classify vehicle movements at signalized crossings, specifically pass-through left-turn and right-turn maneuvers. The process starts by filtering trips that cross a spatial bounding box that has been defined at the target intersection. Approach and departure headings for each trajectory crossing the boundary are computed and are clustered together to identify dominant movements. The proposed algorithm is used to classify the movement of vehicles at 10 intersections in the state of California, and the results indicate that the algorithm can classify movements at these intersections with varying traffic volumes and road network configurations, all in a map-less framework with no need for conflation of vehicle trajectories to a digital base map.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distinctiveness Maps for Image Matching

Stereo correspondence is hard because different image features can look alike. We propose a measure for the ambiguity of image points that allows matching distinctive points first and breaks down the matching task into smaller and separate subproblems. Experiments with an algorithm based on this measure demonstrate the ensuing efficiency and low likelihood of incorrect matches.

Manduchi, Roberto↗

High-resolution mapping of phase-matching conditions in second-order nonlinear crystals

We demonstrate the spatial mapping of phase-matching conditions in nonlinear crystals using detuned second-harmonic generation. A beam-stabilization system cancels out the angular wobbling of the translation stages that scan the crystal under test in front of the static probe beam at the fundamental frequency. A submillimeter resolution over the full scanned aperture, 50 × 50 mm 2 , is demonstrated. The mapping of several partially deuterated potassium dihydrogen phosphate (DKDP) crystals reveals the spatially nonuniform phase-matching conditions due to internal variations in crystal properties and high-frequency surface variations.

36 MATERIALS SCIENCE↗

Turbine adapted maps for turbocharger engine matching

This paper presents a new representation of the turbine performance maps oriented for turbocharger characterization. The aim of this plot is to provide a more compact and suited form to implement in engine simulation models and to interpolate data from turbocharger test bench. The new map is based on the use of conservative parameters as turbocharger power and turbine mass flow to describe the turbine performance in all VGT positions. The curves obtained are accurately fitted with quadratic polynomials and simple interpolation techniques give reliable results. Two turbochargers characterized in an steady flow rig were used for illustrating the representation. After being implemented in a turbocharger submodel, the results obtained with the model have been compared with success against turbine performance evaluated in engine tests cells. A practical application in turbocharger matching is also provided to show how this new map can be directly employed in engine design. (author)

33 ADVANCED PROPULSION SYSTEMS↗

Image registration using binary boundary maps

Registration technique that matches binary boundary maps extracted from raw data, rather than matching actual data, is considerably faster than other techniques. Boundary maps, which are digital representations of regions where image amplitudes change significantly, typically represent data compression of 60 to 70 percent. Maps allow average products to be computed with addition rather than multiplication, further reducing computation time.

Andrus, J. F.↗

Improved high-resolution mapping of phase-matching conditions in second-order nonlinear crystals via imaging

Large-aperture nonlinear crystals for frequency conversion and parametric amplification exhibit spatial variations in phase-matching conditions, which affect the performance of high-power laser systems. We demonstrate significant improvements in speed and resolution to a technique that spatially maps these phase-matching conditions using imaging of the beam resulting from detuned second-harmonic generation. The phase-matching conditions at the pyramidal sector boundary of partially deuterated potassium dihydrogen phosphate (DKDP) are mapped with sub-0.1-mm resolution. We examine the effect of further increases in scan rate on the precision of the technique and demonstrate a scan rate of 0.8 cm 2 per minute at the aforementioned resolution.

Wampler, R. [Univ. of Rochester, NY (United States↗

Mapped Landmark Algorithm for Precision Landing

A report discusses a computer vision algorithm for position estimation to enable precision landing during planetary descent. The Descent Image Motion Estimation System for the Mars Exploration Rovers has been used as a starting point for creating code for precision, terrain-relative navigation during planetary landing. The algorithm is designed to be general because it handles images taken at different scales and resolutions relative to the map, and can produce mapped landmark matches for any planetary terrain of sufficient texture. These matches provide a measurement of horizontal position relative to a known landing site specified on the surface map. Multiple mapped landmarks generated per image allow for automatic detection and elimination of bad matches. Attitude and position can be generated from each image; this image-based attitude measurement can be used by the onboard navigation filter to improve the attitude estimate, which will improve the position estimates. The algorithm uses normalized correlation of grayscale images, producing precise, sub-pixel images. The algorithm has been broken into two sub-algorithms: (1) FFT Map Matching (see figure), which matches a single large template by correlation in the frequency domain, and (2) Mapped Landmark Refinement, which matches many small templates by correlation in the spatial domain. Each relies on feature selection, the homography transform, and 3D image correlation. The algorithm is implemented in C++ and is rated at Technology Readiness Level (TRL) 4.

Johnson, Andrew↗

Mappymatch FKA: YAMM (Yet Another Map-Matcher) [SWR 22-38]

A surprisingly non-trivial technical challenge is to associate points in space (e.g., GPS data) with specific segments of a road network or map. The software package ( allows users to match GPS point data to a road network (commonly known as "map matching"). The software is designed such that a user could match a set of GPS points to a variety of different road network representations using a variety of map matching algorithms. There are currently several "built-in" road networks and map matching algorithms but the software has been designed to enable new ones to be added with minimal overhead.

Reinicke, Nicholas↗