A. Chebira, M. C. Fickus, and J. Kovačević, “Classifying compact convex sets with frames,” Applied and Computational Harmonic Analysis. Nov. 2008.
Full Paper:
http://andrew.cmu.edu/user/jelenak/Repo ... biraFK.pdf
Code/Data: [ZIP (Matlab),164KB]
http://www.andrew.cmu.edu/user/jelenak/ ... K_Code.zip
Contains the code to generate the figures in the paper.
BibTeX:
NA
Copyright Notice:
Copyright holders include the journal/conference publisher.
Complementary URL:
http://www.andrew.cmu.edu/user/jelenak/ ... iraFK.html
Abstract
Classification is a fundamental image processing task. Recent empirical evidence suggests that classification algorithms which make use of redundant linear transforms will regularly outperform their nonredundant counterparts. We provide a rigorous explanation of this phenomenon in the single-class case. We begin by developing a measure-theoretic analysis of the set of points at which a given decision rule will have an intolerable chance of making a classification error. We then apply this general theory to the special case where the class is compact and convex, showing that such a class may be arbitrarily well-approximated by frame sets, namely, preimages of hyperrectangles under frame analysis operators. This leads to a frame-based classification scheme in which frame coefficients are regarded as features. We show that, indeed, the accuracy of such a classification scheme approaches perfect accuracy as the redundancy of the frame grows large.
|
|
Share/Save