Matching Pursuit Algorithm Research Articles

Wireless Remote-Monitoring Technology for Wind-Induced Galloping and Vibration of Transmission Lines

In order to achieve wireless remote monitoring of wind-induced vibrations in power-transmission lines based on MEMS sensors, it is necessary to devise a method for reconstructing the wind swing curve, enabling the device’s real-time performance to promptly acquire, restore, and analyze data. Based on existing single-axis vibration-sensitive components, a measurement array using self-powered MEMS sensors and spacers has been designed. The Orthogonal Matching Pursuit (OMP) algorithm is selected to obtain displacement data collected by sensors installed on the transmission-line spacers. Leveraging the inherent sparsity of the data, a Gaussian white noise regularization matrix is chosen to establish the observation matrix. Through the algorithm, wind data curve reconstruction is achieved, enabling the reconstruction of large-span wind-induced vibration information without distortion. The experimental results demonstrate that when applying the orthogonal tracking algorithm in transmission-line curve reconstruction, sparsity is selected based on the sampling length, that is, the number of sensors installed on the spacers is determined by the span length; a portion of the observation values are selected to generate the observation matrix; and the wind galloping data curve of the transmission line is well restored.

Data Compression Using Optimized Compressive Sensing in Cognitive Radio Network

ABSTRACTIn cognitive radio networks, cooperative spectrum sensing can greatly improve detection performance and reduce test time because cognitive users work cooperatively to detect spectrum signals. However, it is important to reduce the number of measurements taken from the original signal. To overcome these challenges, this study proposes optimized compressive sensing (CS) to reduce processing time and speed up spectrum sensing. To optimize the performance of CS, the penguin optimization algorithm (POA) is used in this approach. The optimal CS matrix is selected using this algorithm. In this algorithm, mean square error (MSE) is considered an objective function. It selects the CS matrix with the minimum error as the optimal matrix. Step size optimized sparsity adaptive matching pursuit algorithm (SSOSAMP) is used to reconstruct the compressed signal using the optimized sensitivity matrix. MATLAB is used to implement this proposed approach. Simulation results show that the proposed system achieves an SNR of 27.43%, a reconstruction probability of 94.28%, and an MSE of 4.27%.

An Improved Variable Step SAMP Method Based on Correlation Principle

The fixed step size in the sparse adaptive matching pursuit algorithm can result in limited accuracy and overestimation. To address this, this paper proposes a variable-step sparse adaptive matching pursuit algorithm based on the Spearman correlation coefficient. By measuring the Spearman correlation coefficient between the candidate set and the input signal, and introducing an adaptive step size adjustment method based on the parameter values of the correlation coefficient, the performance of the SAMP algorithm is optimized and its adaptability is enhanced. Extensive experiments demonstrate that the proposed method achieves good reconstruction results for one-dimensional sparse signals and two-dimensional images.

Multi-Frequency Microwave Sensing System with Frequency Selection Method for Pulverized Coal Concentration.

The accurate measurement of pulverized coal concentration (PCC) is crucial for optimizing the production efficiency and safety of coal-fired power plants. Traditional microwave attenuation methods typically rely on a single frequency for analysis while neglecting valuable information in the frequency domain, making them susceptible to the varying sensitivity of the signal at different frequencies. To address this issue, we proposed an innovative frequency selection method based on principal component analysis (PCA) and orthogonal matching pursuit (OMP) algorithms and implemented a multi-frequency microwave sensing system for PCC measurement. This method transcended the constraints of single-frequency analysis by employing a developed hardware system to control multiple working frequencies and signal paths. It measured insertion loss data across the sensor cross-section at various frequencies and utilized PCA to reduce the dimensionality of high-dimensional full-path insertion loss data. Subsequently, the OMP algorithm was applied to select the optimal frequency signal combination based on the contribution rates of the eigenvectors, enhancing the measurement accuracy through multi-dimensional fusion. The experimental results demonstrated that the multi-frequency microwave sensing system effectively extracted features from the high-dimensional PCC samples and selected the optimal frequency combination. Filed experiments conducted on five coal mills showed that, within a common PCC range of 0-0.5 kg/kg, the system achieved a minimum mean absolute error (MAE) of 1.41% and a correlation coefficient of 0.85. These results indicate that the system could quantitatively predict PCC and promptly detect PCC fluctuations, highlighting its immediacy and reliability.

