基于L1-范数的二维最大间距准则研究-计算机应用技术专业论文.docxVIP

AbstractIn Abstract In the field of image processing and paRern recognition．the amount and dimension of image data are increasing quickly．However，its more difficult to process the image data because of the redundant information in the high dimensional image，SO the”Curse of dimensionality”is emerged．In addition，in high dimensional data space still exist”concentration of measure”，namely the measure of the distance between the data points difference will decrease with increasing the dimension of the data．Therefore，in order to solve the problem of high dimensional data effectively and improve the performance of data classification，it’S essential to reduce the dimensions of high-dimensional data linearly．Traditional methods of linearly decreasing dimensions，such as PCA and LDA，are widely used in many fields，opened a new chapter in the field of pattern recognition．It’S hard to calculate because the dimensions of traditional one-dimensional methods are very high．Moreover．the objective function based on the L2．norm is severely affected by outliers．it is unable to obtain the optimal projection direction．At the same time．because of the small sample size problem，the within-class scatter matrix and between．class scatter matrix of LDA algorithm is singular．Relative the lack of traditional one．dimensional methods，the two—dimensional dimensionality reduction method based image·-as·-matrix directly,such as 2DPCA and 2DLDA method is able to solve the ”Curse of dimensionality”problem．The linear dimensionality reduction based On L 1‘norm method，such as PCA—L I，LDA．L 1 method，is robust to handle outliers． MMC method can adequately solve the problem of small sample．In this paper，the methods of LDA-L 1，LDA and MMC are studied thoroughly，and three improved methods put forward to the problems： (1)On the basis of the basic principle and the existing problems of the LDA．L1 method，the two-dimensional linear discriminant analysis based L I．norm method (2DLDA—L1)is put forward．2DLDA-L 1 meth