Browsing by Subject "Signal reconstruction"

Now showing 1 - 20 of 24

Open Access
Accelerated phase-cycled SSFP imaging with compressed sensing
(Institute of Electrical and Electronics Engineers Inc., 2015) Çukur, T.
Balanced steady-state free precession (SSFP) imaging suffers from irrecoverable signal losses, known as banding artifacts, in regions of large B0 field inhomogeneity. A common solution is to acquire multiple phase-cycled images each with a different frequency sensitivity, such that the location of banding artifacts are shifted in space. These images are then combined to alleviate signal loss across the entire field-of-view. Although high levels of artifact suppression are viable using a large number of images, this is a time costly process that limits clinical utility. Here, we propose to accelerate individual acquisitions such that the overall scan time is equal to that of a single SSFP acquisition. Aliasing artifacts and noise are minimized by using a variable-density random sampling pattern in k-space, and by generating disjoint sampling patterns for separate acquisitions. A sparsity-enforcing method is then used for image reconstruction. Demonstrations on realistic brain phantom images, and in vivo brain and knee images are provided. In all cases, the proposed technique enables robust SSFP imaging in the presence of field inhomogeneities without prolonging scan times. © 2014 IEEE.
Open Access
Average error in recovery of sparse signals and discrete fourier transform
(IEEE, 2012-04) Özçelikkale, Ayça; Yüksel, S.; Özaktaş Haldun M.
In compressive sensing framework it has been shown that a sparse signal can be successfully recovered from a few random measurements. The Discrete Fourier Transform (DFT) is one of the transforms that provide the best performance guarantees regardless of which components of the signal are nonzero. This result is based on the performance criterion of signal recovery with high probability. Whether the DFT is the optimum transform under average error criterion, instead of high probability criterion, has not been investigated. Here we consider this optimization problem. For this purpose, we model the signal as a random process, and propose a model where the covariance matrix of the signal is used as a measure of sparsity. We show that the DFT is, in general, not optimal despite numerous results that suggest otherwise. © 2012 IEEE.
Open Access
Compressed sensing on ambiguity function domain for high resolution detection
(IEEE, 2010) Güldoǧan, Mehmet B.; Pilancı, Mert; Arıkan, Orhan
In this paper, by using compressed sensing techniques, a new approach to achieve robust high resolution detection in sparse multipath channels is presented. Currently used sparse reconstruction techniques are not immediately applicable in wireless channel modeling and radar signal processing. Here, we make use of the cross-ambiguity function (CAF) and transformed the reconstruction problem from time to delay-Doppler domain for efficient exploitation of the delay-Doppler diversity of the multipath components. Simulation results quantify the performance gain and robustness obtained by this new CAF based compressed sensing approach. ©2010 IEEE.
Open Access
A compression method for 3-D laser range scans of indoor environments based on compressive sensing
(IEEE, 2011-08-09) Dobrucalı, Oğuzcan; Barshan, Biilur
Modeling and representing 3-D environments require the transmission and storage of vast amount of measurements that need to be compressed efficiently. We propose a novel compression technique based on compressive sensing for 3-D range measurements that are found to be correlated with each other. The main issue here is finding a highly sparse representation of the range measurements, since they do not have highly sparse representations in common domains, such as the frequency domain. To solve this problem, we generate sparse innovations between consecutive range measurements along the axis of the sensor's motion. We obtain highly sparse innovations compared with other possible ones generated by estimation and filtering. Being a lossy technique, the proposed method performs reasonably well compared with widely used compression techniques. © 2011 EURASIP.
Open Access
Compressive sampling and adaptive multipath estimation
(IEEE, 2010) Pilancı, Mert; Arıkan, Orhan
In many signal processing problems such as channel estimation and equalization, the problem reduces to a linear system of equations. In this proceeding we formulate and investigate linear equations systems with sparse perturbations on the coefficient matrix. In a large class of matrices, it is possible to recover the unknowns exactly even if all the data, including the coefficient matrix and observation vector is corrupted. For this aim, we propose an optimization problem and derive its convex relaxation. The numerical results agree with the previous theoretical findings of the authors. The technique is applied to adaptive multipath estimation in cognitive radios and a significant performance improvement is obtained. The fact that rapidly varying channels are sparse in delay and doppler domain enables our technique to maintain reliable communication even far from the channel training intervals. ©2010 IEEE.
Open Access
Compressive sensing based flame detection in infrared videos
(IEEE, 2013) Günay, Osman; Çetin, A. Enis
In this paper, a Compressive Sensing based feature extraction algorithm is proposed for flame detection using infrared cameras. First, bright and moving regions in videos are detected. Then the videos are divided into spatio-temporal blocks and spatial and temporal feature vectors are exctracted from these blocks. Compressive Sensing is used to exctract spatial feature vectors. Compressed measurements are obtained by multiplying the pixels in the block with the sensing matrix. A new method is also developed to generate the sensing matrix. A random vector generated according to standard Gaussian distribution is passed through a wavelet transform and the resulting matrix is used as the sensing matrix. Temporal features are obtained from the vector that is formed from the difference of mean intensity values of the frames in two neighboring blocks. Spatial feature vectors are classified using Adaboost. Temporal feature vectors are classified using hidden Markov models. To reduce the computational cost only moving and bright regions are classified and classification is performed at specified intervals instead of every frame. © 2013 IEEE.
Open Access
Compressive sensing based target detection in delay-doppler radars
(IEEE, 2013) Teke, Oguzhan; Arıkan, Orhan; Gürbüz, A.C.
Compressive Sensing theory shows that, a sparse signal can be reconstructed from its sub-Nyquist rate random samples. With this property, CS approach has many applications. Radar systems, which deal with sparse signal due to its nature, is one of the important application of CS theory. Even if CS approach is suitable for radar systems, classical detections schemes under Neyman-Pearson formulations may result high probability of false alarm, when CS approach is used, especially if the target has off-grid parameters. In this study, a new detection scheme which enables CS techniques to be used in radar systems is investigated. © 2013 IEEE.
Open Access
Compressive sensing imaging with a graphene modulator at THz frequency in transmission mode
(IEEE, 2016) Özkan, V. A.; Takan, T.; Kakenov, Nurbek; Kocabaş, Coşkun; Altan, H.
In this study we demonstrate compressive sensing imaging with a unique graphene based optoelectronic device which allows us to modulate the THz field through an array of columns or rows distributed throughout its face.
Open Access
Detection of sparse targets with structurally perturbed echo dictionaries
(Elsevier, 2013) Guldogan, M. B.; Arıkan, Orhan
In this paper, a novel algorithm is proposed to achieve robust high resolution detection in sparse multipath channels. Currently used sparse reconstruction techniques are not immediately applicable in multipath channel modeling. Performance of standard compressed sensing formulations based on discretization of the multipath channel parameter space degrade significantly when the actual channel parameters deviate from the assumed discrete set of values. To alleviate this off-grid problem, we make use of the particle swarm optimization (PSO) to perturb each grid point that reside in each multipath component cluster. Orthogonal matching pursuit (OMP) is used to reconstruct sparse multipath components in a greedy fashion. Extensive simulation results quantify the performance gain and robustness obtained by the proposed algorithm against the off-grid problem faced in sparse multipath channels.
Open Access
Ellipsoid genişletmeyle seyrek sinyal geri oluşturma
(IEEE, 2011-04) Gürbüz, A. C.; Pilancı, M.; Arıkan, Orhan
Bu makalede b = Ax + n şeklinde gürültülü A’nın tam rank ve x’in seyrek olduğu doğrusal bir denklem sistemi için seyrek x sinyallerini doğru olarak geri oluşturmaya yönelik yeni bir yöntem sunulmuştur. Önerilen yöntem kullanılan veri sınırını belirleyen ||Ax − b||2 = ellipsoidinin genişletilirken sırayla eksenlerin sıfırlanmasına dayanan yinelemeli bir yöntemdir. Seyrek sinyal oluşturma alanında yinelemeli ve 1 norm minimizasyon tabanlı standard yöntemlere göre benzer problemlerde daha yüksek başarım gösteren metot, eksik belirtilmiş sistemlerde standard metotların oluşturması gereken seyreklik seviyesini de yumuşatmaktadır
Open Access
An empirical eigenvalue-threshold test for sparsity level estimation from compressed measurements
(IEEE, 2014) Lavrenko, A.; Römer, F.; Del Galdo, G.; Thoma, R.; Arıkan, Orhan
Compressed sensing allows for a significant reduction of the number of measurements when the signal of interest is of a sparse nature. Most computationally efficient algorithms for signal recovery rely on some knowledge of the sparsity level, i.e., the number of non-zero elements. However, the sparsity level is often not known a priori and can even vary with time. In this contribution we show that it is possible to estimate the sparsity level directly in the compressed domain, provided that multiple independent observations are available. In fact, one can use classical model order selection algorithms for this purpose. Nevertheless, due to the influence of the measurement process they may not perform satisfactorily in the compressed sensing setup. To overcome this drawback, we propose an approach which exploits the empirical distributions of the noise eigenvalues. We demonstrate its superior performance compared to state-of-the-art model order estimation algorithms numerically.
Open Access
Image feature extraction using compressive sensing
(Springer, 2014) Eleyan, A.; Köse, Kıvanç; Çetin, A. Enis
In this paper a new approach for image feature extraction is presented. We used the Compressive Sensing (CS) concept to generate the measurement matrix. The new measurement matrix is different from the measurement matrices in literature as it was constructed using both zero mean and nonzero mean rows. The image is simply projected into a new space using the measurement matrix to obtain the feature vector. Another proposed measurement matrix is a random matrix constructed from binary entries. Face recognition problem was used as an example for testing the feature extraction capability of the proposed matrices. Experiments were carried out using two well-known face databases, namely, ORL and FERET databases. System performance is very promising and comparable with the classical baseline feature extraction algorithms.
Open Access
Performance assessment of a diffraction field computation method based on source model
(IEEE, 2008-05) Esmer, G. Bora; Onural, Levent; Özaktaş, Haldun M.; Uzunov, V.; Gotchev, A.
Efficient computation of scalar optical diffraction field due to an object is an essential issue in holographic 3D television systems. The first step in the computation process is to construct an object. As a solution for this step, we assume that an object can be represented by a set of distributed data points over a space. The second step is to determine which algorithm provides better performance. The source model whose performance is investigated is based on superposition of the diffraction fields emanated from the hypothetical light sources located at the given sample points. Its performance is evaluated according to visual quality of the reconstructed field and its algorithmic complexity. Source model provides acceptable reconstructed patterns when the region in which the samples are given has a narrow depth along the longitudinal direction and a wide extent along the transversal directions. Also, the source model gives good results when the cumulative field at the location of each point due to all other sources tends to be independent of that location. ©2008 IEEE.
Open Access
Perturbed orthogonal matching pursuit
(IEEE, 2013) Teke, O.; Gurbuz, A. C.; Arıkan, Orhan
Compressive Sensing theory details how a sparsely represented signal in a known basis can be reconstructed with an underdetermined linear measurement model. However, in reality there is a mismatch between the assumed and the actual bases due to factors such as discretization of the parameter space defining basis components, sampling jitter in A/D conversion, and model errors. Due to this mismatch, a signal may not be sparse in the assumed basis, which causes significant performance degradation in sparse reconstruction algorithms. To eliminate the mismatch problem, this paper presents a novel perturbed orthogonal matching pursuit (POMP) algorithm that performs controlled perturbation of selected support vectors to decrease the orthogonal residual at each iteration. Based on detailed mathematical analysis, conditions for successful reconstruction are derived. Simulations show that robust results with much smaller reconstruction errors in the case of perturbed bases can be obtained as compared to standard sparse reconstruction techniques.
Open Access
Polar compressive sampling: A novel technique using polar codes
(IEEE, 2010) Pilancı, Mert; Arıkan, Orhan; Arıkan, Erdal
Recently introduced Polar coding is the first practical coding technique that can be proven to achieve the Shannon capacity for a multitude of communication channels. Polar codes are close to Reed-Muller codes except the fact that they are tuned for the parameters of the channel. Hence, Polar codes are shown to offer better performance, e.g., in the erasure channel. It is known that second order Reed-Muller codes can be used for Compressed Sensing. Inspired by that result, we propose Polar codes as measurement matrices in CS and compare their numerical performances. We also present the algebraic relation between the erasure channel and CS theory, and discuss fast solution techniques. ©2010 IEEE.
Open Access
Range-doppler radar target detection using denoising within the compressive sensing framework
(IEEE, 2014-09) Sevimli, R. Akın; Tofighi, Mohammad; Çetin, A. Enis
Compressive sensing (CS) idea enables the reconstruction of a sparse signal from a small set of measurements. CS approach has applications in many practical areas. One of the areas is radar systems. In this article, the radar ambiguity function is denoised within the CS framework. A new denoising method on the projection onto the epigraph set of the convex function is also developed for this purpose. This approach is compared to the other CS reconstruction algorithms. Experimental results are presented1. © 2014 EURASIP.
Open Access
Recovery of sparse perturbations in Least Squares problems
(IEEE, 2011) Pilanci, M.; Arıkan, Orhan
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structures. The well established theory of Compressed Sensing enables us to prove that if the perturbation structure is sufficiently incoherent, then exact or stable recovery can be achieved using linear programming. We derive sufficiency conditions for both exact and stable recovery using known results of ℓ 0/ℓ 1 equivalence. However the problem turns out to be more complicated than the usual setting used in various sparse reconstruction problems. We propose and solve an optimization criterion and its convex relaxation to recover the perturbation and the solution to the Least Squares problem simultaneously. Then we demonstrate with numerical examples that the proposed method is able to recover the perturbation and the unknown exactly with high probability. The performance of the proposed technique is compared in blind identification of sparse multipath channels. © 2011 IEEE.
Open Access
Seyrek sinyallerin geri çatımına özyineli bir yaklaşım
(IEEE, 2014-04) Teke, Oğuzhan; Arıkan, Orhan; Gürbüz, A. C.
Sıkıştırılmış Algılama (SA) kuramı, bilinen bir tabanda seyrek olan bir sinyalin az sayıda ölçüm ile nasıl geri çatılacağını inceler. Çoğu pratik sistemdeki ölçüm sinyallerinin sürekli bir parametre uzayında seyrek bir tanıma sahip olması, SA kuramı altında geliştirilmiş tekniklerin kullanılabilme olasılığını ortaya çıkarır. Ancak, SA tekniklerinin uygulanabilmesi için sürekli parametre uzayının ayrıklaştırılması gerekir. Bu ayrıklaştırma sonucunda da iyi bilinen ızgara-dışılık problemi ortaya çıkar. Izgara-dışılık problemini engellemek için bu çalışmada, parametre alanını degişken ve uyarlamalı bir şekilde ayrıklaştıran özyineli bir yaklaşım sunulmuştur. Önerilen yaklaşımın çok yakın şekilde konumlanmış hedefleri dahi yüksek hassasiyetle kestirebildiği benzetim çalışmalarıyla gösterilmiştir.
Open Access
Sıkıştırılmış algılama kullanarak Uzaklık-Doppler radar hedef tespiti
(IEEE, 2014-04) Sevimli, R. Akın; Tofighi, Mohammad; Çetin, A. Enis
Sıkıştırılmış algılama(SA) fikri, az sayıda ölçümlerden seyrek bir sinyalin geri çatımını mümkün kılar. SA yaklaşımı bir çok farklı alanda uygulamalara sahiptir. Bu alanlardan birisi de radar sistemleridir. Bu makalede, radar belirsizlik fonksiyonu (Ambiguity Function) SA çatısı altında gürültüden arındırılmıştır. Bu amaç için dışbükey fonksiyonun epigraf kümesine izdüşüm tabanlı yeni bir gürültüden arındırma metodu geliştirilmiştir. Bu yaklaşım, diğer SA geri çatım algoritmalarıyla karşılaştırılmıştır. Deneysel sonuçlar sunulmuştur.
Open Access
Sıkıştırılmış algılama kullanarak yeni bir yüz gösterimi
(IEEE, 2011-04) Eleyan, A.; Köse, Kıvanç; Çetin, A. Enis
Bu bildiride yüz resimleri için yeni bir tanımlayıcı sunulmaktadır. Sıkıştırılmış Algılama (Compressive Sensing) fikri kullanılarak, yüz imgelerinden öznitelikler çıkarılmıştır. Öznitelik çıkarımı sırasında Rastgele Gauss dağılımına sahip elemanları ya da rasgele ikili elemanları olan ölçüm matrisleri kullanılmıştır. Bu sayede elde edilen öznitelik vektörleri en yakın komşu sınıflandırıcısı kullanılarak sınıflandırılmıştır. Hesaplama karmaşıklığı konusunda büyük bir indirim sağlanmış ve bunun yanında tanıma oranlarında büyük bir düşüş yaşanmamıştır.