Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Line search 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Robust integration schemes for generalized viscoplasticity with internal-state variables. Part 1: Theoretical developments and applications

This two-part report is concerned with the development of a general framework for the implicit time-stepping integrators for the flow and evolution equations in generalized viscoplastic models. The primary goal is to present a complete theoretical formulation, and to address in detail the algorithmic and numerical analysis aspects involved in its finite element implementation, as well as to critically assess the numerical performance of the developed schemes in a comprehensive set of test cases. On the theoretical side, the general framework is developed on the basis of the unconditionally-stable, backward-Euler difference scheme as a starting point. Its mathematical structure is of sufficient generality to allow a unified treatment of different classes of viscoplastic models with internal variables. In particular, two specific models of this type, which are representative of the present start-of-art in metal viscoplasticity, are considered in applications reported here; i.e., fully associative (GVIPS) and non-associative (NAV) models. The matrix forms developed for both these models are directly applicable for both initially isotropic and anisotropic materials, in general (three-dimensional) situations as well as subspace applications (i.e., plane stress/strain, axisymmetric, generalized plane stress in shells). On the computational side, issues related to efficiency and robustness are emphasized in developing the (local) interative algorithm. In particular, closed-form expressions for residual vectors and (consistent) material tangent stiffness arrays are given explicitly for both GVIPS and NAV models, with their maximum sizes 'optimized' to depend only on the number of independent stress components (but independent of the number of viscoplastic internal state parameters). Significant robustness of the local iterative solution is provided by complementing the basic Newton-Raphson scheme with a line-search strategy for convergence. In the present first part of the report, we focus on the theoretical developments, and discussions of the results of numerical-performance studies using the integration schemes for GVIPS and NAV models.

Saleeb, Atef F.↗
NASA NTRS1974

The Global Rescue Alarm Net (GRAN): Concept and approaches

The GRAN Experiment is designed to prove a world-wide search and rescue (SAR) system utilizing Omega navigation system signals and geo-synchronous satellites. In order to develop a SAR system, the original NASA Omega Position Locating Equipment (OPLE) experiments have been expanded by the Naval Air Test Center, Patuxent River. Specifically, a fourth frequency (10.880 KHz) has been added experimentally to two Omega transmitters. This will increase line of position (LOP) ambiguities from 72 nautical miles to 360 nmi apart. Algorithms have been developed to resolve the 360 nmi ambiguities. During September and October 1974, two series of tests were conducted with Lincoln Experimental Satellite 6 (LES-6) to demonstrate the position locating potential of the four-frequency Omega concept.

Calise, C. L.↗
NASA NTRSDate not supplied

Resolving Wave-Particle Duality Could Accelerate the Mass Production of Quantum Computers

Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern. Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern.

Quantum Computer↗
NASA NTRS1976

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗
NASA NTRS2024

Redundancy Parameterization and Inverse Kinematics of 7-DOF Revolute Manipulators

Seven degree-of-freedom (DOF) robot arms have one redundant DOF for obstacle and singularity avoidance. This DOF does not change the end effector motion and must be parameterized to fully specify the joint angles for a given end effector pose. For 7-DOF revolute (7R) manipulators, we introduce the generalized shoulder-elbow-wrist (SEW) angle, a generalization of the widely-used conventional SEW angle but with an arbitrary reference direction function, along with Jacobian expressions and singularity analysis. Other redundancy parameterizations including the conventional SEW angle encounter an algorithmic singularity along a line in the workspace. We introduce a reference direction function choice called the stereographic SEW angle which has a singularity only along a half-line and can be placed out of reach. We prove such a singularity is unavoidable for any parameterization. Finally, using the general SEW angle and the subproblem decomposition method, we provide efficient singularity-robust inverse kinematics solutions for 7R manipulators which are often closed-form but may involve a 1D or (in general) 2D search. Search-based solutions may be converted to finding polynomial roots. Examples are available in a publicly accessible repository.

Kinematics↗
NASA NTRS2005

NASA Tech Briefs, March 2005

Topics covered include: Scheme for Entering Binary Data Into a Quantum Computer; Encryption for Remote Control via Internet or Intranet; Coupled Receiver/Decoders for Low-Rate Turbo Codes; Processing GPS Occultation Data To Characterize Atmosphere; Displacing Unpredictable Nulls in Antenna Radiation Patterns; Integrated Pointing and Signal Detector for Optical Receiver; Adaptive Thresholding and Parameter Estimation for PPM; Data-Driven Software Framework for Web-Based ISS Telescience; Software for Secondary-School Learning About Robotics; Fuzzy Logic Engine; Telephone-Directory Program; Simulating a Direction-Finder Search for an ELT; Formulating Precursors for Coating Metals and Ceramics; Making Macroscopic Assemblies of Aligned Carbon Nanotubes; Ball Bearings Equipped for In Situ Lubrication on Demand; Synthetic Bursae for Robots; Robot Forearm and Dexterous Hand; Making a Metal-Lined Composite-Overwrapped Pressure Vessel; Ex Vivo Growth of Bioengineered Ligaments and Other Tissues; Stroboscopic Goggles for Reduction of Motion Sickness; Articulating Support for Horizontal Resistive Exercise; Modified Penning-Malmberg Trap for Storing Antiprotons; Tumbleweed Rovers; Two-Photon Fluorescence Microscope for Microgravity Research; Biased Randomized Algorithm for Fast Model-Based Diagnosis; Fast Algorithms for Model-Based Diagnosis; Simulations of Evaporating Multicomponent Fuel Drops; Formation Flying of Tethered and Nontethered Spacecraft; and Two Methods for Efficient Solution of the Hitting- Set Problem.

Source record↗
NASA NTRS2002

A Lightning Channel Retrieval Algorithm for the North Alabama Lightning Mapping Array (LMA)

A new multi-station VHF time-of-arrival (TOA) antenna network is, at the time of this writing, coming on-line in Northern Alabama. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The network will support on-going ground validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. It will also provide for many interesting and detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and will offer many interesting comparisons with other meteorological/geophysical wets associated with lightning and thunderstorms. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. In this study, a new revised channel mapping retrieval algorithm is introduced. The algorithm is an extension of earlier work provided in Koshak and Solakiewicz (1996) in the analysis of the NASA Kennedy Space Center (KSC) Lightning Detection and Ranging (LDAR) system. As in the 1996 study, direct algebraic solutions are obtained by inverting a simple linear system of equations, thereby making computer searches through a multi-dimensional parameter domain of a Chi-Squared function unnecessary. However, the new algorithm is developed completely in spherical Earth-centered coordinates (longitude, latitude, altitude), rather than in the (x, y, z) cartesian coordinates employed in the 1996 study. Hence, no mathematical transformations from (x, y, z) into spherical coordinates are required (such transformations involve more numerical error propagation, more computer program coding, and slightly more CPU computing time). The new algorithm also has a more realistic definition of source altitude that accounts for Earth oblateness (this can become important for sources that are hundreds of kilometers away from the network). In addition, the new algorithm is being applied to analyze computer simulated LMA datasets in order to obtain detailed location/time retrieval error maps for sources in and around the LMA network. These maps will provide a more comprehensive analysis of retrieval errors for LMA than the 1996 study did of LDAR retrieval errors. Finally, we note that the new algorithm can be applied to LDAR, and essentially any other multi-station TWA network that depends on direct line-of-site antenna excitation.

Koshak, William↗
NASA NTRS1990

An expert system to perform on-line controller restructuring for abrupt model changes

Work in progress on an expert system used to reconfigure and tune airframe/engine control systems on-line in real time in response to battle damage or structural failures is presented. The closed loop system is monitored constantly for changes in structure and performance, the detection of which prompts the expert system to choose and apply a particular control restructuring algorithm based on the type and severity of the damage. Each algorithm is designed to handle specific types of failures and each is applicable only in certain situations. The expert system uses information about the system model to identify the failure and to select the technique best suited to compensate for it. A depth-first search is used to find a solution. Once a new controller is designed and implemented it must be tuned to recover the original closed-loop handling qualities and responsiveness from the degraded system. Ideally, the pilot should not be able to tell the difference between the original and redesigned systems. The key is that the system must have inherent redundancy so that degraded or missing capabilities can be restored by creative use of alternate functionalities. With enough redundancy in the control system, minor battle damage affecting individual control surfaces or actuators, compressor efficiency, etc., can be compensated for such that the closed-loop performance in not noticeably altered. The work is applied to a Black Hawk/T700 system.

