Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6587
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2014-11-03T09:46:12Z-
dc.date.available2014-11-03T09:46:12Z-
dc.date.issued2011-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/6587-
dc.guideGhosh, Debashis-
dc.description.abstractSparse overcomplete representations of signals have garnered a great deal of attention dur-ing the past decade and a half. The main reasons for this noteworthy interest are their high compression ratios and characteristic energy compaction. These have, however, been primarily been used in the fields of denoising, signal source separation, pattern classifica-tion and information hiding. The present endeavour is devoted to the different aspects of sparse overcomplete represen-tations in the form of a survey of various sparse recovery algorithms and their merits as well as demerits and proposing a sparse recovery algorithm based upon genetic algorithms. This is followed by a discussion of the problem of dictionary learning for sparse represen-tations where a popular algorithm has been examined and modified to obtain improved results. Finally, the applications of sparse representations have been extended to the fields of pattern matching as well as of information hiding and a steganography algorithm has been presenteden_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectSPARSE REPRESENTATIONS SIGNALSen_US
dc.subjectPATTERN MATCHINGen_US
dc.subjectINFORMATION HIDINGen_US
dc.titleSPARSE REPRESENTATIONS OF SIGNALS AND THEIR APPLICATION TO PATTERN MATCHING AND INFORMATION HIDINGen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG21097en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECED G21097.pdf3.66 MBAdobe PDFView/Open


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