Group Forward–Backward Orthogonal Matching Pursuit for General Convex Smooth Functions

This paper introduces the Group Forward–Backward Orthogonal Matching Pursuit (Group-FoBa-OMP) algorithm, a novel approach for sparse feature selection. The core innovations of this algorithm include (1) an integrated backward elimination process to correct earlier misidentified groups; (2) a versatile convex smooth model that generalizes previous research; (3) the strategic use of gradient information to expedite the group selection phase; and (4) a theoretical validation of its performance in terms of support set recovery, variable estimation accuracy, and objective function optimization. These advancements are supported by experimental evidence from both synthetic and real-world data, demonstrating the algorithm’s effectiveness.

Self-Supervised Medical Image Denoising Based on WISTA-Net for Human Healthcare in Metaverse.

Medical image processing plays an important role in the interaction of real world and metaverse for healthcare. Self-supervised denoising based on sparse coding methods, without any prerequisite on large-scale training samples, has been attracting extensive attention for medical image processing. Whereas, existing self-supervised methods suffer from poor performance and low efficiency. In this paper, to achieve state-of-the-art denoising performance on the one hand, we present a self-supervised sparse coding method, named the weighted iterative shrinkage thresholding algorithm (WISTA). It does not rely on noisy-clean ground-truth image pairs to learn from only a single noisy image. On the other hand, to further improve denoising efficiency, we unfold the WISTA to construct a deep neural network (DNN) structured WISTA, named WISTA-Net. Specifically, in WISTA, motivated by the merit of the lp-norm, WISTA-Net has better denoising performance than the classical orthogonal matching pursuit (OMP) algorithm and the ISTA. Moreover, leveraging the high-efficiency of DNN structure in parameter updating, WISTA-Net outperforms the compared methods in denoising efficiency. In detail, for a 256 by 256 noisy image, the running time of WISTA-Net is 4.72 s on the CPU, which is much faster than WISTA, OMP, and ISTA by 32.88 s, 13.06 s, and 6.17 s, respectively.

A D* orthogonal matching pursuit algorithm for time-varying channel estimation.

Orthogonal matching pursuit (OMP) combined with the A* search algorithm (A*OMP) exhibits robust reconstruction capabilities for synthesizing sparse data and signals, achieving relatively low reconstruction errors and a higher exact recovery ability than conventional OMP. However, A*OMP is only suitable for static channel estimation and cannot be applied to dynamic scenarios. This is because the channel delays for several consecutive orthogonal frequency-division multiplexing blocks per frame are similar and the path gains exhibit temporal correlation. This paper introduces a dynamic OMP approach (D*OMP) that employs a heuristic function of A*OMP and a unique reverse process, enabling sparse solutions to be identified in unknown and changing environments. The proposed method is highly practical for joint channel estimation across multiple blocks. Simulation and sea trial results indicate that D*OMP not only possesses superior channel recovery accuracy, but also has a more efficient channel reconstruction process, outperforming both A*OMP and conventional OMP.

New scheme of cooperative compressed spectrum sensing

Abstract This study addresses key challenges in sparse signal recovery and compressed spectrum sensing (CSS), focusing on low signal-to-noise ratios (SNR), and the computational complexity of cooperative systems. Motivated by the need for faster and more accurate recovery techniques, we first investigate and generalize the Reduced-Set Matching Pursuit (RMP) algorithm, which overcomes the speed and accuracy limitations of conventional greedy algorithms. Secondly, we propose a novel spatial averaging technique that enhances detection performance by exploiting data from multiple users to counteract low SNR. Lastly, we integrate cooperation into CSS, further improving the detection capabilities during the recovery process. Compared to existing techniques like Joint Sparse Recovery (JSR) and CoSaMP, which face computational and accuracy constraints in real-time applications, the RMP algorithm, combined with the Virtual method (data transformation) and AND fusion rule, delivers superior performance than JSR methods. Moreover, spatial averaging significantly increases the probability of cooperative detection Q d , with SNR increasing linearly by a factor of L − 1 per channel. The results are validated through the implementation of SDR. These findings demonstrate the potential of RMP and cooperation to overcome current limitations in CSS, advancing the state-of-the-art in spectrum sensing for collaborative networks.

