scholarly journals Automatic Kalman-filter-based wavelet shrinkage denoising of 1D stellar spectra

2019 ◽  
Vol 490 (4) ◽  
pp. 5249-5269
Author(s):  
Sankalp Gilda ◽  
Zachary Slepian

ABSTRACT We propose a non-parametric method to denoise 1D stellar spectra based on wavelet shrinkage followed by adaptive Kalman thresholding. Wavelet shrinkage denoising involves applying the discrete wavelet transform (DWT) to the input signal, ‘shrinking’ certain frequency components in the transform domain, and then applying inverse DWT to the reduced components. The performance of this procedure is influenced by the choice of base wavelet, the number of decomposition levels, and the thresholding function. Typically, these parameters are chosen by ‘trial and error’, which can be strongly dependent on the properties of the data being denoised. We here introduce an adaptive Kalman-filter-based thresholding method that eliminates the need for choosing the number of decomposition levels. We use the ‘Haar’ wavelet basis, which we found to provide excellent filtering for 1D stellar spectra, at a low computational cost. We introduce various levels of Poisson noise into synthetic PHOENIX spectra, and test the performance of several common denoising methods against our own. It proves superior in terms of noise suppression and peak shape preservation. We expect it may also be of use in automatically and accurately filtering low signal-to-noise galaxy and quasar spectra obtained from surveys such as SDSS, Gaia, LSST, PESSTO, VANDELS, LEGA-C, and DESI.

Author(s):  
Tu Huynh-Kha ◽  
Thuong Le-Tien ◽  
Synh Ha ◽  
Khoa Huynh-Van

This research work develops a new method to detect the forgery in image by combining the Wavelet transform and modified Zernike Moments (MZMs) in which the features are defined from more pixels than in traditional Zernike Moments. The tested image is firstly converted to grayscale and applied one level Discrete Wavelet Transform (DWT) to reduce the size of image by a half in both sides. The approximation sub-band (LL), which is used for processing, is then divided into overlapping blocks and modified Zernike moments are calculated in each block as feature vectors. More pixels are considered, more sufficient features are extracted. Lexicographical sorting and correlation coefficients computation on feature vectors are next steps to find the similar blocks. The purpose of applying DWT to reduce the dimension of the image before using Zernike moments with updated coefficients is to improve the computational time and increase exactness in detection. Copied or duplicated parts will be detected as traces of copy-move forgery manipulation based on a threshold of correlation coefficients and confirmed exactly from the constraint of Euclidean distance. Comparisons results between proposed method and related ones prove the feasibility and efficiency of the proposed algorithm.


2021 ◽  
Author(s):  
Marie Turčičová ◽  
Jan Mandel ◽  
Kryštof Eben

<p>A widely popular group of data assimilation methods in meteorological and geophysical sciences is formed by filters based on Monte-Carlo approximation of the traditional Kalman filter, e.g. <span>E</span><span>nsemble Kalman filter </span><span>(EnKF)</span><span>, </span><span>E</span><span>nsemble </span><span>s</span><span>quare-root filter and others. Due to the computational cost, ensemble </span><span>size </span><span>is </span><span>usually </span><span>small </span><span>compar</span><span>ed</span><span> to the dimension of the </span><span>s</span><span>tate </span><span>vector. </span><span>Traditional </span> <span>EnKF implicitly uses the sample covariance which is</span><span> a poor estimate of the </span><span>background covariance matrix - singular and </span><span>contaminated by </span><span>spurious correlations. </span></p><p><span>W</span><span>e focus on modelling the </span><span>background </span><span>covariance matrix by means of </span><span>a linear model for its inverse. This is </span><span>particularly </span><span>useful</span> <span>in</span><span> Gauss-Markov random fields (GMRF), </span><span>where</span> <span>the inverse covariance matrix has </span><span>a banded </span><span>structure</span><span>. </span><span>The parameters of the model are estimated by the</span><span> score matching </span><span>method which </span><span>provides</span><span> estimators in a closed form</span><span>, cheap to compute</span><span>. The resulting estimate</span><span> is a key component of the </span><span>proposed </span><span>ensemble filtering algorithms. </span><span>Under the assumption that the state vector is a GMRF in every time-step, t</span><span>he Score matching filter with Gaussian resamplin</span><span>g (SMF-GR) </span><span>gives</span><span> in every time-step a consistent (in the large ensemble limit) estimator of mean and covariance matrix </span><span>of the forecast and analysis distribution</span><span>. Further, we propose a filtering method called Score matching ensemble filter (SMEF), based on regularization of the EnK</span><span>F</span><span>. Th</span><span>is</span><span> filter performs well even for non-Gaussian systems with non-linear dynamic</span><span>s</span><span>. </span><span>The performance of both filters is illustrated on a simple linear convection model and Lorenz-96.</span></p>


