Browsing by Subject "Total Variation"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access Novel methods for SAR imaging problems(Bilkent University, 2013) Uğur, SalihSynthetic Aperture Radar (SAR) provides high resolution images of terrain reflectivity. SAR systems are indispensable in many remote sensing applications. High resolution imaging of terrain requires precise position information of the radar platform on its flight path. In target detection and identification applications, imaging of sparse reflectivity scenes is a requirement. In this thesis, novel SAR image reconstruction techniques for sparse target scenes are developed. These techniques differ from earlier approaches in their ability of simultaneous image reconstruction and motion compensation. 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. In the first proposed technique, Non-Linear Conjugate Gradient Descent algorithm is used to obtain the optimum reconstruction. To increase robustness in the reconstruction, Total Variation penalty is introduced into the cost function of the optimization. To reduce the rate of A/D conversion and memory requirements, a specific under sampling pattern is introduced. In the second proposed technique, Expectation Maximization Based Matching Pursuit (EMMP) algorithm is utilized to obtain the optimum sparse SAR reconstruction. EMMP algorithm is greedy and computationally less complex resulting in fast SAR image reconstructions. Based on a variety of metrics, performances of the proposed techniques are compared. It is observed that the EMMP algorithm has an additional advantage of reconstructing off-grid targets by perturbing on-grid basis vectors on a finer grid.Item Open Access Signal and image processing algorithms using interval convex programming and sparsity(Bilkent University, 2012) Köse, KıvançIn this thesis, signal and image processing algorithms based on sparsity and interval convex programming are developed for inverse problems. Inverse signal processing problems are solved by minimizing the ℓ1 norm or the Total Variation (TV) based cost functions in the literature. A modified entropy functional approximating the absolute value function is defined. This functional is also used to approximate the ℓ1 norm, which is the most widely used cost function in sparse signal processing problems. The modified entropy functional is continuously differentiable, and convex. As a result, it is possible to develop iterative, globally convergent algorithms for compressive sensing, denoising and restoration problems using the modified entropy functional. Iterative interval convex programming algorithms are constructed using Bregman’s D-Projection operator. In sparse signal processing, it is assumed that the signal can be represented using a sparse set of coefficients in some transform domain. Therefore, by minimizing the total variation of the signal, it is expected to realize sparse representations of signals. Another cost function that is introduced for inverse problems is the Filtered Variation (FV) function, which is the generalized version of the Total Variation (VR) function. The TV function uses the differences between the pixels of an image or samples of a signal. This is essentially simple Haar filtering. In FV, high-pass filter outputs are used instead of differences. This leads to flexibility in algorithm design adapting to the local variations of the signal. Extensive simulation studies using the new cost functions are carried out. Better experimental restoration, and reconstructions results are obtained compared to the algorithms in the literature