SEARCH · USGS Science

Results for “Algorithms”

Search indexed USGS publications on groundwater, aquifers, geologic maps, mineral resources and earthquakes. Explore source records by subject and place.

SourceResearch connectionFrom yearThrough year

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

At least 19 recordsLinked to original sources

USGS2011

Hybrid-optimization algorithm for the management of a conjunctive-use project and well field design

Hi-Desert Water District (HDWD), the primary water-management agency in the Warren Groundwater Basin, California, plans to construct a waste water treatment plant to reduce future septic-tank effluent from reaching the groundwater system. The treated waste water will be reclaimed by recharging the groundwater basin via recharge ponds as part of a larger conjunctive-use strategy. HDWD wishes to identify the least-cost conjunctiveuse strategies for managing imported surface water, reclaimed water, and local groundwater. As formulated, the mixed-integer nonlinear programming (MINLP) groundwater-management problem seeks to minimize water delivery costs subject to constraints including potential locations of the new pumping wells, California State regulations, groundwater-level constraints, water-supply demand, available imported water, and pump/recharge capacities. In this study, a hybrid-optimization algorithm, which couples a genetic algorithm and successive-linear programming, is developed to solve the MINLP problem. The algorithm was tested by comparing results to the enumerative solution for a simplified version of the HDWD groundwater-management problem. The results indicate that the hybrid-optimization algorithm can identify the global optimum. The hybrid-optimization algorithm is then applied to solve a complex groundwater-management problem. Sensitivity analyses were also performed to assess the impact of varying the new recharge pond orientation, varying the mixing ratio of reclaimed water and pumped water, and varying the amount of imported water available. The developed conjunctive management model can provide HDWD water managers with information that will improve their ability to manage their surface water, reclaimed water, and groundwater resources.

California↗

USGS2011

A trans-dimensional Bayesian Markov chain Monte Carlo algorithm for model assessment using frequency-domain electromagnetic data

A meaningful interpretation of geophysical measurements requires an assessment of the space of models that are consistent with the data, rather than just a single, ‘best’ model which does not convey information about parameter uncertainty. For this purpose, a trans-dimensional Bayesian Markov chain Monte Carlo (MCMC) algorithm is developed for assessing frequencydomain electromagnetic (FDEM) data acquired from airborne or ground-based systems. By sampling the distribution of models that are consistent with measured data and any prior knowledge, valuable inferences can be made about parameter values such as the likely depth to an interface, the distribution of possible resistivity values as a function of depth and non-unique relationships between parameters. The trans-dimensional aspect of the algorithm allows the number of layers to be a free parameter that is controlled by the data, where models with fewer layers are inherently favoured, which provides a natural measure of parsimony and a signiﬁcant degree of ﬂexibility in parametrization. The MCMC algorithm is used with synthetic examples to illustrate how the distribution of acceptable models is affected by the choice of prior information, the system geometry and conﬁguration and the uncertainty in the measured system elevation. An airborne FDEM data set that was acquired for the purpose of hydrogeological characterization is also studied. The results compare favorably with traditional least-squares analysis, borehole resistivity and lithology logs from the site, and also provide new information about parameter uncertainty necessary for model assessment.

Geophysical Journal International↗

USGS2017

Cloud detection algorithm comparison and validation for operational Landsat data products

Clouds are a pervasive and unavoidable issue in satellite-borne optical imagery. Accurate, well-documented, and automated cloud detection algorithms are necessary to effectively leverage large collections of remotely sensed data. The Landsat project is uniquely suited for comparative validation of cloud assessment algorithms because the modular architecture of the Landsat ground system allows for quick evaluation of new code, and because Landsat has the most comprehensive manual truth masks of any current satellite data archive. Currently, the Landsat Level-1 Product Generation System (LPGS) uses separate algorithms for determining clouds, cirrus clouds, and snow and/or ice probability on a per-pixel basis. With more bands onboard the Landsat 8 Operational Land Imager (OLI)/Thermal Infrared Sensor (TIRS) satellite, and a greater number of cloud masking algorithms, the U.S. Geological Survey (USGS) is replacing the current cloud masking workflow with a more robust algorithm that is capable of working across multiple Landsat sensors with minimal modification. Because of the inherent error from stray light and intermittent data availability of TIRS, these algorithms need to operate both with and without thermal data. In this study, we created a workflow to evaluate cloud and cloud shadow masking algorithms using cloud validation masks manually derived from both Landsat 7 Enhanced Thematic Mapper Plus (ETM +) and Landsat 8 OLI/TIRS data. We created a new validation dataset consisting of 96 Landsat 8 scenes, representing different biomes and proportions of cloud cover. We evaluated algorithm performance by overall accuracy, omission error, and commission error for both cloud and cloud shadow. We found that CFMask, C code based on the Function of Mask (Fmask) algorithm, and its confidence bands have the best overall accuracy among the many algorithms tested using our validation data. The Artificial Thermal-Automated Cloud Cover Algorithm (AT-ACCA) is the most accurate nonthermal-based algorithm. We give preference to CFMask for operational cloud and cloud shadow detection, as it is derived from a priori knowledge of physical phenomena and is operable without geographic restriction, making it useful for current and future land imaging missions without having to be retrained in a machine-learning environment.

