Pattern Recognition: Recent Advances

Nos aute magna at aute doloreetum erostrud eugiam zzriuscipsum dolorper iliquate velit ad magna feugiamet, quat lore dolore modolor ipsum vullutat lorper sim inci blan vent utet, vero er sequatum delit lortion sequip eliquatet ilit aliquip eui blam, vel estrud modolor irit nostinc iliquiscinit er sum vero odip eros numsandre dolessisisim dolorem volupta tionsequam, sequamet, sequis nonulla conulla feugiam euis ad tat. Igna feugiam et ametuercil enim dolore commy numsandiam, sed te con hendit iuscidunt wis nonse volenis molorer suscip er illan essit ea feugue do dunt utetum vercili quamcon ver sequat utem zzriure modiat. Pisl esenis non ex euipsusci tis amet utpate deliquat utat lan hendio consequis nonsequi euisi blaor sim venis nonsequis enit, qui tatem vel dolumsandre enim zzriurercing In this paper, two-dimensional principal component analysis (2DPCA) is first re-examined and its two properties are revealed. 2DPCA can eliminate the correlation between column vectors of image and compact the image energy onto a small number of column vectors (these vectors are used for image representation). In other words, 2DPCA realizes an optimal compression in horizontal direction. These properties are desirable and provide some theoretical supports for 2DPCA-based image representation. However, 2DPCA does not consider the correlation in vertical direction. This leads to a relative lower compression rate compared to PCA. Bi-2DPCA technique is developed to overcome the weakness of 2DPCA. Basically, Bi2DPCA is to perform 2DPCA twice sequentially, i.e., a first compression in horizontal direction followed by a second one in vertical direction. In this way, the correlations in both directions are eliminated and, the image energy is compacted into the up-left corner of image. The elements in this corner are chosen as features. So, Bi-2DPCA needs fewer coefficients than 2DPCA for image representation. This results in lower storage requirements and a remarkable speedup in classification. Actually, Bi-2DPCA based representation is not only economical in storage but also effective for discrimination. Our experiments on FERET database show Bi-2DPCA is comparable with 2DPCA. In addition, the theoretical justification for Bi-2DPCA based image representation is provided. This representation mechanism is sequentially optimal in the sense of minimal mean-square error. In comparison, ST-KLT lacks this justification and is shown to be suboptimal in theory. That is, the mean-square error (MSE) of ST-KLT is always larger than that of Bi-2DPCA. Besides, we also show that the MSEs of the image-data dependent coding methods such as Bi-2DPCA and ST-KLT are much less than the image-data independent method like 2D-DCT. Our experiments indicate that the significant MSE difference between two methods does affect their recognition performances and, the image-data dependent methods are more suitable for representing faces for recognition purpose. The insignificant MSE difference, however, almost has no effect on the recognition results. In contrast to PCA, the most prominent advantage of Bi-2DPCA is its low computational complexity. Actually, Bi-2DPCA has lower computation requirement than PCA on almost all aspects involved, including the construction of covariance matrices, calculating the eigenvectors of these covariance matrices, and image transformation. This characteristic makes Bi-2DPCA faster than PCA in both training and testing processes. It should be mentioned that the speed advantage of Bi-2DPCA would become more remarkable with the increase of database scale and training sample size. Besides, our experiments on the FERET database also demonstrate that Bi-2DPCA is comparable with PCA in recognition performance Preface......Page 5 Nisrine Jrad, Pierre Beauseroy and Edith Grall-Maës......Page 11 Carl Frélicot and Hoel Le Capitaine......Page 35 Ezzat El-Sherif, Sherif Abdelazeem,......Page 59 þÿ......Page 85 Kazuhiro Hotta......Page 109 Adam Herout et al.......Page 121 Jae-Han Park, Kyung-Wook Park, Seung-Ho Baeg, and Moon-Hong Baeg......Page 147 Aryaz Baradarani and Q.M. JonathanWu......Page 161 João Henrique Burckas Ribeiro and Ronaldo Fumio Hashimoto......Page 177 Luis Falcón-Morales, Eduardo Bayro-Corrochano......Page 199 Dmitry Kinoshenko, Vladimir Mashtalir and Elena Yegorova......Page 215 Zhiyong Zhang and Olfa Nasraoui......Page 245 Pavel Vácha and Michal Haindl......Page 263 Rubén Muñiz, José Antonio Corrales, Manuel Rico-Secades and Juan Ángel Martínez-Esteban......Page 283 Joutel Guillaume, Eglin Véronique and Emptoz Hubert......Page 303 Jian Yang ,Yong Xu , Jing-yu Yang ......Page 323 Pohsiang Tsai, Tich Phuoc Tran, Longbing Cao......Page 351 Adel Lablack, Jean Martinet and Chabane Djeraba......Page 377 Félix Moreno, Ignacio López and Ricardo Sanz......Page 389 Mark L. Epstein, MS, Ivan Sheu, BS and Kenji Suzuki, PhD......Page 415 Ruben Machucho-Cadena and Eduardo Bayro-Corrochano......Page 429 Ling Cen, Wee Ser, Zhu Liang Yua and Wei Cen ......Page 441 Tsu-Wang Shen, and Xavier Kuo......Page 461 Rodolfo Romero Herrera......Page 477 Thomas W. Rauber, Eduardo Mendel do Nascimento, Estefhan D. Wandekokem and Flávio M. Varejão......Page 493 Atsushi Yamashita, Hiroki Agata and Toru Kaneko......Page 519 In this chapter we presented a new method for Pattern Recognition based on distance between points and straight line segments called SLS method. Although the design of the SLS method was not initially based on any other method, it has some similarities to the Learning Vector Quantization (LVQ) and the Nearest Feature Line (NFL) methods so that SLS can take the advantages of both methods. For instance, SLS has the low computational complexity of LVQ and the interpolation capacity of straight lines of NFL. The experiments presented here confirm these advantages showing that the SLS method has lower computational complexity than SVM on the test phase with similar classification performance. By observing these results, we can conclude that the SLS method is a new and good option for supervised pattern recognition systems. The SLS method also opens new perspectives for future research on Pattern Recognition. One of the main interest is to improve the training algorithm (which outputs a local optimal solution) by solving the underlying nonlinear optimization problem using other methods than gradient descent (for example, genetic algorithms). Other topics of interest are to extend the method for multiclassification and regression problems