Optimal frame pursuit for pattern classification

Jason C. Isaacs

doi:10.1117/12.885641

23 May 2011 Optimal frame pursuit for pattern classification

Jason C. Isaacs

Proceedings Volume 8017, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVI; 80170N (2011) https://doi.org/10.1117/12.885641
Event: SPIE Defense, Security, and Sensing, 2011, Orlando, Florida, United States

Abstract

Frame methods, basis expansion methods, or kernel methods provide a higher-dimensional representation of a given dataset within a feature space for discrimination applications. Frame pursuit addresses the problem of searching for optimal frames to improve classification for pattern recognition applications. In this paper, the results of two stochastic optimization techniques applied to the optimal frame problem are presented. The cost function is a k-nearest-neighbor function. These techniques are tested here over six datasets. Empirical results demonstrate the utility of frame transformations for improving performance results in pattern recognition applications.

Citation Download Citation

Jason C. Isaacs "Optimal frame pursuit for pattern classification", Proc. SPIE 8017, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVI, 80170N (23 May 2011); https://doi.org/10.1117/12.885641

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available