Litt, Jonathan S.↗
NASA NTRS2007

Some algorithms for polygons on a sphere.

A limited search for polygon algorithms for use in a new military training simulation that interfaces with several others produced only planar algorithms. To avoid having to implement several different sophisticated map projections to guarantee compatibility with all the other simulations, we opted to develop algorithms that work directly on a sphere. The first is an algorithm to compute the area of a polygon whose edges are segments of great circles. Since our model represents certain object locations as mathematical points, the second topic is whether a specified point is inside a specified polygon. Possibly pathological cases are identified and eliminated. When we realized that most political boundaries are actually rhumb lines, use of the Mercator projection equations seemed unavoidable. We then reasoned that if all the edges were short enough, lat-lon lines, great circle segments, and rhumb lines would be close enough to being identical that we could use whichever was most convenient. Thence, we looked at the relationship between the maximum distances between great circle segments and rhumb lines and between lat-lon lines and rhumb lines as functions of length, azimuth, and latitude. The final algorithm finds the area overlapped by two polygons. Again, potentially pathological cases are identified and eliminated.

Duquette, William H.↗
NASA NTRS2007

Multi-Scale Modeling of Magnetospheric Reconnection

One of the major challenges in modeling the magnetospheric magnetic reconnection is to quantify the interaction between large-scale global magnetospheric dynamics and microphysical processes in diffusion regions near reconnection sites. There is still considerable debate as to what degree microphysical processes on kinetic scales affect the global evolution and how important it is to substitute numerical dissipation and/or ad hoc anomalous resistivity by a physically motivated model of dissipation. Comparative studies of magnetic reconnection in small scale geometries demonstrated that MHD simulations that included non-ideal processes in terms of a resistive term $\eta J$ did not produce the fast reconnection rates observed in kinetic simulations. For a broad range of physical parameters in collisionless magnetospheric plasma, the primary mechanism controlling the dissipation in the vicinity of the reconnection site is non-gyrotropic effects with spatial scales comparable with the particle Larmor radius. We utilize the global MHD code BATSRUS and incorporate nongyrotropic effects in diffusion regions in terms of corrections to the induction equation. We developed an algorithm to search for magnetotail reconnection sites, specifically where the magnetic field components perpendicular to the local current direction approaches zero and form an X-type configuration. Spatial scales of the diffusion region and magnitude of the reconnection electric field are calculated selfconsistently using MHD plasma and field parameters in the vicinity of the reconnection site. The location of the reconnection sites is updated during the simulations. To clarify the role of nongyrotropic effects in diffusion region on the global magnetospheric dynamic we perform simulations with steady southward IMF driving of the magnetosphere. Ideal MHD simulations with magnetic reconnection supported by numerical resistivity produce steady configuration with almost stationary near-earth neutral line (NENL). Simulations with non-gyrotropic corrections demonstrate dynamic quasi-periodic response to the steady driving condition. The loading/unloading cycle in non-gyrotropic MHD results has a non-stationary reconnection site in the magnetotail, with the retreating during the stretching phase and then a new NENL forming in the resulting thin plasma sheet. We expect that this model will lead to improved representations of space weather event in the magnetosphere.

Kuznetsova, M. M.↗
NASA NTRS1978

Curvilinear projection developments

Gradient projection is a powerful algorithm for minimization of a function subject to constraints. Constraint nonlinearities hamper projection computations. The constraints must then be restored before another projection cycle. The restoration steps taken in the process of following nonlinear constraint surfaces can be used as a guide to the construction of a curve which more nearly follows the constraints than does the straight line in the projected gradient direction. This scheme, termed 'curvilinear projection', was explored in earlier research. The study presently reported carries out some computational experiments using a related version of the technique. Some other details of projection computations which turn out to be practically important are taken up: rules for updating the variable metric in projection when early termination of the one-dimensional search on constraint violation occurs, and active-constraint logic for screening inequalities that makes use of the Kuhn-Tucker necessary conditions.

