A Structure-Adaptive Matching Pursuit Subspace Search Algorithm for Effective Image Sparse Representation

2012 ◽  
Vol 35 (8) ◽  
pp. 1751
Author(s):  
Yu-Bao SUN ◽  
Liang XIAO ◽  
Zhi-Hui WEI ◽  
Qing-Shan LIU
Author(s):  
Maryam Abedini ◽  
Horriyeh Haddad ◽  
Marzieh Faridi Masouleh ◽  
Asadollah Shahbahrami

This study proposes an image denoising algorithm based on sparse representation and Principal Component Analysis (PCA). The proposed algorithm includes the following steps. First, the noisy image is divided into overlapped [Formula: see text] blocks. Second, the discrete cosine transform is applied as a dictionary for the sparse representation of the vectors created by the overlapped blocks. To calculate the sparse vector, the orthogonal matching pursuit algorithm is used. Then, the dictionary is updated by means of the PCA algorithm to achieve the sparsest representation of vectors. Since the signal energy, unlike the noise energy, is concentrated on a small dataset by transforming into the PCA domain, the signal and noise can be well distinguished. The proposed algorithm was implemented in a MATLAB environment and its performance was evaluated on some standard grayscale images under different levels of standard deviations of white Gaussian noise by means of peak signal-to-noise ratio, structural similarity indexes, and visual effects. The experimental results demonstrate that the proposed denoising algorithm achieves significant improvement compared to dual-tree complex discrete wavelet transform and K-singular value decomposition image denoising methods. It also obtains competitive results with the block-matching and 3D filtering method, which is the current state-of-the-art for image denoising.


2018 ◽  
Vol 214 ◽  
pp. 02004
Author(s):  
Yuanyuan Li ◽  
Yaowen Fu ◽  
Wenpeng Zhang

Distributed ISAR technique has the potential to increase the cross-range resolution by exploiting multi-channel echoes from distributed virtual equivalent sensors. In the existing imaging approaches, the echoes acquired from different sensors are rearranged into an equivalent single-channel ISAR signal. Then, the missing data between the observation angles of any two adjacent sensors is restored by interpolation. However, the interpolation method can be very inaccurate when the gap is large or the signal-to-noise (SNR) of echoes is low. In this paper, we discuss sparse representation of distributed ISAR echoes since the scattering field of the target is usually composed of only a limited number of strong scattering centres, representing strong spatial sparsity. Then, by using sparse algorithm (Orthogonal Matching Pursuit algorithm, OMP), the positions and amplitudes of the scattering points in every range bin can be recovered and the final ISAR image with high cross-range resolution can be obtained. Results show the effectiveness of the proposed method.


2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Yidong Tang ◽  
Shucai Huang ◽  
Aijun Xue

The sparse representation based classifier (SRC) and its kernel version (KSRC) have been employed for hyperspectral image (HSI) classification. However, the state-of-the-art SRC often aims at extended surface objects with linear mixture in smooth scene and assumes that the number of classes is given. Considering the small target with complex background, a sparse representation based binary hypothesis (SRBBH) model is established in this paper. In this model, a query pixel is represented in two ways, which are, respectively, by background dictionary and by union dictionary. The background dictionary is composed of samples selected from the local dual concentric window centered at the query pixel. Thus, for each pixel the classification issue becomes an adaptive multiclass classification problem, where only the number of desired classes is required. Furthermore, the kernel method is employed to improve the interclass separability. In kernel space, the coding vector is obtained by using kernel-based orthogonal matching pursuit (KOMP) algorithm. Then the query pixel can be labeled by the characteristics of the coding vectors. Instead of directly using the reconstruction residuals, the different impacts the background dictionary and union dictionary have on reconstruction are used for validation and classification. It enhances the discrimination and hence improves the performance.


This work proposes a sparse based representation for tracking multi object for the longer sequence of video frame. Object of interest are first identified and then represented with set of low dimensional feature covariance matrix. These feature of different object are kept in a dictionary. In order to classify the object, sparse based Orthogonal matching pursuit(OMP) algorithm is used. Furthermore, towards reducing the computational overhead, proposed model is implemented on a graphical processing unit enhanced with the multi threaded resource for parallelization of the task. Experimental results shows that proposed method out perform as compared with the state of art in identifying the objects.


2021 ◽  
Author(s):  
Mahdi Marsousi

The Sparse representation research field and applications have been rapidly growing during the past 15 years. The use of overcomplete dictionaries in sparse representation has gathered extensive attraction. Sparse representation was followed by the concept of adapting dictionaries to the input data (dictionary learning). The K-SVD is a well-known dictionary learning approach and is widely used in different applications. In this thesis, a novel enhancement to the K-SVD algorithm is proposed which creates a learnt dictionary with a specific number of atoms adapted for the input data set. To increase the efficiency of the orthogonal matching pursuit (OMP) method, a new sparse representation method is proposed which applies a multi-stage strategy to reduce computational cost. A new phase included DCT (PI-DCT) dictionary is also proposed which significantly reduces the blocking artifact problem of using the conventional DCT. The accuracy and efficiency of the proposed methods are then compared with recent approaches that demonstrate the promising performance of the methods proposed in this thesis.


2021 ◽  
Vol 8 (2) ◽  
Author(s):  
Javad Afshar Jahanshahi

Compressed Sensing (CS) has been considered a very effective means of reducing energy consumption at the energy-constrained wireless body sensor networks for monitoring the multi-lead Electrocardiogram (MECG) signals. This paper develops the compressed sensing theory for sparse modeling and effective multi-channel ECG compression. A basis matrix with Gaussian kernels is proposed to obtain the sparse representation of each channel, which showed the closest similarity to the ECG signals. Thereafter, the greedy orthogonal matching pursuit (OMP) method is used to obtain the sparse representation of the signals. After obtaining the sparse representation of each ECG signal, the compressed sensing theory could be used to compress the signals as much as possible. Following the compression, the compressed signal is reconstructed utilizing the greedy orthogonal matching pursuit (OMP) optimization technique to demonstrate the accuracy and reliability of the algorithm. Moreover, as the wavelet basis matrix is another sparsifying basis to sparse representations of ECG signals, the compressed sensing is applied to the ECG signals using the wavelet basis matrix. The simulation results indicated that the proposed algorithm with Gaussian basis matrix reduces the reconstruction error and increases the compression ratio.


Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5559
Author(s):  
Na Li ◽  
Ruihao Wang ◽  
Huijie Zhao ◽  
Mingcong Wang ◽  
Kewang Deng ◽  
...  

To solve the small sample size (SSS) problem in the classification of hyperspectral image, a novel classification method based on diverse density and sparse representation (NCM_DDSR) is proposed. In the proposed method, the dictionary atoms, which learned from the diverse density model, are used to solve the noise interference problems of spectral features, and an improved matching pursuit model is presented to obtain the sparse coefficients. Airborne hyperspectral data collected by the push-broom hyperspectral imager (PHI) and the airborne visible/infrared imaging spectrometer (AVIRIS) are applied to evaluate the performance of the proposed classification method. Results illuminate that the overall accuracies of the proposed model for classification of PHI and AVIRIS images are up to 91.59% and 92.83% respectively. In addition, the kappa coefficients are up to 0.897 and 0.91.


Sign in / Sign up

Export Citation Format

Share Document