2020 ◽  
Author(s):  
Jüri Majak ◽  
Mart Ratas ◽  
Kristo Karjust ◽  
Boris Shvartsman

The study is focused on the development, adaption and evaluation of the higher order Haar wavelet method (HOHWM) for solving differential equations. Accuracy and computational complexity are two measurable key characteristics of any numerical method. The HOHWM introduced recently by authors as an improvement of the widely used Haar wavelet method (HWM) has shown excellent accuracy and convergence results in the case of all model problems studied. The practical value of the proposed HOHWM approach is that it allows reduction of the computational cost by several magnitudes as compared to HWM, depending on the mesh and the method parameter values used.


Author(s):  
Sajjan Singh

Orthogonal frequency division multiplexing (OFDM) is an efficient method of data transmission for high speed communication systems over multipath fading channels. However, the peak-to-average power ratio (PAPR) is a major drawback of multicarrier transmission systems such as OFDM is the high sensitivity of frequency offset. The bit error rate analysis (BER) of discrete wavelet transform (DWT)-OFDM system is compared with conventional fast Fourier transform (FFT)-OFDMA system in order to ensure that wavelet transform based OFDMA transmission gives better improvement to combat ICI than FFT-based OFDMA transmission and hence improvement in BER. Wavelet transform is applied together with OFDM technology in order to improve performance enhancement. In the proposed system, a Kalman filter has been used in order to improve BER by minimizing the effect of ICI and noise. The obtained results from the proposed system simulation showed acceptable BER performance at standard SNR.


Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 1961
Author(s):  
Wei Wu ◽  
Yunfei Wang ◽  
Xiaofei Zhang ◽  
Jianfeng Li

In this paper, we derive the discrete Fourier transform (DFT) method for direction of arrival (DOA) estimation by generating the massive virtual difference co-array with the nested array. By contrast with the spatial smoothing (SS) subspace-based methods for nested array, which halve the array aperture, the proposed method can take full advantage of the total array aperture. Since the conventional DFT method is a non-parametric method and is limited by Rayleigh threshold, we perform the phase rotation operation to obtain the fine DOA estimates. Owing to the full utilization of the array aperture and phase rotation operation, the proposed method can achieve better performance than SS subspace-based methods for far-field sources especially with massive virtual difference co-arrays which possess a large number of virtual sensors. Besides, as the fast Fourier transform (FFT) is attractive in practical implementation, the proposed method lowers the computational cost, as compared with the subspace-based methods. Numerical simulation results validate the superiority of the proposed method in both estimation performance and complexity.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Gopal Priyadarshi ◽  
B.V. Rathish Kumar

Purpose In the past few years, Haar wavelet-based numerical methods have been applied successfully to solve linear and nonlinear partial differential equations. This study aims to propose a wavelet collocation method based on Haar wavelets to identify a parameter in parabolic partial differential equations (PDEs). As Haar wavelet is defined in a very simple way, implementation of the Haar wavelet method becomes easier than the other numerical methods such as finite element method and spectral method. The computational time taken by this method is very less because Haar matrices and Haar integral matrices are stored once and used for each iteration. In the case of Haar wavelet method, Dirichlet boundary conditions are incorporated automatically. Apart from this property, Haar wavelets are compactly supported orthonormal functions. These properties lead to a huge reduction in the computational cost of the method. Design/methodology/approach The aim of this paper is to reconstruct the source control parameter arises in quasilinear parabolic partial differential equation using Haar wavelet-based numerical method. Haar wavelets possess various properties, for example, compact support, orthonormality and closed form expression. The main difficulty with the Haar wavelet is its discontinuity. Therefore, this paper cannot directly use the Haar wavelet to solve partial differential equations. To handle this difficulty, this paper represents the highest-order derivative in terms of Haar wavelet series and using successive integration this study obtains the required term appearing in the problem. Taylor series expansion is used to obtain the second-order partial derivatives at collocation points. Findings An efficient and accurate numerical method based on Haar wavelet has been proposed for parameter identification in quasilinear parabolic partial differential equations. Numerical results are obtained from the proposed method and compared with the existing results obtained from various finite difference methods including Saulyev method. It is shown that the proposed method is superior than the conventional finite difference methods including Saulyev method in terms of accuracy and CPU time. Convergence analysis is presented to show the accuracy of the proposed method. An efficient algorithm is proposed to find the wavelet coefficients at target time. Originality/value The outcome of the paper would have a valuable role in the scientific community for several reasons. In the current scenario, the parabolic inverse problem has emerged as very important problem because of its application in many diverse fields such as tomography, chemical diffusion, thermoelectricity and control theory. In this paper, higher-order derivative is represented in terms of Haar wavelet series. In other words, we represent the solution in multiscale framework. This would enable us to understand the solution at various resolution levels. In the case of Haar wavelet, this paper can achieve a very good accuracy at very less resolution levels, which ultimately leads to huge reduction in the computational cost.


