Signal and image processing algorithms using interval convex programming and sparsity

Simple item page
buir.advisorÇetin, Ahmet Enis
dc.contributor.authorKöse, Kıvanç
dc.date.accessioned2016-01-08T18:24:54Z
dc.date.available2016-01-08T18:24:54Z
dc.date.issued2012
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionAnkara : The Department of Electrical and Electronics Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.en_US
dc.descriptionThesis (Ph. D.) -- Bilkent University, 2012.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractIn 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 literatureen_US
dc.description.degreePh.D.en_US
dc.description.statementofresponsibilityKöse, Kıvançen_US
dc.format.extentxx, 139 leaves, illustrationsen_US
dc.identifier.urihttp://hdl.handle.net/11693/15807
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInterval Convex Programmingen_US
dc.subjectSparse Signal Processingen_US
dc.subjectTotal Variationen_US
dc.subjectFiltered Variationen_US
dc.subjectD-Projectionen_US
dc.subjectEntropic Projectionen_US
dc.subjectInverse Problemsen_US
dc.subject.lccTK5102.9 .K67 2012en_US
dc.subject.lcshSignal processing--Digital techniques.en_US
dc.subject.lcshImage processing--Digital techniques.en_US
dc.subject.lcshAlgorithms.en_US
dc.titleSignal and image processing algorithms using interval convex programming and sparsityen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006512.pdf
Size:
5.29 MB
Format:
Adobe Portable Document Format
Download

Collections

Dept. of Electrical and Electronics Engineering - Ph.D. / Sc.D.