scholarly journals Compressive Sensing Approach to Harmonics Detection in the Ship Electrical Network

Sensors ◽  
2020 ◽  
Vol 20 (9) ◽  
pp. 2744
Author(s):  
Beata Palczynska ◽  
Romuald Masnicki ◽  
Janusz Mindykowski
Keyword(s):  
Fourier Transform ◽  
Data Processing ◽  
Compressive Sensing ◽  
Rank Order ◽  
Reconstruction Algorithm ◽  
Electrical Network ◽  
Large Set ◽  
Processing Load ◽  
Linear Measurements ◽  
Programming Environments

The contribution of this paper is to show the opportunities for using the compressive sensing (CS) technique for detecting harmonics in a frequency sparse signal. The signal in a ship’s electrical network, polluted by harmonic distortions, can be modeled as a superposition of a small number of sinusoids and the discrete Fourier transform (DFT) basis forms its sparse domain. According to the theory of CS, a signal may be reconstructed from under-sampled incoherent linear measurements. This paper highlights the use of the discrete Radon transform (DRT) techniques in the CS scheme. In the reconstruction algorithm section, a fast algorithm based on the inverse DRT is presented, in which a few randomly sampled projections of the input signal are used to correctly reconstruct the original signal. However, DRT requires a very large set of measurements that can defeat the purpose of compressive data acquisition. To acquire the wideband data below the Nyquist frequency, the K-rank-order filter is applied in the sparse transform domain to extract the most significant components and accelerate the convergence of the solution. While most CS research efforts focus on random Gaussian measurements, the Bernoulli matrix with different values of the probability of ones is applied in the presented algorithm. Preliminary results of numerical simulation confirm the effectiveness of the algorithm used, but also indicate its limitations. A significant advantage of the proposed approach is the speed of analysis, which uses fast Fourier transform (FFT) and inverse FFT (IFFT) algorithms widely available in programming environments. Moreover, the data processing algorithm is quite simple, and therefore memory usage and burden of the data processing load are relatively low.

scholarly journals Compressive Sensing in Signal Processing: Algorithms and Transform Domain Formulations

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Irena Orović ◽  
Vladan Papić ◽  
Cornel Ioana ◽  
Xiumei Li ◽  
Srdjan Stanković
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Compressive Sensing ◽  
Signal Reconstruction ◽  
Signal Acquisition ◽  
Transform Domain ◽  
Hermite Transform ◽  
Time Frequency ◽  
Reconstruction Methods ◽  
Fourier Transform Domain

Compressive sensing has emerged as an area that opens new perspectives in signal acquisition and processing. It appears as an alternative to the traditional sampling theory, endeavoring to reduce the required number of samples for successful signal reconstruction. In practice, compressive sensing aims to provide saving in sensing resources, transmission, and storage capacities and to facilitate signal processing in the circumstances when certain data are unavailable. To that end, compressive sensing relies on the mathematical algorithms solving the problem of data reconstruction from a greatly reduced number of measurements by exploring the properties of sparsity and incoherence. Therefore, this concept includes the optimization procedures aiming to provide the sparsest solution in a suitable representation domain. This work, therefore, offers a survey of the compressive sensing idea and prerequisites, together with the commonly used reconstruction methods. Moreover, the compressive sensing problem formulation is considered in signal processing applications assuming some of the commonly used transformation domains, namely, the Fourier transform domain, the polynomial Fourier transform domain, Hermite transform domain, and combined time-frequency domain.

scholarly journals Computerized Tomography Image Features under the Reconstruction Algorithm in the Evaluation of the Effect of Ropivacaine Combined with Dexamethasone and Dexmedetomidine on Assisted Thoracoscopic Lobectomy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yan Cui ◽  
Yang Sun ◽  
Meng Xia ◽  
Dan Yao ◽  
Jun Lei
Keyword(s):  
Fourier Transform ◽  
Iterative Reconstruction ◽  
Analytical Method ◽  
Reconstruction Algorithm ◽  
Ct Images ◽  
Image Features ◽  
Anesthesia Induction ◽  
Iterative Reconstruction Algorithm ◽  
Thoracoscopic Lobectomy ◽  
The Fourier Transform

This research was aimed to study CT image features based on the backprojection filtering reconstruction algorithm and evaluate the effect of ropivacaine combined with dexamethasone and dexmedetomidine on assisted thoracoscopic lobectomy to provide reference for clinical diagnosis. A total of 110 patients undergoing laparoscopic resection were selected as the study subjects. Anesthesia induction and nerve block were performed with ropivacaine combined with dexamethasone and dexmedetomidine before surgery, and chest CT scan was performed. The backprojection image reconstruction algorithm was constructed and applied to patient CT images for reconstruction processing. The results showed that when the overlapping step size was 16 and the block size was 32 × 32, the running time of the algorithm was the shortest. The resolution and sharpness of reconstructed images were better than the Fourier transform analytical method and iterative reconstruction algorithm. The detection rates of lung nodules smaller than 6 mm and 6–30 mm (92.35% and 95.44%) were significantly higher than those of the Fourier transform analytical method and iterative reconstruction algorithm (90.98% and 87.53%; 88.32% and 90.87%) ( P < 0.05 ). After anesthesia induction and lobectomy with ropivacaine combined with dexamethasone and dexmedetomidine, the visual analogue scale (VAS) decreased with postoperative time. The VAS score decreased to a lower level (1.76 ± 0.54) after five days. In summary, ropivacaine combined with dexamethasone and dexmedetomidine had better sedation and analgesia effects in patients with thoracoscopic lobectomy. CT images based on backprojection reconstruction algorithm had a high recognition accuracy for lung lesions.

