Color invariant object recognition using entropic graphs
✍ Scribed by Jan C. van Gemert; Gertjan J. Burghouts; Frank J. Seinstra; Jan-Mark Geusebroek
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 692 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
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
📜 SIMILAR VOLUMES
In this paper, we derive new geometric invariants for structured 3D points and lines from single image under projective transform, and we propose a novel model-based 3D object recognition algorithm using them. Based on the matrix representation of the transformation between space features (points an
Structure-taste relationships for 25 acyclic and 20 cyclic carbosulfamates were investigated by means of pattern recognition using different graph theoretical invariants as molecular substituent descriptors. The SIMCA method was used to classify the compounds into sweet and nonsweet classes. All sel