Remote Sensing of Environment↗

USGS2023

Evaluation of Landsat image compositing algorithms

We proposed a new image compositing algorithm (MAX-RNB) based on the maximum ratio of Near Infrared (NIR) to Blue band (RNB), and evaluated it together with nine other compositing algorithms: MAX-NDVI (maximum Normalized Difference Vegetation Index), MED-NIR (median NIR band), WELD (conterminous United States Web-Enabled Landsat Data), BAP (Best Available Pixel), PAC (Phenology Adaptive Composite), WPS (Weighted Parametric Scoring), MEDOID (medoid measurement), COSSIM (cosine similarity), and NLCD (National Land Cover Database). Each algorithm was applied to time series of Landsat observations collected within two separate years at six locations around the world, to produce monthly (July 1 ± 15 days), seasonal (July 1 ± 45 days), and annual (July 1 ± 180 days) composite images free of cloud, cloud shadow, and snow/ice. By comparing the composite images to reference Landsat images acquired in the growing season (closest to July 1 within ±15 days) for each year, we evaluated the performance of the algorithms in preserving the spectral and spatial fidelity (hereafter referred to as spectral and spatial evaluation, respectively), as well as land cover classification and land change detection (hereafter referred to as application evaluation). The results demonstrated that no single algorithm outperformed all other algorithms in all the evaluations, but that performance depended on compositing intervals and cloud cover. For monthly composites, the MAX-RNB algorithm generally produced the best results in the spectral and application evaluations. For seasonal composites, the NLCD algorithm produced the best results in the spectral and application evaluations. For annual composites, the PAC algorithm produced the best results in the spectral evaluation and change detection, whereas BAP produced the best results in land cover classification. The BAP algorithm also produced the best results in the spatial evaluation for all the compositing periods. This study provides a comprehensive guidance for selecting the most appropriate image compositing algorithm for different Landsat-based applications.

Remote Sensing of Environment↗

USGS2024

New diagnostic assessment of MCMC algorithm effectiveness, efficiency, reliability, and controllability

Markov Chain Monte Carlo (MCMC) is a robust statistical approach for estimating posterior distributions. However, the significant computational cost associated with MCMC presents a considerable challenge, complicating the selection of an appropriate algorithm tailored to the specific problem at hand. This study introduces a novel and comprehensive framework for evaluating the performance of MCMC algorithms, drawing inspiration from diagnostics used for multi-objective evolutionary algorithms. We employ visualizations to evaluate key algorithmic characteristics: Effectiveness (the ability to accurately find representative posterior modes, quantified by the Kullback-Leibler Divergence (KLD) andWasserstein Distance (WD)), Efficiency (the speed of posterior characterization), Reliability (consistency across different random seeds), and Controllability (insensitivity to hyperparameter variation). Evaluating three prominent MCMC algorithms—Metropolis-Hastings (MH), Adaptive Metropolis (AM), and Differential Evolution Adaptive Metropolis (DREAM)—on high-dimensional and bimodal test problems, our analysis uncovers several insights. First, across algorithms, the number of function evaluations most controls performance on the high-dimensional problem, while the number of chains most controls performance on the bimodal problem. While this suggests similar controllability across algorithms, differences emerge on the other algorithmic characteristics. For high numbers of functions evaluations, AM performs best on the high-dimensional problem, while for low (<5) and high (>15) chain counts, MH and AM perform best on the bimodal problem, as measured by KLD. However, outside these specific cases, DREAM consistently demonstrates superior efficiency and reliability, making it a robust choice for both high-dimensional and multimodal problems. These findings can inform MCMC algorithm selection for Bayesian inference applications, as well as hyperparameterization of the chosen algorithm...

