z-logo
open-access-imgOpen Access
Object Recognition Inspiring HVS
Author(s) -
Mohammadesmaeil Akbarpour,
Nasser Mehrshad,
Seyyed-Mohammad Razavi
Publication year - 2018
Publication title -
indonesian journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.241
H-Index - 17
eISSN - 2502-4760
pISSN - 2502-4752
DOI - 10.11591/ijeecs.v12.i2.pp783-793
Subject(s) - block (permutation group theory) , artificial intelligence , computer science , cognitive neuroscience of visual object recognition , pattern recognition (psychology) , human visual system model , similarity (geometry) , object (grammar) , computational complexity theory , computational model , image (mathematics) , mathematics , algorithm , geometry
Human recognize objects in complex natural images very fast within a fraction of a second. Many computational object recognition models inspired from this powerful ability of human. The Human Visual System (HVS) recognizes object in several processing layers which we know them as hierarchically model. Due to amazing complexity of HVS and the connections in visual pathway, computational modeling of HVS directly from its physiology is not possible. So it considered as a some blocks and each block modeled separately. One models inspiring of HVS is HMAX which its main problem is selecting patches in random way. As HMAX is a hierarchical model, HMAX can enhanced with enhancing each layer separately. In this paper instead of random patch extraction, Desirable Patches for HMAX (DPHMAX) will extracted.  HVS for extracting patch first selected patches with more information. For simulating this block patches with more variance will be selected. Then HVS will chose patches with more similarity in a class. For simulating this block one algorithm is used. For evaluating proposed method, Caltech 5 and Caltech101 datasets are used. Results show that the proposed method (DPMAX) provides a significant performance over HMAX and other models with the same framework.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here