{"title":"A fast Kalman filter for time-lapse electrical resistivity tomography","authors":"A. Saibaba, E. Miller, P. Kitanidis","doi":"10.1109/IGARSS.2014.6947146","DOIUrl":null,"url":null,"abstract":"We present a reduced complexity algorithm for time-lapse Electrical Resistivity Tomography (ERT) based on an extended Kalman filter. The key idea of the fast algorithm is an efficient representation of state covariance matrix at each step as a weighted combination of the system noise covariance matrix and a low-rank perturbation term. We propose an efficient algorithm for updating the weights and the basis of the low-rank perturbation. The overall computational cost at each iteration is O(Nnm) and storage cost O(N), where N is the number of grid points, and nm is the number of measurements. The performance of this algorithm is demonstrated on a challenging application of monitoring the CO2 plume using synthetic ERT data.","PeriodicalId":385645,"journal":{"name":"2014 IEEE Geoscience and Remote Sensing Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Geoscience and Remote Sensing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IGARSS.2014.6947146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We present a reduced complexity algorithm for time-lapse Electrical Resistivity Tomography (ERT) based on an extended Kalman filter. The key idea of the fast algorithm is an efficient representation of state covariance matrix at each step as a weighted combination of the system noise covariance matrix and a low-rank perturbation term. We propose an efficient algorithm for updating the weights and the basis of the low-rank perturbation. The overall computational cost at each iteration is O(Nnm) and storage cost O(N), where N is the number of grid points, and nm is the number of measurements. The performance of this algorithm is demonstrated on a challenging application of monitoring the CO2 plume using synthetic ERT data.