Kelley, H. J.↗
NASA NTRS2011

Visual Object Recognition and Tracking of Tools

A method has been created to automatically build an algorithm off-line, using computer-aided design (CAD) models, and to apply this at runtime. The object type is discriminated, and the position and orientation are identified. This system can work with a single image and can provide improved performance using multiple images provided from videos. The spatial processing unit uses three stages: (1) segmentation; (2) initial type, pose, and geometry (ITPG) estimation; and (3) refined type, pose, and geometry (RTPG) calculation. The image segmentation module files all the tools in an image and isolates them from the background. For this, the system uses edge-detection and thresholding to find the pixels that are part of a tool. After the pixels are identified, nearby pixels are grouped into blobs. These blobs represent the potential tools in the image and are the product of the segmentation algorithm. The second module uses matched filtering (or template matching). This approach is used for condensing synthetic images using an image subspace that captures key information. Three degrees of orientation, three degrees of position, and any number of degrees of freedom in geometry change are included. To do this, a template-matching framework is applied. This framework uses an off-line system for calculating template images, measurement images, and the measurements of the template images. These results are used online to match segmented tools against the templates. The final module is the RTPG processor. Its role is to find the exact states of the tools given initial conditions provided by the ITPG module. The requirement that the initial conditions exist allows this module to make use of a local search (whereas the ITPG module had global scope). To perform the local search, 3D model matching is used, where a synthetic image of the object is created and compared to the sensed data. The availability of low-cost PC graphics hardware allows rapid creation of synthetic images. In this approach, a function of orientation, distance, and articulation is defined as a metric on the difference between the captured image and a synthetic image with an object in the given orientation, distance, and articulation. The synthetic image is created using a model that is looked up in an object-model database. A composable software architecture is used for implementation. Video is first preprocessed to remove sensor anomalies (like dead pixels), and then is processed sequentially by a prioritized list of tracker-identifiers.

English, James↗
NASA NTRS2006

Ikhana: A NASA UAS Supporting Long Duration Earth Science Missions

NASA's Ikhana unmanned aerial vehicle (UAV) is a General Atomics MQ-9 Predator-B modified to support the conduct of Earth science missions for the NASA Science Mission Directorate through partnerships, other government agencies and universities. Ikhana, a Native American word meaning 'intelligence', can carry over 2000 lbs of atmospheric and remote sensing instruments in the payload bay and external pods. The aircraft is capable of mission durations in excess of 24 hours at altitudes above 40,000 ft. Redundant flight control, avionics, power, and network systems increase the system reliability and allow easier access to public airspace. The aircraft is remotely piloted from a mobile ground control station (GCS) using both C-band line-of-sight and Ku-band over-the-horizon satellite datalinks. NASA's GCS has been modified to support on-site science monitoring, or the downlink data can be networked to remote sites. All ground support systems are designed to be deployable to support global Eart science investigations. On-board support capabilities include an instrumentation system and an Airborne Research Test System (ARTS). The ARTS can host research algorithms that will autonomously command and control on-board sensors, perform sensor health monitoring, conduct data analysis, and request changes to the flight plan to maximize data collection. The ARTS also has the ability to host algorithms that will autonomously control the aircraft trajectory based on sensor needs, (e.g. precision trajectory for repeat pass interferometry) or to optimize mission objectives (e.g. search for specific atmospheric conditions). Standard on-board networks will collect science data for recording and for inclusion in the aircraft's high bandwidth downlink. The Ikhana project will complete GCS development, science support systems integration, external pod integration and flight clearance, and operations crew training in early 2007. A large-area remote sensing mission is currently scheduled for the Summer 2007.

Cobleigh, Brent R.↗
NASA NTRS2015

Automatic Event Detection in Search for Inter-Moss Loops in IRIS Si IV Slit-Jaw Images

