Deterministic dictionaries for sparse representation: Construction and Applications

Randhi, Ramu Naidu (2015) Deterministic dictionaries for sparse representation: Construction and Applications. PhD thesis, Indian Institute of Technology Hyderabad.

Text MA11P003.pdf - Submitted Version Restricted to Registered users only until 11 August 2019. Download (10MB) | Request a copy

Abstract

Most of the naturally occurring signals typically carry overwhelming amounts of data in which relevant information is often more difficult to obtain. A sparse representation, wherein a few coefficients capture most of the data content, makes the processing faster and simpler. Such representations can be generated by decomposing data via standard bases such as wavelets. But identifying an ideal sparse transform that can be adapted to several data types simultaneously is a hopeless quest.

[error in script]

IITH Creators:	IITH Creators ORCiD
Item Type:	Thesis (PhD)
Uncontrolled Keywords:	Restricted Isometry Property, Computerized Tomography, Tele-cardiology, TD478
Subjects:	?? sub3.8 ??
Divisions:	Department of Mathematics
Depositing User:	Library Staff
Date Deposited:	11 Aug 2015 04:51
Last Modified:	21 Jan 2016 05:18
URI:	http://raiithold.iith.ac.in/id/eprint/1820
Publisher URL:
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item