Search NASA⌕ Search

SEARCH · Search NASA

Results for “trees”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗
DOE OSTI2024

Comparative analysis of nutrient concentrations in generalist and specialist tree species and soils, Manaus, Brazil

This dataset was collected near Manaus, Brazil, at ZF-2 site, inside the North-South transect plots from 20221011 to 20221020. Measurements were made on specialists and generalist tree species along topographic gradient (in upland high-clay content soils of plateaus and high sandy content and partially flooded soils of valleys). We selected nine species (with four replicates each, totaling 35 individuals) occurring in different topographic positions: three plateau specialists, three valley specialists, and three generalists, where leaf and trunk samples were collected from each individual, and soil samples for carbon and nutrient analysis and quantification. Three soil pits were opened around each sample tree, about one meter apart (total of 105 soil pits each 60-cm deep), where soil samples were collected at four depths: 0-5, 5-10, 10-30 and 30-50 cm. In each of the three pits around each tree, one single sample was taken at each depth and combined to obtain a composite sample per depth per individual tree (35 trees × 4 depths = 140 soil samples). The files “Plant_Nutrient_Concentrations_NS_Transect_Manaus.csv” and “Soil_Nutrient_Concentrations_NS_Transect_Manaus.csv” contain the nutrient concentration data from plant and soil material, respectively. Additionally, the file “Sample_Info.csv” contains details about each variable including units and data type. The file “Species_Info.csv” includes information about each sampled individual, such as species, family, diameter at the breast height (DBH), and more. The dataset is ready to be used in any programming language like python or R. This dataset was originally published on the NGEE Tropics Archive and is being mirrored on ESS-DIVE for long-term archival Acknowledgement: Funding for NGEE-Tropics data resources was provided by the U.S. Department of Energy Office of Science, Office of Biological and Environmental Research.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1986

Identification of major backscattering sources in trees and shrubs at 10 GHz

A short-range very-fine-resolution FM-CW radar scatterometer has been used to identify the primary contributors to 10-GHz radar backscatter from pine, pin oak, American sycamore and sugar maple trees, and from creeping juniper shrubs. This system provided a range resolution of 11 cm and gave a 16-cm diameter illumination area at the target range of about 4 m. For a pine tree, the needles caused the strongest backscatter as well as the strongest attenuation in the radar signal. Cones, although insignificant contributors to the total backscatter, were more important for backscattering than for attenuation. For the rest of the trees, leaves were the strongest cause of backscattering and attenuation. However, in the absence of leaves, the petioles, small twigs, and branches gave relatively strong backscatter. For American sycamore and sugar maple trees, the fruits did not affect the total backscatter unless they were packed in clusters. For creeping juniper the backscattered energy and attenuation in the radar signal were mainly due to the top two layers of the evergreen scales. The contribution of the tree trunks was not determined.

Zoughi, R.↗
NASA NTRS1986

Remote sensing of tree attenuation at 870 MHz along simulated Earth-satellite paths

Tree attenuation at 870 MHz was studied using a helicopter as a source platform and a van with receiver and data acquisition instrumentation. Tree attenuation results were obtained with the van stationary and in motion to determine land mobile satellite systems link parameter requirements (expected fading due to roadside trees for mobile and stationary vehicles). Single tree attenuation results give worst case median fades as high as 15 dB although roadside tree values produce fades greater than 20 dB for small percentages of time. The cumulative fade distributions and their relative contributions as a function of path elevation angle, right side versus left side driving, and different road types are derived from the field measurements.

Vogel, W. J.↗
NASA NTRS1989

Labeled trees and the efficient computation of derivations

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Grossman, Robert↗
NASA NTRS1990

Object-oriented fault tree models applied to system diagnosis

