Search

This paper approaches the problem of signal denoising in time-variable noise conditions. Non-stationary noise results in variable degradation of the signal's useful information content over time. In order to maximize the correct recovery of the useful part of the signal, this paper proposes a denoising method that uses a criterion based on amplitude segmentation and local Rényi entropy estimation which are limited over short time blocks of the signal spectrogram. Local estimation of the signal features reduces the denoising problem to the stationary noise case. Results, presented for synthetic and real data, show consistently better performance gained by the proposed adaptive method compared to denoising driven by global criteria. [ABSTRACT FROM AUTHOR]

Gravitational-wave data (discovered first in 2015 by the Advanced LIGO interferometers and awarded by the Nobel Prize in 2017) are characterized by non-Gaussian and non-stationary noise. The ever-increasing amount of acquired data requires the development of efficient denoising algorithms that will enable the detection of gravitational-wave events embedded in low signal-to-noise-ratio (SNR) environments. In this paper, an algorithm based on the local polynomial approximation (LPA) combined with the relative intersection of confidence intervals (RICI) rule for the filter support selection is proposed to denoise the gravitational-wave burst signals from core collapse supernovae. The LPA-RICI denoising method's performance is tested on three different burst signals, numerically generated and injected into the real-life noise data collected by the Advanced LIGO detector. The analysis of the experimental results obtained by several case studies (conducted at different signal source distances corresponding to the different SNR values) indicates that the LPA-RICI method efficiently removes the noise and simultaneously preserves the morphology of the gravitational-wave burst signals. The technique offers reliable denoising performance even at the very low SNR values. Moreover, the analysis shows that the LPA-RICI method outperforms the approach combining LPA and the original intersection of confidence intervals (ICI) rule, total-variation (TV) based method, the method based on the neighboring thresholding in the short-time Fourier transform (STFT) domain, and three wavelet-based denoising techniques by increasing the improvement in the SNR by up to 118.94% and the peak SNR by up to 138.52%, as well as by reducing the root mean squared error by up to 64.59%, the mean absolute error by up to 55.60%, and the maximum absolute error by up to 84.79%. [ABSTRACT FROM AUTHOR]

Soccer player performance is influenced by multiple unpredictable factors. During a game, score changes and pre-game expectations affect the effort exerted by players. This study used GPS wearable sensors to track players' energy expenditure in 5-min intervals, alongside recording the goal timings and the win and lose probabilities from betting sites. A mathematical model was developed that considers pre-game expectations (e.g., favorite, non-favorite), endurance, and goal difference (GD) dynamics on player effort. Particle Swarm and Nelder–Mead optimization methods were used to construct these models, both consistently converging to similar cost function values. The model outperformed baselines relying solely on mean and median power per GD. This improvement is underscored by the mean absolute error (MAE) of 396.87 ± 61.42 and root mean squared error (RMSE) of 520.69 ± 88.66 achieved by our model, as opposed to the B 1 MAE of 429.04 ± 84.87 and RMSE of 581.34 ± 185.84 , and B 2 MAE of 421.57 ± 95.96 and RMSE of 613.47 ± 300.11 observed across all players in the dataset. This research offers an enhancement to the current approaches for assessing players' responses to contextual factors, particularly GD. By utilizing wearable data and contextual factors, the proposed methods have the potential to improve decision-making and deepen the understanding of individual player characteristics. [ABSTRACT FROM AUTHOR]

This paper explores three groups of time–frequency distributions: the Cohen's, affine, and reassigned classes of time–frequency representations (TFRs). This study provides detailed insight into the theory behind the selected TFRs belonging to these classes. Extensive numerical simulations were performed with examples that illustrate the behavior of the analyzed TFR classes in the joint time–frequency domain. The methods were applied both on synthetic and real-life non-stationary signals. The obtained results were assessed with respect to time–frequency concentration (measured by the Rényi entropy), instantaneous frequency (IF) estimation accuracy, cross-term presence in the TFRs, and the computational cost of the TFRs. This study gives valuable insight into the advantages and limitations of the analyzed TFRs and assists in selecting the proper distribution when analyzing given non-stationary signals in the time–frequency domain. [ABSTRACT FROM AUTHOR]

Scene classification relying on images is essential in many systems and applications related to remote sensing. The scientific interest in scene classification from remotely collected images is increasing, and many datasets and algorithms are being developed. The introduction of convolutional neural networks (CNN) and other deep learning techniques contributed to vast improvements in the accuracy of image scene classification in such systems. To classify the scene from areal images, we used a two-stream deep architecture. We performed the first part of the classification, the feature extraction, using pre-trained CNN that extracts deep features of aerial images from different network layers: the average pooling layer or some of the previous convolutional layers. Next, we applied feature concatenation on extracted features from various neural networks, after dimensionality reduction was performed on enormous feature vectors. We experimented extensively with different CNN architectures, to get optimal results. Finally, we used the Support Vector Machine (SVM) for the classification of the concatenated features. The competitiveness of the examined technique was evaluated on two real-world datasets: UC Merced and WHU-RS. The obtained classification accuracies demonstrate that the considered method has competitive results compared to other cutting-edge techniques. [ABSTRACT FROM AUTHOR]