The high-resolution capabilities of the Interface Region Imaging Spectrometer (IRIS) mission have allowed the exploration of the finer details of the solar magnetic structure from the chromosphere to the lower corona that have previously been unresolved. Of particular interest to us are the relatively short-lived, low-lying magnetic loops that have foot points in neighboring moss regions. These inter-moss loops have also appeared in several AIA pass bands, which are generally associated with temperatures that are at least an order of magnitude higher than that of the Si IV emission seen in the 1400 angstrom pass band of IRIS. While the emission lines seen in these pass bands can be associated with a range of temperatures, the simultaneous appearance of these loops in IRIS 1400 and AIA 171, 193, and 211 suggest that they are not in ionization equilibrium. To study these structures in detail, we have developed a series of algorithms to automatically detect signal brightening or events on a pixel-by-pixel basis and group them together as structures for each of the above data sets. These algorithms have successfully picked out all activity fitting certain adjustable criteria. The resulting groups of events are then statistically analyzed to determine which characteristics can be used to distinguish the inter-moss loops from all other structures. While a few characteristic histograms reveal that manually selected inter-moss loops lie outside the norm, a combination of several characteristics will need to be used to determine the statistical likelihood that a group of events be categorized automatically as a loop of interest. The goal of this project is to be able to automatically pick out inter-moss loops from an entire data set and calculate the characteristics that have previously been determined manually, such as length, intensity, and lifetime. We will discuss the algorithms, preliminary results, and current progress of automatic characterization.

loops↗
DOE OSTI2024

An optimization-based approach to tailor the mechanical response of soft metamaterials undergoing rate-dependent instabilities

An optimization-based design framework is proposed to tune the response of soft metamaterials involving both geometric instabilities and nonlinear viscoelastic material behavior. Designing the response of soft metamaterials to harness instabilities and undergo large, tailored configuration changes will enable advancements in soft robotics, shock and vibration mitigation, and flexible electronics. In line with the metamaterial concept, the response of these materials is governed to a large extent by the geometric and topological makeup of their small-scale features. However, the link between structure and response is less intuitive for soft metamaterials due to their reliance upon highly nonlinear responses triggered by geometric instabilities. This is further complicated by the effects of viscoelastic relaxation, which recent studies have shown to alter the emergence of instabilities in non-intuitive ways. Here, these effects are accounted for in our framework to achieve various design objectives, including tailored force–displacement response and maximized energy absorption from both geometric and material effects. To fully automate this process, it is essential to have a completely robust equation solver for forward problems involving instabilities and viscoelastic relaxation. We achieve this by casting the search for stable mechanical equilibrium — i.e. the forward problem — as a minimization problem and utilize a trust region algorithm to robustly handle instabilities and follow energetically-favorable equilibrium paths through critical points.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2017

Kepler Planet Detection Metrics: Per-Target Flux-Level Transit Injection Tests of TPS for Data Release 25

Quantifying the ability of a transiting planet survey to recover transit signals has commonly been accomplished through Monte-Carlo injection of transit signals into the observed data and subsequent running of the signal search algorithm (Gilliland et al., 2000; Weldrake et al., 2005; Burke et al., 2006). In order to characterize the performance of the Kepler pipeline (Twicken et al., 2016; Jenkins et al., 2017) on a sample of over 200,000 stars, two complementary injection and recovery tests are utilized:1. Injection of a single transit signal per target into the image or pixel-level data, hereafter referred to as pixel-level transit injection (PLTI), with subsequent processing through the Photometric Analysis (PA), Presearch Data Conditioning (PDC), Transiting Planet Search (TPS), and Data Validation (DV) modules of the Kepler pipeline. The PLTI quantification of the Kepler pipeline's completeness has been described previously by Christiansen et al. (2015, 2016); the completeness of the final SOC 9.3 Kepler pipeline acting on the Data Release 25 (DR25) light curves is described by Christiansen (2017).2. Injection of multiple transit signals per target into the normalized flux time series data with a subsequent transit search using a stream-lined version of the Transiting Planet Search (TPS) module. This test, hereafter referred to as flux-level transit injection (FLTI), is the subject of this document. By running a heavily modified version of TPS, FLTI is able to perform many injections on selected targets and determine in some detail which injected signals are recoverable. Significant numerical efficiency gains are enabled by precomputing the data conditioning steps at the onset of TPS and limiting the search parameter space (i.e., orbital period, transit duration, and ephemeris zero-point) to a small region around each injected transit signal.The PLTI test has the advantage that it follows transit signals through all processing steps of the Kepler pipeline, and the recovered signals can be further classified as planet candidates or false positives in the exact same manner as detections from the nominal (i.e., observed) pipeline run (Twicken et al., 2016, Thompson et al., in preparation). To date, the PLTI test has been the standard means of measuring pipeline completeness averaged over large samples of targets (Christiansen et al., 2015, 2016; Christiansen, 2017). However, since the PLTI test uses only one injection per target, it does not elucidate individual-target variations in pipeline completeness due to differences in stellar properties or astrophysical variability. Thus, we developed the FLTI test to provide a numerically efficient way to fully map individual targets and explore the performance of the pipeline in greater detail. The FLTI tests thereby allow a thorough validation of the pipeline completeness models (such as window function (Burke and Catanzarite, 2017a), detection efficiency (Burke Catanzarite, 2017b), etc.) across the spectrum of Kepler targets (i.e., various astrophysical phenomena and differences in instrumental noise). Tests during development of the FLTI capability revealed that there are significant target-to-target variations in the detection efficiency.

