Premium
Color invariant object recognition using entropic graphs
Author(s) -
van Gemert Jan C.,
Burghouts Gertjan J.,
Seinstra Frank J.,
Geusebroek JanMark
Publication year - 2006
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.20082
Subject(s) - artificial intelligence , pattern recognition (psychology) , histogram , invariant (physics) , similarity measure , entropy (arrow of time) , mathematics , computer science , principle of maximum entropy , computer vision , cognitive neuroscience of visual object recognition , object (grammar) , image (mathematics) , physics , quantum mechanics , mathematical physics
We present an object recognition approach using higher‐order color invariant features with an entropy‐based similarity measure. Entropic graphs offer an unparameterized alternative to common entropy estimation techniques, such as a histogram or assuming a probability distribution. An entropic graph estimates entropy from a spanning graph structure of sample data. We extract color invariant features from object images invariant to illumination changes in intensity, viewpoint, and shading. The Henze–Penrose similarity measure is used to estimate the similarity of two images. Our method is evaluated on the ALOI collection, a large collection of object images. This object image collection consists of 1000 objects recorded under various imaging circumstances. The proposed method is shown to be effective under a wide variety of imaging conditions. © 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 16, 146–153, 2006