Paper
4 May 2006 Adaptive branch and bound algorithm (ABB) for use on hyperspectral data
Songyot Nakariyakul, David P. Casasent
Author Affiliations +
Abstract
We propose a new adaptive branch and bound (ABB) algorithm for selecting the optimal subset of features in hyperspectral applications. The algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree. Our algorithm includes the following new properties: (i) ordering the tree nodes by the significance of features during construction of the tree, (ii) obtaining a large "good" initial bound by a floating search method, (iii) a new method to select an initial starting search level in the tree, and (iv) a new adaptive jump search strategy to select subsequent search levels to avoid redundant criterion function calculations. Our experimental results for two databases demonstrate that our method is significantly faster than other versions of the branch and bound algorithm.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Songyot Nakariyakul and David P. Casasent "Adaptive branch and bound algorithm (ABB) for use on hyperspectral data", Proc. SPIE 6233, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII, 62332E (4 May 2006); https://doi.org/10.1117/12.666175
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Feature selection

Mahalanobis distance

Tumors

Algorithm development

Cameras

Computer engineering

Back to Top