DocumentCode
639977
Title
Compressive classification
Author
Reboredo, Hugo ; Renna, Francesco ; Calderbank, R. ; Rodrigues, Miguel R. D.
Author_Institution
Inst. de Telecomun., Univ. do Porto, Porto, Portugal
fYear
2013
fDate
7-12 July 2013
Firstpage
674
Lastpage
678
Abstract
This paper presents fundamental limits associated with compressive classification of Gaussian mixture source models. In particular, we offer an asymptotic characterization of the behavior of the (upper bound to the) misclassification probability associated with the optimal Maximum-A-Posteriori (MAP) classifier that depends on quantities that are dual to the concepts of diversity gain and coding gain in multi-antenna communications. The diversity, which is shown to determine the rate at which the probability of misclassification decays in the low noise regime, is shown to depend on the geometry of the source, the geometry of the measurement system and their interplay. The measurement gain, which represents the counterpart of the coding gain, is also shown to depend on geometrical quantities. It is argued that the diversity order and the measurement gain also offer an optimization criterion to perform dictionary learning for compressive classification applications.
Keywords
Gaussian processes; antenna arrays; compressed sensing; diversity reception; encoding; maximum likelihood estimation; measurement systems; signal classification; Gaussian mixture source models; coding gain; compressive classification applications; dictionary learning; diversity gain; low noise regime; measurement gain; measurement system geometry; misclassification decays; misclassification probability; multiantenna communications; optimal MAP classifier; optimal maximum-a-posteriori classifier; Atmospheric measurements; Error probability; Gain measurement; Geometry; Information theory; Particle measurements; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620311
Filename
6620311
Link To Document