Abstract
Feature extraction is a crucial step for Computer Vision applications. Finding appropriate features for an application often means hand-crafting task specific features with many parameters to tune. A generalisation to other applications or scenarios is in many cases not possible. Instead of engineering features, we describe an approach which uses Genetic Programming to generate features automatically. In addition, we do not predefine the dimension of the feature vector but pursue an iterative approach to generate an appropriate number of features. We present this approach on the problem of texture classification based on co-occurrence matrices. Our results are compared to those obtained by using seven Haralick texture features, as well as results reported in the literature on the same database. Our approach yielded a classification performance of up to 87% which is an improvement of 30% over the Haralick features. We achieved an improvement of 12% over previously reported results while reducing the dimension of the feature vector from 78 to four.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)
Haralick, R., Shanmugan, R., Dinstein, I.: Textural features for image classification. IEEE Transactions on Systems, Man, and Cybernetics 3(6), 610–621 (1973)
Poli, R., Cagnoni, S.: Genetic programming with user-driven selection: Experiments on the evolution of algorithms for image enhancement. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proc. of the 2nd Annual Conference, pp. 269–277 (1997)
Poli, R.: Genetic programming for image analysis. Technical Report CSRP-96-1, University of Birmingham, UK (1996)
Winkeler, J.F., Manjunath, B.S.: Genetic programming for object detection. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming. Proceedings of the Second Annual Conference, pp. 330–335. Morgan Kaufmann, Stanford University, CA, USA (1997)
Smart, W., Zhang, M.: Classification strategies for image classification in genetic programming. In: Image and Vision Computing, pp. 402–407 (2003)
Lam, B., Ciesielski, V.: Discovery of human-competitive image texture feature extraction programs using genetic programming. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 1114–1125. Springer, Heidelberg (2004)
Montana, D.J.: Strongly typed genetic programming. Technical Report #7866, Cambridge, MA 02138, USA (1993)
Gagné, C., Parizeau, M.: Open beagle: a generic C++ framework for evolutionary computation. http://beagle.gel.ulaval.ca/index.html (1999–2005)
Intel: Open source computer vision library.http://www.intel.com/technology/computing/opencv/index.htm (2005)
MIT: Vistex databasehttp://vismod.media.mit.edu/vismod/imagery/VisionTexture/vistex.html (1995)
Singh, S., Sharma, M.: Texture analysis experiments with meastex and vistex benchmarks. In: Singh, S., Murshed, N., Kropatsch, W.G. (eds.) ICAPR 2001. LNCS, vol. 2013, p. 417. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aurnhammer, M. (2007). Evolving Texture Features by Genetic Programming. In: Giacobini, M. (eds) Applications of Evolutionary Computing. EvoWorkshops 2007. Lecture Notes in Computer Science, vol 4448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71805-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-71805-5_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71804-8
Online ISBN: 978-3-540-71805-5
eBook Packages: Computer ScienceComputer Science (R0)