When a diagnosis system is used in a dynamic environment, such as the distributed computer system planned for use on Space Station Freedom, it must execute quickly and its knowledge base must be easily updated. Representing system knowledge as object-oriented augmented fault trees provides both features. The diagnosis system described here is based on the failure cause identification process of the diagnostic system described by Narayanan and Viswanadham. Their system has been enhanced in this implementation by replacing the knowledge base of if-then rules with an object-oriented fault tree representation. This allows the system to perform its task much faster and facilitates dynamic updating of the knowledge base in a changing diagnosis environment. Accessing the information contained in the objects is more efficient than performing a lookup operation on an indexed rule base. Additionally, the object-oriented fault trees can be easily updated to represent current system status. This paper describes the fault tree representation, the diagnosis algorithm extensions, and an example application of this system. Comparisons are made between the object-oriented fault tree knowledge structure solution and one implementation of a rule-based solution. Plans for future work on this system are also discussed.

Iverson, David L.↗
NASA NTRS1992

Fault-Tree Compiler Program

FTC, Fault-Tree Compiler program, is reliability-analysis software tool used to calculate probability of top event of fault tree. Five different types of gates allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language of FTC easy to understand and use. Program supports hierarchical fault-tree-definition feature simplifying process of description of tree and reduces execution time. Solution technique implemented in FORTRAN, and user interface in Pascal. Written to run on DEC VAX computer operating under VMS operating system.

Butler, Ricky W.↗
NASA NTRS2000

Efficient Merge and Insert Operations for Binary Heaps and Trees

