Search NASA⌕ Search

SEARCH · Search NASA

Results for “Filtering algorithms”

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 919 records · Page 51

An Adaptive Kalman Filter using a Simple Residual Tuning Method

One difficulty in using Kalman filters in real world situations is the selection of the correct process noise, measurement noise, and initial state estimate and covariance. These parameters are commonly referred to as tuning parameters. Multiple methods have been developed to estimate these parameters. Most of those methods such as maximum likelihood, subspace, and observer Kalman Identification require extensive offline processing and are not suitable for real time processing. One technique, which is suitable for real time processing, is the residual tuning method. Any mismodeling of the filter tuning parameters will result in a non-white sequence for the filter measurement residuals. The residual tuning technique uses this information to estimate corrections to those tuning parameters. The actual implementation results in a set of sequential equations that run in parallel with the Kalman filter. Equations for the estimation of the measurement noise have also been developed. These algorithms are used to estimate the process noise and measurement noise for the Wide Field Infrared Explorer star tracker and gyro.

Harman, Richard R.↗

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

Long, Jason D.↗

Formation Flying With Decentralized Control in Libration Point Orbits

A decentralized control framework is investigated for applicability of formation flying control in libration orbits. The decentralized approach, being non-hierarchical, processes only direct measurement data, in parallel with the other spacecraft. Control is accomplished via linearization about a reference libration orbit with standard control using a Linear Quadratic Regulator (LQR) or the GSFC control algorithm. Both are linearized about the current state estimate as with the extended Kalman filter. Based on this preliminary work, the decentralized approach appears to be feasible for upcoming libration missions using distributed spacecraft.

Folta, David↗

Relative Navigation of Formation Flying Satellites

The Guidance, Navigation, and Control Center (GNCC) at Goddard Space Flight Center (GSFC) has successfully developed high-accuracy autonomous satellite navigation systems using the National Aeronautics and Space Administration's (NASA's) space and ground communications systems and the Global Positioning System (GPS). In addition, an autonomous navigation system that uses celestial object sensor measurements is currently under development and has been successfully tested using real Sun and Earth horizon measurements.The GNCC has developed advanced spacecraft systems that provide autonomous navigation and control of formation flyers in near-Earth, high-Earth, and libration point orbits. To support this effort, the GNCC is assessing the relative navigation accuracy achievable for proposed formations using GPS, intersatellite crosslink, ground-to-satellite Doppler, and celestial object sensor measurements. This paper evaluates the performance of these relative navigation approaches for three proposed missions with two or more vehicles maintaining relatively tight formations. High-fidelity simulations were performed to quantify the absolute and relative navigation accuracy as a function of navigation algorithm and measurement type. Realistically-simulated measurements were processed using the extended Kalman filter implemented in the GPS Enhanced Inboard Navigation System (GEONS) flight software developed by GSFC GNCC. Solutions obtained by simultaneously estimating all satellites in the formation were compared with the results obtained using a simpler approach based on differencing independently estimated state vectors.

Long, Anne↗

Discrete-Time Demodulator Architectures for Free-Space Broadband Optical Pulse-Position Modulation

The objective of this work is to develop discrete-time demodulator architectures for broadband optical pulse-position modulation (PPM) that are capable of processing Nyquist or near-Nyquist data rates. These architectures are motivated by the numerous advantages of realizing communications demodulators in digital very large scale integrated (VLSI) circuits. The architectures are developed within a framework that encompasses a large body of work in optical communications, synchronization, and multirate discrete-time signal processing and are constrained by the limitations of the state of the art in digital hardware. This work attempts to create a bridge between theoretical communication algorithms and analysis for deep-space optical PPM and modern digital VLSI. The primary focus of this work is on the synthesis of discrete-time processing architectures for accomplishing the most fundamental functions required in PPM demodulators, post-detection filtering, synchronization, and decision processing. The architectures derived are capable of closely approximating the theoretical performance of the continuous-time algorithms from which they are derived. The work concludes with an outline of the development path that leads to hardware.

Gray, A. A.↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Analyzing the Radio Frequency Interference Environment at Cal/Val Site Locations for the Soil Moisture Active/Passive (SMAP) Mission

