Optimizing feature selection strategy for adaptive object identification in noisy environment

Sagar Pandya; Thomas Lu; Tien-Hsin Chao

doi:10.1117/12.2005248

4 February 2013 Optimizing feature selection strategy for adaptive object identification in noisy environment

Sagar Pandya, Thomas Lu, Tien-Hsin Chao

Proceedings Volume 8662, Intelligent Robots and Computer Vision XXX: Algorithms and Techniques; 866209 (2013) https://doi.org/10.1117/12.2005248
Event: IS&T/SPIE Electronic Imaging, 2013, Burlingame, California, United States

Abstract

We present the development of a multi-stage automatic target recognition (MS-ATR) system for computer vision in robotics. This paper discusses our work in optimizing the feature selection strategies of the MS-ATR system. Past implementations have utilized Optimum Trade-off Maximum Average Correlation Height (OT‐MACH) filtering as an initial feature selection method, and principal component analysis (PCA) as a feature extraction strategy before the classification stage. Recent work has been done in the implementation of a modified saliency algorithm as a feature selection method. Saliency is typically implemented as a “bottom-up” search process using visual sensory information such as color, intensity, and orientation to detect salient points in the imagery. It is a general saliency mapping algorithm that receives no input from the user on what is considered salient. We discuss here a modified saliency algorithm that accepts the guidance of target features in locating regions of interest (ROI). By introducing target related input parameters, saliency becomes more focused and task oriented. It is used as an initial stage for the fast ROI detection method. The ROIs are passed to the later stages for feature extraction and target identification process.

Citation Download Citation

Sagar Pandya, Thomas Lu, and Tien-Hsin Chao "Optimizing feature selection strategy for adaptive object identification in noisy environment", Proc. SPIE 8662, Intelligent Robots and Computer Vision XXX: Algorithms and Techniques, 866209 (4 February 2013); https://doi.org/10.1117/12.2005248

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