Abstract
The biologically inspired model, Hierarchical Model and X (HMAX), has excellent performance in object categorization. It consists of four layers of computational units based on the mechanisms of the visual cortex. However, the random patch selection method in HMAX often leads to mismatch due to the extraction of redundant information, and the computational cost of recognition is expensive because of the Euclidean distance calculations for similarity in the third layer, S2. To solve these limitations, we propose a fast binary-based HMAX model (B-HMAX). In the proposed method, we detect corner-based interest points after the second layer, C1, to extract few features with better distinctiveness, use binary strings to describe the image patches extracted around detected corners, then use the Hamming distance for matching between two patches in the third layer, S2, which is much faster than Euclidean distance calculations. The experimental results demonstrate that our proposed B-HMAX model can significantly reduce the total process time by almost 80% for an image, while keeping the accuracy performance competitive with the standard HMAX.
Original language | English |
---|---|
Pages (from-to) | 242-250 |
Number of pages | 9 |
Journal | Neurocomputing |
Volume | 218 |
DOIs | |
Publication status | Published - 2016 Dec 19 |
Bibliographical note
Funding Information:This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (Grant No. NRF-2016R1D1A1B01016071).
Publisher Copyright:
© 2016 Elsevier B.V.
Keywords
- Binary descriptor
- Classification
- HMAX
- Object recognition
ASJC Scopus subject areas
- Computer Science Applications
- Cognitive Neuroscience
- Artificial Intelligence