For image recognition, an extensive number of subspace-learning methods have been proposed to overcome the high-dimensionality problem of the features being used. In this paper, we first give an overview of the most popular and state-of-the-art subspace-learning methods, and then, a novel manifold-learning method, named soft locality preserving map (SLPM), is presented. SLPM aims to control the level of spread of the different classes, which is closely connected to the generalizability of the learned subspace. We also do an overview of the extension of manifold learning methods to deep learning by formulating the loss functions for training, and further reformulate SLPM into a soft locality preserving (SLP) loss. These loss functions are ap...
Previous work has demonstrated that the image variations of many objects (human faces in particular)...
©2010 SPIE--The International Society for Optical Engineering. One print or electronic copy may be m...
Abstract How to define the sparse affinity weight matrices is still an open problem in existing mani...
Manifold learning aims to map the original data from a high-dimensional space into a low-dimensional...
Previous works have demonstrated that the face recognition performance can be improved significantly...
Although LDA has many successes in dimensionality reduction and data separation, it also has disadva...
Abstract—Conventional subspace learning or recent feature extraction methods consider globality as t...
190 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.To demonstrate the effectiven...
We present a novel dimensionality reduction method which aims to identify a low dimensional projecti...
Abstract(#br)Automatic facial expression recognition has attracted increasing attention for a variet...
73 p.Face and facial expression recognition research has been motivated by wide and potential applic...
Recently feature extraction methods have commonly been used as a principled approach to understand t...
Abstract—The regularization principals [31] lead approximation schemes to deal with various learning...
This research book provides a comprehensive overview of the state-of-the-art subspace learning metho...
Automatic facial expression analysis is a vital compo-nent of intelligent Human-Computer Interaction...
Previous work has demonstrated that the image variations of many objects (human faces in particular)...
©2010 SPIE--The International Society for Optical Engineering. One print or electronic copy may be m...
Abstract How to define the sparse affinity weight matrices is still an open problem in existing mani...
Manifold learning aims to map the original data from a high-dimensional space into a low-dimensional...
Previous works have demonstrated that the face recognition performance can be improved significantly...
Although LDA has many successes in dimensionality reduction and data separation, it also has disadva...
Abstract—Conventional subspace learning or recent feature extraction methods consider globality as t...
190 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.To demonstrate the effectiven...
We present a novel dimensionality reduction method which aims to identify a low dimensional projecti...
Abstract(#br)Automatic facial expression recognition has attracted increasing attention for a variet...
73 p.Face and facial expression recognition research has been motivated by wide and potential applic...
Recently feature extraction methods have commonly been used as a principled approach to understand t...
Abstract—The regularization principals [31] lead approximation schemes to deal with various learning...
This research book provides a comprehensive overview of the state-of-the-art subspace learning metho...
Automatic facial expression analysis is a vital compo-nent of intelligent Human-Computer Interaction...
Previous work has demonstrated that the image variations of many objects (human faces in particular)...
©2010 SPIE--The International Society for Optical Engineering. One print or electronic copy may be m...
Abstract How to define the sparse affinity weight matrices is still an open problem in existing mani...