IEEE Access↗

USGS2006

Nonlinear inversion of potential-field data using a hybrid-encoding genetic algorithm

Using a genetic algorithm to solve an inverse problem of complex nonlinear geophysical equations is advantageous because it does not require computer gradients of models or "good" initial models. The multi-point search of a genetic algorithm makes it easier to find the globally optimal solution while avoiding falling into a local extremum. As is the case in other optimization approaches, the search efficiency for a genetic algorithm is vital in finding desired solutions successfully in a multi-dimensional model space. A binary-encoding genetic algorithm is hardly ever used to resolve an optimization problem such as a simple geophysical inversion with only three unknowns. The encoding mechanism, genetic operators, and population size of the genetic algorithm greatly affect search processes in the evolution. It is clear that improved operators and proper population size promote the convergence. Nevertheless, not all genetic operations perform perfectly while searching under either a uniform binary or a decimal encoding system. With the binary encoding mechanism, the crossover scheme may produce more new individuals than with the decimal encoding. On the other hand, the mutation scheme in a decimal encoding system will create new genes larger in scope than those in the binary encoding. This paper discusses approaches of exploiting the search potential of genetic operations in the two encoding systems and presents an approach with a hybrid-encoding mechanism, multi-point crossover, and dynamic population size for geophysical inversion. We present a method that is based on the routine in which the mutation operation is conducted in the decimal code and multi-point crossover operation in the binary code. The mix-encoding algorithm is called the hybrid-encoding genetic algorithm (HEGA). HEGA provides better genes with a higher probability by a mutation operator and improves genetic algorithms in resolving complicated geophysical inverse problems. Another significant result is that final solution is determined by the average model derived from multiple trials instead of one computation due to the randomness in a genetic algorithm procedure. These advantages were demonstrated by synthetic and real-world examples of inversion of potential-field data. ?? 2005 Elsevier Ltd. All rights reserved.

Computers & Geosciences↗

USGS2011

An enhanced TIMESAT algorithm for estimating vegetation phenology metrics from MODIS data

An enhanced TIMESAT algorithm was developed for retrieving vegetation phenology metrics from 250 m and 500 m spatial resolution Moderate Resolution Imaging Spectroradiometer (MODIS) vegetation indexes (VI) over North America. MODIS VI data were pre-processed using snow-cover and land surface temperature data, and temporally smoothed with the enhanced TIMESAT algorithm. An objective third derivative test was applied to define key phenology dates and retrieve a set of phenology metrics. This algorithm has been applied to two MODIS VIs: Normalized Difference Vegetation Index (NDVI) and Enhanced Vegetation Index (EVI). In this paper, we describe the algorithm and use EVI as an example to compare three sets of TIMESAT algorithm/MODIS VI combinations: a) original TIMESAT algorithm with original MODIS VI, b) original TIMESAT algorithm with pre-processed MODIS VI, and c) enhanced TIMESAT and pre-processed MODIS VI. All retrievals were compared with ground phenology observations, some made available through the National Phenology Network. Our results show that for MODIS data in middle to high latitude regions, snow and land surface temperature information is critical in retrieving phenology metrics from satellite observations. The results also show that the enhanced TIMESAT algorithm can better accommodate growing season start and end dates that vary significantly from year to year. The TIMESAT algorithm improvements contribute to more spatial coverage and more accurate retrievals of the phenology metrics. Among three sets of TIMESAT/MODIS VI combinations, the start of the growing season metric predicted by the enhanced TIMESAT algorithm using pre-processed MODIS VIs has the best associations with ground observed vegetation greenup dates. ?? 2010 IEEE.

Conference Paper↗

USGS1992

A test to evaluate the earthquake prediction algorithm, M8

