Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/13296
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorKirubarajian, Thia.en_US
dc.contributor.authorLi, Boen_US
dc.date.accessioned2014-06-18T17:03:34Z-
dc.date.available2014-06-18T17:03:34Z-
dc.date.created2013-08-31en_US
dc.date.issued2013-10en_US
dc.identifier.otheropendissertations/8115en_US
dc.identifier.other9190en_US
dc.identifier.other4534724en_US
dc.identifier.urihttp://hdl.handle.net/11375/13296-
dc.description.abstract<p>In compressive sensing, the fundamental problem is to reconstruct sparse signal from its nonadaptive insufficient linear measurement. Besides sparse signal reconstruction algorithms, measurement matrix or measurement dictionary plays an important part in sparse signal recovery. Orthogonal Matching Pursuit (OMP) algorithm, which is widely used in compressive sensing, is especially affected by measurement dictionary. Measurement dictionary with small restricted isometry constant or coherence could improve the performance of OMP algorithm. Based on measurement dictionary, sensing dictionary can be constructed and can be incorporated into OMP algorithm. In this thesis, two methods are proposed to design sensing dictionary. In the first method, sensing dictionary design problem is formulated as a linear programming problem. The solution is unique and can be obtained by standard linear programming method such as primal-dual interior point method. The major drawback of linear programming based method is its high computational complexity. The second method is termed sensing dictionary designing algorithm. In this algorithm, each atom of sensing dictionary is designed independently to reduce the maximal magnitude of its inner product with measurement dictionary. Compared with linear programming based method, the proposed sensing dictionary design algorithm is of low computational complexity and the performance is similar. Simulation results indicate that both of linear programming based method and the proposed sensing dictionary designing algorithm can design sensing dictionary with small mutual coherence and cumulative coherence. When the designed sensing dictionary is applied to OMP algorithm, the performance of OMP algorithm improves.</p>en_US
dc.subjectcompressive sensingen_US
dc.subjectorthogonal matching pursuiten_US
dc.subjectsensing dictionaryen_US
dc.subjectmeasurement dictionaryen_US
dc.subjectmutual coherenceen_US
dc.subjectrestricted isometry constanten_US
dc.subjectSignal Processingen_US
dc.subjectSignal Processingen_US
dc.titleSensing dictionary construction for orthogonal matching pursuit algorithm in compressive sensingen_US
dc.typethesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreeMaster of Science in Electrical and Computer Engineering (MSECE)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
341.18 kBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue