By Topic

Minimum entropy linear embedding based on Gaussian mixture model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Libo Hou ; Liaoning Police Acad., Dalian, China ; Ran He

In this paper, we introduce an information theory motivated algorithm for constructing a low dimensional representation for data sampled from a higher dimensional space. The proposed minimum entropy linear embedding algorithm tries to minimize the information uncertainty (measured by entropy) as much as possible. The entropy is estimated by Gaussian mixture model probability density function and an upper bound of entropy is derived. As a result, the numerical integration involved in the objective function is reduced to a computationally efficient eigenfunction problem. The superiority of proposed method is that it can be used to find the intrinsic character of high dimensional data and has potential ability to reduce redundancy and to improve classification accuracy. Numerical results on toy data, UCI machine learning data set and face recognition illustrate this superiority.

Published in:

Pattern Recognition (ACPR), 2011 First Asian Conference on

Date of Conference:

28-28 Nov. 2011