Browsing by Subject "Reconstruction error"

Now showing 1 - 6 of 6

Open Access
Choice of sampling interval and extent for finite-energy fields
(Institute of Electrical and Electronics Engineers Inc., 2017) Gulcu, T. C.; Özaktaş, Haldun M.
We focus on the problem of representing a nonstationary finite-energy random field, with finitely many samples. We do not require the field to be of finite extent or to be bandlimited. We propose an optimizable procedure for obtaining a finite-sample representation of the given field. We estimate the reconstruction error of the procedure, showing that it is the sum of the truncation errors in the space and frequency domains. We also optimize the truncation parameters analytically and present the resultant Pareto-optimal tradeoff curves involving the error in reconstruction and the sample count, for several examples. These tradeoff curves can be used to determine the optimal sampling strategy in a practical situation based on the relative importance of error and sample count for that application.
Open Access
A complexity-reduced ML parametric signal reconstruction method
(2011) Deprem, Z.; Leblebicioglu, K.; Arkan O.; Çetin, A.E.
The problem of component estimation from a multicomponent signal in additive white Gaussian noise is considered. A parametric ML approach, where all components are represented as a multiplication of a polynomial amplitude and polynomial phase term, is used. The formulated optimization problem is solved via nonlinear iterative techniques and the amplitude and phase parameters for all components are reconstructed. The initial amplitude and the phase parameters are obtained via time-frequency techniques. An alternative method, which iterates amplitude and phase parameters separately, is proposed. The proposed method reduces the computational complexity and convergence time significantly. Furthermore, by using the proposed method together with Expectation Maximization (EM) approach, better reconstruction error level is obtained at low SNR. Though the proposed method reduces the computations significantly, it does not guarantee global optimum. As is known, these types of non-linear optimization algorithms converge to local minimum and do not guarantee global optimum. The global optimum is initialization dependent. © 2011 Z. Deprem et al.
Open Access
A compression method based on compressive sampling for 3-D laser range scans of indoor environments
(Springer, Dordrecht, 2010) Dobrucalı, Oğuzcan; Barshan, Billur
When 3-D models of environments need to be transmitted or stored, they should be compressed efficiently to increase the capacity of the communication channel or the storage medium. We propose a novel compression technique based on compressive sensing, applied to sparse representations of 3-D range measurements. We develop a novel algorithm to generate sparse innovations between consecutive range measurements along the axis of the sensor's motion, since the range measurements do not have highly sparse representations in common domains. Compared with the performances of widely used compression techniques, the proposed method offers the smallest compression ratio and provides a reasonable balance between reconstruction error and processing time. © 2011 Springer Science+Business Media B.V.
Open Access
Expectation maximization based matching pursuit
(IEEE, 2012) Gurbuz, A.C.; Pilanci, M.; Arıkan, Orhan
A novel expectation maximization based matching pursuit (EMMP) algorithm is presented. The method uses the measurements as the incomplete data and obtain the complete data which corresponds to the sparse solution using an iterative EM based framework. In standard greedy methods such as matching pursuit or orthogonal matching pursuit a selected atom can not be changed during the course of the algorithm even if the signal doesn't have a support on that atom. The proposed EMMP algorithm is also flexible in that sense. The results show that the proposed method has lower reconstruction errors compared to other greedy algorithms using the same conditions. © 2012 IEEE.
Open Access
Sparse ground-penetrating radar imaging method for off-the-grid target problem
(SPIE, 2013) Gurbuz, A. C.; Teke, O.; Arıkan, Orhan
Spatial sparsity of the target space in subsurface or through-the-wall imaging applications has been successfully used within the compressive-sensing framework to decrease the data acquisition load in practical systems, while also generating highresolution images. The developed techniques in this area mainly discretize the continuous target space into grid points and generate a dictionary of model data that is used in image-reconstructing optimization problems. However, for targets that do not coincide with the computation grid, imaging performance degrades considerably. This phenomenon is known as the off-grid problem. This paper presents a novel sparse ground-penetrating radar imaging method that is robust for off-grid targets. The proposed technique is an iterative orthogonal matching pursuit-based method that uses gradientbased steepest ascent-type iterations to locate the off-grid target. Simulations show that robust results with much smaller reconstruction errors are obtained for multiple off-grid targets compared to standard sparse reconstruction techniques. © 2013 SPIE and IS&T.
Open Access
Universal lower bound for finite-sample reconstruction error and ıts relation to prolate spheroidal functions
(Institute of Electrical and Electronics Engineers, 2018) Gülcü, T. C.; Özaktaş, Haldun M.
We consider the problem of representing a finite-energy signal with a finite number of samples. When the signal is interpolated via sinc function from the samples, there will be a certain reconstruction error since only a finite number of samples are used. Without making any additional assumptions, we derive a lower bound for this error. This error bound depends on the number of samples but nothing else, and is thus represented as a universal curve of error versus number of samples. Furthermore, the existence of a function that achieves the bound shows that this is the tightest such bound possible.