Sparse Representations of Multiple Signals

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/7250

Full metadata record

DC Field	Value	Language
dc.creator	Evgeniou, Theodoros	-
dc.creator	Poggio, Tomaso	-
dc.date	2004-10-20T21:04:12Z	-
dc.date	2004-10-20T21:04:12Z	-
dc.date	1997-09-01	-
dc.date.accessioned	2013-10-09T02:48:48Z	-
dc.date.available	2013-10-09T02:48:48Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1619	-
dc.identifier	CBCL-156	-
dc.identifier	http://hdl.handle.net/1721.1/7250	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	We discuss the problem of finding sparse representations of a class of signals. We formalize the problem and prove it is NP-complete both in the case of a single signal and that of multiple ones. Next we develop a simple approximation method to the problem and we show experimental results using artificially generated signals. Furthermore,we use our approximation method to find sparse representations of classes of real signals, specifically of images of pedestrians. We discuss the relation between our formulation of the sparsity problem and the problem of finding representations of objects that are compact and appropriate for detection and classification.	-
dc.format	640513 bytes	-
dc.format	244569 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1619	-
dc.relation	CBCL-156	-
dc.title	Sparse Representations of Multiple Signals	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI