scholarly journals Multiview Discriminative Geometry Preserving Projection for Image Classification

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Ziqiang Wang ◽  
Xia Sun ◽  
Lijun Sun ◽  
Yuchun Huang
Keyword(s):  
Image Classification ◽  
Learning Algorithm ◽  
Subspace Learning ◽  
Visual Features ◽  
Expression Recognition ◽  
Single View ◽  
Discrimination Information ◽  
New Feature ◽  
Low Dimensional ◽  
Conventional Solution

In many image classification applications, it is common to extract multiple visual features from different views to describe an image. Since different visual features have their own specific statistical properties and discriminative powers for image classification, the conventional solution for multiple view data is to concatenate these feature vectors as a new feature vector. However, this simple concatenation strategy not only ignores the complementary nature of different views, but also ends up with “curse of dimensionality.” To address this problem, we propose a novel multiview subspace learning algorithm in this paper, named multiview discriminative geometry preserving projection (MDGPP) for feature extraction and classification. MDGPP can not only preserve the intraclass geometry and interclass discrimination information under a single view, but also explore the complementary property of different views to obtain a low-dimensional optimal consensus embedding by using an alternating-optimization-based iterative algorithm. Experimental results on face recognition and facial expression recognition demonstrate the effectiveness of the proposed algorithm.

Feature Dimension Reduction and Graph Based Ranking Based Image Classification

2013 ◽  
Vol 380-384 ◽  
pp. 4035-4038 ◽  
Author(s):  
Nan Yao ◽  
Feng Qian ◽  
Zuo Lei Sun
Keyword(s):  
Dimensionality Reduction ◽  
Dimension Reduction ◽  
Image Classification ◽  
Learning Algorithm ◽  
Contextual Information ◽  
Original Data ◽  
Classification Problem ◽  
Image Features ◽  
Similarity Learning ◽  
Low Dimensional

Dimensionality reduction (DR) of image features plays an important role in image retrieval and classification tasks. Recently, two types of methods have been proposed to improve both the accuracy and efficiency for the dimensionality reduction problem. One uses Non-negative matrix factorization (NMF) to describe the image distribution on the space of base matrix. Another one for dimension reduction trains a subspace projection matrix to project original data space into some low-dimensional subspaces which have deep architecture, so that the low-dimensional codes would be learned. At the same time, the graph based similarity learning algorithm which tries to exploit contextual information for improving the effectiveness of image rankings is also proposed for image class and retrieval problem. In this paper, after above two methods mentioned are utilized to reduce the high-dimensional features of images respectively, we learn the graph based similarity for the image classification problem. This paper compares the proposed approach with other approaches on an image database.

Grassmannian Spectral Regression for Learning and Classification

2015 ◽  
Vol 24 (04) ◽  
pp. 1540015
Author(s):  
Sherif Azary ◽  
Andreas Savakis
Keyword(s):  
Grassmann Manifold ◽  
Learning Algorithm ◽  
Subspace Learning ◽  
Classification Systems ◽  
High Dimensional ◽  
Action Classification ◽  
Computational Performance ◽  
Computationally Intensive ◽  
Low Dimensional ◽  
Spectral Regression

Computational performance associated with high dimensional data is a common challenge for real-world action classification systems. Subspace learning, and manifold learning in particular, have received considerable attention as means of finding efficient low-dimensional representations that lead to better classification and efficient processing. A Grassmann manifold is a space that promotes smooth surfaces where points represent subspaces. In this paper, Grassmannian Spectral Regression (GRASP) is presented as a Grassmann inspired subspace learning algorithm that combines the benefits of Grassmann manifolds and spectral regression for fast and accurate classification. GRASP involves embedding high dimensional action subspaces as individual points onto a Grassmann manifold, kernelizing the embeddings onto a projection space, and then applying Spectral Regression for fast and accurate action classification. Furthermore, spatiotemporal action descriptions called Motion History Surfaces and Motion Depth Surfaces are utilized. The effectiveness of GRASP is illustrated for computationally intensive, multi-view and 3D action classification datasets.

scholarly journals Dimensionality Reduction of Complex Metastable Systems via Kernel Embeddings of Transition Manifolds

2020 ◽  
Vol 31 (1) ◽  
Author(s):  
Andreas Bittracher ◽  
Stefan Klus ◽  
Boumediene Hamzi ◽  
Péter Koltai ◽  
Christof Schütte
Keyword(s):  
Stochastic Systems ◽  
Reproducing Kernel ◽  
Learning Algorithm ◽  
Reproducing Kernel Hilbert Space ◽  
Mathematical Framework ◽  
Reaction Coordinates ◽  
Effective Dynamics ◽  
Distortion Bounds ◽  
Low Dimensional ◽  
Metastable Systems

AbstractWe present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework for the computation of optimal reaction coordinates of such systems that is based on learning a parameterization of a low-dimensional transition manifold in a certain function space. In this article, we enhance this approach by embedding and learning this transition manifold in a reproducing kernel Hilbert space, exploiting the favorable properties of kernel embeddings. Under mild assumptions on the kernel, the manifold structure is shown to be preserved under the embedding, and distortion bounds can be derived. This leads to a more robust and more efficient algorithm compared to the previous parameterization approaches.

Deep Appearance Model and Crow-Sine Cosine Algorithm-Based Deep Belief Network for Age Estimation

2021 ◽  
Vol 12 (3) ◽  
pp. 185-207
Author(s):  
Anjali A. Shejul ◽  
Kinage K. S. ◽  
Eswara Reddy B.
Keyword(s):  
Feature Extraction ◽  
Age Estimation ◽  
Learning Algorithm ◽  
Directional Pattern ◽  
Input Image ◽  
Deep Belief Network ◽  
Appearance Model ◽  
Belief Network ◽  
Sine Cosine Algorithm ◽  
New Feature

Age estimation has been paid great attention in the field of intelligent surveillance, face recognition, biometrics, etc. In contrast to other facial variations, aging variation presents several unique characteristics, which make age estimation very challenging. The overall process of age estimation is performed using three important steps. In the first step, the pre-processing is performed from the input image based on Viola-Jones algorithm to detect the face region. In the second step, feature extraction is done based on three important features such as local transform directional pattern (LTDP), active appearance model (AAM), and the new feature, deep appearance model (Deep AM). After feature extraction, the classification is carried out based on the extracted features using deep belief network (DBN), where the DBN classifier is trained optimally using the proposed learning algorithm named as crow-sine cosine algorithm (CS).

Sign in / Sign up

Export Citation Format

Share Document