Color angular indexing

75Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A fast color-based algorithm for recognizing colorful objects and colored textures is presented. Objects and textures are represented by just six numbers. Let r, g and b denote the 3 color bands of the image of an object (stretched out as vectors) then the color angular index comprises the 3 inter-band angles (one per pair of image vectors). The color edge angular index is calculated from the image's color edge map (the Laplacian of the color bands) in a similar way. These angles capture important low-order statistical information about the color and edge distributions and invariant to the spectral power distribution of the scene illuminant. The 6 illumination-invariant angles provide the basis for angular indexing into a database of objects or textures and has been tested on both Swain's database of color objects which were all taken under the same illuminant and Healey and Wang's database of color textures which were taken under several different illuminants. Color angular indexing yields excellent recognition rates for both data sets.

Cite

CITATION STYLE

APA

Finlayson, G. D., Chatterjee, S. S., & Funt, B. V. (1996). Color angular indexing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1065, pp. 16–27). Springer Verlag. https://doi.org/10.1007/3-540-61123-1_124

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free