Source localization at low frequency using deconvolution of the waveguide impulse response

Matched-mode processing (MMP) methods have been widely investigated for source localization and geoacoustic inversion. For horizontal line arrays (HLA), it aims at retrieving the horizontal wavenumbers and thus at inferring source range and bearing. In this work, the matched-mode is performed by applying the deconvolution of the waveguide response in a narrowband context in order to improve the localization accuracy. Deconvolution usually refers to a sparse framework when the number of sources is smaller than the number of sensors of the HLA. The Orthogonal Matching Pursuit algorithm is then used in this work. First results from numerical simulations for Pekeris waveguide highlight better localization accuracy than MMP. The deconvolution shows as well stronger robustness to mismatch in the sound speed values of the seabed. Results from measurement campaign, involving large HLA, low to ultra-low frequency and water depth up to 1500 m are investigated as well.

An Underwater Target Location Algorithm Combined with Schmidt Orthogonalization

Abstract In underwater target localization research, where challenges such as low signal-to-noise ratio and multiple interferences exist in conventional matched field processing, this paper presents a novel approach combining compressed sensing with Schmidt orthogonalization. Initially, an orthogonalization procedure is applied to the observation matrix, yielding a new matrix with reduced column coherence and maximal adherence to the Restricted Isometry Property (RIP) constraint. Subsequently, the Sparse Adaptive Matching Pursuit (SAMP) algorithm from compressed sensing is employed to reconstruct the signal, leading to precise underwater target localization. Simulation experiments substantiate that this combined approach outperforms the conventional matched field algorithm by yielding a higher signal-to-noise ratio for target acoustic source localization and markedly reducing the count of interference virtual sources. Consequently, the performance of localization for targets is substantially enhanced.

Clustering Hyperspectral Imagery via Sparse Representation Features of the Generalized Orthogonal Matching Pursuit

This study focused on improving the clustering performance of hyperspectral imaging (HSI) by employing the Generalized Orthogonal Matching Pursuit (GOMP) algorithm for feature extraction. Hyperspectral remote sensing imaging technology, which is crucial in various fields like environmental monitoring and agriculture, faces challenges due to its high dimensionality and complexity. Supervised learning methods require extensive data and computational resources, while clustering, an unsupervised method, offers a more efficient alternative. This research presents a novel approach using GOMP to enhance clustering performance in HSI. The GOMP algorithm iteratively selects multiple dictionary elements for sparse representation, which makes it well-suited for handling complex HSI data. The proposed method was tested on two publicly available HSI datasets and evaluated in comparison with other methods to demonstrate its effectiveness in enhancing clustering performance.

Robust sensing matrix design for the Orthogonal Matching Pursuit algorithm in compressive sensing

In compressive sensing, Orthogonal Matching Pursuit (OMP) is a greedy algorithm used for recovering sparse signals from their incomplete linear measurements. Conventionally, the OMP algorithm relies on both the measurement matrix and the measurement signal to reconstruct sparse signals. A sensing matrix can be designed to have a small mutual coherence with respect to (w.r.t.) the measurement matrix, which is used to boost the performance of the OMP algorithm in sparse signal reconstruction. Nevertheless, sensing matrices designed by current methods are vulnerable to measurement noises. In this paper, we begin by examining the underlying cause of the non-robustness to measurement noises exhibited by these sensing matrices. Subsequently, we propose a novel approach to design a robust sensing matrix capable of withstanding the influence of measurement noises. Finally, we conduct numerical simulations to demonstrate the effectiveness and robustness of the sensing matrix designed by the proposed method.

Multi-angle speed-of-sound imaging with sparse sampling to characterize medical tissue properties

