Robust compressive sensing techniques

Simple item page
buir.advisorArıkan, Orhan
dc.contributor.authorTeke, Oğuzhan
dc.date.accessioned2016-07-01T11:10:27Z
dc.date.available2016-07-01T11:10:27Z
dc.date.issued2014
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractCompressive Sensing theory details how a sparsely represented signal in a known basis can be reconstructed from an underdetermined linear measurements. However, in reality there is a mismatch between the assumed and the actual dictionary 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 signifi- cant performance degradation in sparse reconstruction algorithms. To eliminate the mismatch problem, this thesis presents two novel robust algorithm and an adaptive discretization framework that can obtain successful sparse representations. In the proposed techniques, the selected dictionary atoms are perturbed towards directions to decrease the orthogonal residual norm. The first algorithm named as Parameter Perturbed Orthogonal Matching Pursuit (PPOMP) targets the off-grid problem and the parameters of the selected dictionary atoms are perturbed. The second algorithm named as Perturbed Orthogonal Matching Pursuit (POMP) targets the unstructured basis mismatch problem and performs controlled rotation based perturbation of selected dictionary atoms. 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 both parametric and unstructured basis mismatch problem can be obtained as compared to standard sparse reconstruction techniques. Different from the proposed perturbation approaches, the proposed adaptive framework discretizes the continuous parameter space depending on the estimated sparsity level. Once a provisional solution is obtained with a sparse solver, the framework recursively splits the problem into sparser sub-problems so that each sub-problem is exposed to less severe off-grid problem. In the presented recursive framework, any sparse reconstruction technique can be used. As illustrated over commonly used applications, the error in the estimated parameters of sparse signal components almost achieve the Cram´er-Rao lower bound in the proposed framework.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T11:10:27Z (GMT). No. of bitstreams: 1 0006662.pdf: 1619944 bytes, checksum: f2768e3094f5eac412fa52ca411eb5a6 (MD5) Previous issue date: 2014en
dc.description.statementofresponsibilityTeke, Oğuzhanen_US
dc.format.extentxv, 111 leaves, charts, plates, illustrationsen_US
dc.identifier.itemidB147644
dc.identifier.urihttp://hdl.handle.net/11693/30007
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectCompressive Sensingen_US
dc.subjectBasis Mismatchen_US
dc.subjectOff-griden_US
dc.subjectBasis Perturbationen_US
dc.subjectPerturbed OMPen_US
dc.subjectDelayDoppler Radaren_US
dc.subjectSampling Jitteren_US
dc.subjectSparse Reconstructionen_US
dc.subjectRecursive Solveren_US
dc.subjectAdaptive Discretizationen_US
dc.subject.lccTK5102.92 .T45 2014en_US
dc.subject.lcshData compression (Telecommunication)en_US
dc.titleRobust compressive sensing techniquesen_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006662.pdf
Size:
1.54 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science