Advertisement

Texture Subspaces

  • Erkki Oja
  • Jussi Parkkinen
Part of the NATO ASI Series book series (volume 30)

Abstract

The subspace method of pattern recognition has been developed for fast and accurate classification of high-dimensional feature vectors, especially power spectra and distribution densities. The basic algorithms for class subspace construction are statistically motivated, and the classification is based on inner products. In texture analysis, this method has been previously applied for two-dimensional spatial frequency spectra. In this work we show that a feasible method for texture window classification is to use a smoothed cooccurrence matrix as the feature vector and to define texture classes for such representations by the subspace method. These texture subspaces seem to capture the characteristic second-order properties of texture fields. Results are given using various natural and synthetic textures.

Keywords

Cooccurrence Matrix Subspace Method Subspace Cluster Cooccurrence Matrice Learn Subspace 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Akhiezer, N.I. and Glazman, I.M.: Theory of Linear Operators in Hilbert Space, Vol. I, Pitman Adv. Publ. ProgrBoston, 1981. Google Scholar
  2. [2]
    Brodatz, P.: Textures: A Photographic Album for Artists and Designers, Reinhold, New York, 1968. Google Scholar
  3. [3]
    Caelli, T. and Julesz, B.: On Perceptual Analyzers Underlying Visual Texture Discrimination: Part I, Part II, Biol. Cyb. 28, 1978, pp. 167–175 and 29, 1978, pp. 201–214.CrossRefGoogle Scholar
  4. [4]
    Conners, R.W. and Harlow, C.A.: A Theoretical Comparison of Texture Algorithms, IEEE Trans. on Patt. Anal, and Mach. Intel., PAMI- 2, 1980, pp. 204–222.MATHCrossRefGoogle Scholar
  5. [5]
    Conners, R.W., Trivedi, M.M., and Harlow, C.A.: Segmentation of a High Resolution Urban Scene Using Texture Operators, Comp. Vision, Graphics and Image Proc. 25, 1984, pp. 273–310.CrossRefGoogle Scholar
  6. [6]
    D’Astous, F. and Jernigan, M.E.: Texture Discrimination Based on Detailed Measures of the Power Spectrum, Proc. 7th ICPR, Montreal, July 30 — Aug. 2, 1984, pp. 83–86.Google Scholar
  7. [7]
    Diday, E. and Simon, J.C.: Clustering Analysis, in K.S. Fu (Ed.), Digital Pattern Recognition, Springer, Berlin-Heidelberg-New York, 1976, pp. 47–94.CrossRefGoogle Scholar
  8. [8]
    Duvernoy, J.: Optical-Digital Processing of Directional Terrain Textures Invariant under Translation, Rotation, and Change of Scale, Appl. Optics 23, No. 6, 1984, pp. 828–837.CrossRefGoogle Scholar
  9. [9]
    Haralick, R.M.: Statistical and Structural Approaches to Texture,Proc. IEEE 67, 1979, pp. 786–804.CrossRefGoogle Scholar
  10. [10]
    Haralick, R.M., Shanmugam, K., and Dinstein, I.: Textural Features for Image Classification, IEEE Trans. Syst. Man Cybern., SMC-3, 1973, pp. 610–621.CrossRefGoogle Scholar
  11. [11]
    Iijima, T.: A Theory of Pattern Recognition by Compound Similarity Method (in Japanese), Trans. IECE Japan, PRL 74–25. Google Scholar
  12. [12]
    Julesz, T.: Visual Pattern Discrimination, IRE Trans. Inform. Theory IT- 8, 1962, pp. 84–92.CrossRefGoogle Scholar
  13. [13]
    Kittler, J. and Young, P.C.: Discriminant Function Implementation of a Minimum Risk Classifier, Biol. Cyb. 18, 1975, pp. 169–179.MATHCrossRefGoogle Scholar
  14. [14]
    Kohonen, T., Nemeth, G., Bry, K.-J., Jalanko, M., and Makisara, K.: Spectral Classification of Phonemes by Learning Subspaces, Proc. 1979 IEEE Int. Conf. on Acoust., Speech and Signal Proc., April 2–4, 1979, Washington, DC, pp. 97–100.Google Scholar
  15. [15]
    Kohonen, T., Rüttinen., Jalanko, M., Reuhkala, E., and Haltsonen, S.: A 1000 Word Recognition System Based on the Learning Subspace Method and Redundant Hash Addressing, Proc. 5th Int. Conf. on Pattern Recognition, Miami Beach, FL, Dec. 1.-4., 1980, pp. 158–165.Google Scholar
  16. [16]
    Lendaris,G. and Stanley,G.: Diffraction Pattern Samplings for Automatic Pattern Recognition, Proc. IEEE 58, 1970, pp. 198–216.CrossRefGoogle Scholar
  17. [17]
    Oja, E.: Subspace Methods of Pattern Recognition, Research Studies Press, Letch- worth and J. Wiley, New York, 1983.Google Scholar
  18. [18]
    Oja, E. and Kuusela, M.: The ALSM Algorithm — an Improved Subspace Method of Classification, Patt. Rec. 16, No. 4, 1983, pp. 421–427.CrossRefGoogle Scholar
  19. [19]
    Oja, E. and Karhunen, J.: An Analysis of Convergence for a Learning Version of the Subspace Method, J.Math. Anal. Appl. 91, 1983, pp. 102–111.MathSciNetMATHCrossRefGoogle Scholar
  20. [20]
    Oja, E. and Parkkinen, J.: On Subspace Clustering, Proc. 7th. Int. Conf. on Pattern Recognition, Montreal, Canada, July 30.— Aug. 2., 1984, pp. 692–695.Google Scholar
  21. [21]
    Parkkinen, J. and Oja, E.: Texture Classification by the Subspace Method,Proc. 4th. Scand. Conf on Image Analysis,Trondheim, Norway June 17.-20.,1985, pp. 429–436.Google Scholar
  22. [22]
    Rüttinen, H.: Recognition of Phonemes in a Speech Recognition System Using Learning Projective Methods, Dr.Tech. Thesis, Helsinki University of Technology, 1986.Google Scholar
  23. [23]
    Unser, M.: A Fast Texture Classifier Based on Cross Entropy Minimization, in H.W. Schüssler (Ed.), Signal Processing II: Theories and Applications, Elsevier Sci. Publ., 1983, pp. 261–264.Google Scholar
  24. [24]
    Van Gool, L., Dewaele, P. and Oosterlinck, A.: Texture Analysis Anno 1983, Comp. Vision, Graphics and Image Proc. 29, 1985, pp. 336–357.CrossRefGoogle Scholar
  25. [25]
    Vickers, A.L. and Modestino, J.W.: A Maximum Likelihood Approach to Texture Classification, IEEE Trans, on Pattern Anal, and Machine Intelligence, PAMI- 4 1982, pp. 61–68.CrossRefGoogle Scholar
  26. [26]
    Watanabe, S.: Knowing and Guessing — a Quantitative Study of Inference and Information, J. Wiley, New York, 1969. MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Erkki Oja
    • 1
  • Jussi Parkkinen
    • 1
  1. 1.Department of Computer Science and MathematicsKuopio UniversityKuopioFinland

Personalised recommendations