Medical Speed-of-sound (SoS) imaging, which can characterize medical tissue properties better by quantifying their different SoS, is an effective imaging method compared with conventional B-mode ultrasound imaging. As a commonly used diagnostic instrument, a hand-held array probe features convenient and quick inspection. However, artifacts will occur in the single-angle SoS imaging, resulting in indistinguishable tissue boundaries. In order to build a high-quality SoS image, a number of raw data are needed, which will bring difficulties to data storage and processing. Compressed sensing (CS) theory offers theoretical support to the feasibility that a sparse signal can be rebuilt with random but less sampling data. In this study, we proposed an SoS reconstruction method based on CS theory to process signals obtained from a hand-held linear array probe with a passive reflector positioned on the opposite side. The SoS reconstruction method consists of three parts. Firstly, a sparse transform basis is selected appropriately for a sparse representation of the original signal. Then, considering the mathematical principles of SoS imaging, the ray-length matrix is used as a sparse measurement matrix to observe the original signal, which represents the length of the acoustic propagation path. Finally, the orthogonal matching pursuit algorithm is introduced for image reconstruction. The experimental result of the phantom proves that SoS imaging can clearly distinguish tissues that show similar echogenicity in B-mode ultrasound imaging. The simulation and experimental results show that our proposed method holds promising potential for reconstructing precision SoS images with fewer signal samplings, transmission, and storage.

Spatial-frequency parallel subsampling for distributed compressive sensing in ultrasonic imaging inspection

To address the problem of the high hardware requirements and insufficient data storage capacity in current ultrasonic imaging testing, a novel approach is developed using a programmable device, which combines spatial-frequency parallel subsampling with the distributed compressive sensing simultaneous orthogonal matching pursuit (DCS-SOMP) algorithm to achieve fast and high-quality ultrasonic imaging inspection with a small amount of subsampled data. The spatial sparse measurement method was employed to achieve spatial subsampling and minimize the count of signals. Additionally, frequency subsampling was utilized to significantly reduce the data volume of time-domain signals while ensuring signal quality by truncating the primary testing frequency components. The subsampled data was then reconstructed using distributed compressive sensing (DCS) for multi-channel data reconstruction. The experiment of ultrasonic scanning imaging was conducted on a carbon steel specimen containing six transverse through-holes with a diameter of Ф1.5 mm at different depths. The ultrasonic signals were acquired using the spatial-frequency parallel subsampling method, and subsequently reconstructed using the DCS-SOMP algorithm. The results show that the proposed method achieves comparable image quality to that obtained with complete data, using only 1/8 of the complete data, while accurately locating and quantifying defects.

Learning functional brain networks with heterogeneous connectivities for brain disease identification

Functional brain networks (FBNs), which are used to portray interactions between different brain regions, have been widely used to identify potential biomarkers of neurological and mental disorders. The FBNs estimated using current methods tend to be homogeneous, indicating that different brain regions exhibit the same type of correlation. This homogeneity limits our ability to accurately encode complex interactions within the brain. Therefore, to the best of our knowledge, in the present study, for the first time, we propose the existence of heterogeneous FBNs and introduce a novel FBN estimation model that adaptively assigns heterogeneous connections to different pairs of brain regions, thereby effectively encoding the complex interaction patterns in the brain. Specifically, we first construct multiple types of candidate correlations from different views or based on different methods and then develop an improved orthogonal matching pursuit algorithm to select at most one correlation for each brain region pair under the guidance of label information. These adaptively estimated heterogeneous FBNs were then used to distinguish subjects with neurological/mental disorders from healthy controls and identify potential biomarkers related to these disorders. Experimental results on real datasets show that the proposed scheme improves classification performance by 7.07% and 7.58% at the two sites, respectively, compared with the baseline approaches. This emphasizes the plausibility of the heterogeneity hypothesis and effectiveness of the heterogeneous connection assignment algorithm.

Ultra-Wideband Digital Receive Method Based on Low-Speed Analog-to-Information Sampling

Owing that the bandwidth of radar signal is very small compared with the receiving bandwidth of electronic reconnaissance system, the received signal has sparse frequency spectrum in short time. The ultra-wideband digital receive method based on Analog-to-Information is proposed in this paper, which can obtain the capability of wideband digital receiving by low-speed sampling. Firstly, the analog signal is modulated by pseudo-random signal; next the signal is filtered by low-pass filter and sampled with low speed ADC; and then the original signal can be reconstructed by orthogonal matching pursuit algorithm. Finally, the simulation demonstrates that the original signal can be recon-structed even that the sampling speed goes down 8 times.