Binary heaps and binary search trees merge efficiently. We introduce a new amortized analysis that allows us to prove the cost of merging either binary heaps or balanced binary trees is O(l), in the amortized sense. The standard set of other operations (create, insert, delete, extract minimum, in the case of binary heaps, and balanced binary trees, as well as a search operation for balanced binary trees) remain with a cost of O(log n). For binary heaps implemented as arrays, we show a new merge algorithm that has a single operation cost for merging two heaps, a and b, of O(absolute value of a + min(log absolute value of b log log absolute value of b. log absolute value of a log absolute value of b). This is an improvement over O(absolute value of a + log absolute value of a log absolute value of b). The cost of the new merge is so low that it can be used in a new structure which we call shadow heaps. to implement the insert operation to a tunable efficiency. Shadow heaps support the insert operation for simple priority queues in an amortized time of O(f(n)) and other operations in time O((log n log log n)/f (n)), where 1 less than or equal to f (n) less than or equal to log log n. More generally, the results here show that any data structure with operations that change its size by at most one, with the exception of a merge (aka meld) operation, can efficiently amortize the cost of the merge under conditions that are true for most implementations of binary heaps and search trees.

Kuszmaul, Christopher Lee↗
NASA NTRS2002

Tree Canopy Characterization for EO-1 Reflective and Thermal Infrared Validation Studies: Rochester, New York

The tree canopy characterization presented herein provided ground and tree canopy data for different types of tree canopies in support of EO-1 reflective and thermal infrared validation studies. These characterization efforts during August and September of 2001 included stem and trunk location surveys, tree structure geometry measurements, meteorology, and leaf area index (LAI) measurements. Measurements were also collected on thermal and reflective spectral properties of leaves, tree bark, leaf litter, soil, and grass. The data presented in this report were used to generate synthetic reflective and thermal infrared scenes and images that were used for the EO-1 Validation Program. The data also were used to evaluate whether the EO-1 ALI reflective channels can be combined with the Landsat-7 ETM+ thermal infrared channel to estimate canopy temperature, and also test the effects of separating the thermal and reflective measurements in time resulting from satellite formation flying.

Ballard, Jerrell R., Jr.↗
NASA NTRS2011

Effective Tree Scattering at L-Band

For routine microwave Soil Moisture (SM) retrieval through vegetation, the tau-omega [1] model [zero-order Radiative Transfer (RT) solution] is attractive due to its simplicity and eases of inversion and implementation. It is the model used in baseline retrieval algorithms for several planned microwave space missions, such as ESA's Soil Moisture Ocean Salinity (SMOS) mission (launched November 2009) and NASA's Soil Moisture Active Passive (SMAP) mission (to be launched 2014/2015) [2 and 3]. These approaches are adapted for vegetated landscapes with effective vegetation parameters tau and omega by fitting experimental data or simulation outputs of a multiple scattering model [4-7]. The model has been validated over grasslands, agricultural crops, and generally light to moderate vegetation. As the density of vegetation increases, sensitivity to the underlying SM begins to degrade significantly and errors in the retrieved SM increase accordingly. The zero-order model also loses its validity when dense vegetation (i.e. forest, mature corn, etc.) includes scatterers, such as branches and trunks (or stalks in the case of corn), which are large with respect to the wavelength. The tau-omega model (when applied over moderately to densely vegetated landscapes) will need modification (in terms of form or effective parameterization) to enable accurate characterization of vegetation parameters with respect to specific tree types, anisotropic canopy structure, presence of leaves and/or understory. More scattering terms (at least up to first-order at L-band) should be included in the RT solutions for forest canopies [8]. Although not really suitable to forests, a zero-order tau-omega model might be applied to such vegetation canopies with large scatterers, but that equivalent or effective parameters would have to be used [4]. This requires that the effective values (vegetation opacity and single scattering albedo) need to be evaluated (compared) with theoretical definitions of these parameters. In a recent study [9], effective vegetation opacity of coniferous trees was compared with two independent estimates of the same parameter. First, a zero-order RT model was fitted to multiangular microwave emissivity data in a least-square sense to provide effective vegetation optical depth as done in spaceborne retrieval algorithms. Second, a ratio between radar backscatter measurements with a corner reflector under trees and in an open area was calculated to obtain measured tree propagation characteristics. Finally, the theoretical propagation constant was determined by forward scattering theorem using detailed measurements of size/angle distributions and dielectric constants of the tree constituents (trunk, branches, and needles). Results indicated that the effective attenuation values are smaller than but of similar magnitude to both the theoretical and measured values. This study will complement the previous work [9] and will focus on characterization of effective scattering albedo by assuming that effective vegetation opacity is same as theoretical opacity. The resultant effective albedo will not be the albedo of single forest canopy element anymore, but it becomes a global parameter, which depends on all the processes taking place within the canopy including multiple scattering as described.

Kurum, Mehmet↗
NASA NTRS2011

Fast Image Texture Classification Using Decision Trees

Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.

Thompson, David R.↗
NASA NTRS2012

Roles of Urban Tree Canopy and Buildings in Urban Heat Island Effects: Parameterization and Preliminary Results

Urban heat island (UHI) effects can strengthen heat waves and air pollution episodes. In this study, the dampening impact of urban trees on the UHI during an extreme heat wave in the Washington, D.C., and Baltimore, Maryland, metropolitan area is examined by incorporating trees, soil, and grass into the coupled Weather Research and Forecasting model and an urban canopy model (WRF-UCM). By parameterizing the effects of these natural surfaces alongside roadways and buildings, the modified WRF-UCM is used to investigate how urban trees, soil, and grass dampen the UHI. The modified model was run with 50% tree cover over urban roads and a 10% decrease in the width of urban streets to make space for soil and grass alongside the roads and buildings. Results show that, averaged over all urban areas, the added vegetation decreases surface air temperature in urban street canyons by 4.1 K and road-surface and building-wall temperatures by 15.4 and 8.9 K, respectively, as a result of tree shading and evapotranspiration. These temperature changes propagate downwind and alter the temperature gradient associated with the Chesapeake Bay breeze and, therefore, alter the strength of the bay breeze. The impact of building height on the UHI shows that decreasing commercial building heights by 8 m and residential building heights by 2.5 m results in up to 0.4-K higher daytime surface and near-surface air temperatures because of less building shading and up to 1.2-K lower nighttime temperatures because of less longwave radiative trapping in urban street canyons.

urban vegetation↗
NASA NTRS2015

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗
NASA NTRS2022

Multiple Scattering Effects of Trees on L-band Microwave Using a Hybrid Method

The multiple scattering of electromagnetic waves in forests is studied using a two-step hybrid method. First, the T-matrix of a single tree is calculated based on its far-field computed with the full-wave simulations of the FEKO software. The T-matrix captures the multiple scattering caused by the tree structure. Second, the the interactions among different trees are considered using the T-matrices of the individual trees and the Foldy-Lax equations. The result of the two-step hybrid method is validated with FEKO by solving scattering from two trees directly. The multiple scattering effects are illustrated by the field solutions.

Yueh, Simon↗
NASA NTRS2024

Central Park Ecological Conservation: Assessing Tree Health Conditions in New York City’s Central Park with NASA Earth Observation Data

The Central Park Conservancy stewards New York City’s iconic Central Park with a mission to preserve the park for all. This mission is complicated by the spread of Dutch elm disease (DED) which has threatened the culturally and ecologically significant American elm tree (Ulmus americana). Central Park is home to one of the largest and last remaining urban concentrations of American elm and the Conservancy currently protects them through integrated pest management. This paper discusses an interdisciplinary feasibility study that assessed the application of NASA Earth observations from 2014 to 2023 to detect changes in forest phenology possibly related to DED. Landsat 8 and 9 imagery was used to calculate multiyear time series of the Normalized Difference Vegetation Index (NDVI) and quantify changes in land surface phenology for a given year. A pixel-based logistic regression analysis was performed using changes in NDVI, tree site locations, and recorded occurrences of trees infected with DED as inputs. The results of this analysis show that changes in NDVI derived from Landsat data are capable of detecting unhealthy tree canopies with 71% precision and healthy tree canopies with 41% precision. The study had uncertainties and limitations due to the spatial and temporal resolutions of Landsat, the natural variability in land surface phenology and NDVI, and the attempt to detect disease impacts while disease prevention and mitigation is occurring. As is, the findings of this study and its methods provide managers with an approach for integrating Earth observations to make more informed decisions in the application and timing of urban forest management activities.

Central Park↗
NASA NTRSDate not supplied

Assessing Tree Health Conditions in New York City’s Central Park with Earth Observation Data

The Central Park Conservancy stewards New York City’s iconic Central Park with a mission to preserve the park for all. This mission is complicated by the spread of Dutch elm disease (DED) which has threatened the culturally and ecologically significant American elm tree (Ulmus americana). Central Park is home to one of the largest and last remaining urban concentrations of American elm and the Conservancy currently protects them through integrated pest management. This project is an interdisciplinary feasibility study that assessed the application of NASA Earth observations from 2014 to 2023 to detect changes in forest phenology possibly related to DED. Landsat 8 and 9 imagery was used to calculate a multiyear time series of the Normalized Difference Vegetation Index (NDVI) and quantify changes in land surface phenology. A pixel-based logistic regression analysis was performed using changes in NDVI, tree site locations, and recorded occurrences of trees infected with DED as inputs. The results of this analysis show that changes in NDVI derived from Landsat data are capable of detecting unhealthy tree canopies with 71% precision and healthy tree canopies with 41% precision. The study had uncertainties and limitations due to the spatial and temporal resolutions of Landsat, the natural variability in land surface phenology and NDVI, and the attempt to detect disease impacts while disease prevention and mitigation are occurring. As is, the findings of this study and its methods provide managers with an approach for integrating Earth observations to make more informed decisions in the application and timing of urban forest management activities.

John Hocknell↗
DOE OSTI2024

Tree Canopy in Beacon Hill, Washington [Slides]

This technical assistance through the Communities LEAP program aims to provide the Solutions' Collaborative with information and geospatial analysis of tree canopy coverage in Beacon Hill, Seattle as a high priority environmental justice community with the goal of exploring the benefits of trees to improve air quality and mitigate extreme heat. It further provides information on tree-planting programs in Seattle and King County.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees

Applications such as reconstructing cell lineage trees (represented as phylogenetic trees) from single-cell sequencing data require reconstructing a {0,1}-matrix that has many errors and missing entries. We introduce Sempervirens, a very fast matrix reconstruction algorithm for noisy and incomplete matrix representations of phylogenetic trees. Sempervirens uses an iterative maximum-likelihood approach to determine the topology tree represented by the corrupted data. We show that Sempervirens is at least three orders of magnitude faster than other methods on thousand by thousand matrices, with the speed gap widening with larger matrices. We also show that Sempervirens matches state-of-the-art methods in reconstruction accuracy. The speed of Sempervirens enables it to be tractably applied to reconstructing much larger matrices than those that other methods can reconstruct. In addition to experimental results, we justify the algorithm with a mathematical treatment of its subprocedures.

algorithms↗