Browsing by Subject "Total variation"

Now showing 1 - 4 of 4

Open Access
Deconvolution using projections onto the epigraph set of a convex cost function
(IEEE, 2014) Tofighi, Mohammad; Bozkurt, Alican; Köse, K.; Çetin, A. Enis
A new deconvolution algorithm based on making orthogonal projections onto the epigraph set of a convex cost function is presented. In this algorithm, the dimension of the minimization problem is lifted by one and sets corresponding to the cost function and observations are defined. If the utilized cost function is convex in RN, the corresponding epigraph set is also convex in RN+1. The deconvolution algorithm starts with an arbitrary initial estimate in RN+1. At each iteration cycle of the algorithm, first deconvolution projections are performed onto the hyperplanes representing observations, then an orthogonal projection is performed onto epigraph of the cost function. The method provides globally optimal solutions for total variation, l1, l2, and entropic cost functions.
Open Access
Filtered Variation method for denoising and sparse signal processing
(IEEE, 2012) Köse, Kıvanç; Cevher V.; Çetin, A. Enis
We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by using discrete time filters that are widely used in signal processing. We mathematically define the FV problem, and solve it using alternating projections in space and transform domains. We provide a globally convergent algorithm based on the projections onto convex sets approach. We apply to our algorithm to real denoising problems and compare it with the total variation recovery. © 2012 IEEE.
Open Access
Polynomial fitting and total variation based techniques on 1-D and 2-D signal denoising
(2010) Yıldız, Aykut
New techniques are developed for signal denoising and texture recovery. Geometrical theory of total variation (TV) is explored, and an algorithm that uses quadratic programming is introduced for total variation reduction. To minimize the staircase effect associated with commonly used total variation based techniques, robust algorithms are proposed for accurate localization of transition boundaries. For this boundary detection problem, three techniques are proposed. In the first method, the 1−D total variation is applied in first derivative domain. This technique is based on the fact that total variation forms piecewise constant parts and the constant parts in the derivative domain corresponds to lines in time domain. The boundaries of these constant parts are used as the transition boundaries for the line fitting. In the second technique proposed for boundary detection, a wavelet based technique is proposed. Since the mother wavelet can be used to detect local abrupt changes, the Haar wavelet function is used for the purpose of boundary detection. Convolution of a signal or its derivative family with this Haar mother wavelet gives responses at the edge locations, attaining local maxima. A basic local maximization technique is used to find the boundary locations. The last technique proposed for boundary detection is the well known Particle Swarm Optimization (PSO). The locations of the boundaries are randomly perturbed yielding an error for each set of boundaries. Pursuing the personal and global best positions, the boundary locations converge to a set of boundaries. In all of the techniques, polynomial fitting is applied to the part of the signal between the edges. A more complicated scenario for 1−D signal denoising is texture recovery. In the technique proposed in this thesis, the periodicity of the texture is exploited. Periodic and non-periodic parts are distinguished by examining total variation of the autocorrelation of the signal. In the periodic parts, the period size was found by PSO evolution. All the periods were averaged to remove the noise, and the final signal was synthesized. For the purpose of image denoising, optimum one dimensional total variation minimization is carried to two dimensions by Radon transform and slicing method. In the proposed techniques, the stopping criterion for the procedures is chosen as the error norm. The processes are stopped when the residual norm is comparable to noise standard deviation. 1−D and 2−D noise statistics estimation methods based on Maximum Likelihood Estimation (MLE) are presented. The proposed denoising techniques are compared with principal curve projection technique, total variation by Rudin et al, total variation by Willsky et al, and curvelets. The simulations show that our techniques outperform these widely used techniques in the literature.
Open Access
SAR image reconstruction and autofocus by compressed sensing
(Elsevier, 2012-07-24) Ugur, S.; Arıkan, Orhan
A new SAR signal processing technique based on compressed sensing is proposed for autofocused image reconstruction on subsampled raw SAR data. It is shown that, if the residual phase error after INS/GPS corrected platform motion is captured in the signal model, then the optimal autofocused image formation can be formulated as a sparse reconstruction problem. To further improve image quality, the total variation of the reconstruction is used as a penalty term. In order to demonstrate the performance of the proposed technique in wide-band SAR systems, the measurements used in the reconstruction are formed by a new under-sampling pattern that can be easily implemented in practice by using slower rate A/D converters. Under a variety of metrics for the reconstruction quality, it is demonstrated that, even at high under-sampling ratios, the proposed technique provides reconstruction quality comparable to that obtained by the classical techniques which require full-band data without any under-sampling.