Search NASA⌕ Search

SEARCH · Search NASA

Results for “Regular Grid”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

A Nowcasting Approach for Low Earth Orbit Hyperspectral Infrared Soundings Within the Convective Environment

Low Earth orbit (LEO) hyper-spectral infrared (IR) sounders have significant yet untapped potential for characterizing thermodynamic environments of convective initiation and ongoing convection. While LEO soundings are of value to weather forecasters, the temporal resolution needed to resolve the rapidly evolving thermodynamics of the convective environment is limited. We have developed a novel nowcasting methodology to extend snapshots of LEO soundings forward in time up to six hours to create a product available within National Weather Service systems for user assessment. Our methodology is based on parcel forward-trajectory calculations from the satellite observing time to generate future soundings of temperature (T) and specific humidity (q) at regularly gridded intervals in space and time. The soundings are based on NOAA-Unique Combined Atmospheric Processing System (NUCAPS) retrievals from the Suomi NPP and NOAA-20 satellite platforms. The tendencies of derived convective available potential energy (CAPE) and convective inhibition (CIN) are evaluated against gridded, hourly accumulated rainfall obtained from the Multi-Radar Multi-Sensor (MRMS) observations for 24 hand-selected cases over the Contiguous United States. Areas with forecast increases in CAPE (reduced CIN) are shown to be associated with areas of precipitation. The increases in CAPE and decreases in CIN are largest for areas that have the heaviest precipitation and are statistically significant compared to areas without precipitation. These results imply that adiabatic parcel advection of LEO satellite sounding snapshots forward in time are capable of identifying convective initiation over an expanded temporal scale compared to soundings used only during the LEO satellite overpass time.

North America↗

Interoperable Map Services with Performance Tuning for Earth Science Data through API-Tiles and Dynamic API-Styles

NASA’s Goddard Earth Sciences Data and Information Services Center (GES DISC) provides access to a wide range of global climate data from various satellite missions and models. However, the visualization and analysis of these data can be challenging due to their large volume, complex structure, and diverse formats. This study presents the implementation of interoperable map services (API-Maps) with performance tuning using API-Tiles and dynamic API-Styles. API-Maps is a standard for defining and exposing map services through RESTful (representational state transfer) APIs (application programming interfaces). API-Tiles is a technique for generating and delivering map tiles on demand from any data source. API-Styles is a method for dynamically applying styles to map tiles based on user preferences or data attributes. The use of API-Tiles and dynamic API-Styles enhances the performance and scalability of the map services, allowing for smooth and interactive visualization of large datasets. Two types of Earth Science data sources from the NASA GES DISC are used in the experiment: regularly gridded data, such as Global Precipitation Measurement (GPM) precipitation data, and low processing level data, such as low-level data of atmospheric composite measurements from the TROPOspheric Monitoring Instrument (TROPOMI) mission. Re-gridding of swath data (low level data - e.g. Level 2) of atmospheric composites (e.g. TROPOMI products, such as nitrogen dioxide, ozone and aerosol optical depth) is applied to enable the Web-based, interoperable, tiled, and styled mapping (rendering) services of such data. The results demonstrate the effectiveness of the proposed approach in providing fast and efficient access to Earth science data through interoperable map services.

Geographic Information System↗

Improving the Time Resolution of Hyper-Spectral Infrared Sounding Observations With Trajectory Enhancement