The Soil Moisture Active/Passive satellite was launched in 2015 to provide global and continuous maps of land surface soil moisture and freeze-thaw using L-Band microwave radiometry. Even though the 1400-1427 MHz frequency used by SMAP is a protected portion of the spectrum, Radio Frequency Interference (RFI) is still observed that can corrupt the radiometer’s measurements. Nine distinct algorithms are implemented as part of SMAP’s level 1 processing to detect and filter out RFI contributions. However, any remaining undetected RFI are major concern especially at the locations of cal/val sites used for evaluating soil moisture retrieval performance. This paper presents an analysis of the RFI environment at SMAP cal/val site locations and assesses the impact of RFI on soil moisture retrievals at those locations.

Misra, S.↗

Heterogeneous Multi-Domain Dataset Synthesis to Facilitate Privacy and Risk Assessments in Smart City IoT

The emergence of the Smart Cities paradigm and the rapid expansion and integration of Internet of Things (IoT) technologies within this context have created unprecedented opportunities for high-resolution behavioral analytics, urban optimization, and context-aware services. However, this same proliferation intensifies privacy risks, particularly those arising from cross-modal data linkage across heterogeneous sensing platforms. To address these challenges, this paper introduces a comprehensive, statistically grounded framework for generating synthetic, multimodal IoT datasets tailored to Smart City research. The framework produces behaviorally plausible synthetic data suitable for preliminary privacy risk assessment and as a benchmark for future re-identification studies, as well as for evaluating algorithms in mobility modeling, urban informatics, and privacy-enhancing technologies. As part of our approach, we formalize probabilistic methods for synthesizing three heterogeneous and operationally relevant data streams—cellular mobility traces, payment terminal transaction logs, and Smart Retail nutrition records—capturing the behaviors of a large number of synthetically generated urban residents over a 12-week period. The framework integrates spatially explicit merchant selection using K-Dimensional (KD)-tree nearest-neighbor algorithms, temporally correlated anchor-based mobility simulation reflective of daily urban rhythms, and dietary-constraint filtering to preserve ecological validity in consumption patterns. In total, the system generates approximately 116 million mobility pings, 5.4 million transactions, and 1.9 million itemized purchases, yielding a reproducible benchmark for evaluating multimodal analytics, privacy-preserving computation, and secure IoT data-sharing protocols. To show the validity of this dataset, the underlying distributions of these residents were successfully validated against reported distributions in published research. We present preliminary uniqueness and cross-modal linkage indicators; comprehensive re-identification benchmarking against specific attack algorithms is planned as future work. This framework can be easily adapted to various scenarios of interest in Smart Cities and other IoT applications. By aligning methodological rigor with the operational needs of Smart City ecosystems, this work fills critical gaps in synthetic data generation for privacy-sensitive domains, including intelligent transportation systems, urban health informatics, and next-generation digital commerce infrastructures.

IoT↗

Signal Processing for Determining Water Height in Steam Pipes with Dynamic Surface Conditions

An enhanced signal processing method based on the filtered Hilbert envelope of the auto-correlation function of the wave signal has been developed to monitor the height of condensed water through the steel wall of steam pipes with dynamic surface conditions. The developed signal processing algorithm can also be used to estimate the thickness of the pipe to determine the cut-off frequency for the low pass filter frequency of the Hilbert Envelope. Testing and analysis results by using the developed technique for dynamic surface conditions are presented. A multiple array of transducers setup and methodology are proposed for both the pulse-echo and pitch-catch signals to monitor the fluctuation of the water height due to disturbance, water flow, and other anomaly conditions.

health monitoring↗

A VHDL Core for Intrinsic Evolution of Discrete Time Filters with Signal Feedback

The design of an Evolvable Machine VHDL Core is presented, representing a discrete-time processing structure capable of supporting control system applications. This VHDL Core is implemented in an FPGA and is interfaced with an evolutionary algorithm implemented in firmware on a Digital Signal Processor (DSP) to create an evolvable system platform. The salient features of this architecture are presented. The capability to implement IIR filter structures is presented along with the results of the intrinsic evolution of a filter. The robustness of the evolved filter design is tested and its unique characteristics are described.

