Results 161 to 170 of about 3,975 (201)

A fast orthogonal matching pursuit algorithm

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002
The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit,
Mohammad Gharavi-Alkhansari, Thomas S. Huang   +1 more
openaire   +1 more source

Sparsity and incoherence in orthogonal matching pursuit

Multidimensional Systems and Signal Processing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Shen, Ruifang Hu
openaire   +2 more sources

Stagewise Arithmetic Orthogonal Matching Pursuit

International Journal of Wireless Information Networks, 2018
In order to improve the problems that stagewise weak orthogonal matching pursuit (SWOMP) has low reconstruction accuracy and imprecise choice of indexs selecting, an effective algorithm called stagewise arithmetic orthogonal matching pursuit (SAOMP) was proposed.
Yingying Zhang, Guiling Sun
openaire   +1 more source

Look ahead orthogonal matching pursuit

2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011
For compressive sensing, we endeavor to improve the recovery performance of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlying support set progressively through iterations, we use a look ahead strategy.
Saikat Chatterjee, Dennis Sundman, Mikael Skoglund   +2 more
openaire   +1 more source

Orthogonal Matching Pursuit on Faulty Circuits

IEEE Transactions on Communications, 2015
With the wide recognition that modern nanoscale devices will be error-prone, characterization of reliability of information processing systems built out of unreliable components has become an important topic. In this paper, we analyze the performance of orthogonal matching pursuit (OMP), a popular sparse recovery algorithm, running on faulty circuits ...
Yao Li 0007, Yuejie Chi, Chu-Hsiang Huang, Lara Dolecek   +3 more
openaire   +1 more source

Orthogonal matching pursuit for VHR image reconstruction

2012 IEEE International Geoscience and Remote Sensing Symposium, 2012
Reconstructing missing data in very high resolution (VHR) multispectral images represents a complex image processing challenge. In this paper, we propose a new method for the reconstruction of areas obscured by clouds. It is based on compressive sensing (CS) theory, which allows to find sparse signal representations in underdetermined linear equation ...
Lorenzi, Luca, Melgani, Farid, G. Mercier   +2 more
openaire   +1 more source

Optical CDMA Detection by Orthogonal Matching Pursuit

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006
In this paper, we present a novel optical CDMA multi-user detector employing the orthogonal matching pursuit algorithm. The proposed system is compared with most of the receiver structures in the literature. It is shown by simulation results that the proposed detection architecture is a very promising candidate with its low computational complexity ...
Tolga Kurt, Günes Karabulut, Abbas Yongaçoglu   +2 more
openaire   +2 more sources

Ordered Orthogonal Matching Pursuit

2012 National Conference on Communications (NCC), 2012
Compressed Sensing deals with recovering sparse signals from a relatively small number of linear measurements. Several algorithms exists for data recovery from the compressed measurements, particularly appealing among these is the greedy approach known as Orthogonal Matching Pursuit (OMP). In this paper, we propose a modified OMP based algorithm called
Deepak Baby, Sibi Raj B Pillai
openaire   +1 more source

Orthogonal Matching Pursuit with correction

2016 IEEE 12th International Colloquium on Signal Processing & Its Applications (CSPA), 2016
Orthogonal Matching Pursuit (OMP) is the most popular greedy algorithm that has been developed to find a sparse solution vector to an under-determined linear system of equations. OMP follows the projection procedure to identify the indices of the support of the sparse solution vector.
Nasser Mourad, Maha Sharkas, Mostafa M. Elsherbeny   +2 more
openaire   +1 more source

Subspace pursuit embedded in Orthogonal Matching Pursuit

TENCON 2012 IEEE Region 10 Conference, 2012
Orthogonal Matching Pursuit (OMP) is a popular greedy pursuit algorithm widely used for sparse signal recovery from an undersampled measurement system. However, one of the main shortcomings of OMP is its irreversible selection procedure of columns of measurement matrix.
Sooraj K. Ambat, Saikat Chatterjee, K.V.S. Hari   +2 more
openaire   +1 more source