A test of the algorithm M8 is described. The test is constructed to meet four rules, which we propose to be applicable to the test of any method for earthquake prediction: 1. An earthquake prediction technique should be presented as a well documented, logical algorithm that can be used by investigators without restrictions. 2. The algorithm should be coded in a common programming language and implementable on widely available computer systems. 3. A test of the earthquake prediction technique should involve future predictions with a black box version of the algorithm in which potentially adjustable parameters are fixed in advance. The source of the input data must be defined and ambiguities in these data must be resolved automatically by the algorithm. 4. At least one reasonable null hypothesis should be stated in advance of testing the earthquake prediction method, and it should be stated how this null hypothesis will be used to estimate the statistical significance of the earthquake predictions. The M8 algorithm has successfully predicted several destructive earthquakes, in the sense that the earthquakes occurred inside regions with linear dimensions from 384 to 854 km that the algorithm had identified as being in times of increased probability for strong earthquakes. In addition, M8 has successfully "post predicted" high percentages of strong earthquakes in regions to which it has been applied in retroactive studies. The statistical significance of previous predictions has not been established, however, and post-prediction studies in general are notoriously subject to success-enhancement through hindsight. Nor has it been determined how much more precise an M8 prediction might be than forecasts and probability-of-occurrence estimates made by other techniques. We view our test of M8 both as a means to better determine the effectiveness of M8 and as an experimental structure within which to make observations that might lead to improvements in the algorithm or conceivably lead to a radically different approach to earthquake prediction.

Open-File Report↗

USGS2004

Siberia snow depth climatology derived from SSM/I data using a combined dynamic and static algorithm

One of the major challenges in determining snow depth (SD) from passive microwave measurements is to take into account the spatiotemporal variations of the snow grain size. Static algorithms based on a constant snow grain size cannot provide accurate estimates of snow pack thickness, particularly over large regions where the snow pack is subjected to big spatial temperature variations. A recent dynamic algorithm that accounts for the dependence of the microwave scattering on the snow grain size has been developed to estimate snow depth from the Special Sensor Microwave/Imager (SSM/I) over the Northern Great Plains (NGP) in the US. In this paper, we develop a combined dynamic and static algorithm to estimate snow depth from 13 years of SSM/I observations over Central Siberia. This region is characterised by extremely cold surface air temperatures and by the presence of permafrost that significantly affects the ground temperature. The dynamic algorithm is implemented to take into account these effects and it yields accurate snow depths early in the winter, when thin snowpacks combine with cold air temperatures to generate rapid crystal growth. However, it is not applicable later in the winter when the grain size growth slows. Combining the dynamic algorithm to a static algorithm, with a temporally constant but spatially varying coefficient, we obtain reasonable snow depth estimates throughout the entire snow season. Validation is carried out by comparing the satellite snow depth monthly averages to monthly climatological data. We show that the location of the snow depth maxima and minima is improved when applying the combined algorithm, since its dynamic portion explicitly incorporate the thermal gradient through the snowpack. The results obtained are presented and evaluated for five different vegetation zones of Central Siberia. Comparison with in situ measurements is also shown and discussed. ?? 2004 Elsevier Inc. All rights reserved.

Remote Sensing of Environment↗

USGS2015

Reducing cross-sectional data using a genetic algorithm method and effects on cross-section geometry and steady-flow profiles

Reduction of cross-sectional data using a genetic algorithm method, and the effects of data reduction on channel geometry and steady-flow profiles, were analyzed. Two reduction methods─standard and genetic algorithms─were used to reduce cross-sectional data from the Kootenai River in northern Idaho. Cross sections that are representative of meander, straight, braided, and canyon reaches were used to evalutate the reduction methods. Visual and hydraulic analyses were used to assess the methods. The genetic algorithm-reduced cross sections approximated the shape of the original cross sections better than the standard-reduced cross sections. A greater number of cross-sectional data points were needed for reduced cross sections in the straight reach, and even more in the braided reach, because a greater amount of data points are needed to adequately define cross sections that have greater topographic varability. For the genetic algorithm-reduction method, about 40 data points were needed to adequately define the shape of a reduced cross section in the braided reach compared to 10 to 20 data points in the meander and canyon reaches. The standard-reduction method needed about 70 data points for the braided reach and more than 30 points for the meander and canyon reaches. The genetic algorithm can effectively reduce data while staying within the threshold set by the maximum number of points to be included in the reduced dataset. The effects of reduced cross-sectional data points on steady-flow profiles were also determined. Thirty-five cross sections of the original steady-flow model of the Kootenai River were used. These two methods were tested for all cross sections with each cross section resolution reduced to 10, 20 and 30 data points, that is, six tests were completed for each of the thirty-five cross sections. Generally, differences from the original water-surface elevation were smaller as the number of data points in reduced cross sections increased, but this was not always the case, especially in the braided reach. Differences were smaller for reduced cross sections developed by the genetic algorithm method than the standard algorithm method.

Scientific Investigations Report↗

USGS2012