Gwaltney, David A.↗

Methodology and Results of the Near-Earth Object (NEO) Human Space Flight (HSF) Accessible Targets Study (NHATS)

Near-Earth Asteroids (NEAs) have been identified by the current administration as potential destinations for human explorers during the mid-2020s. While the close proximity of these objects' orbits to Earth's orbit creates a risk of highly damaging or catastrophic impacts, it also makes some of these objects particularly accessible to spacecraft departing Earth, and this presents unique opportunities for solar system science and humanity's first ventures beyond cislunar space. Planning such ambitious missions first requires the selection of potentially accessible targets from the growing population of nearly 7,800 NEAs. To accomplish this, NASA is conducting the Near-Earth Object (NEO) Human Space Flight (HSF) Accessible Targets Study (NHATS). Phase I of the NHATS was executed during September of 2010, and Phase II was completed by early March of 2011. The study is ongoing because previously undetected NEAs are being discovered constantly, which has motivated an effort to automate the analysis algorithms in order to provide continuous monitoring of NEA accessibility. The NHATS analysis process consists of a trajectory filter and a minimum maximum estimated size criterion. The trajectory filter employs the method of embedded trajectory grids to compute all possible ballistic round-trip mission trajectories to every NEA in the Jet Propulsion Laboratory (JPL) Small-Body Database (SBDB) and stores all solutions that satisfy the trajectory filter criteria. An NEA must offer at least one qualifying trajectory solution to pass the trajectory filter. The Phase II NHATS filter criteria were purposely chosen to be highly inclusive, requiring Earth departure date between January 1st, 2015 and December 31st, 2040, total round-trip flight time <= 450 days, stay time at the NEA >= 8 days, Earth departure C(sub 3) energy <= 60 km(exp 2)/s(exp 2), total mission delta-v <= 12 km/s (including an Earth departure maneuver from a 400 km altitude circular parking orbit), and a maximum atmospheric re-entry speed of 12 km/s. After determining which NEAs offer at least one trajectory solution meeting the criteria, the estimated size constraint is then imposed whereby those NEAs may only be considered NHATS- qualifying NEAs if their maximum estimated size is >= 30 m. This corresponds to an absolute magnitude H <= 26.5 with an assumed albedo p = 0:05. The following is a brief high-level summary of the Phase II study results. Of the 7,665 NEAs in the SBDB as of February 3rd, 2011, 765 NEAs passed the trajectory filter and yielded a total of 79,157,604 trajectory solutions. The trajectory solutions for each NEA are post-processed into Pork Chop Contour (PCC) plots which show total mission delta-v as a function of Earth departure date and total mission duration. Although the PCC plots necessarily compress a very multi-dimensional design space into a two-dimensional plot, they permit rapid assessment of the breadth and quality of an NEA's available Earth departure season and clearly indicate the regions of the trajectory design space which warrant further analysis and optimization. The PCC plot for the NEA with the greatest number of NHATS-qualifying trajectory solutions, 2000 SG-344, is shown. Of the 765 NEAs which passed the Phase II trajectory filter, a total of 590 NEAs also satisfied the further constraint of maximum estimated size >= 30 m. The distributions of osculating heliocentric orbital semi-major axis (a), eccentricity (e), and inclination (i), for those 590 NEAs are shown. Note that the semi-latus rectum used is equal to alpha (1-e(exp 2)). To further our understanding of round-trip trajectory accessibility dynamics, it is instructive to examine the distribution of the NHATS-Qualifying NEAs according to orbit classification. NEAs are grouped into four orbit families: Atiras (aphelion < 0.983 AU), Atens (aphelion > 0.983 AU, alpha < 1.0 AU), Apollos (perihelion < 1.017 AU, alpha > 1.0 AU), and Amors (1.017 < perihelion < 1.3 AU). Of the 765 NEAhich satisfied the NHATS trajectory criteria, none are Atiras, 193 are Atens (31% of known Atens), 456 are Apollos (11% of known Apollos), and 116 are Amors (4% of known Amors). While Apollos comprise 60% of the NEAs which pass the NHATS trajectory filter and Atens comprise only 25%, the percentages according to orbit family are perhaps more relevant. Note that only 11% of known Apollos passed the trajectory filter while 31% of known Atens passed. These simple statistics alone strongly suggest that Aten orbits possess features which tend to enhance their round-trip trajectory accessibility as compared to Apollos or Amors. This is significant because Atens' orbits cause them to spend considerable time in Earth's daytime sky, making them difficult to discover and track using ground-based observing assets. In this paper we will detail the NHATS analysis algorithms, present and analyze all NHATS results to date, and discuss aspects of HSF mission architecture design for future NEA missions.