DR25↗
NASA NTRS1994

Locating buildings in aerial photos

Algorithms and techniques for use in the identification and location of large buildings in digitized copies of aerial photographs are developed and tested. The building data would be used in the simulation of objects located in the vicinity of an airport that may be detected by aircraft radar. Two distinct approaches are considered. Most building footprints are rectangular in form. The first approach studied is to search for right-angled corners that characterize rectangular objects and then to connect these corners to complete the building. This problem is difficult because many nonbuilding objects, such as street corners, parking lots, and ballparks often have well defined corners which are often difficult to distinguish from rooftops. Furthermore, rooftops come in a number of shapes, sizes, shadings, and textures which also limit the discrimination task. The strategy used linear sequences of different samples to detect straight edge segments at multiple angles and to determine when these segments meet at approximately right-angles with respect to each other. This technique is effective in locating corners. The test image used has a fairly rectangular block pattern oriented about thirty degrees clockwise from a vertical alignment, and the overall measurement data reflect this. However, this technique does not discriminate between buildings and other objects at an operationally suitable rate. In addition, since multiple paths are tested for each image pixel, this is a time consuming task. The process can be speeded up by preprocessing the image to locate the more optimal sampling paths. The second approach is to rely on a human operator to identify and select the building objects and then to have the computer determine the outline and location of the selected structures. When presented with a copy of a digitized aerial photograph, the operator uses a mouse and cursor to select a target building. After a button on the mouse is pressed, with the cursor fully within the perimeter of the building, the program scans from the position of the cursor to a perimeter position where a shift in grayscale is detected. Once at the perimeter, the process traces along it, around the building, until it eventually returns to the perimeter starting point. Spatial resolution limits cause the perimeter trace to be somewhat course so that a line straightening algorithm is employed. One result is that the building corner positions become more distinctly defined.

Green, James S.↗
NASA NTRS2005

Model Development and Testing for THEMIS Controlled Mars Mosaics

As part of our work [1] to develop techniques and procedures to create regional and eventually global THEMIS mosaics of Mars, we are developing algorithms and software to photogrammetrically control THEMIS IR line scanner camera images. We have found from comparison of a limited number of images to MOLA digital image models (DIMs) [2] that the a priori geometry information (i.e. SPICE [3]) for THEMIS images generally allows their relative positions to be specified at the several pixel level (e.g. approx.5 to 13 pixels). However a need for controlled solutions to improve this geometry to the sub-pixel level still exists. Only with such solutions can seamless mosaics be obtained and likely distortion from spacecraft motion during image collection removed at such levels. Past experience has shown clearly that such mosaics are in heavy demand by users for operational and scientific use, and that they are needed over large areas or globally (as opposed to being available only on a limited basis via labor intensive custom mapping projects). Uses include spacecraft navigation, landing site planning and mapping, registration of multiple data types and image sets, registration of multispectral images, registration of images with topographic information, recovery of thermal properties, change detection searches, etc.

Archinal, B. A.↗