2019 ◽  
Vol 142 (2) ◽  
Author(s):  
Brian J. Burrows ◽  
Douglas Allaire

Abstract Filtering is a subset of a more general probabilistic estimation scheme for estimating the unobserved parameters from the observed measurements. For nonlinear, high speed applications, the extended Kalman filter (EKF) and the unscented Kalman filter (UKF) are common estimators; however, expensive and strongly nonlinear forward models remain a challenge. In this paper, a novel Kalman filtering algorithm for nonlinear systems is developed, where the numerical approximation is achieved via a change of measure. The accuracy is identical in the linear case and superior in two nonlinear test problems: a challenging 1D benchmarking problem and a 4D structural health monitoring problem. This increase in accuracy is achieved without the need for tuning parameters, rather relying on a more complete approximation of the underlying distributions than the Unscented Transform. In addition, when expensive forward models are used, we achieve a significant reduction in computational cost without resorting to model approximation.


2014 ◽  
Vol 875-877 ◽  
pp. 1982-1988
Author(s):  
Wen Liang Du ◽  
Xiao Lin Tian ◽  
Yan Kui Sun

Speckle noise is a common phenomenon in Optical Coherence Tomography (OCT) images. This paper describes a dynamic filtering approach for anterior chamber OCT images to reduce the speckle noise in wavelet domain. The approach proposed segments the OCT image into some parts and identifies if the parts have region of interest (ROI), which includes the anterior chamber tissues. Then, it suppresses noise with three different suppression strategies in part with ROI. For the part without ROI, it sets the discrete wavelet transform coefficients of this part to zero. Here, the sampling-based sub-band adaptive algorithm is used to distinguish the ROI; and the correlations of neighboring wavelet coefficients and the coefficients of the corresponding locations in adjacent decomposition levels are used to suppress the noise. The performance improvement over the previously published method is quantified in terms of noise suppression, image structural preservation and visual quality. The numerical values of the image quality metrics along with the qualitative analysis results indicated that the approach proposed has better performance.


2010 ◽  
Vol 27 (4) ◽  
pp. 753-765 ◽  
Author(s):  
Liying Wan ◽  
Laurent Bertino ◽  
Jiang Zhu

Abstract The ensemble Kalman filter (EnKF) has proven its efficiency in strongly nonlinear dynamical systems but is demanding in its computing power requirements, which are typically about the same as those of the four-dimensional variational data assimilation (4DVAR) systems presently used in several weather forecasting centers. A simplified version of EnKF, the so-called ensemble optimal interpolation (EnOI), requires only a small fraction of the computing cost of the EnKF, but makes the crude assumption of no dynamical evolution of the errors. How do both these two methods compare in realistic settings of a Pacific Ocean forecasting system where the computational cost is a primary concern? In this paper the two methods are used to assimilate real altimetry data via a Hybrid Coordinate Ocean Model of the Pacific. The results are validated against the independent Argo temperature and salinity profiles and show that the EnKF has the advantage in terms of both temperature and salinity and in all parts of the domain, although not with a very striking difference.


2009 ◽  
Author(s):  
Nari Tanabe ◽  
Toshihiro Furukawa ◽  
Shigeo Tsujii

Sign in / Sign up

Export Citation Format

Share Document