Effects of activity and energy budget balancing algorithm on laboratory performance of a fish bioenergetics model

We evaluated the performance of the Wisconsin bioenergetics model for lake trout Salvelinus namaycush that were fed ad libitum in laboratory tanks under regimes of low activity and high activity. In addition, we compared model performance under two different model algorithms: (1) balancing the lake trout energy budget on day t based on lake trout energy density on day t and (2) balancing the lake trout energy budget on day t based on lake trout energy density on day t + 1. Results indicated that the model significantly underestimated consumption for both inactive and active lake trout when algorithm 1 was used and that the degree of underestimation was similar for the two activity levels. In contrast, model performance substantially improved when using algorithm 2, as no detectable bias was found in model predictions of consumption for inactive fish and only a slight degree of overestimation was detected for active fish. The energy budget was accurately balanced by using algorithm 2 but not by using algorithm 1. Based on the results of this study, we recommend the use of algorithm 2 to estimate food consumption by fish in the field. Our study results highlight the importance of accurately accounting for changes in fish energy density when balancing the energy budget; furthermore, these results have implications for the science of evaluating fish bioenergetics model performance and for more accurate estimation of food consumption by fish in the field when fish energy density undergoes relatively rapid changes.

Transactions of the American Fisheries Society↗

USGS2025

Generalized Bancroft algorithm for locating earthquakes with P- and S-wave arrival times

Because of similarities between locating an earthquake with seismic stations and locating a Global Positioning System (GPS) receiver from satellites, the Bancroft algorithm developed for GPS processing can be used to locate earthquakes. Such an approach to earthquake location differs from the conventional method of choosing an initial or trial solution and then iteratively improving the solution until convergence. The Bancroft algorithm has the advantage of being a direct, noniterative solution but with the disadvantage of only being able to accommodate a homogeneous velocity model. An additional limitation of the standard Bancroft algorithm is that it considers arrival times in a medium with a single propagation velocity. This poses no problem for GPS processing because electromagnetic waves travel at the speed of light; however, for seismic waves it means the algorithm can be applied to collections of either P ‐ or S ‐wave arrival times. Here, I show how the Bancroft algorithm can be generalized to handle both P ‐ and S ‐wave arrival‐time measurements simultaneously. I also show how to accommodate depth‐varying P ‐ and S ‐wave velocity models. I apply the generalized Bancroft algorithm to microearthquakes beneath Tanaga Volcano in Alaska and compare standard locations from the widely used HYPOINVERSE location code to Bancroft locations and to the output of HYPOINVERSE when setting the trial location to the Bancroft location. I find the Bancroft locations outperform the results from the other methods for shallow earthquakes near sea level, where a quantity known as the geometric dilution of precision is large and linearized approaches such as HYPOINVERSE are expected to struggle.

Alaska↗

USGS2015

Advanced Spaceborne Thermal Emission and Reflection Radiometer Level 1 Precision Terrain Corrected Registered At-Sensor Radiance (AST_L1T) Product, algorithm theoretical basis document