Barbee, Brent↗

Compressed/reconstructed test images for CRAF/Cassini

A set of compressed, then reconstructed, test images submitted to the Comet Rendezvous Asteroid Flyby (CRAF)/Cassini project is presented as part of its evaluation of near lossless high compression algorithms for representing image data. A total of seven test image files were provided by the project. The seven test images were compressed, then reconstructed with high quality (root mean square error of approximately one or two gray levels on an 8 bit gray scale), using discrete cosine transforms or Hadamard transforms and efficient entropy coders. The resulting compression ratios varied from about 2:1 to about 10:1, depending on the activity or randomness in the source image. This was accomplished without any special effort to optimize the quantizer or to introduce special postprocessing to filter the reconstruction errors. A more complete set of measurements, showing the relative performance of the compression algorithms over a wide range of compression ratios and reconstruction errors, shows that additional compression is possible at a small sacrifice in fidelity.

Dolinar, S.↗

Large-scale real-time signal processing in physics experiments: the ALICE TPC FPGA pipeline

For LHC Run 3, the ALICE Time Projection Chamber was upgraded to operate in continuous readout mode. Interaction rates of up to 50 kHz in Pb-Pb collisions require real-time processing of more than 3 TB s -1 of raw detector data. This requirement is met by a custom FPGA-based processing pipeline that performs the complete front-end data treatment fully in-stream, including common-mode correction, pedestal subtraction, ion-tail filtering, zero suppression, and dense data packing. A central element of the design is a highly parallel common-mode correction algorithm operating directly on the streaming data. It robustly identifies signal-free readout channels on a time-bin basis and applies pad-dependent scaling to compensate for local variations in capacitive coupling in the GEM readout. In combination with pedestal subtraction and ion-tail filtering, this enables accurate baseline restoration under extreme high-occupancy conditions, preventing signal loss while efficiently suppressing noise prior to zero suppression. The pipeline operates continuously at the full detector bandwidth and reduces the raw input rate of approximately 3 TB s -1 to about 900 GBps for Pb-Pb collisions at the target interaction rate. Overall, it represents a large-scale FPGA-based real-time signal-processing implementation for high-energy physics detector readout.

Digital signal processing (DSP)↗

Application of Radon Transform to Multi-Angle Measurements Made by the Research Scanning Polarimeter: A New Approach to Cloud Tomography. Part I: Theory and Tests on Simulated Data.

The Research Scanning Polarimeter (RSP) is an airborne along-track scanner measuring the polarized and total reflectances in 9 spectral channels. The RSP was a prototype for the Aerosol Polarimetry Sensor (APS) launched on-board the NASA Glory satellite. Currently the retrieval algorithms developed for the RSP are being adopted for the measurements of the space-borne polarimeters on the upcoming NASA’s Plankton, Aerosol, Cloud Ocean Ecosystem (PACE)satellite mission. The RSP’s uniquely high angular resolution coupled with the high frequency of measurements allows for characterization of liquid water cloud droplet sizes using the polarized rainbow structure. It also provides geometric constraints on the cumulus cloud’s 2D cross section yielding the cloud’s geometric shape estimates. In this study we further build on the latter technique to develop a new tomographic approach to retrieval of cloud internal structure from remote sensing measurements. While tomography in the strict definition is a technique based on active measurements yielding a tomogram (directional optical thickness as a function of angle and offset of the view ray), we developed a “semi-tomographic” approach in which tomogram of the cloud is estimated from passive observations instead of being measured directly. This tomogram is then converted into 2D spatial distribution of the extinction coefficient using inverse Radon transform (filtered back projection) which is the standard tomographic procedure used e.g., in medical CT scans. This algorithm is computationally inexpensive compared to techniques relying on highly-multi-dimensional least-square fitting; it does not require iterative 3D RT simulations. The resulting extinction distribution is defined up to an unknown constant factor, so we discuss the ways to calibrate it using additional independent measurements. In the next step we use the profile of the droplet size distribution parameters from the cloud’s side (derived by fitting the polarized rainbows) to convert the 2D extinction distribution into that of the droplet number concentration. We illustrate and validate the proposed technique using 3D-RT-simulatedRSP observations of a LES-generated Cu cloud. Quantitative comparisons between the retrieved and the original optical and microphysical parameters are presented.