Low Earth orbit (LEO) hyper-spectral infrared (IR) sounders have significant potential for characterizing the complex evolution of thermodynamic environments favorable for convective initiation and ongoing convection. The snapshots at fixed local times are unable to provide the temporal resolution needed to resolve the rapidly evolving convective environment. A novel methodology using trajectory modeling coupled with satellite soundings was developed to create proximity soundings near NCEI Storm Events to investigate differences in severe weather environments (Kalmus et al., 2019, https://doi.org/10.1175/MWR-D-18-0055.1). This methodology was recently extended to entire satellite swaths forward in time up to six hours into the future and was evaluated during NOAA’s Hazardous Weather Testbed (HWT) in a quasi-operational setting (Kahn et al., 2023, https://doi.org/10.1175/WAF-D-22-0204.1). This methodology is based on parcel forward-trajectory calculations from the satellite observing time to recreate future soundings of temperature and moisture at regularly gridded intervals in space and time. Using coincident Multi-Radar Multi-Sensor (MRMS) rainfall estimates, we show that convective available potential energy (CAPE) is increased and convective inhibition (CIN) is decreased at times and locations where convection initiated. This methodology was evaluated with ERA5 data sampled to mimic the satellite observing swaths (Richardson et al., 2023, https://doi.org/10.5194/egusphere-2023-97). Approximately 60–90% of the temporal and spatial variability in temperature and humidity is explained by parcel advection using trajectory modeling. This method will be applied to the multi-decadal LEO satellite record and could be used to examine capabilities of future satellite missions such as the GeoXO mission.

Emily Berndt↗

Hexagonal Pixels and Indexing Scheme for Binary Images

A scheme for resampling binaryimage data from a rectangular grid to a regular hexagonal grid and an associated tree-structured pixel-indexing scheme keyed to the level of resolution have been devised. This scheme could be utilized in conjunction with appropriate image-data-processing algorithms to enable automated retrieval and/or recognition of images. For some purposes, this scheme is superior to a prior scheme that relies on rectangular pixels: one example of such a purpose is recognition of fingerprints, which can be approximated more closely by use of line segments along hexagonal axes than by line segments along rectangular axes. This scheme could also be combined with algorithms for query-image-based retrieval of images via the Internet. A binary image on a rectangular grid is generated by raster scanning or by sampling on a stationary grid of rectangular pixels. In either case, each pixel (each cell in the rectangular grid) is denoted as either bright or dark, depending on whether the light level in the pixel is above or below a prescribed threshold. The binary data on such an image are stored in a matrix form that lends itself readily to searches of line segments aligned with either or both of the perpendicular coordinate axes. The first step in resampling onto a regular hexagonal grid is to make the resolution of the hexagonal grid fine enough to capture all the binaryimage detail from the rectangular grid. In practice, this amounts to choosing a hexagonal-cell width equal to or less than a third of the rectangular- cell width. Once the data have been resampled onto the hexagonal grid, the image can readily be checked for line segments aligned with the hexagonal coordinate axes, which typically lie at angles of 30deg, 90deg, and 150deg with respect to say, the horizontal rectangular coordinate axis. Optionally, one can then rotate the rectangular image by 90deg, then again sample onto the hexagonal grid and check for line segments at angles of 0deg, 60deg, and 120deg to the original horizontal coordinate axis. The net result is that one has checked for line segments at angular intervals of 30deg. For even finer angular resolution, one could, for example, then rotate the rectangular-grid image +/-45deg before sampling to perform checking for line segments at angular intervals of 15deg.

Johnson, Gordon G.↗

Notes on Accuracy of Finite-Volume Discretization Schemes on Irregular Grids

Truncation-error analysis is a reliable tool in predicting convergence rates of discretization errors on regular smooth grids. However, it is often misleading in application to finite-volume discretization schemes on irregular (e.g., unstructured) grids. Convergence of truncation errors severely degrades on general irregular grids; a design-order convergence can be achieved only on grids with a certain degree of geometric regularity. Such degradation of truncation-error convergence does not necessarily imply a lower-order convergence of discretization errors. In these notes, irregular-grid computations demonstrate that the design-order discretization-error convergence can be achieved even when truncation errors exhibit a lower-order convergence or, in some cases, do not converge at all.

Diskin, Boris↗

Pyramidal Image-Processing Code For Hexagonal Grid

Algorithm based on processing of information on intensities of picture elements arranged in regular hexagonal grid. Called "image pyramid" because image information at each processing level arranged in hexagonal grid having one-seventh number of picture elements of next lower processing level, each picture element derived from hexagonal set of seven nearest-neighbor picture elements in next lower level. At lowest level, fine-resolution of elements of original image. Designed to have some properties of image-coding scheme of primate visual cortex.

Watson, Andrew B.↗

Tools for Analysis and Visualization of Large Time-Varying CFD Data Sets

In the second year, we continued to built upon and improve our scanline-based direct volume renderer that we developed in the first year of this grant. This extremely general rendering approach can handle regular or irregular grids, including overlapping multiple grids, and polygon mesh surfaces. It runs in parallel on multi-processors. It can also be used in conjunction with a k-d tree hierarchy, where approximate models and error terms are stored in the nodes of the tree, and approximate fast renderings can be created. We have extended our software to handle time-varying data where the data changes but the grid does not. We are now working on extending it to handle more general time-varying data. We have also developed a new extension of our direct volume renderer that uses automatic decimation of the 3D grid, as opposed to an explicit hierarchy. We explored this alternative approach as being more appropriate for very large data sets, where the extra expense of a tree may be unacceptable. We also describe a new approach to direct volume rendering using hardware 3D textures and incorporates lighting effects. Volume rendering using hardware 3D textures is extremely fast, and machines capable of using this technique are becoming more moderately priced. While this technique, at present, is limited to use with regular grids, we are pursuing possible algorithms extending the approach to more general grid types. We have also begun to explore a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH '96. In our initial implementation, we automatically image the volume from 32 equi-distant positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation. We are studying whether this will give a quantitative measure of the effects of approximation. We have created new tools for exploring the differences between images produced by various rendering methods. Images created by our software can be stored in the SGI RGB format. Our idtools software reads in pair of images and compares them using various metrics. The differences of the images using the RGB, HSV, and HSL color models can be calculated and shown. We can also calculate the auto-correlation function and the Fourier transform of the image and image differences. We will explore how these image differences compare in order to find useful metrics for quantifying the success of various visualization approaches. In general, progress was consistent with our research plan for the second year of the grant.

Wilhelms, Jane↗

Conical-Domain Model for Estimating GPS Ionospheric Delays

The conical-domain model is a computational model, now undergoing development, for estimating ionospheric delays of Global Positioning System (GPS) signals. Relative to the standard ionospheric delay model described below, the conical-domain model offers improved accuracy. In the absence of selective availability, the ionosphere is the largest source of error for single-frequency users of GPS. Because ionospheric signal delays contribute to errors in GPS position and time measurements, satellite-based augmentation systems (SBASs) have been designed to estimate these delays and broadcast corrections. Several national and international SBASs are currently in various stages of development to enhance the integrity and accuracy of GPS measurements for airline navigation. In the Wide Area Augmentation System (WAAS) of the United States, slant ionospheric delay errors and confidence bounds are derived from estimates of vertical ionospheric delay modeled on a grid at regularly spaced intervals of latitude and longitude. The estimate of vertical delay at each ionospheric grid point (IGP) is calculated from a planar fit of neighboring slant delay measurements, projected to vertical using a standard, thin-shell model of the ionosphere. Interpolation on the WAAS grid enables estimation of the vertical delay at the ionospheric pierce point (IPP) corresponding to any arbitrary measurement of a user. (The IPP of a given user s measurement is the point where the GPS signal ray path intersects a reference ionospheric height.) The product of the interpolated value and the user s thin-shell obliquity factor provides an estimate of the user s ionospheric slant delay. Two types of error that restrict the accuracy of the thin-shell model are absent in the conical domain model: (1) error due to the implicit assumption that the electron density is independent of the azimuthal angle at the IPP and (2) error arising from the slant-to-vertical conversion. At low latitudes or at mid-latitudes under disturbed conditions, the accuracy of SBAS systems based upon the thin-shell model suffers due to the presence of complex ionospheric structure, high delay values, and large electron density gradients. Interpolation on the vertical delay grid serves as an additional source of delay error. The conical-domain model permits direct computation of the user s slant delay estimate without the intervening use of a vertical delay grid. The key is to restrict each fit of GPS measurements to a spatial domain encompassing signals from only one satellite. The conical domain model is so named because each fit involves a group of GPS receivers that all receive signals from the same GPS satellite (see figure); the receiver and satellite positions define a cone, the satellite position being the vertex. A user within a given cone evaluates the delay to the satellite directly, using (1) the IPP coordinates of the line of sight to the satellite and (2) broadcast fit parameters associated with the cone. The conical-domain model partly resembles the thin-shell model in that both models reduce an inherently four-dimensional problem to two dimensions. However, unlike the thin-shell model, the conical domain model does not involve any potentially erroneous simplifying assumptions about the structure of the ionosphere. In the conical domain model, the initially four-dimensional problem becomes truly two-dimensional in the sense that once a satellite location has been specified, any signal path emanating from a satellite can be identified by only two coordinates; for example, the IPP coordinates. As a consequence, a user s slant-delay estimate converges to the correct value in the limit that the receivers converge to the user s location (or, equivalently, in the limit that the measurement IPPs converge to the user s IPP).

Sparks, Lawrence↗

Partitioning a Gridded Rectangle into Smaller Rectangles

A relatively simple algorithm, devised for use in an image-data-compression application, partitions a rectangular pixelated image (or any other rectangle on which a regular rectangular grid has already been superimposed) into a specified number of smaller rectangles, hereafter denoted segments. The algorithm has the following properties: No floating-point operations are needed. The segments tend to be nearly square (in the sense that their widths and heights in pixel units tend to be nearly equal). The segments tend to have nearly equal areas. The algorithm yields valid results (no zero-width or zero-height segments) as long as the specified number of segments, s, does not exceed the number of pixels (equivalently, the number of grid cells). The inputs to the algorithm are the positive integer s plus the positive integers h and w, denoting the height and width, respectively, of the rectangle in pixel units. The limit on s for a valid result is given by s less than or equal to wh.

Klimesh, Matthew↗

High-Order/Low-Dissipation Chain-Rule Flux Solution Reconstruction Schemes in FUN3D

In this paper, we report progress in the development of economically high-order flux-solution-reconstruction (FSR) schemes, which are second-order accurate on general unstructured grids but achieve high-order accuracy when a grid is regular, i.e., has the same stencil (with the same spacing) throughout the domain. Two variants of the FSR schemes are discussed: chain-rule-flux-solution reconstruction (CFSR) and quadratic-form-flux-solution reconstruction (QFSR), where the former is based on the chain rule and the latter on the flux reconstruction expressed as a function of solution variables. These schemes are tested for flows with shock waves with a limiter incorporated in the flux and solution reconstructions. Improved results, compared with second-order methods are demonstrated for inviscid and viscous flows with smooth grids.

high-order↗

Balloon-based interferometric techniques

A balloon-borne triple-etalon Fabry-Perot Interferometer, observing the Doppler shifts of absorption lines caused by molecular oxygen and water vapor in the far red/near infrared spectrum of backscattered sunlight, has been used to evaluate a passive spaceborne remote sensing technique for measuring winds in the troposphere and stratosphere. There have been two successful high altitude balloon flights of the prototype UCL instrument from the National Scientific Balloon Facility at Palestine, TE (May 80, Oct. 83). The results from these flights have demonstrated that an interferometer with adequate resolution, stability and sensitivity can be built. The wind data are of comparable quality to those obtained from operational techniques (balloon and rocket sonde, cloud-top drift analysis, and from the gradient wind analysis of satellite radiance measurements). However, the interferometric data can provide a regular global grid, over a height range from 5 to 50 km in regions of clear air. Between the middle troposphere (5 km) and the upper stratosphere (40 to 50 km), an optimized instrument can make wind measurements over the daylit hemisphere with an accuracy of about 3 to 5 m/sec (2 sigma). It is possible to obtain full height profiles between altitudes of 5 and 50 km, with 4 km height resolution, and a spatial resolution of about 200 km, along the orbit track. Below an altitude of about 10 km, Fraunhofer lines of solar origin are possible targets of the Doppler wind analysis. Above an altitude of 50 km, the weakness of the backscattered solar spectrum (decreasing air density) is coupled with the low absorption crosssection of all atmospheric species in the spectral region up to 800 nm (where imaging photon detectors can be used), causing the along-the-track resolution (or error) to increase beyond values useful for operational purposes. Within the region of optimum performance (5 to 50 km), however, the technique is a valuable potential complement to existing wind measuring systems and can provide a low cost addition to powerful active (LIDAR) wind measuring systems now under development.

Rees, David↗

Multigrid properties of upwind-biased data reconstructions

The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

Warren, Gary P.↗

Technical report series on global modeling and data assimilation. Volume 2: Direct solution of the implicit formulation of fourth order horizontal diffusion for gridpoint models on the sphere

High order horizontal diffusion of the form K Delta(exp 2m) is widely used in spectral models as a means of preventing energy accumulation at the shortest resolved scales. In the spectral context, an implicit formation of such diffusion is trivial to implement. The present note describes an efficient method of implementing implicit high order diffusion in global finite difference models. The method expresses the high order diffusion equation as a sequence of equations involving Delta(exp 2). The solution is obtained by combining fast Fourier transforms in longitude with a finite difference solver for the second order ordinary differential equation in latitude. The implicit diffusion routine is suitable for use in any finite difference global model that uses a regular latitude/longitude grid. The absence of a restriction on the timestep makes it particularly suitable for use in semi-Lagrangian models. The scale selectivity of the high order diffusion gives it an advantage over the uncentering method that has been used to control computational noise in two-time-level semi-Lagrangian models.

Max J. Suarez↗

Multiresolution With Super-Compact Wavelets

The solution data computed from large scale simulations are sometimes too big for main memory, for local disks, and possibly even for a remote storage disk, creating tremendous processing time as well as technical difficulties in analyzing the data. The excessive storage demands a corresponding huge penalty in I/O time, rendering time and transmission time between different computer systems. In this paper, a multiresolution scheme is proposed to compress field simulation or experimental data without much loss of important information in the representation. Originally, the wavelet based multiresolution scheme was introduced in image processing, for the purposes of data compression and feature extraction. Unlike photographic image data which has rather simple settings, computational field simulation data needs more careful treatment in applying the multiresolution technique. While the image data sits on a regular spaced grid, the simulation data usually resides on a structured curvilinear grid or unstructured grid. In addition to the irregularity in grid spacing, the other difficulty is that the solutions consist of vectors instead of scalar values. The data characteristics demand more restrictive conditions. In general, the photographic images have very little inherent smoothness with discontinuities almost everywhere. On the other hand, the numerical solutions have smoothness almost everywhere and discontinuities in local areas (shock, vortices, and shear layers). The wavelet bases should be amenable to the solution of the problem at hand and applicable to constraints such as numerical accuracy and boundary conditions. In choosing a suitable wavelet basis for simulation data among a variety of wavelet families, the supercompact wavelets designed by Beam and Warming provide one of the most effective multiresolution schemes. Supercompact multi-wavelets retain the compactness of Haar wavelets, are piecewise polynomial and orthogonal, and can have arbitrary order of approximation. The advantages of the multiresolution algorithm are that no special treatment is required at the boundaries of the interval, and that the application to functions which are only piecewise continuous (internal boundaries) can be efficiently implemented. In this presentation, Beam's supercompact wavelets are generalized to higher dimensions using multidimensional scaling and wavelet functions rather than alternating the directions as in the 1D version. As a demonstration of actual 3D data compression, supercompact wavelet transforms are applied to a 3D data set for wing tip vortex flow solutions (2.5 million grid points). It is shown that high data compression ratio can be achieved (around 50:1 ratio) in both vector and scalar data set.

Lee, Dohyung↗

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

Visualizing Flow Over Parametric Surfaces Using Line Integral Convolution

Line Integral Convolution (LIC) is a powerful technique for imaging and animating vector fields. We extend the LIC paradigm in three ways: (1) The existing technique is limited to vector fields over a regular Cartesian grid. We extend it to vector fields over parametric surfaces, such as those found in curvilinear grids, used in computational fluid dynamics simulations; (2) Periodic motion filters can be used to animate the flow visualization. When the flow lies on a parametric surface, however, the motion appears misleading. We explain why this problem arises and show how to adjust the LIC algorithm to handle it; (3) We introduce a technique to visualize vector magnitudes as well as vector direction. Cabral and Leedom have suggested a method for variable-speed animation, which is based on varying the frequency of the filter function. We develop a different technique based on kernel phase shifts which we have found to show substantially better results. Our implementation of these algorithms utilizes texture-mapping hardware to run in real time, which allows them to be included in interactive applications.

Forssell, Lisa↗

Spacecraft hazard avoidance utilizing structured light

At JPL, a <5 kg free-flying micro-inspector spacecraft is being designed for host-vehicle inspection. The spacecraft includes a hazard avoidance sensor to navigate relative to the vehicle being inspected. Structured light was selected for hazard avoidance because of its low mass and cost. Structured light is a method of remote sensing 3-dimensional structure of the proximity utilizing a laser, a grating, and a single regular APS camera. The laser beam is split into 400 different beams by a grating to form a regular spaced grid of laser beams that are projected into the field of view of an APS camera. The laser source and the APS camera are separated forming the base of a triangle. The distance to all beam intersections of the host are calculated based on triangulation.

remote sensing↗

MODIS Tree Cover Validation for the Circumpolar Taiga-Tundra Transition Zone

A validation of the 2005 500m MODIS vegetation continuous fields (VCF) tree cover product in the circumpolar taiga-tundra ecotone was performed using high resolution Quickbird imagery. Assessing the VCF's performance near the northern limits of the boreal forest can help quantify the accuracy of the product within this vegetation transition area. The circumpolar region was divided into longitudinal zones and validation sites were selected in areas of varying tree cover where Quickbird imagery is available in Google Earth. Each site was linked to the corresponding VCF pixel and overlaid with a regular dot grid within the VCF pixel's boundary to estimate percent tree crown cover in the area. Percent tree crown cover was estimated using Quickbird imagery for 396 sites throughout the circumpolar region and related to the VCF's estimates of canopy cover for 2000-2005. Regression results of VCF inter-annual comparisons (2000-2005) and VCF-Quickbird image-interpreted estimates indicate that: (1) Pixel-level, inter-annual comparisons of VCF estimates of percent canopy cover were linearly related (mean R(sup 2) = 0.77) and exhibited an average root mean square error (RMSE) of 10.1 % and an average root mean square difference (RMSD) of 7.3%. (2) A comparison of image-interpreted percent tree crown cover estimates based on dot counts on Quickbird color images by two different interpreters were more variable (R(sup 2) = 0.73, RMSE = 14.8%, RMSD = 18.7%) than VCF inter-annual comparisons. (3) Across the circumpolar boreal region, 2005 VCF-Quickbird comparisons were linearly related, with an R(sup 2) = 0.57, a RMSE = 13.4% and a RMSD = 21.3%, with a tendency to over-estimate areas of low percent tree cover and anomalous VCF results in Scandinavia. The relationship of the VCF estimates and ground reference indicate to potential users that the VCF's tree cover values for individual pixels, particularly those below 20% tree cover, may not be precise enough to monitor 500m pixel-level tree cover in the taiga-tundra transition zone.

Montesano, P. M.↗