An information theoretic approach to sparse representation and recovery of signals

dc.contributor.guideAbhilash, G
dc.coverage.spatial
dc.creator.researcherMeena, V
dc.date.accessioned2024-09-11T05:45:17Z
dc.date.available2024-09-11T05:45:17Z
dc.date.awarded2020
dc.date.completed2020
dc.date.registered2010
dc.description.abstractCompressed sensing, also known as compressed sampling, is a scheme that embeds the newlineintelligence of compression along with signal acquisition in discrete form. The central theme newlineof compressed sampling is built around a scheme that identifies the sparsest solution of newlinea severely under-determined consistent system of linear equations. This observation calls newlinefor new strategies of signal recovery which would work with unusually small number of newlinemeasurements, especially in the presence of noise. newlineThe efficiency of a signal acquisition system that uses compressed sensing depends on newlinethree aspects: newline1. A basis for the sparse representation of the signal of interest. newline2. A measurement matrix that captures maximum information of the signal in a reduced newlineset of measurements. newline3. A method that recovers the sparse representation with high probability such as to newlinereconstruct the signal without degrading the quality. newlineSampling at sub-Nyquist rate uses random measurement matrices as they have low newlinemutual coherence with any sparse representation basis. The compressed measurements thus newlineobtained support perfect recovery with high probability if the number of measurements M is newlineat least of the order of Klog(N/K), where K is the sparsity of the signal x and#8712; R newline newlineN, measured in newlineterms of its l0 count. Since the minimization of the l0 count is NP hard, other algorithms newlinewhich minimize the l1-norm or non-linear greedy algorithms assume practical importance. newlineThe l1-norm minimization recovers the optimal solution under certain conditions but is newlinecomputationally complex. A majority of the greedy recovery algorithms depends on residual newlineenergy minimization which restricts the robustness of the recovery in the presence of noise. newlineThis work proposes an information-theoretic approach to sparse representation and newlinerecovery of signals, which is robust under noisy environments. newline
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions
dc.format.extent
dc.identifier.urihttp://hdl.handle.net/10603/588650
dc.languageEnglish
dc.publisher.institutionDepartment of Electronics and Communication Engineering
dc.publisher.placeCalicut
dc.publisher.universityNational Institute of Technology Calicut
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordcompressed sampling
dc.subject.keywordCompressed sensing
dc.subject.keywordEngineering
dc.subject.keywordEngineering and Technology
dc.subject.keywordEngineering Electrical and Electronic
dc.titleAn information theoretic approach to sparse representation and recovery of signals
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 12
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
90.54 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
830.51 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_content.pdf
Size:
79.63 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
96.17 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
129.81 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: