• 沒有找到結果。

Self-eigenroughness selection for texture recognition using genetic algorithms

N/A
N/A
Protected

Academic year: 2021

Share "Self-eigenroughness selection for texture recognition using genetic algorithms"

Copied!
3
0
0

加載中.... (立即查看全文)

全文

(1)

J. Blanc-Talon et al. (Eds.): ACIVS 2007, LNCS 4678, pp. 849–854, 2007. © Springer-Verlag Berlin Heidelberg 2007

Self-Eigenroughness Selection for Texture Recognition

Using Genetic Algorithms

Jing-Wein Wang

Institute of Photonics and Communications National Kaohsiung University of Applied Sciences 415 Chien-Kung Road, Kaohsiung 807, Taiwan, R.O.C.

Tel.: +886-7-3814526 Ext. 3350 Fax.: +886-7-38327712 jwwang@cc.kuas.edu.tw

Abstract. To test the effectiveness of Self-Eigenroughness, which is derived from performing principal component analysis (PCA) on each texture roughness individually, in texture recognition with respect to Eigenroughness, which is derived from performing PCA on all texture roughness; we present a novel fitness function with adaptive threshold to evaluate the performance of each subset of genetically selected eigenvectors. Comparatively studies suggest that the former is superior to the latter in terms of recognition accuracy and computation efficiency.

1 Introduction

PCA-based method has been successfully used for supervised image classification [1]. While any image in the sample space can be approximated by a linear combination of the significant eigenvectors, this approach does not attempt to minimize the within-class variation since it is an unsupervised technique. Thus, the projection vectors chosen for optimal representation in the sense of mean square error may obscure the existence of the separate classes. In this paper, instead of using the common properties of classes in the training set, we use a given class’s own scatter matrix to obtain its discriminative vectors, called the Self-Eigenvectors. We also give a Self-Eigenvector selection algorithm to test the effectiveness with respect to the Eigenroughness, where both an enrolled dataset and an invader dataset are used for experiments.

This paper is organized as follows. An extraction of texture roughness is presented in Section 2. The Eigenrouhness and Self-Eigenroughness techniques are introduced in Section 3, respectively, and the genetic eigenvector selection algorithm is proposed in Section 4. Experimental results are discussed in Section 5.

2 Texture Roughness

To describe texture, one obvious feature is energy [2]. The image of a real object surface is not uniform usually but contains variations of intensities which form certain

(2)

850 J.-W. Wang

repeated patterns. The patterns can be the result of physical surface properties such as roughness, which often has a tactile quality and therefore exhibits various energy variations over texture region. It is proper in reality to quantify the texture content by the roughness descriptor which provides measures of properties such as smoothness, coarseness, and regularity, being very useful as a distinctive preprocessing of texture characterization. In order to extract out texture roughness from its background, a smoothing filter is used to move the center from pixel to pixel in an image to guarantee the desired local edge enhancement. This continues until all pixel locations have been covered and a new image is to be created for storing the response of the linear mask. The local standard average

μ

and energy ε of the pixels in the 3 × 3 neighborhood defined by the mask are given by the expressions

∑∑

− = =− + + = 1 1 1 1 ) , ( 1 ) , ( i j j y i x f y x ρ μ , (1)

∑∑

− = =− − + + = 1 1 1 1 2 )) , ( ) , ( ( 1 ) , ( i j y x j y i x f y x μ ρ ε , (2)

where ρ = 9 is a normalizing constant, f(x, y) is the input image, and ε(x, y) is corresponding to the roughness image formed with energy enrichment.

3 Self-Eigenroughness

PCA can be used to find the best set of projection directions in the sample space composed with roughness features that will maximize the total scatter across all texture images. Projection directions are called the Eigenroughness, namely,

Eigenroughness:T ={m ,WK}, (3) where mdenotes the mean vector of the N-dimensional observation vector obtained from all two-dimensional roughness images, WK = (w1,…,wK), and K << N. The vector wK is the Eigenroughness corresponding to the K-th largest eigenvalue of the sample covariance matrix. The K principal components in W are the orthonormal axes onto which the retained energy under projection is maximal. Although PCA is as optimal representation criterion in the sense of mean square error, yet it does not consider the classification aspect. Based on our observation that the variations between images of different textures reflecting the changes in texture identity are almost always larger than the variations between images of the same texture, the single Eigenroughness set is not efficient to be used for analyzing a nonlinear structure such as complicated textures with large variations of roughness. To overcome this drawback, a variant of the PCA technique proposed by Torres and Vilá [3] is adopted in this work. In what follows, independent PCA is performed for each texture using its available images for recognition purpose. Like the traditional PCA, the independent PCA decorrelates the components and arranges them in order of decreasing significance but with a different amplitude distribution. The analysis results in a set of Eigenroughness for each texture, called Self-Eigenroughness,

(3)

854 J.-W. Wang

texture representation separately, image variations are limited to each class only that leads to a lower equal error rate (EER). Moreover, the selection of Self-Eigenroughness for discrimination is not only on the leading eigenvectors but also spreads more on the latter components. Selected Self-Eigenroughness number in every 10 eigenvectors for the best fitness value is illustrated in Fig. 2.

0 2 4 6 8 10 10 50 100 150 200 250 300 Every 10 Self-Eigenroughness Selected number

Fig. 2. Selected number in every 10 for the total 300 Self-Eigenroughness components

Acknowledgement

The author would like to acknowledge the support received from NSC through project number NSC 95-2622-E-151-022-CC3.

References

[1] Fredembach, C., Schröder, M., Süsstrunk, S.: Eigenregions for Image Classification. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1645–1649 (2004)

[2] Zhang, J., Tan, T.: Brief Review of Invariant Texture Analysis Methods. Pattern Recognition 35, 735–747 (2002)

[3] Torres, L., Vilá, J.: Automatic Face Recognition for Video Indexing Applications. Pattern Recognition 35, 615–625 (2002)

[4] Duda, R.O., Hart, P.E., Stork, D.G. (eds.): Pattern Classification. John Wiley & Sons, Chichester (2000)

[5] Brodatz, P., (ed.): Textures: A Photographic Album for Artists and Designers. Dover, NY (1966)

數據

Fig. 2. Selected number in every 10 for the total 300 Self-Eigenroughness components

參考文獻

相關文件

 Retrieval performance of different texture features according to the number of relevant images retrieved at various scopes using Corel Photo galleries. # of top

For a deep NNet for written character recognition from raw pixels, which type of features are more likely extracted after the first hidden layer.

These images are the results of relighting the synthesized target object under Lambertian model (left column) and Phong model (right column) with different light directions ....

• Given a finite sample of some texture, the goal is to synthesize other samples from that same is to synthesize other samples from that same texture...

• Li-Yi Wei, Marc Levoy, Fast Texture Synthesis Using Tree-Structured Vector Quantization, SIGGRAPH 2000. Jacobs, Nuria Oliver, Brian Curless,

A marble texture can be made by using a Perlin function as an offset using a Perlin function as an offset to a cosine function. texture = cosine( x +

projected texture Active depth from defocus Active depth from defocus Photometric stereo Photometric stereo.. time of flight time

 Negative selection: if the antibodies of a B cell match any self antigen in the bone marrow, the cell dies.  Self tolerance: almost all self antigens are presented i n