Leveraging power of deep learning for fast and efficient elite pixel selection in time series SAR interferometry
This study proposes a new convolutional long short-term memory (ConvLSTM) based architecture for selection of elite pixels (i.e., less noisy) in time series interferometric synthetic aperture radar (TS-InSAR). The model utilizes the spatial and temporal relation among neighboring pixels to identify both persistent and distributed scatterers. We trained the model on ~20,000 training images (interferograms), each of size 100 by 100 pixels, extracted from InSAR time series interferograms containing both artificial features (buildings and infrastructure) and objects of natural environment (vegetation, forests, barren or agricultural land, water bodies). Based on such categorization, we developed two models, tailormade to detect elite pixels in urban and coastal sites. Training labels were generated from elite pixel selection outputs generated from the wavelet-based InSAR (WabInSAR) software. We used 4 urban and 7 coastal sites for training and validation respectively, and the predicted elite pixel selection maps reveal that the proposed models efficiently learn from WabInSAR-generated labels, reaching a test accuracy of 94%. The models accurately discard pixels affected by geometric and temporal decorrelation while selecting pixels corresponding to urban objects and those with stable phase history unaffected by temporal and geometric decorrelation. The density of pixels in urban areas is comparable to and higher for coastal areas than WabInSAR outputs. With significantly reduced time computation (order of minutes) and improved density of elite pixels, the proposed models can efficiently process long InSAR time series stacks and generate deformation maps quickly, making the time series InSAR technique more suitable for varied (non-urban and urban) terrains and unaddressed land deformation applications.
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesSimilar Papers 제목 키워드 기반
Multi-Emitter MAP-Elites: Improving quality, diversity and convergence speed with heterogeneous sets of emitters
Quality-Diversity (QD) optimisation is a new family of learning algorithms that aims at generating collections of diverse and high-performing solutions. Among those algorithms, the recently introduced Covariance Matrix A…
DiversityMulti-Task Multi-Behavior MAP-Elites
We propose Multi-Task Multi-Behavior MAP-Elites, a variant of MAP-Elites that finds a large number of high-quality solutions for a large set of tasks (optimization problems from a given family). It combines the original …
DiversityGram-Elites: N-Gram Based Quality-Diversity Search
In the context of procedural content generation via machine learning (PCGML), quality-diversity (QD) algorithms are a powerful tool to generate diverse game content. A branch of QD uses genetic operators to generate cont…
DiversityControllable Exploration of a Design Space via Interactive Quality Diversity
This paper introduces a user-driven evolutionary algorithm based on Quality Diversity (QD) search. During a design session, the user iteratively selects among presented alternatives and their selections affect the upcomi…
DiversityELITE: Efficient Gaussian Head Avatar from a Monocular Video via Learned Initialization and TEst-time Generative Adaptation
We introduce ELITE, an Efficient Gaussian head avatar synthesis from a monocular video via Learned Initialization and TEst-time generative adaptation. Prior works rely either on a 3D data prior or a 2D generative prior t…