clouds↗

Filtering states with total spin on a quantum computer

Starting from a general wave-function described on a set of spins or qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of total spin S 2 and its z component S z . The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. Here, the different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. In the former case, when the projection on the total spin j is made, we show that the number of operations for the projection can be reduced from a quadratic to a linear dependence in j. After each measurement, the state collapses to one of the spin eigenstates that could be used for postprocessing. For this reason, we call the method total quantum spin filtering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A general algorithm for solving the algebraic Riccati equation

The generalized eigenvalue problem provides a suitable framework for reliable solutions of many system theoretic, control, and estimation problems. A general algorithm for solving the matrix algebraic Riccati equation (ARE) which utilizes a pencil structure is described here. This algorithm avoids unnecessary inversion of cost or transition matrices, making it a numerically sound way to solve for the gains and/or ARE with singular quadratic costs, for cases satisfying detectability and stabilizability conditions. Examples are solution with discrete dead-beat control, noiseless measurements in Kalman filters and time-delays in discrete-time systems, which cause difficulties in the Hamiltonian standard eigenvalue problem formulation. The ARE algorithm implementatiton and numerical examples are shown.

Walker, R. A.↗

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗

Development of the GeoNEX Level 2G Products: Exploiting the Diurnal Variability of TOA Reflectance in Atmospheric Correction

This study develops a new atmospheric correction algorithm to generate the Level 2G products, in particular the gap-filled Surface Reflectance at 10-minute time steps, for the Geostationary-NASA Earth Exchange (GeoNEX) project. The algorithm is based on the MODIS MAIAC (Multi-Angle Implementation of Atmospheric Correction) framework but with significant modifications to exploit angular/temporal information from the diurnal variability of the GeoNEX L1G TOA (Top-of-Atmosphere) reflectance. The algorithm starts by evaluating the roughness/smoothness of the diurnal time series of the TOA reflectance. Because rapid changes in TOA reflectance are generally caused by passing clouds or shadows, rough segments of the time series are automatically filtered out while the smooth segments are further tested for brightness and temperature to identify clear-sky and snow-free observations. Next the algorithm runs the MAIAC RTM (Radiative Transfer Model) to retrieve the Ross-Thick-Li-Sparse (RTLS) BRDF model parameters and the daily-mean atmospheric optical depth (AOD) that allow the RTM to optimally simulate the observed diurnal variability of clear-sky TOA reflectance. Once the initial RTLS parameters are retrieved after the algorithm’s burn-in period, they are used as the prior information to predict the AOD level for the next days, while the subsequent clear-sky observations are used to make necessary adjustments to the RTLS parameters in an continuous fashion. This “prediction-analysis” cycle is then iterated to process the full time series of the L1G data, skipping only total-cloudy days or when surface snow is detected. We tested the algorithm over a list of selected AERONET sites. The retrieved results (the daily mean AOD and the RTLS parameters) reasonably agree with the ground-based measurements. Importantly, the results indicate that the diurnal cycles of surface reflectance are continuous functions of the illumination-view geometry. Thus we can use the retrieved RTLS model to accurately fill in data gaps on partial cloudy days. Also, our algorithm is totally independent from the traditional approaches based on the use of spectral band ratios between the shortwave infrared (e.g., 2.2µm) and the visible (e.g., 0.47µm and 0.64µm) bands. Our results thus demonstrate that the high-frequent diurnal geostationary observations contain unique information that helps us improve atmospheric correction of remote sensing data.

GeoNEX↗