Recursive TBM method for target classification

Gan-lin Shan; Wei Mei; Yuan-zeng Cheng

doi:10.1117/12.829444

4 September 2009 Recursive TBM method for target classification

Gan-lin Shan, Wei Mei, Yuan-zeng Cheng

Proceedings Volume 7445, Signal and Data Processing of Small Targets 2009; 74450Y (2009) https://doi.org/10.1117/12.829444
Event: SPIE Optical Engineering + Applications, 2009, San Diego, California, United States

Abstract

Target classification based on the transferable belief model (TBM) is believed to be more robust than the Bayesian method. However, existing TBM classifier may forget over time the estimated prior information of the class. This paper proposes a recursive TBM classifier, which could combine the current basic belief assignment (BBA) of the class with the historic class information. Besides, feature mapping from the feature space to the class space, instead of the conventional converse mapping, is utilized to improve the performance of the recursive classifier. Simulation results reveal that the proposed TBM classifier eliminated the deficiency of existing TBM method and has more robust performance than the Bayesian classifier.

Citation Download Citation

Gan-lin Shan, Wei Mei, and Yuan-zeng Cheng "Recursive TBM method for target classification", Proc. SPIE 7445, Signal and Data Processing of Small Targets 2009, 74450Y (4 September 2009); https://doi.org/10.1117/12.829444

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