This document provides an overview of the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) supplemental algorithms in conjunction with the reuse of Landsat geometric algorithms modified by the National Aeronautics and Space Administration (NASA Land Processes Distributed Active Archive Center (LP DAAC) to create an ASTER Level 1 Precision Terrain Corrected Registered At-Sensor Radiance (AST_L1T) product. Implementation of these algorithms occurs within the AST_L1T product generation executable (PGE) as part of the open source Simple, Scalable, Script-based Science Processor for Missions (S4PM) processing software subsystem. The AST_L1T algorithms include the following: Generation of the AST_L1A input product via supplemental algorithms Application of the radiometric and geometric corrections appended in the AST_L1A product Application of cross-talk correction coefficients Generation and application of affine transformation coefficients Modification and reuse of Landsat’s geometric algorithms including: Systematic—generates the systematic grid Resampling—multi-use; only a single resample of input scene Gpyramid—scale input image to reference image (if necessary) Ground Control Point (GCP) Correlate—computes x,y offsets for GCPs to be used for precision grid generation Precision Refine—generates the precision grid GVERIFY—geometric verification

Open-File Report↗

USGS2013

An algorithmic and information-theoretic approach to multimetric index construction

The use of multimetric indices (MMIs), such as the widely used index of biological integrity (IBI), to measure, track, summarize and infer the overall impact of human disturbance on biological communities has been steadily growing in recent years. Initially, MMIs were developed for aquatic communities using pre-selected biological metrics as indicators of system integrity. As interest in these bioassessment tools has grown, so have the types of biological systems to which they are applied. For many ecosystem types the appropriate biological metrics to use as measures of biological integrity are not known a priori. As a result, a variety of ad hoc protocols for selecting metrics empirically has developed. However, the assumptions made by proposed protocols have not be explicitly described or justified, causing many investigators to call for a clear, repeatable methodology for developing empirically derived metrics and indices that can be applied to any biological system. An issue of particular importance that has not been sufficiently addressed is the way that individual metrics combine to produce an MMI that is a sensitive composite indicator of human disturbance. In this paper, we present and demonstrate an algorithm for constructing MMIs given a set of candidate metrics and a measure of human disturbance. The algorithm uses each metric to inform a candidate MMI, and then uses information-theoretic principles to select MMIs that capture the information in the multidimensional system response from among possible MMIs. Such an approach can be used to create purely empirical (data-based) MMIs or can, optionally, be influenced by expert opinion or biological theory through the use of a weighting vector to create value-weighted MMIs. We demonstrate the algorithm with simulated data to demonstrate the predictive capacity of the final MMIs and with real data from wetlands from Acadia and Rocky Mountain National Parks. For the Acadia wetland data, the algorithm identified 4 metrics that combined to produce a -0.88 correlation with the human disturbance index. When compared to other methods, we find this algorithmic approach resulted in MMIs that were more predictive and comprise fewer metrics.

Ecological Indicators↗

USGS2020

The Landsat Burned Area algorithm and products for the conterminous United States

Complete and accurate burned area map data are needed to document spatial and temporal patterns of fires, to quantify their drivers, and to assess the impacts on human and natural systems. In this study, we developed the Landsat Burned Area (BA) algorithm, an update from the Landsat Burned Area Essential Climate Variable (BAECV) algorithm. Here, we present the BA algorithm and products, changes relative to the BAECV algorithm and products, and updated validation metrics. We also present spatial and temporal patterns of burned area across the conterminous U.S., how burned area varies in relation to the number of operational Landsat sensors, and a comparison with other burned area datasets, including the BAECV, Monitoring Trends in Burn Severity (MTBS), GeoMAC, and Moderate Resolution Imaging Spectroradiometer (MODIS) MCD64A1.006 data. The BA algorithm identifies burned areas in analysis ready data (ARD) time-series of Landsat imagery from 1984 through 2018 using machine learning, thresholding, and image segmentation. Validation with reference data from high-resolution commercial satellite imagery resulted in omission and commission error rates averaging 19% and 41%, respectively. In comparison, validation with Landsat reference data had omission and commission error rates averaging 40% and 28%, respectively when burned areas in cultivated crops and pasture/hay land-cover types were excluded. Both validation tests documented lower commission error rates relative to the BAECV products. The amount of burned area detected varies not only in response to climate but also with the number of operational sensors and scenes collected. The combined amount of burned area detected by multiple sensors was larger than from any individual sensor, but there was no significant difference between individual sensors. Therefore, we used BA products from individual sensors to assess trends over time and all available sensors to compare with other existing BA products. From 1984 through 2018, annual burned area averaged 30,000 km2, ranged between 14,000 km2 in 1991 and 46,500 km2 in 2012, and increased over time at a rate of 356 km2/year. Compared to existing burned area products, the new Landsat BA products identified 29% more burned area than the BAECV products (1984–2015), 183% more than the MTBS/GeoMAC products (1984–2018), and 56% more than the MCD64A1.006 products (2003–2018). The products had similar patterns of year-to-year variability; the R2 values of linear regressions between annual burned area were >0.70 with the BAECV products and the MTBS/GeoMAC products, but somewhat lower for the MCD64A1.006 product (R2 = 0.66). The BA products are routinely produced as new Landsat data are collected and provide a unique data source to monitor and assess the spatial and temporal patterns and the impacts of fire.

Remote Sensing of Environment↗

USGS2012

Development of the Landsat Data Continuity Mission cloud-cover assessment algorithms

The upcoming launch of the Operational Land Imager (OLI) will start the next era of the Landsat program. However, the Automated Cloud-Cover Assessment (CCA) (ACCA) algorithm used on Landsat 7 requires a thermal band and is thus not suited for OLI. There will be a thermal instrument on the Landsat Data Continuity Mission (LDCM)-the Thermal Infrared Sensor-which may not be available during all OLI collections. This illustrates a need for CCA for LDCM in the absence of thermal data. To research possibilities for full-resolution OLI cloud assessment, a global data set of 207 Landsat 7 scenes with manually generated cloud masks was created. It was used to evaluate the ACCA algorithm, showing that the algorithm correctly classified 79.9% of a standard test subset of 3.95 109 pixels. The data set was also used to develop and validate two successor algorithms for use with OLI data-one derived from an off-the-shelf machine learning package and one based on ACCA but enhanced by a simple neural network. These comprehensive CCA algorithms were shown to correctly classify pixels as cloudy or clear 88.5% and 89.7% of the time, respectively.

IEEE Transactions on Geoscience and Remote Sensing↗

USGS2006

An effective medium inversion algorithm for gas hydrate quantification and its application to laboratory and borehole measurements of gas hydrate-bearing sediments

The presence of gas hydrate in marine sediments alters their physical properties. In some circumstances, gas hydrate may cement sediment grains together and dramatically increase the seismic P- and S-wave velocities of the composite medium. Hydrate may also form a load-bearing structure within the sediment microstructure, but with different seismic wave attenuation characteristics, changing the attenuation behaviour of the composite. Here we introduce an inversion algorithm based on effective medium modelling to infer hydrate saturations from velocity and attenuation measurements on hydrate-bearing sediments. The velocity increase is modelled as extra binding developed by gas hydrate that strengthens the sediment microstructure. The attenuation increase is modelled through a difference in fluid flow properties caused by different permeabilities in the sediment and hydrate microstructures. We relate velocity and attenuation increases in hydrate-bearing sediments to their hydrate content, using an effective medium inversion algorithm based on the self-consistent approximation (SCA), differential effective medium (DEM) theory, and Biot and squirt flow mechanisms of fluid flow. The inversion algorithm is able to convert observations in compressional and shear wave velocities and attenuations to hydrate saturation in the sediment pore space. We applied our algorithm to a data set from the Mallik 2L–38 well, Mackenzie delta, Canada, and to data from laboratory measurements on gas-rich and water-saturated sand samples. Predictions using our algorithm match the borehole data and water-saturated laboratory data if the proportion of hydrate contributing to the load-bearing structure increases with hydrate saturation. The predictions match the gas-rich laboratory data if that proportion decreases with hydrate saturation. We attribute this difference to differences in hydrate formation mechanisms between the two environments.

Geophysical Journal International↗

USGS2019

Event detection performance of the PLUM earthquake early warning algorithm in southern California

We test the Japanese ground‐motion‐based earthquake early warning (EEW) algorithm, propagation of local undamped motion (PLUM), in southern California with application to the U.S. ShakeAlert system. In late 2018, ShakeAlert began limited public alerting in Los Angeles to areas of expected modified Mercalli intensity (⁠IMMI⁠) 4.0+ for magnitude 5.0+ earthquakes. Most EEW systems, including ShakeAlert, use source‐based methods: they estimate the location, magnitude, and origin time of an earthquake from P waves and use a ground‐motion prediction equation to identify regions of expected strong shaking. The PLUM algorithm uses observed ground motions directly to define alert areas and was developed to address deficiencies in the Japan Meteorological Agency source‐based EEW system during the 2011 Mw 9.0 Tohoku earthquake sequence. We assess PLUM using (a) a dataset of 193 magnitude 3.5+ earthquakes that occurred in southern California between 2012 and 2017 and (b) the ShakeAlert testing and certification suite of 49 earthquakes and other seismic signals. The latter suite includes events that challenge the current ShakeAlert algorithms. We provide a first‐order performance assessment using event‐based metrics similar to those used by ShakeAlert. We find that PLUM can be configured to successfully issue alerts using IMMI trigger thresholds that are lower than those implemented in Japan. Using two stations, a trigger threshold of IMMI 4.0 for the first station and a threshold of IMMI 2.5 for the second station PLUM successfully detect 12 of 13 magnitude 5.0+ earthquakes and issue no false alerts. PLUM alert latencies were similar to and in some cases faster than source‐based algorithms, reducing area that receives no warning near the source that generally have the highest ground motions. PLUM is a simple, independent seismic method that may complement existing source‐based algorithms in EEW systems, including the ShakeAlert system, even when alerting to light (⁠IMMI 4.0) or higher ground‐motion levels.

California↗