Theoretical Consideration on the Application of Continuous Wavelet Transform to Time-Series Processing for Magnetotelluric Data

2020 ◽  
Author(s):  
Hiroki Ogawa ◽  
Yuki Hama ◽  
Koichi Asamori ◽  
Takumi Ueda
Keyword(s):  
Time Series ◽  
Fourier Transform ◽  
Data Processing ◽  
Time Series Data ◽  
Series Data ◽  
Short Time Fourier Transform ◽  
Numerical Errors ◽  
Spectral Transform ◽  
Frequency Components ◽  
Short Time

Abstract In the magnetotelluric (MT) method, the responses of the natural electromagnetic fields are evaluated by transforming time-series data into spectral data and calculating the apparent resistivity and phase. The continuous wavelet transform (CWT) can be an alternative to the short-time Fourier transform, and the applicability of CWT to MT data has been reported. There are, however, few cases of considering the effect of numerical errors derived from spectral transform on MT data processing. In general, it is desirable to adopt a window function narrow in the time domain for higher-frequency components and one in the frequency domain for lower-frequency components. In conducting the short-time Fourier transform, because the size of the window function is fixed unless the time-series data are decimated, there might be difference between the calculated MT responses and the true ones due to the numerical errors. Meanwhile, CWT can strike a balance between the resolution of the time and frequency domains by magnifying or reducing the wavelet, according to the value of frequency. Although the types of wavelet functions and their parameters influence the resolution of time and frequency, those calculation settings of CWT are often determined empirically. In this study, focusing on the frequency band between 0.001 Hz and 10 Hz, we demonstrated the superiority of utilizing CWT in MT data processing and determined its proper calculation settings in terms of restraining the numerical errors caused by the spectral transform of time-series data. The results obtained with the short-time Fourier transform accompanied with gradual decimation of the time-series data, called cascade decimation, were compared with those of CWT. The shape of the wavelet was changed by using different types of wavelet functions or their parameters, and the respective results of data processing were compared. Through these experiments, this study indicates that CWT with the complex Morlet function with its wavelet parameter k set to 6 ≤ k < 10 will be effective in restraining the numerical errors caused by the spectral transform.

A novel topology identification method based on compressive sensing for multidimensional networks

2020 ◽  
Vol 34 (30) ◽  
pp. 2050294
Author(s):  
Shuheng Fang ◽  
Zhengmin Kong ◽  
Ping Hu ◽  
Li Ding
Keyword(s):  
Compressive Sensing ◽  
Matching Pursuit ◽  
Network Models ◽  
Reconstruction Algorithm ◽  
Identification Problem ◽  
Topology Identification ◽  
Network Recovery ◽  
Threshold Mechanism ◽  
Different Types ◽  
2D Network

In real-world scenarios, it is difficult to know about the complete topology of a huge network with different types of links. In this brief, we propose a method to identify the topology of multidimensional networks from information transmission data. We consider information propagating over edges of a two-dimensional (2D) network, where one type of links is known and the other type is unknown. Given the state of all nodes at each unit time, we can transform the topology identification problem into a compressive sensing framework. A modified reconstruction algorithm, called Sparsity Adaptive Matching Pursuit with Mixed Threshold Mechanism (SAMPMTM), is proposed to tackle the problem. Compared with the classical Sparsity Adaptive Matching Pursuit (SAMP) algorithm, the proposed SAMPMTM algorithm can reduce the conflict rate and improve the accuracy of network recovery. We further demonstrate the performance of this improved algorithm through Monte-Carlo simulations under different network models.

scholarly journals Fourier transform and correlation analysis for CSEM data processing

2019 ◽  
Vol 1237 ◽  
pp. 022105
Author(s):  
Guang Li ◽  
Congcong Xu ◽  
Jin Li ◽  
Liangyin Mu ◽  
Huangzhou Lin ◽  
...  
Keyword(s):  
Fourier Transform ◽  
Correlation Analysis ◽  
Data Processing

Gravity anomaly reconstruction based on nonequispaced Fourier transform

Geophysics ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. G83-G92
Author(s):  
Ya Xu ◽  
Fangzhou Nan ◽  
Weiping Cao ◽  
Song Huang ◽  
Tianyao Hao
Keyword(s):  
Fourier Transform ◽  
Compressed Sensing ◽  
Gravity Data ◽  
Signal Reconstruction ◽  
Gaussian Function ◽  
Reconstruction Algorithm ◽  
Data Reconstruction ◽  
Reconstruction Method ◽  
Grid Data ◽  
2D Data

Irregular sampled gravity data are often interpolated into regular grid data for convenience of data processing and interpretation. The compressed sensing theory provides a signal reconstruction method that can recover a sparse signal from far fewer samples. We have introduced a gravity data reconstruction method based on the nonequispaced Fourier transform (NFT) in the framework of compressed sensing theory. We have developed a sparsity analysis and a reconstruction algorithm with an iterative cooling thresholding method and applied to the gravity data of the Bishop model. For 2D data reconstruction, we use two methods to build the weighting factors: the Gaussian function and the Voronoi method. Both have good reconstruction results from the 2D data tests. The 2D reconstruction tests from different sampling rates and comparison with the minimum curvature and the kriging methods indicate that the reconstruction method based on the NFT has a good reconstruction result even with few sampling data.

Sign in / Sign up

Export Citation Format

Share Document