Spatial Information Entropy-Assisted Integrated Sensing and Communication for Integrated Satellite-Terrestrial Networks

To better meet communication needs, 6G proposes Integrated Satellite-Terrestrial Networks. Integrated Sensing and Communication (ISAC) is one of the key technologies of Integrated Satellite-Terrestrial Networks, which can reduce the energy consumption of the system, improve communication efficiency, and increase the utilization rate of spectrum resources. In the existing technology, the Modulated Wideband Converter (MWC) system can provide support for the miniaturization and intelligence of wireless device sensing and communication systems. Therefore, the MWC system can be used as a preliminary application of ISAC technology. However, the reconstruction effect of the conventional MWC system under the influence of noise is not stable. Therefore, we propose a signal processing optimization scheme for the MWC system based on spatial information entropy. First, the subsequent reconstruction algorithm is considered to require the dynamic and flexible processing of the sampled signals to reduce the influence of noise. Second, for the shortcomings of the original Orthogonal Matching Pursuit (OMP) algorithm, the concept of the genetic algorithm is used to optimize the algorithm by constructing the feature factor through spatial information gain and spatial information features. According to the simulation results, compared with the traditional MWC system, the scheme proposed in this paper is improved in all indicators.

An adaptive compressive sensing method on hybrid-field channel estimation for a massive MIMO system

Massive MIMO (Multiple-input-multiple output), crucial for 5 G and Beyond 5 G (B5G) networks, faces challenges with terahertz frequencies in B5G as the communication shifts from far-field to near-field. This shift disrupts traditional Massive MIMO channel estimation, leading to increased pilot overhead and limited performance. The current study used the hybrid-field orthogonal matching pursuit (HF-OMP) algorithm from the compressive sensing (CS) framework to estimate the channel with scatters from both far-field and near-field. The method, however, needs more flexibility regarding scatter location in the field of interest. Also, the usage of HF-OMP under a single measurement vector (SMV) scheme limits the overall performance of the existing method. To address these, we have proposed an adaptive hybrid-field simultaneous-OMP algorithm under multiple measurement vector (MMV) of the CS framework which selects multiple atoms having common support within a single iteration. This innovative approach tackles channel estimation for both far-field and near-field scatters while adapting to their varying distributions. Compared to classical methods, simulations show the new algorithm achieves up to a 14 % improvement in normalized mean square error within a 0 dB to 10 dB signal-to-noise ratio range. This translates to significant reductions in pilot overhead and enhanced channel reliability, paving the way for more efficient and robust wireless networks in the future.

LDCT image denoising algorithm based on two-dimensional variational mode decomposition and dictionary learning

Low-dose X-CT scanning method effectively reduces radiation hazards, however, reducing the radiation dose will introduce noise and artifacts during the projection process, resulting in a decrease in the quality of the reconstructed image. To address this problem, we combined 2D variational modal decomposition and dictionary learning. We proposed a low-dose CT (LDCT) image denoising algorithm based on an improved K-SVD algorithm with image decomposition. The dictionary obtained by K-SVD training lacks consideration of image structure information. To address this problem, we employ the two-dimensional variational mode decomposition (2D-VMD) method to decompose the image into distinct modal components. Through the adaptive learning of dictionaries based on the characteristics of each modal component, independent denoising processing is applied to each component, avoiding the loss of structural and detailed information in the image. In addition, we introduce the regularized orthogonal matching pursuit algorithm (ROMP) and dictionary atom optimization method to improve the sparse representation ability of the dictionary and reduce the impact of noise atoms on denoising performance. The experiments show that the proposed method outperforms other denoising methods regarding peak signal-to-noise ratio and structural similarity. The proposed method maintains the denoised image details and structural information while removing LDCT image noise and artifacts. The image quality after denoising is significantly improved and facilitates more accurate detection and analysis of lesion areas.

Clustering-based regularized orthogonal matching pursuit algorithm for rolling element bearing fault diagnosis

Clustering-based regularized orthogonal matching pursuit algorithm for rolling element bearing fault diagnosis